/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-simple/nested_4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:07:56,011 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:07:56,012 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:07:56,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:07:56,043 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:07:56,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:07:56,049 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:07:56,052 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:07:56,053 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:07:56,057 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:07:56,058 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:07:56,059 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:07:56,059 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:07:56,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:07:56,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:07:56,062 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:07:56,063 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:07:56,063 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:07:56,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:07:56,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:07:56,069 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:07:56,070 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:07:56,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:07:56,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:07:56,072 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:07:56,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:07:56,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:07:56,074 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:07:56,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:07:56,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:07:56,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:07:56,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:07:56,075 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:07:56,076 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:07:56,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:07:56,077 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:07:56,077 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:07:56,077 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:07:56,077 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:07:56,077 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:07:56,078 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:07:56,079 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:07:56,079 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 07:07:56,087 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:07:56,088 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:07:56,088 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:07:56,089 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:07:56,089 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:07:56,089 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:07:56,089 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:07:56,089 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:07:56,089 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:07:56,089 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:07:56,090 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:07:56,090 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:07:56,090 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:07:56,090 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:07:56,090 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:07:56,090 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:07:56,090 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:07:56,090 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:07:56,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:07:56,090 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:07:56,091 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:07:56,091 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:07:56,091 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:07:56,091 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:07:56,091 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:07:56,091 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 07:07:56,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:07:56,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:07:56,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:07:56,284 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:07:56,286 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:07:56,287 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 07:07:56,347 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de48c0ad1/4f94414039bd40ca87c447112a0095c5/FLAGfdb6ca730 [2022-04-15 07:07:56,647 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:07:56,647 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_4.c [2022-04-15 07:07:56,657 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de48c0ad1/4f94414039bd40ca87c447112a0095c5/FLAGfdb6ca730 [2022-04-15 07:07:57,093 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de48c0ad1/4f94414039bd40ca87c447112a0095c5 [2022-04-15 07:07:57,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:07:57,096 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:07:57,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:07:57,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:07:57,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:07:57,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:07:57" (1/1) ... [2022-04-15 07:07:57,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26735c0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:57, skipping insertion in model container [2022-04-15 07:07:57,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:07:57" (1/1) ... [2022-04-15 07:07:57,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:07:57,124 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:07:57,258 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 07:07:57,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:07:57,266 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:07:57,276 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 07:07:57,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:07:57,284 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:07:57,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:57 WrapperNode [2022-04-15 07:07:57,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:07:57,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:07:57,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:07:57,285 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:07:57,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:57" (1/1) ... [2022-04-15 07:07:57,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:57" (1/1) ... [2022-04-15 07:07:57,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:57" (1/1) ... [2022-04-15 07:07:57,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:57" (1/1) ... [2022-04-15 07:07:57,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:57" (1/1) ... [2022-04-15 07:07:57,306 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:57" (1/1) ... [2022-04-15 07:07:57,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:57" (1/1) ... [2022-04-15 07:07:57,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:07:57,308 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:07:57,308 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:07:57,308 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:07:57,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:57" (1/1) ... [2022-04-15 07:07:57,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:07:57,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:07:57,339 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 07:07:57,344 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 07:07:57,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:07:57,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:07:57,375 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:07:57,375 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:07:57,375 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:07:57,375 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:07:57,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:07:57,375 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:07:57,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:07:57,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:07:57,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:07:57,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:07:57,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:07:57,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:07:57,423 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:07:57,424 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:07:57,539 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:07:57,543 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:07:57,543 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-15 07:07:57,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:07:57 BoogieIcfgContainer [2022-04-15 07:07:57,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:07:57,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:07:57,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:07:57,548 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:07:57,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:07:57" (1/3) ... [2022-04-15 07:07:57,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52cf7612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:07:57, skipping insertion in model container [2022-04-15 07:07:57,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:57" (2/3) ... [2022-04-15 07:07:57,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52cf7612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:07:57, skipping insertion in model container [2022-04-15 07:07:57,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:07:57" (3/3) ... [2022-04-15 07:07:57,550 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_4.c [2022-04-15 07:07:57,553 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:07:57,554 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 07:07:57,598 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:07:57,602 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 07:07:57,602 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 07:07:57,614 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 07:07:57,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-15 07:07:57,618 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:07:57,619 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:07:57,619 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:07:57,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:07:57,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1467912619, now seen corresponding path program 1 times [2022-04-15 07:07:57,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:57,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1470133838] [2022-04-15 07:07:57,635 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:07:57,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1467912619, now seen corresponding path program 2 times [2022-04-15 07:07:57,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:07:57,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20272304] [2022-04-15 07:07:57,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:07:57,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:07:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:57,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:07:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:57,796 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 07:07:57,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 07:07:57,797 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #68#return; {25#true} is VALID [2022-04-15 07:07:57,800 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 07:07:57,801 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 07:07:57,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 07:07:57,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #68#return; {25#true} is VALID [2022-04-15 07:07:57,801 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret8 := main(); {25#true} is VALID [2022-04-15 07:07:57,801 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 07:07:57,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-15 07:07:57,802 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 07:07:57,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-15 07:07:57,803 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 07:07:57,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:07:57,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20272304] [2022-04-15 07:07:57,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20272304] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:57,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:57,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:07:57,808 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:07:57,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1470133838] [2022-04-15 07:07:57,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1470133838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:57,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:57,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:07:57,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048919574] [2022-04-15 07:07:57,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:07:57,812 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 07:07:57,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:07:57,815 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 07:07:57,831 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 07:07:57,831 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 07:07:57,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:57,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 07:07:57,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:07:57,852 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 07:07:57,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:57,919 INFO L93 Difference]: Finished difference Result 38 states and 54 transitions. [2022-04-15 07:07:57,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 07:07:57,919 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 07:07:57,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:07:57,920 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 07:07:57,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-15 07:07:57,931 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 07:07:57,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-15 07:07:57,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2022-04-15 07:07:58,008 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 07:07:58,013 INFO L225 Difference]: With dead ends: 38 [2022-04-15 07:07:58,013 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 07:07:58,015 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 07:07:58,017 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 07:07:58,018 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 07:07:58,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 07:07:58,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 07:07:58,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:07:58,040 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 07:07:58,040 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 07:07:58,041 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 07:07:58,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:58,044 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-15 07:07:58,044 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-15 07:07:58,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:58,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:58,044 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 07:07:58,045 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 07:07:58,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:58,046 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-15 07:07:58,046 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-15 07:07:58,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:58,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:58,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:07:58,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:07:58,056 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 07:07:58,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-04-15 07:07:58,058 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 9 [2022-04-15 07:07:58,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:07:58,058 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-04-15 07:07:58,059 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 07:07:58,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 20 transitions. [2022-04-15 07:07:58,082 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 07:07:58,083 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-15 07:07:58,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-15 07:07:58,083 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:07:58,084 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:07:58,084 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 07:07:58,085 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:07:58,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:07:58,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1467952981, now seen corresponding path program 1 times [2022-04-15 07:07:58,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:58,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [188256947] [2022-04-15 07:07:58,087 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:07:58,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1467952981, now seen corresponding path program 2 times [2022-04-15 07:07:58,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:07:58,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547486353] [2022-04-15 07:07:58,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:07:58,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:07:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:58,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:07:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:58,134 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 07:07:58,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {177#true} assume true; {177#true} is VALID [2022-04-15 07:07:58,134 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {177#true} {177#true} #68#return; {177#true} is VALID [2022-04-15 07:07:58,135 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 07:07:58,135 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 07:07:58,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {177#true} assume true; {177#true} is VALID [2022-04-15 07:07:58,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177#true} {177#true} #68#return; {177#true} is VALID [2022-04-15 07:07:58,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {177#true} call #t~ret8 := main(); {177#true} is VALID [2022-04-15 07:07:58,136 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 07:07:58,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {182#(= main_~a~0 0)} assume !(~a~0 < 6); {178#false} is VALID [2022-04-15 07:07:58,137 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 07:07:58,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {178#false} assume !false; {178#false} is VALID [2022-04-15 07:07:58,137 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 07:07:58,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:07:58,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547486353] [2022-04-15 07:07:58,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547486353] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:58,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:58,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:07:58,138 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:07:58,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [188256947] [2022-04-15 07:07:58,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [188256947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:58,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:58,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:07:58,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549332761] [2022-04-15 07:07:58,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:07:58,139 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 07:07:58,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:07:58,139 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 07:07:58,158 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 07:07:58,158 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 07:07:58,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:58,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 07:07:58,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 07:07:58,159 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 07:07:58,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:58,269 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-15 07:07:58,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 07:07:58,269 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 07:07:58,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:07:58,269 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 07:07:58,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-04-15 07:07:58,271 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 07:07:58,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-04-15 07:07:58,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2022-04-15 07:07:58,304 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 07:07:58,307 INFO L225 Difference]: With dead ends: 28 [2022-04-15 07:07:58,307 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 07:07:58,307 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 07:07:58,313 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 07:07:58,313 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 07:07:58,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 07:07:58,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2022-04-15 07:07:58,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:07:58,320 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 07:07:58,321 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 07:07:58,322 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 07:07:58,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:58,325 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-15 07:07:58,325 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-15 07:07:58,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:58,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:58,326 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 07:07:58,326 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 07:07:58,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:58,328 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-15 07:07:58,328 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-15 07:07:58,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:58,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:58,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:07:58,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:07:58,329 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 07:07:58,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-15 07:07:58,330 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 9 [2022-04-15 07:07:58,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:07:58,330 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-15 07:07:58,330 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 07:07:58,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 21 transitions. [2022-04-15 07:07:58,350 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 07:07:58,351 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-15 07:07:58,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 07:07:58,351 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:07:58,351 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:07:58,351 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 07:07:58,351 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:07:58,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:07:58,352 INFO L85 PathProgramCache]: Analyzing trace with hash -408278750, now seen corresponding path program 1 times [2022-04-15 07:07:58,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:58,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [438086100] [2022-04-15 07:07:58,444 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:07:58,446 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:07:58,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1739867075, now seen corresponding path program 1 times [2022-04-15 07:07:58,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:07:58,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414481216] [2022-04-15 07:07:58,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:07:58,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:07:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:58,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:07:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:58,536 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 07:07:58,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {330#true} assume true; {330#true} is VALID [2022-04-15 07:07:58,536 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {330#true} {330#true} #68#return; {330#true} is VALID [2022-04-15 07:07:58,537 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 07:07:58,537 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 07:07:58,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {330#true} assume true; {330#true} is VALID [2022-04-15 07:07:58,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {330#true} {330#true} #68#return; {330#true} is VALID [2022-04-15 07:07:58,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {330#true} call #t~ret8 := main(); {330#true} is VALID [2022-04-15 07:07:58,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {330#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {335#(= main_~a~0 0)} is VALID [2022-04-15 07:07:58,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {335#(= main_~a~0 0)} [72] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_4| |v_main_#t~pre4_3|))) (or (and (= v_main_~b~0_10 v_main_~b~0_9) .cse0 (= v_main_~a~0_10 v_main_~a~0_9)) (and (= v_main_~b~0_9 v_main_~b~0_10) .cse0 (= v_main_~a~0_9 v_main_~a~0_10)))) InVars {main_~b~0=v_main_~b~0_10, main_#t~pre4=|v_main_#t~pre4_4|, main_~a~0=v_main_~a~0_10} OutVars{main_~b~0=v_main_~b~0_9, main_#t~pre4=|v_main_#t~pre4_3|, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~b~0, main_#t~pre4, main_~a~0] {335#(= main_~a~0 0)} is VALID [2022-04-15 07:07:58,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {335#(= main_~a~0 0)} [71] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {331#false} is VALID [2022-04-15 07:07:58,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {331#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {331#false} is VALID [2022-04-15 07:07:58,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {331#false} assume !false; {331#false} is VALID [2022-04-15 07:07:58,540 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 07:07:58,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:07:58,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414481216] [2022-04-15 07:07:58,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414481216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:58,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:58,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:07:58,560 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:07:58,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [438086100] [2022-04-15 07:07:58,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [438086100] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:58,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:58,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:07:58,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774501292] [2022-04-15 07:07:58,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:07:58,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 07:07:58,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:07:58,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 07:07:58,575 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 07:07:58,576 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:07:58,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:58,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:07:58,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:07:58,578 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 07:07:58,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:58,698 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2022-04-15 07:07:58,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:07:58,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 07:07:58,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:07:58,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 07:07:58,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-04-15 07:07:58,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 07:07:58,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-04-15 07:07:58,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2022-04-15 07:07:58,752 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 07:07:58,753 INFO L225 Difference]: With dead ends: 42 [2022-04-15 07:07:58,753 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 07:07:58,754 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-15 07:07:58,754 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 49 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:07:58,755 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 28 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:07:58,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 07:07:58,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2022-04-15 07:07:58,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:07:58,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 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 07:07:58,759 INFO L74 IsIncluded]: Start isIncluded. First operand 31 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 07:07:58,759 INFO L87 Difference]: Start difference. First operand 31 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 07:07:58,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:58,760 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-04-15 07:07:58,760 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-04-15 07:07:58,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:58,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:58,761 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 31 states. [2022-04-15 07:07:58,761 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 31 states. [2022-04-15 07:07:58,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:58,768 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-04-15 07:07:58,768 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-04-15 07:07:58,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:58,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:58,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:07:58,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:07:58,772 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 07:07:58,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-15 07:07:58,773 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2022-04-15 07:07:58,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:07:58,773 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-15 07:07:58,773 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 07:07:58,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 22 transitions. [2022-04-15 07:07:58,795 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 07:07:58,795 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-15 07:07:58,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 07:07:58,797 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:07:58,797 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:07:58,797 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 07:07:58,799 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:07:58,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:07:58,800 INFO L85 PathProgramCache]: Analyzing trace with hash 675904015, now seen corresponding path program 1 times [2022-04-15 07:07:58,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:58,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1960221881] [2022-04-15 07:07:58,845 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:07:58,934 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:07:58,934 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:07:58,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1739928579, now seen corresponding path program 1 times [2022-04-15 07:07:58,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:07:58,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944601749] [2022-04-15 07:07:58,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:07:58,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:07:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:58,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:07:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:58,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {534#(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); {528#true} is VALID [2022-04-15 07:07:58,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {528#true} assume true; {528#true} is VALID [2022-04-15 07:07:58,985 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {528#true} {528#true} #68#return; {528#true} is VALID [2022-04-15 07:07:58,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {528#true} call ULTIMATE.init(); {534#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:07:58,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {534#(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); {528#true} is VALID [2022-04-15 07:07:58,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {528#true} assume true; {528#true} is VALID [2022-04-15 07:07:58,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {528#true} {528#true} #68#return; {528#true} is VALID [2022-04-15 07:07:58,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {528#true} call #t~ret8 := main(); {528#true} is VALID [2022-04-15 07:07:58,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {528#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {533#(= main_~a~0 0)} is VALID [2022-04-15 07:07:58,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {533#(= main_~a~0 0)} [74] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_10| |v_main_#t~pre5_9|)) (.cse1 (= |v_main_#t~pre4_9| |v_main_#t~pre4_8|)) (.cse2 (= v_main_~a~0_16 v_main_~a~0_15)) (.cse3 (= v_main_~b~0_23 v_main_~b~0_21))) (or (and .cse0 (= v_main_~c~0_16 v_main_~c~0_15) .cse1 .cse2 .cse3) (and .cse0 .cse1 (= v_main_~c~0_15 v_main_~c~0_16) .cse2 .cse3))) InVars {main_~c~0=v_main_~c~0_16, main_~b~0=v_main_~b~0_23, main_#t~pre4=|v_main_#t~pre4_9|, main_#t~pre5=|v_main_#t~pre5_10|, main_~a~0=v_main_~a~0_16} OutVars{main_~c~0=v_main_~c~0_15, main_~b~0=v_main_~b~0_21, main_#t~pre4=|v_main_#t~pre4_8|, main_#t~pre5=|v_main_#t~pre5_9|, main_~a~0=v_main_~a~0_15} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0] {533#(= main_~a~0 0)} is VALID [2022-04-15 07:07:58,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {533#(= main_~a~0 0)} [73] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {529#false} is VALID [2022-04-15 07:07:58,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {529#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {529#false} is VALID [2022-04-15 07:07:58,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {529#false} assume !false; {529#false} is VALID [2022-04-15 07:07:58,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:07:58,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:07:58,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944601749] [2022-04-15 07:07:58,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944601749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:58,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:58,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:07:59,016 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:07:59,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1960221881] [2022-04-15 07:07:59,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1960221881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:59,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:59,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:07:59,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223508979] [2022-04-15 07:07:59,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:07:59,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 07:07:59,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:07:59,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 07:07:59,026 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 07:07:59,026 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 07:07:59,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:59,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 07:07:59,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:07:59,027 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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 07:07:59,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:59,155 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2022-04-15 07:07:59,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 07:07:59,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 07:07:59,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:07:59,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 07:07:59,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-04-15 07:07:59,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 07:07:59,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-04-15 07:07:59,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 59 transitions. [2022-04-15 07:07:59,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:07:59,208 INFO L225 Difference]: With dead ends: 46 [2022-04-15 07:07:59,208 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 07:07:59,209 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-15 07:07:59,209 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 64 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:07:59,210 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 26 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:07:59,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 07:07:59,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2022-04-15 07:07:59,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:07:59,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 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 07:07:59,213 INFO L74 IsIncluded]: Start isIncluded. First operand 35 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 07:07:59,213 INFO L87 Difference]: Start difference. First operand 35 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 07:07:59,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:59,215 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 07:07:59,215 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-15 07:07:59,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:59,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:59,215 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 35 states. [2022-04-15 07:07:59,215 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 35 states. [2022-04-15 07:07:59,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:59,216 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 07:07:59,216 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-15 07:07:59,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:59,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:59,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:07:59,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:07:59,217 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 07:07:59,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-15 07:07:59,218 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2022-04-15 07:07:59,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:07:59,218 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-15 07:07:59,218 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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 07:07:59,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions. [2022-04-15 07:07:59,248 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 07:07:59,249 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-15 07:07:59,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 07:07:59,249 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:07:59,249 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 07:07:59,249 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 07:07:59,249 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:07:59,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:07:59,250 INFO L85 PathProgramCache]: Analyzing trace with hash 919301982, now seen corresponding path program 1 times [2022-04-15 07:07:59,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:59,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1604432606] [2022-04-15 07:07:59,277 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:07:59,316 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:07:59,355 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:07:59,434 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:07:59,435 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:07:59,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1739990083, now seen corresponding path program 1 times [2022-04-15 07:07:59,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:07:59,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42073855] [2022-04-15 07:07:59,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:07:59,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:07:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:59,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:07:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:59,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {753#(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); {747#true} is VALID [2022-04-15 07:07:59,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {747#true} assume true; {747#true} is VALID [2022-04-15 07:07:59,485 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {747#true} {747#true} #68#return; {747#true} is VALID [2022-04-15 07:07:59,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {747#true} call ULTIMATE.init(); {753#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:07:59,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {753#(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); {747#true} is VALID [2022-04-15 07:07:59,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {747#true} assume true; {747#true} is VALID [2022-04-15 07:07:59,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {747#true} {747#true} #68#return; {747#true} is VALID [2022-04-15 07:07:59,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {747#true} call #t~ret8 := main(); {747#true} is VALID [2022-04-15 07:07:59,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {747#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {752#(= main_~a~0 0)} is VALID [2022-04-15 07:07:59,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {752#(= main_~a~0 0)} [76] L22-3-->L22-4_primed: Formula: (and (= v_main_~b~0_36 v_main_~b~0_34) (= |v_main_#t~pre5_21| |v_main_#t~pre5_20|) (= v_main_~a~0_22 v_main_~a~0_21) (= |v_main_#t~pre6_21| |v_main_#t~pre6_20|) (= v_main_~c~0_41 v_main_~c~0_39) (= |v_main_#t~pre4_14| |v_main_#t~pre4_13|) (= v_main_~d~0_27 v_main_~d~0_26)) InVars {main_~c~0=v_main_~c~0_41, main_~d~0=v_main_~d~0_27, main_~b~0=v_main_~b~0_36, main_#t~pre4=|v_main_#t~pre4_14|, main_#t~pre5=|v_main_#t~pre5_21|, main_~a~0=v_main_~a~0_22, main_#t~pre6=|v_main_#t~pre6_21|} OutVars{main_~c~0=v_main_~c~0_39, main_~d~0=v_main_~d~0_26, main_~b~0=v_main_~b~0_34, main_#t~pre4=|v_main_#t~pre4_13|, main_#t~pre5=|v_main_#t~pre5_20|, main_~a~0=v_main_~a~0_21, main_#t~pre6=|v_main_#t~pre6_20|} AuxVars[] AssignedVars[main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {752#(= main_~a~0 0)} is VALID [2022-04-15 07:07:59,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {752#(= main_~a~0 0)} [75] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {748#false} is VALID [2022-04-15 07:07:59,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {748#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {748#false} is VALID [2022-04-15 07:07:59,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {748#false} assume !false; {748#false} is VALID [2022-04-15 07:07:59,488 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 07:07:59,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:07:59,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42073855] [2022-04-15 07:07:59,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42073855] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:59,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:59,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:07:59,520 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:07:59,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1604432606] [2022-04-15 07:07:59,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1604432606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:59,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:59,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 07:07:59,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693491251] [2022-04-15 07:07:59,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:07:59,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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 07:07:59,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:07:59,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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 07:07:59,530 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 07:07:59,530 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 07:07:59,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:59,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 07:07:59,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-15 07:07:59,531 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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 07:07:59,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:59,662 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-15 07:07:59,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 07:07:59,663 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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 07:07:59,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:07:59,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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 07:07:59,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-15 07:07:59,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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 07:07:59,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-15 07:07:59,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 61 transitions. [2022-04-15 07:07:59,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:07:59,702 INFO L225 Difference]: With dead ends: 48 [2022-04-15 07:07:59,702 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 07:07:59,703 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-04-15 07:07:59,703 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 74 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:07:59,704 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 24 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:07:59,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 07:07:59,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 21. [2022-04-15 07:07:59,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:07:59,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 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 07:07:59,707 INFO L74 IsIncluded]: Start isIncluded. First operand 37 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 07:07:59,707 INFO L87 Difference]: Start difference. First operand 37 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 07:07:59,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:59,708 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-15 07:07:59,708 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-04-15 07:07:59,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:59,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:59,709 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 37 states. [2022-04-15 07:07:59,709 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 37 states. [2022-04-15 07:07:59,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:59,710 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-15 07:07:59,710 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-04-15 07:07:59,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:59,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:59,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:07:59,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:07:59,710 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 07:07:59,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-15 07:07:59,711 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 18 [2022-04-15 07:07:59,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:07:59,711 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-15 07:07:59,711 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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 07:07:59,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 24 transitions. [2022-04-15 07:07:59,729 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 07:07:59,729 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-15 07:07:59,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 07:07:59,730 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:07:59,730 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 07:07:59,730 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 07:07:59,730 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:07:59,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:07:59,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1380235844, now seen corresponding path program 1 times [2022-04-15 07:07:59,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:59,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1341337882] [2022-04-15 07:08:03,846 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:03,908 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:07,981 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:08,054 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:10,526 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:10,581 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:10,677 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:10,677 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:08:10,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1740051587, now seen corresponding path program 1 times [2022-04-15 07:08:10,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:08:10,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451967219] [2022-04-15 07:08:10,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:08:10,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:08:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:10,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:08:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:10,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {985#(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); {979#true} is VALID [2022-04-15 07:08:10,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {979#true} assume true; {979#true} is VALID [2022-04-15 07:08:10,744 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {979#true} {979#true} #68#return; {979#true} is VALID [2022-04-15 07:08:10,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {979#true} call ULTIMATE.init(); {985#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:08:10,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {985#(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); {979#true} is VALID [2022-04-15 07:08:10,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {979#true} assume true; {979#true} is VALID [2022-04-15 07:08:10,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {979#true} {979#true} #68#return; {979#true} is VALID [2022-04-15 07:08:10,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {979#true} call #t~ret8 := main(); {979#true} is VALID [2022-04-15 07:08:10,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {979#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {984#(= main_~a~0 0)} is VALID [2022-04-15 07:08:10,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {984#(= main_~a~0 0)} [78] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_19| |v_main_#t~pre4_18|)) (.cse1 (= v_main_~b~0_44 v_main_~b~0_42)) (.cse2 (= v_main_~d~0_54 v_main_~d~0_52)) (.cse3 (= v_main_~a~0_28 v_main_~a~0_27)) (.cse4 (= |v_main_#t~pre6_28| |v_main_#t~pre6_27|)) (.cse5 (= |v_main_#t~pre5_27| |v_main_#t~pre5_26|)) (.cse6 (= |v_main_#t~pre7_22| |v_main_#t~pre7_21|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= v_main_~c~0_49 v_main_~c~0_51)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= v_main_~c~0_51 v_main_~c~0_49)))) InVars {main_#t~pre7=|v_main_#t~pre7_22|, main_~c~0=v_main_~c~0_51, main_~d~0=v_main_~d~0_54, main_~b~0=v_main_~b~0_44, main_#t~pre4=|v_main_#t~pre4_19|, main_#t~pre5=|v_main_#t~pre5_27|, main_~a~0=v_main_~a~0_28, main_#t~pre6=|v_main_#t~pre6_28|} OutVars{main_#t~pre7=|v_main_#t~pre7_21|, main_~c~0=v_main_~c~0_49, main_~d~0=v_main_~d~0_52, main_~b~0=v_main_~b~0_42, main_#t~pre4=|v_main_#t~pre4_18|, main_#t~pre5=|v_main_#t~pre5_26|, main_~a~0=v_main_~a~0_27, main_#t~pre6=|v_main_#t~pre6_27|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {984#(= main_~a~0 0)} is VALID [2022-04-15 07:08:10,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {984#(= main_~a~0 0)} [77] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {980#false} is VALID [2022-04-15 07:08:10,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {980#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {980#false} is VALID [2022-04-15 07:08:10,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {980#false} assume !false; {980#false} is VALID [2022-04-15 07:08:10,746 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 07:08:10,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:08:10,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451967219] [2022-04-15 07:08:10,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451967219] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:10,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:10,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:08:10,815 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:08:10,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1341337882] [2022-04-15 07:08:10,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1341337882] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:10,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:10,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:08:10,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432112538] [2022-04-15 07:08:10,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:08:10,816 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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 07:08:10,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:08:10,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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 07:08:10,829 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 07:08:10,829 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 07:08:10,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:10,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 07:08:10,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-15 07:08:10,830 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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 07:08:11,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:11,005 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-04-15 07:08:11,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 07:08:11,006 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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 07:08:11,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:08:11,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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 07:08:11,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2022-04-15 07:08:11,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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 07:08:11,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2022-04-15 07:08:11,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 63 transitions. [2022-04-15 07:08:11,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:11,055 INFO L225 Difference]: With dead ends: 50 [2022-04-15 07:08:11,055 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 07:08:11,056 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2022-04-15 07:08:11,060 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 67 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:08:11,061 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 24 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:08:11,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 07:08:11,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 23. [2022-04-15 07:08:11,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:08:11,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 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 07:08:11,068 INFO L74 IsIncluded]: Start isIncluded. First operand 39 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 07:08:11,068 INFO L87 Difference]: Start difference. First operand 39 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 07:08:11,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:11,070 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-04-15 07:08:11,070 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-04-15 07:08:11,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:11,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:11,071 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 39 states. [2022-04-15 07:08:11,071 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 39 states. [2022-04-15 07:08:11,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:11,072 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-04-15 07:08:11,072 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-04-15 07:08:11,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:11,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:11,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:08:11,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:08:11,074 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 07:08:11,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-04-15 07:08:11,075 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 20 [2022-04-15 07:08:11,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:08:11,075 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-04-15 07:08:11,076 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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 07:08:11,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 26 transitions. [2022-04-15 07:08:11,097 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 07:08:11,097 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-15 07:08:11,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 07:08:11,097 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:08:11,097 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 07:08:11,097 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 07:08:11,098 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:08:11,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:08:11,098 INFO L85 PathProgramCache]: Analyzing trace with hash 672070810, now seen corresponding path program 2 times [2022-04-15 07:08:11,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:11,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [820964617] [2022-04-15 07:08:15,181 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:15,243 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:17,907 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:17,970 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:20,183 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:20,276 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:20,276 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:08:20,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1740113091, now seen corresponding path program 1 times [2022-04-15 07:08:20,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:08:20,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112397445] [2022-04-15 07:08:20,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:08:20,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:08:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:20,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:08:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:20,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {1232#(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); {1226#true} is VALID [2022-04-15 07:08:20,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {1226#true} assume true; {1226#true} is VALID [2022-04-15 07:08:20,317 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1226#true} {1226#true} #68#return; {1226#true} is VALID [2022-04-15 07:08:20,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {1226#true} call ULTIMATE.init(); {1232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:08:20,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {1232#(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); {1226#true} is VALID [2022-04-15 07:08:20,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {1226#true} assume true; {1226#true} is VALID [2022-04-15 07:08:20,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1226#true} {1226#true} #68#return; {1226#true} is VALID [2022-04-15 07:08:20,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {1226#true} call #t~ret8 := main(); {1226#true} is VALID [2022-04-15 07:08:20,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {1226#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {1231#(= main_~a~0 0)} is VALID [2022-04-15 07:08:20,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {1231#(= main_~a~0 0)} [80] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_33| |v_main_#t~pre5_32|)) (.cse1 (= |v_main_#t~pre4_24| |v_main_#t~pre4_23|)) (.cse2 (= |v_main_#t~pre6_35| |v_main_#t~pre6_34|)) (.cse3 (= v_main_~d~0_87 v_main_~d~0_84)) (.cse4 (= v_main_~c~0_61 v_main_~c~0_59)) (.cse5 (= v_main_~a~0_34 v_main_~a~0_33)) (.cse6 (= v_main_~b~0_52 v_main_~b~0_50))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre7_49| |v_main_#t~pre7_47|) .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre7_47| |v_main_#t~pre7_49|) .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_49|, main_~c~0=v_main_~c~0_61, main_~d~0=v_main_~d~0_87, main_~b~0=v_main_~b~0_52, main_#t~pre4=|v_main_#t~pre4_24|, main_#t~pre5=|v_main_#t~pre5_33|, main_~a~0=v_main_~a~0_34, main_#t~pre6=|v_main_#t~pre6_35|} OutVars{main_#t~pre7=|v_main_#t~pre7_47|, main_~c~0=v_main_~c~0_59, main_~d~0=v_main_~d~0_84, main_~b~0=v_main_~b~0_50, main_#t~pre4=|v_main_#t~pre4_23|, main_#t~pre5=|v_main_#t~pre5_32|, main_~a~0=v_main_~a~0_33, main_#t~pre6=|v_main_#t~pre6_34|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {1231#(= main_~a~0 0)} is VALID [2022-04-15 07:08:20,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {1231#(= main_~a~0 0)} [79] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {1227#false} is VALID [2022-04-15 07:08:20,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {1227#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {1227#false} is VALID [2022-04-15 07:08:20,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {1227#false} assume !false; {1227#false} is VALID [2022-04-15 07:08:20,322 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 07:08:20,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:08:20,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112397445] [2022-04-15 07:08:20,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112397445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:20,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:20,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:08:20,390 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:08:20,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [820964617] [2022-04-15 07:08:20,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [820964617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:20,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:20,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 07:08:20,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117382012] [2022-04-15 07:08:20,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:08:20,391 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 07:08:20,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:08:20,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 07:08:20,404 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 07:08:20,404 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 07:08:20,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:20,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 07:08:20,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-15 07:08:20,405 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 07:08:20,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:20,618 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2022-04-15 07:08:20,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 07:08:20,618 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 07:08:20,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:08:20,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 07:08:20,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2022-04-15 07:08:20,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 07:08:20,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 65 transitions. [2022-04-15 07:08:20,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 65 transitions. [2022-04-15 07:08:20,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:20,670 INFO L225 Difference]: With dead ends: 52 [2022-04-15 07:08:20,670 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 07:08:20,670 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2022-04-15 07:08:20,670 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 64 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:08:20,670 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 34 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:08:20,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 07:08:20,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 25. [2022-04-15 07:08:20,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:08:20,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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 07:08:20,674 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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 07:08:20,674 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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 07:08:20,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:20,675 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-15 07:08:20,675 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-04-15 07:08:20,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:20,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:20,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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 41 states. [2022-04-15 07:08:20,676 INFO L87 Difference]: Start difference. First operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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 41 states. [2022-04-15 07:08:20,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:20,677 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-15 07:08:20,677 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-04-15 07:08:20,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:20,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:20,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:08:20,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:08:20,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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 07:08:20,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-15 07:08:20,678 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 22 [2022-04-15 07:08:20,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:08:20,678 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-15 07:08:20,678 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 07:08:20,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-15 07:08:20,705 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 07:08:20,705 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 07:08:20,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 07:08:20,706 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:08:20,706 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:08:20,706 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 07:08:20,706 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:08:20,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:08:20,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1548776440, now seen corresponding path program 3 times [2022-04-15 07:08:20,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:20,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1669629698] [2022-04-15 07:08:24,804 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:24,854 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:28,927 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:28,980 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:31,131 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:31,228 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:31,228 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:08:31,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1740174595, now seen corresponding path program 1 times [2022-04-15 07:08:31,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:08:31,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768563410] [2022-04-15 07:08:31,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:08:31,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:08:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:31,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:08:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:31,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {1494#(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); {1488#true} is VALID [2022-04-15 07:08:31,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {1488#true} assume true; {1488#true} is VALID [2022-04-15 07:08:31,274 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1488#true} {1488#true} #68#return; {1488#true} is VALID [2022-04-15 07:08:31,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {1488#true} call ULTIMATE.init(); {1494#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:08:31,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {1494#(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); {1488#true} is VALID [2022-04-15 07:08:31,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {1488#true} assume true; {1488#true} is VALID [2022-04-15 07:08:31,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1488#true} {1488#true} #68#return; {1488#true} is VALID [2022-04-15 07:08:31,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {1488#true} call #t~ret8 := main(); {1488#true} is VALID [2022-04-15 07:08:31,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {1488#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {1493#(= main_~a~0 0)} is VALID [2022-04-15 07:08:31,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {1493#(= main_~a~0 0)} [82] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_39| |v_main_#t~pre5_38|)) (.cse1 (= v_main_~a~0_40 v_main_~a~0_39)) (.cse2 (= |v_main_#t~pre6_42| |v_main_#t~pre6_41|)) (.cse3 (= v_main_~d~0_124 v_main_~d~0_120)) (.cse4 (= |v_main_#t~pre7_79| |v_main_#t~pre7_76|)) (.cse5 (= |v_main_#t~pre4_29| |v_main_#t~pre4_28|))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~c~0_71 v_main_~c~0_69) .cse4 .cse5 (= v_main_~b~0_60 v_main_~b~0_58)) (and .cse0 (= v_main_~c~0_69 v_main_~c~0_71) .cse1 .cse2 .cse3 .cse4 .cse5 (= v_main_~b~0_58 v_main_~b~0_60)))) InVars {main_#t~pre7=|v_main_#t~pre7_79|, main_~c~0=v_main_~c~0_71, main_~d~0=v_main_~d~0_124, main_~b~0=v_main_~b~0_60, main_#t~pre4=|v_main_#t~pre4_29|, main_#t~pre5=|v_main_#t~pre5_39|, main_~a~0=v_main_~a~0_40, main_#t~pre6=|v_main_#t~pre6_42|} OutVars{main_#t~pre7=|v_main_#t~pre7_76|, main_~c~0=v_main_~c~0_69, main_~d~0=v_main_~d~0_120, main_~b~0=v_main_~b~0_58, main_#t~pre4=|v_main_#t~pre4_28|, main_#t~pre5=|v_main_#t~pre5_38|, main_~a~0=v_main_~a~0_39, main_#t~pre6=|v_main_#t~pre6_41|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {1493#(= main_~a~0 0)} is VALID [2022-04-15 07:08:31,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {1493#(= main_~a~0 0)} [81] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {1489#false} is VALID [2022-04-15 07:08:31,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {1489#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {1489#false} is VALID [2022-04-15 07:08:31,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {1489#false} assume !false; {1489#false} is VALID [2022-04-15 07:08:31,278 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 07:08:31,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:08:31,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768563410] [2022-04-15 07:08:31,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768563410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:31,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:31,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:08:31,403 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:08:31,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1669629698] [2022-04-15 07:08:31,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1669629698] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:31,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:31,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 07:08:31,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341033685] [2022-04-15 07:08:31,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:08:31,404 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 07:08:31,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:08:31,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:31,421 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 07:08:31,421 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 07:08:31,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:31,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 07:08:31,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-15 07:08:31,422 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:31,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:31,654 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2022-04-15 07:08:31,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 07:08:31,654 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 07:08:31,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:08:31,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:31,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-15 07:08:31,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:31,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-15 07:08:31,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 67 transitions. [2022-04-15 07:08:31,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:31,704 INFO L225 Difference]: With dead ends: 54 [2022-04-15 07:08:31,704 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 07:08:31,704 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2022-04-15 07:08:31,705 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 74 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:08:31,705 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 24 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:08:31,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 07:08:31,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 27. [2022-04-15 07:08:31,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:08:31,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:31,709 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:31,710 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:31,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:31,711 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-04-15 07:08:31,711 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2022-04-15 07:08:31,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:31,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:31,711 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-15 07:08:31,712 INFO L87 Difference]: Start difference. First operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-15 07:08:31,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:31,713 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-04-15 07:08:31,713 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2022-04-15 07:08:31,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:31,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:31,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:08:31,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:08:31,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:31,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-15 07:08:31,714 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 24 [2022-04-15 07:08:31,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:08:31,714 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-15 07:08:31,714 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:31,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-15 07:08:31,745 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 07:08:31,745 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 07:08:31,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 07:08:31,745 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:08:31,746 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:08:31,746 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 07:08:31,746 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:08:31,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:08:31,746 INFO L85 PathProgramCache]: Analyzing trace with hash -2045670442, now seen corresponding path program 4 times [2022-04-15 07:08:31,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:31,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1603569800] [2022-04-15 07:08:34,037 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:34,098 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:38,188 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:38,246 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:42,329 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:42,388 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:42,490 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:42,490 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:08:42,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1740236099, now seen corresponding path program 1 times [2022-04-15 07:08:42,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:08:42,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952877361] [2022-04-15 07:08:42,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:08:42,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:08:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:42,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:08:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:42,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {1771#(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); {1765#true} is VALID [2022-04-15 07:08:42,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {1765#true} assume true; {1765#true} is VALID [2022-04-15 07:08:42,519 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1765#true} {1765#true} #68#return; {1765#true} is VALID [2022-04-15 07:08:42,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {1765#true} call ULTIMATE.init(); {1771#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:08:42,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {1771#(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); {1765#true} is VALID [2022-04-15 07:08:42,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {1765#true} assume true; {1765#true} is VALID [2022-04-15 07:08:42,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1765#true} {1765#true} #68#return; {1765#true} is VALID [2022-04-15 07:08:42,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {1765#true} call #t~ret8 := main(); {1765#true} is VALID [2022-04-15 07:08:42,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {1765#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {1770#(= main_~a~0 0)} is VALID [2022-04-15 07:08:42,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {1770#(= main_~a~0 0)} [84] L22-3-->L22-4_primed: Formula: (and (= v_main_~d~0_165 v_main_~d~0_160) (= |v_main_#t~pre6_49| |v_main_#t~pre6_48|) (= v_main_~c~0_81 v_main_~c~0_79) (= |v_main_#t~pre7_112| |v_main_#t~pre7_108|) (= v_main_~b~0_68 v_main_~b~0_66) (= |v_main_#t~pre4_34| |v_main_#t~pre4_33|) (= |v_main_#t~pre5_45| |v_main_#t~pre5_44|) (= v_main_~a~0_46 v_main_~a~0_45)) InVars {main_#t~pre7=|v_main_#t~pre7_112|, main_~c~0=v_main_~c~0_81, main_~d~0=v_main_~d~0_165, main_~b~0=v_main_~b~0_68, main_#t~pre4=|v_main_#t~pre4_34|, main_#t~pre5=|v_main_#t~pre5_45|, main_~a~0=v_main_~a~0_46, main_#t~pre6=|v_main_#t~pre6_49|} OutVars{main_#t~pre7=|v_main_#t~pre7_108|, main_~c~0=v_main_~c~0_79, main_~d~0=v_main_~d~0_160, main_~b~0=v_main_~b~0_66, main_#t~pre4=|v_main_#t~pre4_33|, main_#t~pre5=|v_main_#t~pre5_44|, main_~a~0=v_main_~a~0_45, main_#t~pre6=|v_main_#t~pre6_48|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {1770#(= main_~a~0 0)} is VALID [2022-04-15 07:08:42,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {1770#(= main_~a~0 0)} [83] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {1766#false} is VALID [2022-04-15 07:08:42,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {1766#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {1766#false} is VALID [2022-04-15 07:08:42,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {1766#false} assume !false; {1766#false} is VALID [2022-04-15 07:08:42,522 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 07:08:42,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:08:42,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952877361] [2022-04-15 07:08:42,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952877361] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:42,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:42,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:08:42,646 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:08:42,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1603569800] [2022-04-15 07:08:42,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1603569800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:42,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:42,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 07:08:42,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61452270] [2022-04-15 07:08:42,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:08:42,647 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 07:08:42,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:08:42,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:42,668 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 07:08:42,668 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 07:08:42,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:42,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 07:08:42,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-04-15 07:08:42,669 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:42,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:42,964 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2022-04-15 07:08:42,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 07:08:42,965 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 07:08:42,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:08:42,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:42,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 69 transitions. [2022-04-15 07:08:42,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:42,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 69 transitions. [2022-04-15 07:08:42,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 69 transitions. [2022-04-15 07:08:43,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:43,020 INFO L225 Difference]: With dead ends: 56 [2022-04-15 07:08:43,021 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 07:08:43,021 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2022-04-15 07:08:43,021 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 75 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:08:43,021 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 24 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:08:43,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 07:08:43,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 29. [2022-04-15 07:08:43,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:08:43,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 29 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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 07:08:43,026 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 29 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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 07:08:43,026 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 29 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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 07:08:43,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:43,028 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-04-15 07:08:43,028 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2022-04-15 07:08:43,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:43,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:43,028 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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 45 states. [2022-04-15 07:08:43,028 INFO L87 Difference]: Start difference. First operand has 29 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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 45 states. [2022-04-15 07:08:43,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:43,029 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-04-15 07:08:43,029 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2022-04-15 07:08:43,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:43,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:43,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:08:43,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:08:43,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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 07:08:43,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-04-15 07:08:43,030 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 26 [2022-04-15 07:08:43,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:08:43,030 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-04-15 07:08:43,030 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:43,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 32 transitions. [2022-04-15 07:08:43,065 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 07:08:43,065 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-15 07:08:43,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 07:08:43,065 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:08:43,066 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:08:43,066 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 07:08:43,066 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:08:43,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:08:43,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1139549236, now seen corresponding path program 5 times [2022-04-15 07:08:43,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:43,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1923355250] [2022-04-15 07:08:46,305 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:50,375 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:50,422 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:54,507 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:54,569 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:54,678 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:54,678 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:08:54,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1740297603, now seen corresponding path program 1 times [2022-04-15 07:08:54,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:08:54,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134890895] [2022-04-15 07:08:54,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:08:54,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:08:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:54,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:08:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:54,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {2063#(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); {2057#true} is VALID [2022-04-15 07:08:54,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {2057#true} assume true; {2057#true} is VALID [2022-04-15 07:08:54,736 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2057#true} {2057#true} #68#return; {2057#true} is VALID [2022-04-15 07:08:54,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {2057#true} call ULTIMATE.init(); {2063#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:08:54,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {2063#(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); {2057#true} is VALID [2022-04-15 07:08:54,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {2057#true} assume true; {2057#true} is VALID [2022-04-15 07:08:54,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2057#true} {2057#true} #68#return; {2057#true} is VALID [2022-04-15 07:08:54,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {2057#true} call #t~ret8 := main(); {2057#true} is VALID [2022-04-15 07:08:54,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {2057#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {2062#(= main_~a~0 0)} is VALID [2022-04-15 07:08:54,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {2062#(= main_~a~0 0)} [86] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre7_148| |v_main_#t~pre7_143|)) (.cse1 (= |v_main_#t~pre4_39| |v_main_#t~pre4_38|)) (.cse2 (= v_main_~a~0_52 v_main_~a~0_51)) (.cse3 (= |v_main_#t~pre6_56| |v_main_#t~pre6_55|)) (.cse4 (= |v_main_#t~pre5_51| |v_main_#t~pre5_50|)) (.cse5 (= v_main_~b~0_76 v_main_~b~0_74))) (or (and .cse0 (= v_main_~d~0_210 v_main_~d~0_204) .cse1 (= v_main_~c~0_91 v_main_~c~0_89) .cse2 .cse3 .cse4 .cse5) (and .cse0 (= v_main_~c~0_89 v_main_~c~0_91) .cse1 (= v_main_~d~0_204 v_main_~d~0_210) .cse2 .cse3 .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_148|, main_~c~0=v_main_~c~0_91, main_~d~0=v_main_~d~0_210, main_~b~0=v_main_~b~0_76, main_#t~pre4=|v_main_#t~pre4_39|, main_#t~pre5=|v_main_#t~pre5_51|, main_~a~0=v_main_~a~0_52, main_#t~pre6=|v_main_#t~pre6_56|} OutVars{main_#t~pre7=|v_main_#t~pre7_143|, main_~c~0=v_main_~c~0_89, main_~d~0=v_main_~d~0_204, main_~b~0=v_main_~b~0_74, main_#t~pre4=|v_main_#t~pre4_38|, main_#t~pre5=|v_main_#t~pre5_50|, main_~a~0=v_main_~a~0_51, main_#t~pre6=|v_main_#t~pre6_55|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {2062#(= main_~a~0 0)} is VALID [2022-04-15 07:08:54,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {2062#(= main_~a~0 0)} [85] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {2058#false} is VALID [2022-04-15 07:08:54,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {2058#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {2058#false} is VALID [2022-04-15 07:08:54,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {2058#false} assume !false; {2058#false} is VALID [2022-04-15 07:08:54,739 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 07:08:54,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:08:54,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134890895] [2022-04-15 07:08:54,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134890895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:54,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:54,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:08:54,868 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:08:54,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1923355250] [2022-04-15 07:08:54,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1923355250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:54,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:54,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 07:08:54,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608538675] [2022-04-15 07:08:54,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:08:54,869 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 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 28 [2022-04-15 07:08:54,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:08:54,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 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 07:08:54,891 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 07:08:54,892 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 07:08:54,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:54,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 07:08:54,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-04-15 07:08:54,892 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 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 07:08:55,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:55,248 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2022-04-15 07:08:55,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 07:08:55,248 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 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 28 [2022-04-15 07:08:55,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:08:55,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 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 07:08:55,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2022-04-15 07:08:55,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 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 07:08:55,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2022-04-15 07:08:55,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 71 transitions. [2022-04-15 07:08:55,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:55,298 INFO L225 Difference]: With dead ends: 58 [2022-04-15 07:08:55,298 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 07:08:55,299 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2022-04-15 07:08:55,299 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 87 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:08:55,299 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 29 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:08:55,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 07:08:55,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2022-04-15 07:08:55,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:08:55,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 31 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 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 07:08:55,304 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 31 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 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 07:08:55,305 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 31 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 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 07:08:55,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:55,306 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2022-04-15 07:08:55,306 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-15 07:08:55,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:55,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:55,306 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 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 47 states. [2022-04-15 07:08:55,306 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 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 47 states. [2022-04-15 07:08:55,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:55,307 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2022-04-15 07:08:55,307 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-15 07:08:55,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:55,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:55,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:08:55,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:08:55,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 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 07:08:55,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-15 07:08:55,308 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 28 [2022-04-15 07:08:55,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:08:55,308 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-15 07:08:55,308 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 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 07:08:55,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 34 transitions. [2022-04-15 07:08:55,345 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 07:08:55,346 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-15 07:08:55,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 07:08:55,346 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:08:55,346 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:08:55,346 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 07:08:55,346 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:08:55,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:08:55,346 INFO L85 PathProgramCache]: Analyzing trace with hash -176022254, now seen corresponding path program 6 times [2022-04-15 07:08:55,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:55,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [951248329] [2022-04-15 07:08:59,487 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:59,535 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:03,622 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:03,666 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:05,825 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:05,876 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:05,982 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:05,982 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:09:05,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1740359107, now seen corresponding path program 1 times [2022-04-15 07:09:05,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:09:05,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625028667] [2022-04-15 07:09:05,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:09:05,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:09:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:06,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:09:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:06,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {2370#(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); {2364#true} is VALID [2022-04-15 07:09:06,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-15 07:09:06,026 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2364#true} {2364#true} #68#return; {2364#true} is VALID [2022-04-15 07:09:06,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {2364#true} call ULTIMATE.init(); {2370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:09:06,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {2370#(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); {2364#true} is VALID [2022-04-15 07:09:06,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {2364#true} assume true; {2364#true} is VALID [2022-04-15 07:09:06,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2364#true} {2364#true} #68#return; {2364#true} is VALID [2022-04-15 07:09:06,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {2364#true} call #t~ret8 := main(); {2364#true} is VALID [2022-04-15 07:09:06,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {2364#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {2369#(= main_~a~0 0)} is VALID [2022-04-15 07:09:06,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {2369#(= main_~a~0 0)} [88] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_101 v_main_~c~0_99)) (.cse1 (= |v_main_#t~pre4_44| |v_main_#t~pre4_43|)) (.cse2 (= v_main_~d~0_259 v_main_~d~0_252)) (.cse3 (= |v_main_#t~pre6_63| |v_main_#t~pre6_62|)) (.cse4 (= |v_main_#t~pre5_57| |v_main_#t~pre5_56|)) (.cse5 (= v_main_~b~0_84 v_main_~b~0_82))) (or (and .cse0 (= |v_main_#t~pre7_181| |v_main_#t~pre7_187|) (= v_main_~a~0_57 v_main_~a~0_58) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (= |v_main_#t~pre7_187| |v_main_#t~pre7_181|) .cse3 .cse4 (= v_main_~a~0_58 v_main_~a~0_57) .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_187|, main_~c~0=v_main_~c~0_101, main_~d~0=v_main_~d~0_259, main_~b~0=v_main_~b~0_84, main_#t~pre4=|v_main_#t~pre4_44|, main_#t~pre5=|v_main_#t~pre5_57|, main_~a~0=v_main_~a~0_58, main_#t~pre6=|v_main_#t~pre6_63|} OutVars{main_#t~pre7=|v_main_#t~pre7_181|, main_~c~0=v_main_~c~0_99, main_~d~0=v_main_~d~0_252, main_~b~0=v_main_~b~0_82, main_#t~pre4=|v_main_#t~pre4_43|, main_#t~pre5=|v_main_#t~pre5_56|, main_~a~0=v_main_~a~0_57, main_#t~pre6=|v_main_#t~pre6_62|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {2369#(= main_~a~0 0)} is VALID [2022-04-15 07:09:06,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {2369#(= main_~a~0 0)} [87] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {2365#false} is VALID [2022-04-15 07:09:06,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {2365#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {2365#false} is VALID [2022-04-15 07:09:06,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {2365#false} assume !false; {2365#false} is VALID [2022-04-15 07:09:06,028 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 07:09:06,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:09:06,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625028667] [2022-04-15 07:09:06,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625028667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:06,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:06,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:09:06,219 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:09:06,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [951248329] [2022-04-15 07:09:06,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [951248329] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:06,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:06,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 07:09:06,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806926680] [2022-04-15 07:09:06,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:09:06,220 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 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 30 [2022-04-15 07:09:06,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:09:06,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 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 07:09:06,239 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 07:09:06,239 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 07:09:06,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:06,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 07:09:06,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-04-15 07:09:06,240 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 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 07:09:06,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:06,666 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2022-04-15 07:09:06,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 07:09:06,667 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 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 30 [2022-04-15 07:09:06,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:09:06,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 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 07:09:06,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. [2022-04-15 07:09:06,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 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 07:09:06,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. [2022-04-15 07:09:06,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 71 transitions. [2022-04-15 07:09:06,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:06,726 INFO L225 Difference]: With dead ends: 58 [2022-04-15 07:09:06,726 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 07:09:06,727 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2022-04-15 07:09:06,727 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 65 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:09:06,727 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 38 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:09:06,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 07:09:06,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2022-04-15 07:09:06,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:09:06,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 35 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 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 07:09:06,734 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 35 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 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 07:09:06,734 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 35 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 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 07:09:06,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:06,735 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-15 07:09:06,735 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-15 07:09:06,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:06,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:06,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 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 47 states. [2022-04-15 07:09:06,736 INFO L87 Difference]: Start difference. First operand has 35 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 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 47 states. [2022-04-15 07:09:06,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:06,736 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-15 07:09:06,736 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-15 07:09:06,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:06,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:06,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:09:06,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:09:06,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 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 07:09:06,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-04-15 07:09:06,737 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 30 [2022-04-15 07:09:06,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:09:06,737 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-04-15 07:09:06,737 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 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 07:09:06,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 38 transitions. [2022-04-15 07:09:06,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:06,776 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-15 07:09:06,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 07:09:06,776 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:09:06,777 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:09:06,777 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 07:09:06,777 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:09:06,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:09:06,777 INFO L85 PathProgramCache]: Analyzing trace with hash 145574267, now seen corresponding path program 7 times [2022-04-15 07:09:06,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:06,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1529428992] [2022-04-15 07:09:09,965 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:10,008 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:12,316 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:16,386 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:16,438 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:16,532 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:16,532 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:09:16,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1740420611, now seen corresponding path program 1 times [2022-04-15 07:09:16,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:09:16,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293708713] [2022-04-15 07:09:16,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:09:16,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:09:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:16,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:09:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:16,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {2691#(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); {2685#true} is VALID [2022-04-15 07:09:16,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {2685#true} assume true; {2685#true} is VALID [2022-04-15 07:09:16,565 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2685#true} {2685#true} #68#return; {2685#true} is VALID [2022-04-15 07:09:16,566 INFO L272 TraceCheckUtils]: 0: Hoare triple {2685#true} call ULTIMATE.init(); {2691#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:09:16,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {2691#(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); {2685#true} is VALID [2022-04-15 07:09:16,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {2685#true} assume true; {2685#true} is VALID [2022-04-15 07:09:16,566 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2685#true} {2685#true} #68#return; {2685#true} is VALID [2022-04-15 07:09:16,566 INFO L272 TraceCheckUtils]: 4: Hoare triple {2685#true} call #t~ret8 := main(); {2685#true} is VALID [2022-04-15 07:09:16,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {2685#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {2690#(= main_~a~0 0)} is VALID [2022-04-15 07:09:16,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {2690#(= main_~a~0 0)} [90] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_118 v_main_~c~0_115)) (.cse1 (= |v_main_#t~pre7_226| |v_main_#t~pre7_220|)) (.cse2 (= |v_main_#t~pre6_74| |v_main_#t~pre6_72|)) (.cse3 (= v_main_~b~0_92 v_main_~b~0_90)) (.cse4 (= |v_main_#t~pre4_49| |v_main_#t~pre4_48|)) (.cse5 (= |v_main_#t~pre5_63| |v_main_#t~pre5_62|)) (.cse6 (= v_main_~a~0_64 v_main_~a~0_63))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~d~0_314 v_main_~d~0_306) .cse5 .cse6) (and (= v_main_~d~0_306 v_main_~d~0_314) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_226|, main_~c~0=v_main_~c~0_118, main_~d~0=v_main_~d~0_314, main_~b~0=v_main_~b~0_92, main_#t~pre4=|v_main_#t~pre4_49|, main_#t~pre5=|v_main_#t~pre5_63|, main_~a~0=v_main_~a~0_64, main_#t~pre6=|v_main_#t~pre6_74|} OutVars{main_#t~pre7=|v_main_#t~pre7_220|, main_~c~0=v_main_~c~0_115, main_~d~0=v_main_~d~0_306, main_~b~0=v_main_~b~0_90, main_#t~pre4=|v_main_#t~pre4_48|, main_#t~pre5=|v_main_#t~pre5_62|, main_~a~0=v_main_~a~0_63, main_#t~pre6=|v_main_#t~pre6_72|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {2690#(= main_~a~0 0)} is VALID [2022-04-15 07:09:16,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {2690#(= main_~a~0 0)} [89] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {2686#false} is VALID [2022-04-15 07:09:16,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {2686#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {2686#false} is VALID [2022-04-15 07:09:16,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {2686#false} assume !false; {2686#false} is VALID [2022-04-15 07:09:16,568 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 07:09:16,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:09:16,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293708713] [2022-04-15 07:09:16,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293708713] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:16,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:16,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:09:16,777 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:09:16,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1529428992] [2022-04-15 07:09:16,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1529428992] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:16,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:16,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 07:09:16,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950416389] [2022-04-15 07:09:16,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:09:16,778 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 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 33 [2022-04-15 07:09:16,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:09:16,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 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 07:09:16,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:16,800 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 07:09:16,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:16,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 07:09:16,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-04-15 07:09:16,801 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 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 07:09:17,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:17,261 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2022-04-15 07:09:17,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 07:09:17,262 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 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 33 [2022-04-15 07:09:17,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:09:17,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 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 07:09:17,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 72 transitions. [2022-04-15 07:09:17,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 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 07:09:17,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 72 transitions. [2022-04-15 07:09:17,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 72 transitions. [2022-04-15 07:09:17,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:17,312 INFO L225 Difference]: With dead ends: 60 [2022-04-15 07:09:17,312 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 07:09:17,313 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2022-04-15 07:09:17,313 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 83 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:09:17,313 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 28 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:09:17,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 07:09:17,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2022-04-15 07:09:17,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:09:17,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 36 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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 07:09:17,321 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 36 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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 07:09:17,321 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 36 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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 07:09:17,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:17,322 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-04-15 07:09:17,322 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-04-15 07:09:17,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:17,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:17,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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 49 states. [2022-04-15 07:09:17,322 INFO L87 Difference]: Start difference. First operand has 36 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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 49 states. [2022-04-15 07:09:17,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:17,323 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-04-15 07:09:17,323 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-04-15 07:09:17,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:17,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:17,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:09:17,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:09:17,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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 07:09:17,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-15 07:09:17,324 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 33 [2022-04-15 07:09:17,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:09:17,325 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-15 07:09:17,325 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 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 07:09:17,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 39 transitions. [2022-04-15 07:09:17,375 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 07:09:17,376 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-15 07:09:17,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 07:09:17,376 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:09:17,376 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:09:17,376 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 07:09:17,377 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:09:17,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:09:17,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1903227751, now seen corresponding path program 8 times [2022-04-15 07:09:17,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:17,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [422518733] [2022-04-15 07:09:17,602 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:20,176 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:20,231 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:24,314 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:24,381 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:24,489 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:24,605 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:28,698 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:28,755 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:28,848 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:28,849 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:09:28,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1740482115, now seen corresponding path program 1 times [2022-04-15 07:09:28,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:09:28,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912587576] [2022-04-15 07:09:28,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:09:28,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:09:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:28,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:09:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:28,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {3025#(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); {3019#true} is VALID [2022-04-15 07:09:28,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {3019#true} assume true; {3019#true} is VALID [2022-04-15 07:09:28,879 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3019#true} {3019#true} #68#return; {3019#true} is VALID [2022-04-15 07:09:28,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {3019#true} call ULTIMATE.init(); {3025#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:09:28,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {3025#(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); {3019#true} is VALID [2022-04-15 07:09:28,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {3019#true} assume true; {3019#true} is VALID [2022-04-15 07:09:28,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3019#true} {3019#true} #68#return; {3019#true} is VALID [2022-04-15 07:09:28,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {3019#true} call #t~ret8 := main(); {3019#true} is VALID [2022-04-15 07:09:28,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {3019#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {3024#(= main_~a~0 0)} is VALID [2022-04-15 07:09:28,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {3024#(= main_~a~0 0)} [92] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_54| |v_main_#t~pre4_53|)) (.cse1 (= |v_main_#t~pre7_279| |v_main_#t~pre7_272|)) (.cse2 (= v_main_~b~0_100 v_main_~b~0_98))) (or (and (= v_main_~a~0_69 v_main_~a~0_70) (= v_main_~c~0_149 v_main_~c~0_152) .cse0 .cse1 (= v_main_~d~0_382 v_main_~d~0_391) .cse2 (= |v_main_#t~pre6_99| |v_main_#t~pre6_101|) (= |v_main_#t~pre5_68| |v_main_#t~pre5_69|)) (and (= v_main_~c~0_152 v_main_~c~0_149) .cse0 (= |v_main_#t~pre6_101| |v_main_#t~pre6_99|) .cse1 .cse2 (= |v_main_#t~pre5_69| |v_main_#t~pre5_68|) (= v_main_~d~0_391 v_main_~d~0_382) (= v_main_~a~0_70 v_main_~a~0_69)))) InVars {main_#t~pre7=|v_main_#t~pre7_279|, main_~c~0=v_main_~c~0_152, main_~d~0=v_main_~d~0_391, main_~b~0=v_main_~b~0_100, main_#t~pre4=|v_main_#t~pre4_54|, main_#t~pre5=|v_main_#t~pre5_69|, main_~a~0=v_main_~a~0_70, main_#t~pre6=|v_main_#t~pre6_101|} OutVars{main_#t~pre7=|v_main_#t~pre7_272|, main_~c~0=v_main_~c~0_149, main_~d~0=v_main_~d~0_382, main_~b~0=v_main_~b~0_98, main_#t~pre4=|v_main_#t~pre4_53|, main_#t~pre5=|v_main_#t~pre5_68|, main_~a~0=v_main_~a~0_69, main_#t~pre6=|v_main_#t~pre6_99|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {3024#(= main_~a~0 0)} is VALID [2022-04-15 07:09:28,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {3024#(= main_~a~0 0)} [91] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {3020#false} is VALID [2022-04-15 07:09:28,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {3020#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {3020#false} is VALID [2022-04-15 07:09:28,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {3020#false} assume !false; {3020#false} is VALID [2022-04-15 07:09:28,881 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 07:09:28,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:09:28,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912587576] [2022-04-15 07:09:28,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912587576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:28,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:28,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:09:29,101 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:09:29,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [422518733] [2022-04-15 07:09:29,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [422518733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:29,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:29,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 07:09:29,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009342691] [2022-04-15 07:09:29,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:09:29,102 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 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 35 [2022-04-15 07:09:29,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:09:29,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 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 07:09:29,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:29,125 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 07:09:29,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:29,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 07:09:29,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-04-15 07:09:29,126 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 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 07:09:29,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:29,633 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2022-04-15 07:09:29,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 07:09:29,633 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 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 35 [2022-04-15 07:09:29,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:09:29,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 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 07:09:29,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 74 transitions. [2022-04-15 07:09:29,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 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 07:09:29,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 74 transitions. [2022-04-15 07:09:29,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 74 transitions. [2022-04-15 07:09:29,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:29,688 INFO L225 Difference]: With dead ends: 62 [2022-04-15 07:09:29,688 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 07:09:29,688 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2022-04-15 07:09:29,689 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 69 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:09:29,689 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 38 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:09:29,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 07:09:29,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 38. [2022-04-15 07:09:29,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:09:29,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 38 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 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 07:09:29,696 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 38 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 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 07:09:29,696 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 38 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 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 07:09:29,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:29,696 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-15 07:09:29,696 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-15 07:09:29,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:29,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:29,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 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 51 states. [2022-04-15 07:09:29,697 INFO L87 Difference]: Start difference. First operand has 38 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 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 51 states. [2022-04-15 07:09:29,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:29,697 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-04-15 07:09:29,697 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-04-15 07:09:29,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:29,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:29,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:09:29,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:09:29,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 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 07:09:29,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-15 07:09:29,698 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 35 [2022-04-15 07:09:29,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:09:29,698 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-15 07:09:29,699 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 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 07:09:29,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-15 07:09:29,744 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 07:09:29,745 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-15 07:09:29,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 07:09:29,745 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:09:29,745 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:09:29,745 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 07:09:29,745 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:09:29,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:09:29,745 INFO L85 PathProgramCache]: Analyzing trace with hash 588021815, now seen corresponding path program 9 times [2022-04-15 07:09:29,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:29,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1961246477] [2022-04-15 07:09:29,947 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:30,064 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:30,165 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:30,301 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:30,395 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:30,523 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:30,627 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:30,627 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:09:30,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1740543619, now seen corresponding path program 1 times [2022-04-15 07:09:30,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:09:30,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395231841] [2022-04-15 07:09:30,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:09:30,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:09:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:30,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:09:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:30,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {3374#(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); {3368#true} is VALID [2022-04-15 07:09:30,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {3368#true} assume true; {3368#true} is VALID [2022-04-15 07:09:30,659 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3368#true} {3368#true} #68#return; {3368#true} is VALID [2022-04-15 07:09:30,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {3368#true} call ULTIMATE.init(); {3374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:09:30,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {3374#(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); {3368#true} is VALID [2022-04-15 07:09:30,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {3368#true} assume true; {3368#true} is VALID [2022-04-15 07:09:30,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3368#true} {3368#true} #68#return; {3368#true} is VALID [2022-04-15 07:09:30,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {3368#true} call #t~ret8 := main(); {3368#true} is VALID [2022-04-15 07:09:30,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {3368#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {3373#(= main_~a~0 0)} is VALID [2022-04-15 07:09:30,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {3373#(= main_~a~0 0)} [94] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~b~0_108 v_main_~b~0_106)) (.cse1 (= v_main_~c~0_186 v_main_~c~0_183)) (.cse2 (= |v_main_#t~pre5_75| |v_main_#t~pre5_74|)) (.cse3 (= v_main_~a~0_76 v_main_~a~0_75)) (.cse4 (= |v_main_#t~pre6_128| |v_main_#t~pre6_126|)) (.cse5 (= |v_main_#t~pre4_59| |v_main_#t~pre4_58|))) (or (and .cse0 (= v_main_~d~0_472 v_main_~d~0_462) .cse1 (= |v_main_#t~pre7_340| |v_main_#t~pre7_332|) .cse2 .cse3 .cse4 .cse5) (and .cse0 (= |v_main_#t~pre7_332| |v_main_#t~pre7_340|) .cse1 .cse2 (= v_main_~d~0_462 v_main_~d~0_472) .cse3 .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_340|, main_~c~0=v_main_~c~0_186, main_~d~0=v_main_~d~0_472, main_~b~0=v_main_~b~0_108, main_#t~pre4=|v_main_#t~pre4_59|, main_#t~pre5=|v_main_#t~pre5_75|, main_~a~0=v_main_~a~0_76, main_#t~pre6=|v_main_#t~pre6_128|} OutVars{main_#t~pre7=|v_main_#t~pre7_332|, main_~c~0=v_main_~c~0_183, main_~d~0=v_main_~d~0_462, main_~b~0=v_main_~b~0_106, main_#t~pre4=|v_main_#t~pre4_58|, main_#t~pre5=|v_main_#t~pre5_74|, main_~a~0=v_main_~a~0_75, main_#t~pre6=|v_main_#t~pre6_126|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {3373#(= main_~a~0 0)} is VALID [2022-04-15 07:09:30,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {3373#(= main_~a~0 0)} [93] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {3369#false} is VALID [2022-04-15 07:09:30,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {3369#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {3369#false} is VALID [2022-04-15 07:09:30,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {3369#false} assume !false; {3369#false} is VALID [2022-04-15 07:09:30,661 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 07:09:30,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:09:30,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395231841] [2022-04-15 07:09:30,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395231841] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:30,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:30,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:09:30,882 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:09:30,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1961246477] [2022-04-15 07:09:30,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1961246477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:30,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:30,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 07:09:30,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109415161] [2022-04-15 07:09:30,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:09:30,883 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 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 37 [2022-04-15 07:09:30,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:09:30,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 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 07:09:30,907 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 07:09:30,907 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 07:09:30,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:30,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 07:09:30,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-04-15 07:09:30,908 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 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 07:09:31,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:31,472 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2022-04-15 07:09:31,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 07:09:31,472 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 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 37 [2022-04-15 07:09:31,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:09:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 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 07:09:31,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 76 transitions. [2022-04-15 07:09:31,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 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 07:09:31,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 76 transitions. [2022-04-15 07:09:31,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 76 transitions. [2022-04-15 07:09:31,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:31,530 INFO L225 Difference]: With dead ends: 64 [2022-04-15 07:09:31,530 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 07:09:31,531 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2022-04-15 07:09:31,531 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 80 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:09:31,531 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 38 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:09:31,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 07:09:31,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2022-04-15 07:09:31,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:09:31,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 40 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 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 07:09:31,539 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 40 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 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 07:09:31,539 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 40 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 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 07:09:31,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:31,540 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-15 07:09:31,540 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-15 07:09:31,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:31,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:31,540 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 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 53 states. [2022-04-15 07:09:31,540 INFO L87 Difference]: Start difference. First operand has 40 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 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 53 states. [2022-04-15 07:09:31,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:31,541 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-15 07:09:31,541 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-15 07:09:31,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:31,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:31,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:09:31,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:09:31,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 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 07:09:31,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-04-15 07:09:31,542 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 37 [2022-04-15 07:09:31,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:09:31,542 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-04-15 07:09:31,542 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 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 07:09:31,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 43 transitions. [2022-04-15 07:09:31,599 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 07:09:31,600 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-15 07:09:31,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 07:09:31,600 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:09:31,600 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:09:31,600 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 07:09:31,600 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:09:31,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:09:31,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1912896427, now seen corresponding path program 10 times [2022-04-15 07:09:31,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:31,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1223864064] [2022-04-15 07:09:31,803 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:35,885 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:35,929 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:36,028 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:40,108 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:40,157 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:40,268 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:42,410 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:42,525 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:42,526 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:09:42,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1740605123, now seen corresponding path program 1 times [2022-04-15 07:09:42,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:09:42,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758127698] [2022-04-15 07:09:42,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:09:42,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:09:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:42,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:09:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:42,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {3738#(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); {3732#true} is VALID [2022-04-15 07:09:42,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-15 07:09:42,551 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3732#true} {3732#true} #68#return; {3732#true} is VALID [2022-04-15 07:09:42,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {3732#true} call ULTIMATE.init(); {3738#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:09:42,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {3738#(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); {3732#true} is VALID [2022-04-15 07:09:42,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {3732#true} assume true; {3732#true} is VALID [2022-04-15 07:09:42,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3732#true} {3732#true} #68#return; {3732#true} is VALID [2022-04-15 07:09:42,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {3732#true} call #t~ret8 := main(); {3732#true} is VALID [2022-04-15 07:09:42,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {3732#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {3737#(= main_~a~0 0)} is VALID [2022-04-15 07:09:42,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {3737#(= main_~a~0 0)} [96] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre7_404| |v_main_#t~pre7_395|)) (.cse1 (= |v_main_#t~pre5_81| |v_main_#t~pre5_80|)) (.cse2 (= v_main_~a~0_82 v_main_~a~0_81)) (.cse3 (= v_main_~c~0_220 v_main_~c~0_217)) (.cse4 (= |v_main_#t~pre4_64| |v_main_#t~pre4_63|)) (.cse5 (= |v_main_#t~pre6_155| |v_main_#t~pre6_153|)) (.cse6 (= v_main_~b~0_116 v_main_~b~0_114))) (or (and .cse0 (= v_main_~d~0_546 v_main_~d~0_557) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= v_main_~d~0_557 v_main_~d~0_546)))) InVars {main_#t~pre7=|v_main_#t~pre7_404|, main_~c~0=v_main_~c~0_220, main_~d~0=v_main_~d~0_557, main_~b~0=v_main_~b~0_116, main_#t~pre4=|v_main_#t~pre4_64|, main_#t~pre5=|v_main_#t~pre5_81|, main_~a~0=v_main_~a~0_82, main_#t~pre6=|v_main_#t~pre6_155|} OutVars{main_#t~pre7=|v_main_#t~pre7_395|, main_~c~0=v_main_~c~0_217, main_~d~0=v_main_~d~0_546, main_~b~0=v_main_~b~0_114, main_#t~pre4=|v_main_#t~pre4_63|, main_#t~pre5=|v_main_#t~pre5_80|, main_~a~0=v_main_~a~0_81, main_#t~pre6=|v_main_#t~pre6_153|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {3737#(= main_~a~0 0)} is VALID [2022-04-15 07:09:42,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {3737#(= main_~a~0 0)} [95] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {3733#false} is VALID [2022-04-15 07:09:42,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {3733#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {3733#false} is VALID [2022-04-15 07:09:42,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {3733#false} assume !false; {3733#false} is VALID [2022-04-15 07:09:42,562 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 07:09:42,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:09:42,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758127698] [2022-04-15 07:09:42,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758127698] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:42,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:42,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:09:42,814 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:09:42,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1223864064] [2022-04-15 07:09:42,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1223864064] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:42,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:42,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 07:09:42,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76736374] [2022-04-15 07:09:42,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:09:42,815 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 07:09:42,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:09:42,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:42,840 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 07:09:42,840 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 07:09:42,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:42,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 07:09:42,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-04-15 07:09:42,841 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:43,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:43,464 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-04-15 07:09:43,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 07:09:43,464 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 07:09:43,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:09:43,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:43,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 78 transitions. [2022-04-15 07:09:43,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:43,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 78 transitions. [2022-04-15 07:09:43,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 78 transitions. [2022-04-15 07:09:43,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:43,532 INFO L225 Difference]: With dead ends: 66 [2022-04-15 07:09:43,532 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 07:09:43,533 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=861, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 07:09:43,533 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 84 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:09:43,533 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 38 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:09:43,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 07:09:43,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2022-04-15 07:09:43,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:09:43,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 42 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 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 07:09:43,541 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 42 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 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 07:09:43,541 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 42 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 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 07:09:43,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:43,542 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-15 07:09:43,542 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-15 07:09:43,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:43,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:43,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 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 55 states. [2022-04-15 07:09:43,542 INFO L87 Difference]: Start difference. First operand has 42 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 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 55 states. [2022-04-15 07:09:43,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:43,543 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-04-15 07:09:43,543 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-04-15 07:09:43,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:43,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:43,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:09:43,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:09:43,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 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 07:09:43,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-04-15 07:09:43,544 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 39 [2022-04-15 07:09:43,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:09:43,544 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-04-15 07:09:43,544 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:43,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 45 transitions. [2022-04-15 07:09:43,606 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 07:09:43,606 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-04-15 07:09:43,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 07:09:43,606 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:09:43,606 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:09:43,606 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 07:09:43,607 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:09:43,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:09:43,607 INFO L85 PathProgramCache]: Analyzing trace with hash -113641229, now seen corresponding path program 11 times [2022-04-15 07:09:43,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:43,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1471272095] [2022-04-15 07:09:43,846 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:43,949 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:44,053 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:44,159 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:44,259 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:44,370 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:44,488 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:44,488 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:09:44,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1740666627, now seen corresponding path program 1 times [2022-04-15 07:09:44,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:09:44,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566992005] [2022-04-15 07:09:44,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:09:44,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:09:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:44,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:09:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:44,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {4117#(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); {4111#true} is VALID [2022-04-15 07:09:44,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {4111#true} assume true; {4111#true} is VALID [2022-04-15 07:09:44,511 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4111#true} {4111#true} #68#return; {4111#true} is VALID [2022-04-15 07:09:44,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {4111#true} call ULTIMATE.init(); {4117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:09:44,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {4117#(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); {4111#true} is VALID [2022-04-15 07:09:44,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {4111#true} assume true; {4111#true} is VALID [2022-04-15 07:09:44,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4111#true} {4111#true} #68#return; {4111#true} is VALID [2022-04-15 07:09:44,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {4111#true} call #t~ret8 := main(); {4111#true} is VALID [2022-04-15 07:09:44,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {4111#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {4116#(= main_~a~0 0)} is VALID [2022-04-15 07:09:44,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {4116#(= main_~a~0 0)} [98] L22-3-->L22-4_primed: Formula: (and (= |v_main_#t~pre7_471| |v_main_#t~pre7_461|) (= |v_main_#t~pre6_182| |v_main_#t~pre6_180|) (= v_main_~b~0_124 v_main_~b~0_122) (= v_main_~a~0_88 v_main_~a~0_87) (= |v_main_#t~pre4_69| |v_main_#t~pre4_68|) (= v_main_~d~0_646 v_main_~d~0_634) (= |v_main_#t~pre5_87| |v_main_#t~pre5_86|) (= v_main_~c~0_254 v_main_~c~0_251)) InVars {main_#t~pre7=|v_main_#t~pre7_471|, main_~c~0=v_main_~c~0_254, main_~d~0=v_main_~d~0_646, main_~b~0=v_main_~b~0_124, main_#t~pre4=|v_main_#t~pre4_69|, main_#t~pre5=|v_main_#t~pre5_87|, main_~a~0=v_main_~a~0_88, main_#t~pre6=|v_main_#t~pre6_182|} OutVars{main_#t~pre7=|v_main_#t~pre7_461|, main_~c~0=v_main_~c~0_251, main_~d~0=v_main_~d~0_634, main_~b~0=v_main_~b~0_122, main_#t~pre4=|v_main_#t~pre4_68|, main_#t~pre5=|v_main_#t~pre5_86|, main_~a~0=v_main_~a~0_87, main_#t~pre6=|v_main_#t~pre6_180|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {4116#(= main_~a~0 0)} is VALID [2022-04-15 07:09:44,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {4116#(= main_~a~0 0)} [97] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {4112#false} is VALID [2022-04-15 07:09:44,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {4112#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {4112#false} is VALID [2022-04-15 07:09:44,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {4112#false} assume !false; {4112#false} is VALID [2022-04-15 07:09:44,514 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 07:09:44,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:09:44,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566992005] [2022-04-15 07:09:44,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566992005] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:44,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:44,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:09:44,789 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:09:44,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1471272095] [2022-04-15 07:09:44,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1471272095] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:44,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:44,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 07:09:44,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751874213] [2022-04-15 07:09:44,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:09:44,789 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 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 41 [2022-04-15 07:09:44,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:09:44,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 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 07:09:44,815 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 07:09:44,815 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 07:09:44,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:44,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 07:09:44,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2022-04-15 07:09:44,815 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 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 07:09:45,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:45,472 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2022-04-15 07:09:45,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 07:09:45,473 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 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 41 [2022-04-15 07:09:45,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:09:45,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 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 07:09:45,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 80 transitions. [2022-04-15 07:09:45,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 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 07:09:45,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 80 transitions. [2022-04-15 07:09:45,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 80 transitions. [2022-04-15 07:09:45,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:45,532 INFO L225 Difference]: With dead ends: 68 [2022-04-15 07:09:45,532 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 07:09:45,532 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=983, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 07:09:45,533 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 76 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:09:45,533 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 28 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 07:09:45,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 07:09:45,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2022-04-15 07:09:45,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:09:45,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 44 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 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 07:09:45,542 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 44 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 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 07:09:45,542 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 44 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 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 07:09:45,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:45,542 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2022-04-15 07:09:45,542 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2022-04-15 07:09:45,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:45,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:45,543 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 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 57 states. [2022-04-15 07:09:45,543 INFO L87 Difference]: Start difference. First operand has 44 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 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 57 states. [2022-04-15 07:09:45,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:45,543 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2022-04-15 07:09:45,544 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2022-04-15 07:09:45,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:45,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:45,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:09:45,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:09:45,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 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 07:09:45,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-04-15 07:09:45,544 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 41 [2022-04-15 07:09:45,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:09:45,545 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-04-15 07:09:45,545 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 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 07:09:45,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 47 transitions. [2022-04-15 07:09:45,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:45,601 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-04-15 07:09:45,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 07:09:45,602 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:09:45,602 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:09:45,602 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 07:09:45,602 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:09:45,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:09:45,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1901216239, now seen corresponding path program 12 times [2022-04-15 07:09:45,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:45,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [8771823] [2022-04-15 07:09:45,841 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:49,927 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:49,977 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:50,085 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:52,222 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:52,328 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:55,135 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:55,185 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:55,310 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:55,311 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:09:55,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1740728131, now seen corresponding path program 1 times [2022-04-15 07:09:55,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:09:55,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205683] [2022-04-15 07:09:55,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:09:55,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:09:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:55,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:09:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:55,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {4511#(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); {4505#true} is VALID [2022-04-15 07:09:55,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {4505#true} assume true; {4505#true} is VALID [2022-04-15 07:09:55,343 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4505#true} {4505#true} #68#return; {4505#true} is VALID [2022-04-15 07:09:55,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {4505#true} call ULTIMATE.init(); {4511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:09:55,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {4511#(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); {4505#true} is VALID [2022-04-15 07:09:55,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {4505#true} assume true; {4505#true} is VALID [2022-04-15 07:09:55,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4505#true} {4505#true} #68#return; {4505#true} is VALID [2022-04-15 07:09:55,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {4505#true} call #t~ret8 := main(); {4505#true} is VALID [2022-04-15 07:09:55,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {4505#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {4510#(= main_~a~0 0)} is VALID [2022-04-15 07:09:55,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {4510#(= main_~a~0 0)} [100] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_94 v_main_~a~0_93)) (.cse1 (= |v_main_#t~pre5_93| |v_main_#t~pre5_92|)) (.cse2 (= |v_main_#t~pre4_74| |v_main_#t~pre4_73|)) (.cse3 (= v_main_~b~0_132 v_main_~b~0_130)) (.cse4 (= v_main_~c~0_288 v_main_~c~0_285)) (.cse5 (= |v_main_#t~pre6_209| |v_main_#t~pre6_207|))) (or (and .cse0 .cse1 (= v_main_~d~0_739 v_main_~d~0_726) .cse2 .cse3 (= |v_main_#t~pre7_541| |v_main_#t~pre7_530|) .cse4 .cse5) (and (= |v_main_#t~pre7_530| |v_main_#t~pre7_541|) .cse0 .cse1 (= v_main_~d~0_726 v_main_~d~0_739) .cse2 .cse3 .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_541|, main_~c~0=v_main_~c~0_288, main_~d~0=v_main_~d~0_739, main_~b~0=v_main_~b~0_132, main_#t~pre4=|v_main_#t~pre4_74|, main_#t~pre5=|v_main_#t~pre5_93|, main_~a~0=v_main_~a~0_94, main_#t~pre6=|v_main_#t~pre6_209|} OutVars{main_#t~pre7=|v_main_#t~pre7_530|, main_~c~0=v_main_~c~0_285, main_~d~0=v_main_~d~0_726, main_~b~0=v_main_~b~0_130, main_#t~pre4=|v_main_#t~pre4_73|, main_#t~pre5=|v_main_#t~pre5_92|, main_~a~0=v_main_~a~0_93, main_#t~pre6=|v_main_#t~pre6_207|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {4510#(= main_~a~0 0)} is VALID [2022-04-15 07:09:55,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {4510#(= main_~a~0 0)} [99] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {4506#false} is VALID [2022-04-15 07:09:55,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {4506#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {4506#false} is VALID [2022-04-15 07:09:55,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {4506#false} assume !false; {4506#false} is VALID [2022-04-15 07:09:55,346 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 07:09:55,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:09:55,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205683] [2022-04-15 07:09:55,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205683] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:55,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:55,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:09:55,670 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:09:55,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [8771823] [2022-04-15 07:09:55,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [8771823] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:55,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:55,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 07:09:55,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091799279] [2022-04-15 07:09:55,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:09:55,670 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 07:09:55,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:09:55,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 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 07:09:55,698 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 07:09:55,698 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 07:09:55,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:55,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 07:09:55,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-04-15 07:09:55,699 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 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 07:09:56,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:56,592 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2022-04-15 07:09:56,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 07:09:56,592 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 07:09:56,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:09:56,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 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 07:09:56,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 85 transitions. [2022-04-15 07:09:56,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 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 07:09:56,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 85 transitions. [2022-04-15 07:09:56,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 85 transitions. [2022-04-15 07:09:56,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:56,651 INFO L225 Difference]: With dead ends: 72 [2022-04-15 07:09:56,651 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 07:09:56,651 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=219, Invalid=1113, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 07:09:56,652 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 110 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:09:56,652 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 18 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 07:09:56,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 07:09:56,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 48. [2022-04-15 07:09:56,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:09:56,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 48 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 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 07:09:56,666 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 48 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 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 07:09:56,666 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 48 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 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 07:09:56,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:56,667 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2022-04-15 07:09:56,667 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2022-04-15 07:09:56,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:56,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:56,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 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 61 states. [2022-04-15 07:09:56,667 INFO L87 Difference]: Start difference. First operand has 48 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 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 61 states. [2022-04-15 07:09:56,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:56,668 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2022-04-15 07:09:56,668 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2022-04-15 07:09:56,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:56,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:56,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:09:56,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:09:56,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 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 07:09:56,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2022-04-15 07:09:56,669 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 43 [2022-04-15 07:09:56,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:09:56,669 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2022-04-15 07:09:56,669 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 19 states have internal predecessors, (40), 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 07:09:56,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 51 transitions. [2022-04-15 07:09:56,738 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 07:09:56,739 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2022-04-15 07:09:56,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 07:09:56,739 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:09:56,739 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:09:56,739 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 07:09:56,739 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:09:56,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:09:56,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1773882449, now seen corresponding path program 13 times [2022-04-15 07:09:56,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:56,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1025709709] [2022-04-15 07:09:56,951 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:59,393 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:59,437 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:59,548 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:03,626 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:03,668 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:03,770 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:05,971 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:06,081 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:06,081 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:10:06,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1740789635, now seen corresponding path program 1 times [2022-04-15 07:10:06,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:10:06,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072510485] [2022-04-15 07:10:06,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:10:06,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:10:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:06,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:10:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:06,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {4932#(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); {4926#true} is VALID [2022-04-15 07:10:06,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {4926#true} assume true; {4926#true} is VALID [2022-04-15 07:10:06,114 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4926#true} {4926#true} #68#return; {4926#true} is VALID [2022-04-15 07:10:06,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {4926#true} call ULTIMATE.init(); {4932#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:10:06,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {4932#(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); {4926#true} is VALID [2022-04-15 07:10:06,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {4926#true} assume true; {4926#true} is VALID [2022-04-15 07:10:06,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4926#true} {4926#true} #68#return; {4926#true} is VALID [2022-04-15 07:10:06,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {4926#true} call #t~ret8 := main(); {4926#true} is VALID [2022-04-15 07:10:06,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {4926#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {4931#(= main_~a~0 0)} is VALID [2022-04-15 07:10:06,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {4931#(= main_~a~0 0)} [102] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre7_608| |v_main_#t~pre7_596|)) (.cse1 (= v_main_~c~0_320 v_main_~c~0_317)) (.cse2 (= v_main_~d~0_829 v_main_~d~0_815)) (.cse3 (= v_main_~a~0_100 v_main_~a~0_99)) (.cse4 (= v_main_~b~0_140 v_main_~b~0_138)) (.cse5 (= |v_main_#t~pre5_99| |v_main_#t~pre5_98|)) (.cse6 (= |v_main_#t~pre6_235| |v_main_#t~pre6_233|))) (or (and .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~pre4_79| |v_main_#t~pre4_78|) .cse4 .cse5 .cse6) (and .cse0 .cse1 (= |v_main_#t~pre4_78| |v_main_#t~pre4_79|) .cse2 .cse3 .cse4 .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_608|, main_~c~0=v_main_~c~0_320, main_~d~0=v_main_~d~0_829, main_~b~0=v_main_~b~0_140, main_#t~pre4=|v_main_#t~pre4_79|, main_#t~pre5=|v_main_#t~pre5_99|, main_~a~0=v_main_~a~0_100, main_#t~pre6=|v_main_#t~pre6_235|} OutVars{main_#t~pre7=|v_main_#t~pre7_596|, main_~c~0=v_main_~c~0_317, main_~d~0=v_main_~d~0_815, main_~b~0=v_main_~b~0_138, main_#t~pre4=|v_main_#t~pre4_78|, main_#t~pre5=|v_main_#t~pre5_98|, main_~a~0=v_main_~a~0_99, main_#t~pre6=|v_main_#t~pre6_233|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {4931#(= main_~a~0 0)} is VALID [2022-04-15 07:10:06,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {4931#(= main_~a~0 0)} [101] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {4927#false} is VALID [2022-04-15 07:10:06,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {4927#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {4927#false} is VALID [2022-04-15 07:10:06,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {4927#false} assume !false; {4927#false} is VALID [2022-04-15 07:10:06,116 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 07:10:06,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:10:06,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072510485] [2022-04-15 07:10:06,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072510485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:06,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:06,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:10:06,482 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:10:06,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1025709709] [2022-04-15 07:10:06,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1025709709] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:06,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:06,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 07:10:06,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165108837] [2022-04-15 07:10:06,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:10:06,483 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 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 45 [2022-04-15 07:10:06,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:10:06,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 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 07:10:06,513 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 07:10:06,513 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 07:10:06,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:06,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 07:10:06,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2022-04-15 07:10:06,514 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 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 07:10:07,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:07,508 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-04-15 07:10:07,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 07:10:07,508 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 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 45 [2022-04-15 07:10:07,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:10:07,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 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 07:10:07,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 85 transitions. [2022-04-15 07:10:07,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 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 07:10:07,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 85 transitions. [2022-04-15 07:10:07,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 85 transitions. [2022-04-15 07:10:07,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:07,604 INFO L225 Difference]: With dead ends: 73 [2022-04-15 07:10:07,604 INFO L226 Difference]: Without dead ends: 62 [2022-04-15 07:10:07,605 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 18 SyntacticMatches, 9 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=1251, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 07:10:07,605 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 93 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:10:07,605 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 53 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 07:10:07,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-15 07:10:07,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2022-04-15 07:10:07,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:10:07,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 50 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 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 07:10:07,616 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 50 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 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 07:10:07,617 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 50 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 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 07:10:07,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:07,617 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2022-04-15 07:10:07,617 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2022-04-15 07:10:07,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:07,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:07,619 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 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 62 states. [2022-04-15 07:10:07,619 INFO L87 Difference]: Start difference. First operand has 50 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 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 62 states. [2022-04-15 07:10:07,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:07,620 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2022-04-15 07:10:07,620 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2022-04-15 07:10:07,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:07,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:07,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:10:07,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:10:07,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 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 07:10:07,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-04-15 07:10:07,626 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 45 [2022-04-15 07:10:07,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:10:07,626 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-04-15 07:10:07,627 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 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 07:10:07,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 53 transitions. [2022-04-15 07:10:07,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:07,694 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-04-15 07:10:07,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 07:10:07,695 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:10:07,695 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:10:07,695 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 07:10:07,695 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:10:07,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:10:07,695 INFO L85 PathProgramCache]: Analyzing trace with hash -584953410, now seen corresponding path program 14 times [2022-04-15 07:10:07,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:07,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [763921582] [2022-04-15 07:10:07,911 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:11,164 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:11,206 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:11,317 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:15,406 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:15,449 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:15,538 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:19,613 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:19,655 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:19,759 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:19,759 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:10:19,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1740851139, now seen corresponding path program 1 times [2022-04-15 07:10:19,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:10:19,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504617403] [2022-04-15 07:10:19,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:10:19,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:10:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:19,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:10:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:19,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {5364#(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); {5358#true} is VALID [2022-04-15 07:10:19,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {5358#true} assume true; {5358#true} is VALID [2022-04-15 07:10:19,798 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5358#true} {5358#true} #68#return; {5358#true} is VALID [2022-04-15 07:10:19,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {5358#true} call ULTIMATE.init(); {5364#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:10:19,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {5364#(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); {5358#true} is VALID [2022-04-15 07:10:19,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {5358#true} assume true; {5358#true} is VALID [2022-04-15 07:10:19,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5358#true} {5358#true} #68#return; {5358#true} is VALID [2022-04-15 07:10:19,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {5358#true} call #t~ret8 := main(); {5358#true} is VALID [2022-04-15 07:10:19,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {5358#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {5363#(= main_~a~0 0)} is VALID [2022-04-15 07:10:19,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {5363#(= main_~a~0 0)} [104] L22-3-->L22-4_primed: Formula: (and (= v_main_~c~0_357 v_main_~c~0_353) (= v_main_~d~0_923 v_main_~d~0_908) (= |v_main_#t~pre7_675| |v_main_#t~pre7_663|) (= v_main_~a~0_106 v_main_~a~0_105) (= |v_main_#t~pre5_105| |v_main_#t~pre5_104|) (= |v_main_#t~pre4_84| |v_main_#t~pre4_83|) (= v_main_~b~0_148 v_main_~b~0_146) (= |v_main_#t~pre6_264| |v_main_#t~pre6_261|)) InVars {main_#t~pre7=|v_main_#t~pre7_675|, main_~c~0=v_main_~c~0_357, main_~d~0=v_main_~d~0_923, main_~b~0=v_main_~b~0_148, main_#t~pre4=|v_main_#t~pre4_84|, main_#t~pre5=|v_main_#t~pre5_105|, main_~a~0=v_main_~a~0_106, main_#t~pre6=|v_main_#t~pre6_264|} OutVars{main_#t~pre7=|v_main_#t~pre7_663|, main_~c~0=v_main_~c~0_353, main_~d~0=v_main_~d~0_908, main_~b~0=v_main_~b~0_146, main_#t~pre4=|v_main_#t~pre4_83|, main_#t~pre5=|v_main_#t~pre5_104|, main_~a~0=v_main_~a~0_105, main_#t~pre6=|v_main_#t~pre6_261|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {5363#(= main_~a~0 0)} is VALID [2022-04-15 07:10:19,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {5363#(= main_~a~0 0)} [103] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {5359#false} is VALID [2022-04-15 07:10:19,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {5359#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {5359#false} is VALID [2022-04-15 07:10:19,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {5359#false} assume !false; {5359#false} is VALID [2022-04-15 07:10:19,801 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 07:10:19,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:10:19,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504617403] [2022-04-15 07:10:19,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504617403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:19,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:19,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:10:20,162 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:10:20,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [763921582] [2022-04-15 07:10:20,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [763921582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:20,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:20,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 07:10:20,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978226367] [2022-04-15 07:10:20,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:10:20,163 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 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 48 [2022-04-15 07:10:20,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:10:20,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 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 07:10:20,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:20,195 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 07:10:20,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:20,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 07:10:20,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-04-15 07:10:20,196 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 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 07:10:21,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:21,357 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2022-04-15 07:10:21,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 07:10:21,357 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 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 48 [2022-04-15 07:10:21,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:10:21,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 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 07:10:21,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 87 transitions. [2022-04-15 07:10:21,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 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 07:10:21,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 87 transitions. [2022-04-15 07:10:21,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 87 transitions. [2022-04-15 07:10:21,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:21,437 INFO L225 Difference]: With dead ends: 75 [2022-04-15 07:10:21,437 INFO L226 Difference]: Without dead ends: 64 [2022-04-15 07:10:21,437 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 22 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=1397, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 07:10:21,438 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 90 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:10:21,438 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 68 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 07:10:21,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-15 07:10:21,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 51. [2022-04-15 07:10:21,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:10:21,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 51 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 47 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 07:10:21,451 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 51 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 47 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 07:10:21,451 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 51 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 47 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 07:10:21,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:21,452 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2022-04-15 07:10:21,452 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-04-15 07:10:21,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:21,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:21,452 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 47 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 64 states. [2022-04-15 07:10:21,452 INFO L87 Difference]: Start difference. First operand has 51 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 47 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 64 states. [2022-04-15 07:10:21,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:21,453 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2022-04-15 07:10:21,453 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-04-15 07:10:21,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:21,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:21,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:10:21,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:10:21,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 47 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 07:10:21,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2022-04-15 07:10:21,454 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 48 [2022-04-15 07:10:21,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:10:21,454 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2022-04-15 07:10:21,454 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 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 07:10:21,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 54 transitions. [2022-04-15 07:10:21,531 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 07:10:21,531 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-04-15 07:10:21,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 07:10:21,531 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:10:21,532 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:10:21,532 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 07:10:21,532 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:10:21,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:10:21,532 INFO L85 PathProgramCache]: Analyzing trace with hash 434311196, now seen corresponding path program 15 times [2022-04-15 07:10:21,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:21,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [414876558] [2022-04-15 07:10:21,761 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:23,927 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:28,009 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:28,074 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:28,172 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:28,279 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:32,377 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:32,434 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:32,556 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:32,557 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:10:32,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1740912643, now seen corresponding path program 1 times [2022-04-15 07:10:32,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:10:32,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579475935] [2022-04-15 07:10:32,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:10:32,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:10:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:32,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:10:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:32,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {5809#(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); {5803#true} is VALID [2022-04-15 07:10:32,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {5803#true} assume true; {5803#true} is VALID [2022-04-15 07:10:32,585 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5803#true} {5803#true} #68#return; {5803#true} is VALID [2022-04-15 07:10:32,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {5803#true} call ULTIMATE.init(); {5809#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:10:32,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {5809#(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); {5803#true} is VALID [2022-04-15 07:10:32,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {5803#true} assume true; {5803#true} is VALID [2022-04-15 07:10:32,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5803#true} {5803#true} #68#return; {5803#true} is VALID [2022-04-15 07:10:32,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {5803#true} call #t~ret8 := main(); {5803#true} is VALID [2022-04-15 07:10:32,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {5803#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {5808#(= main_~a~0 0)} is VALID [2022-04-15 07:10:32,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {5808#(= main_~a~0 0)} [106] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_112 v_main_~a~0_111)) (.cse1 (= v_main_~b~0_156 v_main_~b~0_154)) (.cse2 (= v_main_~d~0_1021 v_main_~d~0_1005)) (.cse3 (= |v_main_#t~pre5_111| |v_main_#t~pre5_110|)) (.cse4 (= |v_main_#t~pre4_89| |v_main_#t~pre4_88|))) (or (and .cse0 (= |v_main_#t~pre7_740| |v_main_#t~pre7_727|) (= |v_main_#t~pre6_293| |v_main_#t~pre6_290|) .cse1 .cse2 .cse3 .cse4 (= v_main_~c~0_394 v_main_~c~0_390)) (and (= |v_main_#t~pre6_290| |v_main_#t~pre6_293|) (= |v_main_#t~pre7_727| |v_main_#t~pre7_740|) .cse0 .cse1 (= v_main_~c~0_390 v_main_~c~0_394) .cse2 .cse3 .cse4))) InVars {main_#t~pre7=|v_main_#t~pre7_740|, main_~c~0=v_main_~c~0_394, main_~d~0=v_main_~d~0_1021, main_~b~0=v_main_~b~0_156, main_#t~pre4=|v_main_#t~pre4_89|, main_#t~pre5=|v_main_#t~pre5_111|, main_~a~0=v_main_~a~0_112, main_#t~pre6=|v_main_#t~pre6_293|} OutVars{main_#t~pre7=|v_main_#t~pre7_727|, main_~c~0=v_main_~c~0_390, main_~d~0=v_main_~d~0_1005, main_~b~0=v_main_~b~0_154, main_#t~pre4=|v_main_#t~pre4_88|, main_#t~pre5=|v_main_#t~pre5_110|, main_~a~0=v_main_~a~0_111, main_#t~pre6=|v_main_#t~pre6_290|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {5808#(= main_~a~0 0)} is VALID [2022-04-15 07:10:32,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {5808#(= main_~a~0 0)} [105] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {5804#false} is VALID [2022-04-15 07:10:32,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {5804#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {5804#false} is VALID [2022-04-15 07:10:32,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {5804#false} assume !false; {5804#false} is VALID [2022-04-15 07:10:32,587 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 07:10:32,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:10:32,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579475935] [2022-04-15 07:10:32,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579475935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:32,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:32,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:10:32,969 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:10:32,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [414876558] [2022-04-15 07:10:32,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [414876558] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:32,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:32,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 07:10:32,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242461539] [2022-04-15 07:10:32,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:10:32,970 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 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 50 [2022-04-15 07:10:32,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:10:32,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 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 07:10:33,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:33,002 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 07:10:33,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:33,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 07:10:33,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2022-04-15 07:10:33,003 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 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 07:10:34,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:34,193 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2022-04-15 07:10:34,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 07:10:34,193 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 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 50 [2022-04-15 07:10:34,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:10:34,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 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 07:10:34,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 89 transitions. [2022-04-15 07:10:34,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 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 07:10:34,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 89 transitions. [2022-04-15 07:10:34,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 89 transitions. [2022-04-15 07:10:34,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:34,270 INFO L225 Difference]: With dead ends: 77 [2022-04-15 07:10:34,270 INFO L226 Difference]: Without dead ends: 66 [2022-04-15 07:10:34,270 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 8 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=255, Invalid=1551, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 07:10:34,271 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 115 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:10:34,271 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 53 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 07:10:34,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-15 07:10:34,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 53. [2022-04-15 07:10:34,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:10:34,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 53 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 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 07:10:34,292 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 53 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 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 07:10:34,293 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 53 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 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 07:10:34,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:34,293 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2022-04-15 07:10:34,293 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2022-04-15 07:10:34,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:34,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:34,294 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 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 66 states. [2022-04-15 07:10:34,294 INFO L87 Difference]: Start difference. First operand has 53 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 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 66 states. [2022-04-15 07:10:34,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:34,294 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2022-04-15 07:10:34,295 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2022-04-15 07:10:34,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:34,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:34,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:10:34,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:10:34,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 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 07:10:34,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2022-04-15 07:10:34,296 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 50 [2022-04-15 07:10:34,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:10:34,296 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2022-04-15 07:10:34,296 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 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 07:10:34,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 56 transitions. [2022-04-15 07:10:34,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:34,367 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-04-15 07:10:34,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-15 07:10:34,367 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:10:34,367 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:10:34,367 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 07:10:34,368 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:10:34,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:10:34,368 INFO L85 PathProgramCache]: Analyzing trace with hash 695054074, now seen corresponding path program 16 times [2022-04-15 07:10:34,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:34,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1259515264] [2022-04-15 07:10:34,592 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:38,675 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:38,746 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:38,859 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:42,948 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:42,992 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:43,086 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:45,227 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:45,268 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:45,387 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:45,388 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:10:45,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1740974147, now seen corresponding path program 1 times [2022-04-15 07:10:45,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:10:45,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628241658] [2022-04-15 07:10:45,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:10:45,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:10:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:45,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:10:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:45,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {6269#(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); {6263#true} is VALID [2022-04-15 07:10:45,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {6263#true} assume true; {6263#true} is VALID [2022-04-15 07:10:45,428 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6263#true} {6263#true} #68#return; {6263#true} is VALID [2022-04-15 07:10:45,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {6263#true} call ULTIMATE.init(); {6269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:10:45,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {6269#(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); {6263#true} is VALID [2022-04-15 07:10:45,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {6263#true} assume true; {6263#true} is VALID [2022-04-15 07:10:45,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6263#true} {6263#true} #68#return; {6263#true} is VALID [2022-04-15 07:10:45,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {6263#true} call #t~ret8 := main(); {6263#true} is VALID [2022-04-15 07:10:45,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {6263#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {6268#(= main_~a~0 0)} is VALID [2022-04-15 07:10:45,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {6268#(= main_~a~0 0)} [108] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre7_813| |v_main_#t~pre7_799|)) (.cse1 (= v_main_~a~0_118 v_main_~a~0_117)) (.cse2 (= |v_main_#t~pre5_117| |v_main_#t~pre5_116|)) (.cse3 (= |v_main_#t~pre4_94| |v_main_#t~pre4_93|)) (.cse4 (= v_main_~d~0_1123 v_main_~d~0_1106)) (.cse5 (= v_main_~b~0_164 v_main_~b~0_162))) (or (and (= v_main_~c~0_427 v_main_~c~0_431) .cse0 .cse1 .cse2 (= |v_main_#t~pre6_319| |v_main_#t~pre6_322|) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (= v_main_~c~0_431 v_main_~c~0_427) .cse3 (= |v_main_#t~pre6_322| |v_main_#t~pre6_319|) .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_813|, main_~c~0=v_main_~c~0_431, main_~d~0=v_main_~d~0_1123, main_~b~0=v_main_~b~0_164, main_#t~pre4=|v_main_#t~pre4_94|, main_#t~pre5=|v_main_#t~pre5_117|, main_~a~0=v_main_~a~0_118, main_#t~pre6=|v_main_#t~pre6_322|} OutVars{main_#t~pre7=|v_main_#t~pre7_799|, main_~c~0=v_main_~c~0_427, main_~d~0=v_main_~d~0_1106, main_~b~0=v_main_~b~0_162, main_#t~pre4=|v_main_#t~pre4_93|, main_#t~pre5=|v_main_#t~pre5_116|, main_~a~0=v_main_~a~0_117, main_#t~pre6=|v_main_#t~pre6_319|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {6268#(= main_~a~0 0)} is VALID [2022-04-15 07:10:45,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {6268#(= main_~a~0 0)} [107] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {6264#false} is VALID [2022-04-15 07:10:45,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {6264#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {6264#false} is VALID [2022-04-15 07:10:45,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {6264#false} assume !false; {6264#false} is VALID [2022-04-15 07:10:45,430 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 07:10:45,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:10:45,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628241658] [2022-04-15 07:10:45,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628241658] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:45,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:45,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:10:45,818 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:10:45,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1259515264] [2022-04-15 07:10:45,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1259515264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:45,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:45,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 07:10:45,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997787111] [2022-04-15 07:10:45,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:10:45,819 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 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 52 [2022-04-15 07:10:45,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:10:45,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 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 07:10:45,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:45,855 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 07:10:45,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:45,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 07:10:45,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2022-04-15 07:10:45,855 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 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 07:10:47,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:47,063 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2022-04-15 07:10:47,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 07:10:47,063 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 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 52 [2022-04-15 07:10:47,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:10:47,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 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 07:10:47,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 91 transitions. [2022-04-15 07:10:47,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 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 07:10:47,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 91 transitions. [2022-04-15 07:10:47,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 91 transitions. [2022-04-15 07:10:47,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:47,127 INFO L225 Difference]: With dead ends: 79 [2022-04-15 07:10:47,127 INFO L226 Difference]: Without dead ends: 68 [2022-04-15 07:10:47,128 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=267, Invalid=1713, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 07:10:47,128 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 85 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:10:47,128 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 63 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 07:10:47,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-15 07:10:47,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 55. [2022-04-15 07:10:47,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:10:47,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 55 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:10:47,141 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 55 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:10:47,141 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 55 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:10:47,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:47,142 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-04-15 07:10:47,142 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-04-15 07:10:47,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:47,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:47,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-15 07:10:47,142 INFO L87 Difference]: Start difference. First operand has 55 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-15 07:10:47,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:47,143 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-04-15 07:10:47,143 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-04-15 07:10:47,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:47,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:47,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:10:47,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:10:47,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:10:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2022-04-15 07:10:47,144 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 52 [2022-04-15 07:10:47,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:10:47,144 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2022-04-15 07:10:47,144 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 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 07:10:47,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 58 transitions. [2022-04-15 07:10:47,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:47,227 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2022-04-15 07:10:47,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 07:10:47,227 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:10:47,227 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:10:47,227 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 07:10:47,227 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:10:47,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:10:47,228 INFO L85 PathProgramCache]: Analyzing trace with hash -2134110632, now seen corresponding path program 17 times [2022-04-15 07:10:47,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:47,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [731478312] [2022-04-15 07:10:47,472 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:47,605 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:47,698 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:47,826 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:47,922 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:48,042 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:48,153 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:48,153 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:10:48,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1741035651, now seen corresponding path program 1 times [2022-04-15 07:10:48,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:10:48,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424232857] [2022-04-15 07:10:48,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:10:48,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:10:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:48,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:10:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:48,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {6744#(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); {6738#true} is VALID [2022-04-15 07:10:48,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {6738#true} assume true; {6738#true} is VALID [2022-04-15 07:10:48,188 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6738#true} {6738#true} #68#return; {6738#true} is VALID [2022-04-15 07:10:48,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {6738#true} call ULTIMATE.init(); {6744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:10:48,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {6744#(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); {6738#true} is VALID [2022-04-15 07:10:48,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {6738#true} assume true; {6738#true} is VALID [2022-04-15 07:10:48,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6738#true} {6738#true} #68#return; {6738#true} is VALID [2022-04-15 07:10:48,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {6738#true} call #t~ret8 := main(); {6738#true} is VALID [2022-04-15 07:10:48,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {6738#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {6743#(= main_~a~0 0)} is VALID [2022-04-15 07:10:48,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {6743#(= main_~a~0 0)} [110] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_124 v_main_~a~0_123)) (.cse1 (= |v_main_#t~pre5_123| |v_main_#t~pre5_122|)) (.cse2 (= |v_main_#t~pre6_351| |v_main_#t~pre6_348|)) (.cse3 (= |v_main_#t~pre4_99| |v_main_#t~pre4_98|)) (.cse4 (= v_main_~d~0_1229 v_main_~d~0_1211)) (.cse5 (= v_main_~c~0_468 v_main_~c~0_464))) (or (and .cse0 (= |v_main_#t~pre7_874| |v_main_#t~pre7_889|) .cse1 .cse2 .cse3 .cse4 .cse5 (= v_main_~b~0_170 v_main_~b~0_172)) (and .cse0 (= v_main_~b~0_172 v_main_~b~0_170) (= |v_main_#t~pre7_889| |v_main_#t~pre7_874|) .cse1 .cse2 .cse3 .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_889|, main_~c~0=v_main_~c~0_468, main_~d~0=v_main_~d~0_1229, main_~b~0=v_main_~b~0_172, main_#t~pre4=|v_main_#t~pre4_99|, main_#t~pre5=|v_main_#t~pre5_123|, main_~a~0=v_main_~a~0_124, main_#t~pre6=|v_main_#t~pre6_351|} OutVars{main_#t~pre7=|v_main_#t~pre7_874|, main_~c~0=v_main_~c~0_464, main_~d~0=v_main_~d~0_1211, main_~b~0=v_main_~b~0_170, main_#t~pre4=|v_main_#t~pre4_98|, main_#t~pre5=|v_main_#t~pre5_122|, main_~a~0=v_main_~a~0_123, main_#t~pre6=|v_main_#t~pre6_348|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {6743#(= main_~a~0 0)} is VALID [2022-04-15 07:10:48,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {6743#(= main_~a~0 0)} [109] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {6739#false} is VALID [2022-04-15 07:10:48,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {6739#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {6739#false} is VALID [2022-04-15 07:10:48,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {6739#false} assume !false; {6739#false} is VALID [2022-04-15 07:10:48,190 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 07:10:48,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:10:48,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424232857] [2022-04-15 07:10:48,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424232857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:48,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:48,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:10:48,699 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:10:48,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [731478312] [2022-04-15 07:10:48,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [731478312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:48,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:48,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 07:10:48,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607764264] [2022-04-15 07:10:48,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:10:48,700 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 24 states have internal predecessors, (51), 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 54 [2022-04-15 07:10:48,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:10:48,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.04) internal successors, (51), 24 states have internal predecessors, (51), 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 07:10:48,738 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 07:10:48,739 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 07:10:48,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:48,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 07:10:48,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2022-04-15 07:10:48,739 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 24 states have internal predecessors, (51), 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 07:10:50,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:50,068 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2022-04-15 07:10:50,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 07:10:50,069 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 24 states have internal predecessors, (51), 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 54 [2022-04-15 07:10:50,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:10:50,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 24 states have internal predecessors, (51), 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 07:10:50,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 93 transitions. [2022-04-15 07:10:50,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 24 states have internal predecessors, (51), 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 07:10:50,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 93 transitions. [2022-04-15 07:10:50,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 93 transitions. [2022-04-15 07:10:50,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:50,154 INFO L225 Difference]: With dead ends: 81 [2022-04-15 07:10:50,154 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 07:10:50,155 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 24 SyntacticMatches, 8 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=279, Invalid=1883, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 07:10:50,155 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 112 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:10:50,155 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 43 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 07:10:50,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 07:10:50,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 57. [2022-04-15 07:10:50,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:10:50,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 57 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 53 states have internal predecessors, (57), 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 07:10:50,171 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 57 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 53 states have internal predecessors, (57), 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 07:10:50,171 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 57 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 53 states have internal predecessors, (57), 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 07:10:50,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:50,172 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2022-04-15 07:10:50,172 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2022-04-15 07:10:50,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:50,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:50,172 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 53 states have internal predecessors, (57), 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 70 states. [2022-04-15 07:10:50,172 INFO L87 Difference]: Start difference. First operand has 57 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 53 states have internal predecessors, (57), 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 70 states. [2022-04-15 07:10:50,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:50,173 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2022-04-15 07:10:50,173 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2022-04-15 07:10:50,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:50,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:50,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:10:50,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:10:50,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 53 states have internal predecessors, (57), 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 07:10:50,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2022-04-15 07:10:50,174 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 54 [2022-04-15 07:10:50,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:10:50,174 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2022-04-15 07:10:50,175 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 24 states have internal predecessors, (51), 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 07:10:50,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 60 transitions. [2022-04-15 07:10:50,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:50,256 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2022-04-15 07:10:50,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-15 07:10:50,257 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:10:50,257 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:10:50,257 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 07:10:50,257 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:10:50,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:10:50,257 INFO L85 PathProgramCache]: Analyzing trace with hash 2047872566, now seen corresponding path program 18 times [2022-04-15 07:10:50,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:50,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1599373773] [2022-04-15 07:10:50,490 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:52,721 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:52,810 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:56,896 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:56,948 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:57,040 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:59,164 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:59,211 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:59,337 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:59,337 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:10:59,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1741097155, now seen corresponding path program 1 times [2022-04-15 07:10:59,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:10:59,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454390319] [2022-04-15 07:10:59,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:10:59,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:10:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:59,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:10:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:59,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {7234#(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); {7228#true} is VALID [2022-04-15 07:10:59,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {7228#true} assume true; {7228#true} is VALID [2022-04-15 07:10:59,378 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7228#true} {7228#true} #68#return; {7228#true} is VALID [2022-04-15 07:10:59,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {7228#true} call ULTIMATE.init(); {7234#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:10:59,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {7234#(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); {7228#true} is VALID [2022-04-15 07:10:59,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {7228#true} assume true; {7228#true} is VALID [2022-04-15 07:10:59,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7228#true} {7228#true} #68#return; {7228#true} is VALID [2022-04-15 07:10:59,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {7228#true} call #t~ret8 := main(); {7228#true} is VALID [2022-04-15 07:10:59,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {7228#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {7233#(= main_~a~0 0)} is VALID [2022-04-15 07:10:59,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {7233#(= main_~a~0 0)} [112] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_129| |v_main_#t~pre5_128|)) (.cse1 (= |v_main_#t~pre4_104| |v_main_#t~pre4_103|)) (.cse2 (= |v_main_#t~pre7_968| |v_main_#t~pre7_952|)) (.cse3 (= v_main_~c~0_505 v_main_~c~0_501))) (or (and (= |v_main_#t~pre6_377| |v_main_#t~pre6_380|) (= v_main_~b~0_178 v_main_~b~0_180) .cse0 (= v_main_~d~0_1320 v_main_~d~0_1339) (= v_main_~a~0_129 v_main_~a~0_130) .cse1 .cse2 .cse3) (and (= v_main_~d~0_1339 v_main_~d~0_1320) (= v_main_~b~0_180 v_main_~b~0_178) .cse0 .cse1 (= |v_main_#t~pre6_380| |v_main_#t~pre6_377|) .cse2 .cse3 (= v_main_~a~0_130 v_main_~a~0_129)))) InVars {main_#t~pre7=|v_main_#t~pre7_968|, main_~c~0=v_main_~c~0_505, main_~d~0=v_main_~d~0_1339, main_~b~0=v_main_~b~0_180, main_#t~pre4=|v_main_#t~pre4_104|, main_#t~pre5=|v_main_#t~pre5_129|, main_~a~0=v_main_~a~0_130, main_#t~pre6=|v_main_#t~pre6_380|} OutVars{main_#t~pre7=|v_main_#t~pre7_952|, main_~c~0=v_main_~c~0_501, main_~d~0=v_main_~d~0_1320, main_~b~0=v_main_~b~0_178, main_#t~pre4=|v_main_#t~pre4_103|, main_#t~pre5=|v_main_#t~pre5_128|, main_~a~0=v_main_~a~0_129, main_#t~pre6=|v_main_#t~pre6_377|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {7233#(= main_~a~0 0)} is VALID [2022-04-15 07:10:59,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {7233#(= main_~a~0 0)} [111] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {7229#false} is VALID [2022-04-15 07:10:59,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {7229#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {7229#false} is VALID [2022-04-15 07:10:59,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {7229#false} assume !false; {7229#false} is VALID [2022-04-15 07:10:59,381 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 07:10:59,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:10:59,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454390319] [2022-04-15 07:10:59,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454390319] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:59,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:59,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:10:59,870 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:10:59,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1599373773] [2022-04-15 07:10:59,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1599373773] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:59,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:59,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 07:10:59,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118984406] [2022-04-15 07:10:59,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:10:59,870 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 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 56 [2022-04-15 07:10:59,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:10:59,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 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 07:10:59,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:59,910 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 07:10:59,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:59,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 07:10:59,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2022-04-15 07:10:59,911 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 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 07:11:01,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:01,346 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2022-04-15 07:11:01,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 07:11:01,346 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 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 56 [2022-04-15 07:11:01,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:11:01,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 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 07:11:01,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 95 transitions. [2022-04-15 07:11:01,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 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 07:11:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 95 transitions. [2022-04-15 07:11:01,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 95 transitions. [2022-04-15 07:11:01,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:01,420 INFO L225 Difference]: With dead ends: 83 [2022-04-15 07:11:01,420 INFO L226 Difference]: Without dead ends: 72 [2022-04-15 07:11:01,420 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 24 SyntacticMatches, 9 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=291, Invalid=2061, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 07:11:01,421 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 90 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:11:01,421 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 58 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 07:11:01,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-15 07:11:01,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 59. [2022-04-15 07:11:01,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:11:01,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 59 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 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 07:11:01,436 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 59 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 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 07:11:01,436 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 59 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 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 07:11:01,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:01,437 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2022-04-15 07:11:01,437 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2022-04-15 07:11:01,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:01,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:01,437 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-15 07:11:01,437 INFO L87 Difference]: Start difference. First operand has 59 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-15 07:11:01,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:01,438 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2022-04-15 07:11:01,438 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2022-04-15 07:11:01,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:01,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:01,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:11:01,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:11:01,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 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 07:11:01,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2022-04-15 07:11:01,439 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 56 [2022-04-15 07:11:01,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:11:01,439 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2022-04-15 07:11:01,439 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 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 07:11:01,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 62 transitions. [2022-04-15 07:11:01,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:01,531 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2022-04-15 07:11:01,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-15 07:11:01,531 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:11:01,531 INFO L499 BasicCegarLoop]: trace histogram [17, 17, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:11:01,531 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 07:11:01,531 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:11:01,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:11:01,532 INFO L85 PathProgramCache]: Analyzing trace with hash 844336788, now seen corresponding path program 19 times [2022-04-15 07:11:01,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:01,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1603556878] [2022-04-15 07:11:01,739 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:05,815 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:05,861 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:05,965 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:08,045 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:08,085 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:08,173 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:10,842 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:10,882 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:10,998 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:10,998 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:11:10,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1741158659, now seen corresponding path program 1 times [2022-04-15 07:11:10,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:11:10,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683329099] [2022-04-15 07:11:10,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:11:11,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:11:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:11,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:11:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:11,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {7739#(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); {7733#true} is VALID [2022-04-15 07:11:11,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {7733#true} assume true; {7733#true} is VALID [2022-04-15 07:11:11,027 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7733#true} {7733#true} #68#return; {7733#true} is VALID [2022-04-15 07:11:11,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {7733#true} call ULTIMATE.init(); {7739#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:11:11,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {7739#(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); {7733#true} is VALID [2022-04-15 07:11:11,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {7733#true} assume true; {7733#true} is VALID [2022-04-15 07:11:11,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7733#true} {7733#true} #68#return; {7733#true} is VALID [2022-04-15 07:11:11,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {7733#true} call #t~ret8 := main(); {7733#true} is VALID [2022-04-15 07:11:11,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {7733#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {7738#(= main_~a~0 0)} is VALID [2022-04-15 07:11:11,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {7738#(= main_~a~0 0)} [114] L22-3-->L22-4_primed: Formula: (and (= v_main_~d~0_1453 v_main_~d~0_1433) (= v_main_~a~0_136 v_main_~a~0_135) (= |v_main_#t~pre4_109| |v_main_#t~pre4_108|) (= v_main_~c~0_542 v_main_~c~0_538) (= |v_main_#t~pre6_409| |v_main_#t~pre6_406|) (= |v_main_#t~pre5_135| |v_main_#t~pre5_134|) (= |v_main_#t~pre7_1050| |v_main_#t~pre7_1033|) (= v_main_~b~0_188 v_main_~b~0_186)) InVars {main_#t~pre7=|v_main_#t~pre7_1050|, main_~c~0=v_main_~c~0_542, main_~d~0=v_main_~d~0_1453, main_~b~0=v_main_~b~0_188, main_#t~pre4=|v_main_#t~pre4_109|, main_#t~pre5=|v_main_#t~pre5_135|, main_~a~0=v_main_~a~0_136, main_#t~pre6=|v_main_#t~pre6_409|} OutVars{main_#t~pre7=|v_main_#t~pre7_1033|, main_~c~0=v_main_~c~0_538, main_~d~0=v_main_~d~0_1433, main_~b~0=v_main_~b~0_186, main_#t~pre4=|v_main_#t~pre4_108|, main_#t~pre5=|v_main_#t~pre5_134|, main_~a~0=v_main_~a~0_135, main_#t~pre6=|v_main_#t~pre6_406|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {7738#(= main_~a~0 0)} is VALID [2022-04-15 07:11:11,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {7738#(= main_~a~0 0)} [113] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {7734#false} is VALID [2022-04-15 07:11:11,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {7734#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {7734#false} is VALID [2022-04-15 07:11:11,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {7734#false} assume !false; {7734#false} is VALID [2022-04-15 07:11:11,030 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 07:11:11,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:11:11,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683329099] [2022-04-15 07:11:11,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683329099] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:11,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:11,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:11:11,608 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:11:11,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1603556878] [2022-04-15 07:11:11,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1603556878] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:11,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:11,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 07:11:11,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369274018] [2022-04-15 07:11:11,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:11:11,608 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 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 58 [2022-04-15 07:11:11,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:11:11,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 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 07:11:11,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:11,646 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 07:11:11,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:11,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 07:11:11,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2022-04-15 07:11:11,647 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 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 07:11:13,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:13,493 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2022-04-15 07:11:13,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 07:11:13,493 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 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 58 [2022-04-15 07:11:13,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:11:13,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 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 07:11:13,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 100 transitions. [2022-04-15 07:11:13,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 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 07:11:13,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 100 transitions. [2022-04-15 07:11:13,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 100 transitions. [2022-04-15 07:11:13,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:13,594 INFO L225 Difference]: With dead ends: 87 [2022-04-15 07:11:13,594 INFO L226 Difference]: Without dead ends: 76 [2022-04-15 07:11:13,594 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 21 SyntacticMatches, 13 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=303, Invalid=2247, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 07:11:13,595 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 113 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 07:11:13,595 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 88 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 07:11:13,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-15 07:11:13,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 63. [2022-04-15 07:11:13,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:11:13,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 63 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:11:13,612 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 63 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:11:13,612 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 63 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:11:13,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:13,613 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-04-15 07:11:13,613 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2022-04-15 07:11:13,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:13,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:13,613 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-15 07:11:13,614 INFO L87 Difference]: Start difference. First operand has 63 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-15 07:11:13,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:13,614 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-04-15 07:11:13,614 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2022-04-15 07:11:13,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:13,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:13,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:11:13,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:11:13,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:11:13,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2022-04-15 07:11:13,615 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 58 [2022-04-15 07:11:13,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:11:13,616 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2022-04-15 07:11:13,616 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 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 07:11:13,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 66 transitions. [2022-04-15 07:11:13,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:13,728 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2022-04-15 07:11:13,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 07:11:13,728 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:11:13,728 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:11:13,729 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 07:11:13,729 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:11:13,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:11:13,729 INFO L85 PathProgramCache]: Analyzing trace with hash -407343246, now seen corresponding path program 20 times [2022-04-15 07:11:13,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:13,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [800286294] [2022-04-15 07:11:13,946 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:14,064 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:14,161 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:14,268 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:14,364 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:14,468 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:14,588 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:14,589 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:11:14,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1741220163, now seen corresponding path program 1 times [2022-04-15 07:11:14,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:11:14,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185193478] [2022-04-15 07:11:14,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:11:14,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:11:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:14,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:11:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:14,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {8271#(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); {8265#true} is VALID [2022-04-15 07:11:14,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {8265#true} assume true; {8265#true} is VALID [2022-04-15 07:11:14,625 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8265#true} {8265#true} #68#return; {8265#true} is VALID [2022-04-15 07:11:14,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {8265#true} call ULTIMATE.init(); {8271#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:11:14,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {8271#(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); {8265#true} is VALID [2022-04-15 07:11:14,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {8265#true} assume true; {8265#true} is VALID [2022-04-15 07:11:14,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8265#true} {8265#true} #68#return; {8265#true} is VALID [2022-04-15 07:11:14,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {8265#true} call #t~ret8 := main(); {8265#true} is VALID [2022-04-15 07:11:14,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {8265#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {8270#(= main_~a~0 0)} is VALID [2022-04-15 07:11:14,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {8270#(= main_~a~0 0)} [116] L22-3-->L22-4_primed: Formula: (and (= |v_main_#t~pre7_1129| |v_main_#t~pre7_1111|) (= |v_main_#t~pre6_437| |v_main_#t~pre6_434|) (= v_main_~d~0_1564 v_main_~d~0_1543) (= |v_main_#t~pre4_114| |v_main_#t~pre4_113|) (= |v_main_#t~pre5_141| |v_main_#t~pre5_140|) (= v_main_~a~0_142 v_main_~a~0_141) (= v_main_~c~0_577 v_main_~c~0_573) (= v_main_~b~0_196 v_main_~b~0_194)) InVars {main_#t~pre7=|v_main_#t~pre7_1129|, main_~c~0=v_main_~c~0_577, main_~d~0=v_main_~d~0_1564, main_~b~0=v_main_~b~0_196, main_#t~pre4=|v_main_#t~pre4_114|, main_#t~pre5=|v_main_#t~pre5_141|, main_~a~0=v_main_~a~0_142, main_#t~pre6=|v_main_#t~pre6_437|} OutVars{main_#t~pre7=|v_main_#t~pre7_1111|, main_~c~0=v_main_~c~0_573, main_~d~0=v_main_~d~0_1543, main_~b~0=v_main_~b~0_194, main_#t~pre4=|v_main_#t~pre4_113|, main_#t~pre5=|v_main_#t~pre5_140|, main_~a~0=v_main_~a~0_141, main_#t~pre6=|v_main_#t~pre6_434|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {8270#(= main_~a~0 0)} is VALID [2022-04-15 07:11:14,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {8270#(= main_~a~0 0)} [115] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {8266#false} is VALID [2022-04-15 07:11:14,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {8266#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {8266#false} is VALID [2022-04-15 07:11:14,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {8266#false} assume !false; {8266#false} is VALID [2022-04-15 07:11:14,627 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 07:11:14,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:11:14,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185193478] [2022-04-15 07:11:14,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185193478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:14,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:14,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:11:15,199 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:11:15,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [800286294] [2022-04-15 07:11:15,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [800286294] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:15,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:15,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 07:11:15,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359977670] [2022-04-15 07:11:15,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:11:15,200 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 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 60 [2022-04-15 07:11:15,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:11:15,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 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 07:11:15,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:15,242 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 07:11:15,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:15,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 07:11:15,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2022-04-15 07:11:15,243 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 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 07:11:16,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:16,974 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2022-04-15 07:11:16,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 07:11:16,974 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 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 60 [2022-04-15 07:11:16,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:11:16,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 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 07:11:16,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 100 transitions. [2022-04-15 07:11:16,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 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 07:11:16,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 100 transitions. [2022-04-15 07:11:16,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 100 transitions. [2022-04-15 07:11:17,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:17,072 INFO L225 Difference]: With dead ends: 88 [2022-04-15 07:11:17,072 INFO L226 Difference]: Without dead ends: 77 [2022-04-15 07:11:17,072 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 22 SyntacticMatches, 13 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=315, Invalid=2441, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 07:11:17,073 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 93 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 07:11:17,073 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 98 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 07:11:17,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-15 07:11:17,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2022-04-15 07:11:17,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:11:17,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 65 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 61 states have internal predecessors, (65), 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 07:11:17,091 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 65 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 61 states have internal predecessors, (65), 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 07:11:17,091 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 65 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 61 states have internal predecessors, (65), 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 07:11:17,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:17,092 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-04-15 07:11:17,092 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2022-04-15 07:11:17,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:17,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:17,092 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 61 states have internal predecessors, (65), 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 77 states. [2022-04-15 07:11:17,092 INFO L87 Difference]: Start difference. First operand has 65 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 61 states have internal predecessors, (65), 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 77 states. [2022-04-15 07:11:17,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:17,093 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-04-15 07:11:17,093 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2022-04-15 07:11:17,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:17,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:17,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:11:17,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:11:17,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.0655737704918034) internal successors, (65), 61 states have internal predecessors, (65), 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 07:11:17,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2022-04-15 07:11:17,094 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 60 [2022-04-15 07:11:17,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:11:17,094 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2022-04-15 07:11:17,094 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 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 07:11:17,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 68 transitions. [2022-04-15 07:11:17,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:17,200 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2022-04-15 07:11:17,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 07:11:17,200 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:11:17,200 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:11:17,200 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 07:11:17,200 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:11:17,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:11:17,201 INFO L85 PathProgramCache]: Analyzing trace with hash -2010555621, now seen corresponding path program 21 times [2022-04-15 07:11:17,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:17,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [336012174] [2022-04-15 07:11:17,420 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:21,516 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:21,566 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:21,659 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:24,286 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:24,345 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:24,436 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:27,178 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:27,320 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:27,320 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:11:27,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1741281667, now seen corresponding path program 1 times [2022-04-15 07:11:27,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:11:27,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021918498] [2022-04-15 07:11:27,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:11:27,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:11:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:27,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:11:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:27,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {8814#(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); {8808#true} is VALID [2022-04-15 07:11:27,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {8808#true} assume true; {8808#true} is VALID [2022-04-15 07:11:27,356 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8808#true} {8808#true} #68#return; {8808#true} is VALID [2022-04-15 07:11:27,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {8808#true} call ULTIMATE.init(); {8814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:11:27,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {8814#(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); {8808#true} is VALID [2022-04-15 07:11:27,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {8808#true} assume true; {8808#true} is VALID [2022-04-15 07:11:27,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8808#true} {8808#true} #68#return; {8808#true} is VALID [2022-04-15 07:11:27,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {8808#true} call #t~ret8 := main(); {8808#true} is VALID [2022-04-15 07:11:27,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {8808#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {8813#(= main_~a~0 0)} is VALID [2022-04-15 07:11:27,360 INFO L290 TraceCheckUtils]: 6: Hoare triple {8813#(= main_~a~0 0)} [118] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_147| |v_main_#t~pre5_146|)) (.cse1 (= |v_main_#t~pre6_468| |v_main_#t~pre6_464|)) (.cse2 (= v_main_~d~0_1679 v_main_~d~0_1657)) (.cse3 (= v_main_~a~0_148 v_main_~a~0_147)) (.cse4 (= |v_main_#t~pre7_1208| |v_main_#t~pre7_1190|)) (.cse5 (= v_main_~b~0_204 v_main_~b~0_202)) (.cse6 (= |v_main_#t~pre4_119| |v_main_#t~pre4_118|))) (or (and .cse0 (= v_main_~c~0_612 v_main_~c~0_617) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (= v_main_~c~0_617 v_main_~c~0_612) .cse4 .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_1208|, main_~c~0=v_main_~c~0_617, main_~d~0=v_main_~d~0_1679, main_~b~0=v_main_~b~0_204, main_#t~pre4=|v_main_#t~pre4_119|, main_#t~pre5=|v_main_#t~pre5_147|, main_~a~0=v_main_~a~0_148, main_#t~pre6=|v_main_#t~pre6_468|} OutVars{main_#t~pre7=|v_main_#t~pre7_1190|, main_~c~0=v_main_~c~0_612, main_~d~0=v_main_~d~0_1657, main_~b~0=v_main_~b~0_202, main_#t~pre4=|v_main_#t~pre4_118|, main_#t~pre5=|v_main_#t~pre5_146|, main_~a~0=v_main_~a~0_147, main_#t~pre6=|v_main_#t~pre6_464|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {8813#(= main_~a~0 0)} is VALID [2022-04-15 07:11:27,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {8813#(= main_~a~0 0)} [117] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {8809#false} is VALID [2022-04-15 07:11:27,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {8809#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {8809#false} is VALID [2022-04-15 07:11:27,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {8809#false} assume !false; {8809#false} is VALID [2022-04-15 07:11:27,360 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 07:11:27,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:11:27,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021918498] [2022-04-15 07:11:27,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021918498] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:27,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:27,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:11:27,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:11:27,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [336012174] [2022-04-15 07:11:27,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [336012174] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:27,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:27,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 07:11:27,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120389392] [2022-04-15 07:11:27,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:11:27,904 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 28 states have internal predecessors, (60), 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 63 [2022-04-15 07:11:27,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:11:27,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 28 states have internal predecessors, (60), 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 07:11:27,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:27,945 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 07:11:27,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:27,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 07:11:27,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2022-04-15 07:11:27,946 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 28 states have internal predecessors, (60), 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 07:11:29,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:29,659 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2022-04-15 07:11:29,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 07:11:29,659 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 28 states have internal predecessors, (60), 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 63 [2022-04-15 07:11:29,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:11:29,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 28 states have internal predecessors, (60), 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 07:11:29,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 102 transitions. [2022-04-15 07:11:29,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 28 states have internal predecessors, (60), 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 07:11:29,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 102 transitions. [2022-04-15 07:11:29,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 102 transitions. [2022-04-15 07:11:29,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:29,736 INFO L225 Difference]: With dead ends: 90 [2022-04-15 07:11:29,736 INFO L226 Difference]: Without dead ends: 79 [2022-04-15 07:11:29,737 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 31 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=327, Invalid=2643, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 07:11:29,737 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 104 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 07:11:29,737 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 43 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 07:11:29,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-15 07:11:29,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 66. [2022-04-15 07:11:29,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:11:29,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 66 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 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 07:11:29,756 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 66 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 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 07:11:29,756 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 66 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 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 07:11:29,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:29,757 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2022-04-15 07:11:29,757 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2022-04-15 07:11:29,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:29,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:29,758 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 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 79 states. [2022-04-15 07:11:29,758 INFO L87 Difference]: Start difference. First operand has 66 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 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 79 states. [2022-04-15 07:11:29,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:29,758 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2022-04-15 07:11:29,758 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2022-04-15 07:11:29,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:29,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:29,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:11:29,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:11:29,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 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 07:11:29,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2022-04-15 07:11:29,760 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 63 [2022-04-15 07:11:29,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:11:29,760 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2022-04-15 07:11:29,760 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 28 states have internal predecessors, (60), 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 07:11:29,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 69 transitions. [2022-04-15 07:11:29,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:29,864 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2022-04-15 07:11:29,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 07:11:29,864 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:11:29,864 INFO L499 BasicCegarLoop]: trace histogram [19, 19, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:11:29,864 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 07:11:29,865 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:11:29,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:11:29,865 INFO L85 PathProgramCache]: Analyzing trace with hash 525153849, now seen corresponding path program 22 times [2022-04-15 07:11:29,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:29,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1863823402] [2022-04-15 07:11:30,146 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:34,239 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:34,289 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:38,357 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:38,403 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:38,492 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:38,606 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:42,698 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:42,756 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:42,915 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:42,915 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:11:42,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1741343171, now seen corresponding path program 1 times [2022-04-15 07:11:42,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:11:42,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633969630] [2022-04-15 07:11:42,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:11:42,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:11:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:42,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:11:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:42,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {9370#(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); {9364#true} is VALID [2022-04-15 07:11:42,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {9364#true} assume true; {9364#true} is VALID [2022-04-15 07:11:42,951 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9364#true} {9364#true} #68#return; {9364#true} is VALID [2022-04-15 07:11:42,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {9364#true} call ULTIMATE.init(); {9370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:11:42,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {9370#(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); {9364#true} is VALID [2022-04-15 07:11:42,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {9364#true} assume true; {9364#true} is VALID [2022-04-15 07:11:42,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9364#true} {9364#true} #68#return; {9364#true} is VALID [2022-04-15 07:11:42,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {9364#true} call #t~ret8 := main(); {9364#true} is VALID [2022-04-15 07:11:42,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {9364#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {9369#(= main_~a~0 0)} is VALID [2022-04-15 07:11:42,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {9369#(= main_~a~0 0)} [120] L22-3-->L22-4_primed: Formula: (and (= |v_main_#t~pre6_499| |v_main_#t~pre6_495|) (= v_main_~d~0_1798 v_main_~d~0_1775) (= v_main_~b~0_212 v_main_~b~0_210) (= |v_main_#t~pre4_124| |v_main_#t~pre4_123|) (= v_main_~c~0_657 v_main_~c~0_652) (= |v_main_#t~pre7_1285| |v_main_#t~pre7_1266|) (= v_main_~a~0_154 v_main_~a~0_153) (= |v_main_#t~pre5_153| |v_main_#t~pre5_152|)) InVars {main_#t~pre7=|v_main_#t~pre7_1285|, main_~c~0=v_main_~c~0_657, main_~d~0=v_main_~d~0_1798, main_~b~0=v_main_~b~0_212, main_#t~pre4=|v_main_#t~pre4_124|, main_#t~pre5=|v_main_#t~pre5_153|, main_~a~0=v_main_~a~0_154, main_#t~pre6=|v_main_#t~pre6_499|} OutVars{main_#t~pre7=|v_main_#t~pre7_1266|, main_~c~0=v_main_~c~0_652, main_~d~0=v_main_~d~0_1775, main_~b~0=v_main_~b~0_210, main_#t~pre4=|v_main_#t~pre4_123|, main_#t~pre5=|v_main_#t~pre5_152|, main_~a~0=v_main_~a~0_153, main_#t~pre6=|v_main_#t~pre6_495|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {9369#(= main_~a~0 0)} is VALID [2022-04-15 07:11:42,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {9369#(= main_~a~0 0)} [119] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {9365#false} is VALID [2022-04-15 07:11:42,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {9365#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {9365#false} is VALID [2022-04-15 07:11:42,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {9365#false} assume !false; {9365#false} is VALID [2022-04-15 07:11:42,953 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 07:11:42,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:11:42,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633969630] [2022-04-15 07:11:42,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633969630] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:42,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:42,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:11:43,658 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:11:43,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1863823402] [2022-04-15 07:11:43,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1863823402] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:43,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:43,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 07:11:43,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540655633] [2022-04-15 07:11:43,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:11:43,659 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 29 states have internal predecessors, (62), 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 65 [2022-04-15 07:11:43,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:11:43,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 29 states have internal predecessors, (62), 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 07:11:43,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:43,710 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 07:11:43,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:43,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 07:11:43,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2022-04-15 07:11:43,711 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 29 states have internal predecessors, (62), 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 07:11:46,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:46,090 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2022-04-15 07:11:46,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 07:11:46,091 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 29 states have internal predecessors, (62), 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 65 [2022-04-15 07:11:46,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:11:46,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 29 states have internal predecessors, (62), 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 07:11:46,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 104 transitions. [2022-04-15 07:11:46,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 29 states have internal predecessors, (62), 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 07:11:46,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 104 transitions. [2022-04-15 07:11:46,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 104 transitions. [2022-04-15 07:11:46,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:46,175 INFO L225 Difference]: With dead ends: 92 [2022-04-15 07:11:46,175 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 07:11:46,176 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 29 SyntacticMatches, 9 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=339, Invalid=2853, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 07:11:46,176 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 106 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:11:46,177 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 43 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 07:11:46,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 07:11:46,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 68. [2022-04-15 07:11:46,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:11:46,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 68 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 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 07:11:46,202 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 68 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 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 07:11:46,202 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 68 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 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 07:11:46,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:46,203 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2022-04-15 07:11:46,203 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2022-04-15 07:11:46,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:46,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:46,203 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 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 81 states. [2022-04-15 07:11:46,203 INFO L87 Difference]: Start difference. First operand has 68 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 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 81 states. [2022-04-15 07:11:46,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:46,204 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2022-04-15 07:11:46,204 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2022-04-15 07:11:46,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:46,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:46,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:11:46,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:11:46,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 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 07:11:46,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-04-15 07:11:46,205 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 65 [2022-04-15 07:11:46,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:11:46,206 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-04-15 07:11:46,206 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 29 states have internal predecessors, (62), 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 07:11:46,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 71 transitions. [2022-04-15 07:11:46,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:46,340 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-15 07:11:46,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 07:11:46,341 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:11:46,341 INFO L499 BasicCegarLoop]: trace histogram [20, 20, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:11:46,341 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-15 07:11:46,341 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:11:46,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:11:46,342 INFO L85 PathProgramCache]: Analyzing trace with hash 2095497687, now seen corresponding path program 23 times [2022-04-15 07:11:46,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:46,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [717895221] [2022-04-15 07:11:46,586 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:50,679 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:50,718 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:50,811 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:54,682 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:54,726 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:54,827 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:58,916 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:58,958 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:59,091 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:59,092 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:11:59,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1741404675, now seen corresponding path program 1 times [2022-04-15 07:11:59,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:11:59,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173262077] [2022-04-15 07:11:59,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:11:59,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:11:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:59,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:11:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:59,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {9941#(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); {9935#true} is VALID [2022-04-15 07:11:59,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {9935#true} assume true; {9935#true} is VALID [2022-04-15 07:11:59,125 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9935#true} {9935#true} #68#return; {9935#true} is VALID [2022-04-15 07:11:59,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {9935#true} call ULTIMATE.init(); {9941#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:11:59,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {9941#(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); {9935#true} is VALID [2022-04-15 07:11:59,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {9935#true} assume true; {9935#true} is VALID [2022-04-15 07:11:59,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9935#true} {9935#true} #68#return; {9935#true} is VALID [2022-04-15 07:11:59,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {9935#true} call #t~ret8 := main(); {9935#true} is VALID [2022-04-15 07:11:59,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {9935#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {9940#(= main_~a~0 0)} is VALID [2022-04-15 07:11:59,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {9940#(= main_~a~0 0)} [122] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_159| |v_main_#t~pre5_158|)) (.cse1 (= v_main_~c~0_697 v_main_~c~0_692)) (.cse2 (= |v_main_#t~pre4_129| |v_main_#t~pre4_128|)) (.cse3 (= v_main_~d~0_1921 v_main_~d~0_1897)) (.cse4 (= |v_main_#t~pre6_530| |v_main_#t~pre6_526|)) (.cse5 (= |v_main_#t~pre7_1370| |v_main_#t~pre7_1350|)) (.cse6 (= v_main_~b~0_220 v_main_~b~0_218))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~a~0_160 v_main_~a~0_159) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (= v_main_~a~0_159 v_main_~a~0_160) .cse4 .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_1370|, main_~c~0=v_main_~c~0_697, main_~d~0=v_main_~d~0_1921, main_~b~0=v_main_~b~0_220, main_#t~pre4=|v_main_#t~pre4_129|, main_#t~pre5=|v_main_#t~pre5_159|, main_~a~0=v_main_~a~0_160, main_#t~pre6=|v_main_#t~pre6_530|} OutVars{main_#t~pre7=|v_main_#t~pre7_1350|, main_~c~0=v_main_~c~0_692, main_~d~0=v_main_~d~0_1897, main_~b~0=v_main_~b~0_218, main_#t~pre4=|v_main_#t~pre4_128|, main_#t~pre5=|v_main_#t~pre5_158|, main_~a~0=v_main_~a~0_159, main_#t~pre6=|v_main_#t~pre6_526|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {9940#(= main_~a~0 0)} is VALID [2022-04-15 07:11:59,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {9940#(= main_~a~0 0)} [121] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {9936#false} is VALID [2022-04-15 07:11:59,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {9936#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {9936#false} is VALID [2022-04-15 07:11:59,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {9936#false} assume !false; {9936#false} is VALID [2022-04-15 07:11:59,127 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 07:11:59,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:11:59,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173262077] [2022-04-15 07:11:59,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173262077] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:59,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:59,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:11:59,786 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:11:59,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [717895221] [2022-04-15 07:11:59,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [717895221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:59,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:59,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 07:11:59,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792266818] [2022-04-15 07:11:59,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:11:59,787 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 07:11:59,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:11:59,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 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 07:11:59,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:59,829 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 07:11:59,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:59,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 07:11:59,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2022-04-15 07:11:59,830 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 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 07:12:01,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:01,956 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2022-04-15 07:12:01,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 07:12:01,957 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 07:12:01,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:12:01,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 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 07:12:01,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 106 transitions. [2022-04-15 07:12:01,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 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 07:12:01,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 106 transitions. [2022-04-15 07:12:01,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 106 transitions. [2022-04-15 07:12:02,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:02,030 INFO L225 Difference]: With dead ends: 94 [2022-04-15 07:12:02,030 INFO L226 Difference]: Without dead ends: 83 [2022-04-15 07:12:02,030 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 29 SyntacticMatches, 10 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=351, Invalid=3071, Unknown=0, NotChecked=0, Total=3422 [2022-04-15 07:12:02,031 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 108 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 07:12:02,031 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 63 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 07:12:02,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-15 07:12:02,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 70. [2022-04-15 07:12:02,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:02,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 70 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 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 07:12:02,052 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 70 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 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 07:12:02,052 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 70 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 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 07:12:02,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:02,052 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-04-15 07:12:02,053 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-04-15 07:12:02,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:02,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:02,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 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 83 states. [2022-04-15 07:12:02,053 INFO L87 Difference]: Start difference. First operand has 70 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 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 83 states. [2022-04-15 07:12:02,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:02,054 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-04-15 07:12:02,054 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-04-15 07:12:02,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:02,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:02,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:02,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:02,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 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 07:12:02,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-04-15 07:12:02,055 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 67 [2022-04-15 07:12:02,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:02,055 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-04-15 07:12:02,055 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 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 07:12:02,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 73 transitions. [2022-04-15 07:12:02,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:02,172 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-15 07:12:02,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 07:12:02,172 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:02,172 INFO L499 BasicCegarLoop]: trace histogram [21, 21, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:12:02,172 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-15 07:12:02,172 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:02,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:02,173 INFO L85 PathProgramCache]: Analyzing trace with hash -632562187, now seen corresponding path program 24 times [2022-04-15 07:12:02,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:02,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1856934684] [2022-04-15 07:12:02,378 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:02,499 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:02,623 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:02,740 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:02,834 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:02,953 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:03,086 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:03,087 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:12:03,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1741466179, now seen corresponding path program 1 times [2022-04-15 07:12:03,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:03,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105220025] [2022-04-15 07:12:03,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:03,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:03,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:12:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:03,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {10527#(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); {10521#true} is VALID [2022-04-15 07:12:03,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {10521#true} assume true; {10521#true} is VALID [2022-04-15 07:12:03,122 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10521#true} {10521#true} #68#return; {10521#true} is VALID [2022-04-15 07:12:03,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {10521#true} call ULTIMATE.init(); {10527#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:12:03,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {10527#(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); {10521#true} is VALID [2022-04-15 07:12:03,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {10521#true} assume true; {10521#true} is VALID [2022-04-15 07:12:03,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10521#true} {10521#true} #68#return; {10521#true} is VALID [2022-04-15 07:12:03,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {10521#true} call #t~ret8 := main(); {10521#true} is VALID [2022-04-15 07:12:03,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {10521#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {10526#(= main_~a~0 0)} is VALID [2022-04-15 07:12:03,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {10526#(= main_~a~0 0)} [124] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_165| |v_main_#t~pre5_164|)) (.cse1 (= v_main_~d~0_2048 v_main_~d~0_2023)) (.cse2 (= v_main_~a~0_166 v_main_~a~0_165)) (.cse3 (= v_main_~b~0_228 v_main_~b~0_226)) (.cse4 (= |v_main_#t~pre4_134| |v_main_#t~pre4_133|)) (.cse5 (= |v_main_#t~pre7_1458| |v_main_#t~pre7_1437|))) (or (and (= v_main_~c~0_732 v_main_~c~0_737) .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre6_557| |v_main_#t~pre6_561|) .cse5) (and (= v_main_~c~0_737 v_main_~c~0_732) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_main_#t~pre6_561| |v_main_#t~pre6_557|)))) InVars {main_#t~pre7=|v_main_#t~pre7_1458|, main_~c~0=v_main_~c~0_737, main_~d~0=v_main_~d~0_2048, main_~b~0=v_main_~b~0_228, main_#t~pre4=|v_main_#t~pre4_134|, main_#t~pre5=|v_main_#t~pre5_165|, main_~a~0=v_main_~a~0_166, main_#t~pre6=|v_main_#t~pre6_561|} OutVars{main_#t~pre7=|v_main_#t~pre7_1437|, main_~c~0=v_main_~c~0_732, main_~d~0=v_main_~d~0_2023, main_~b~0=v_main_~b~0_226, main_#t~pre4=|v_main_#t~pre4_133|, main_#t~pre5=|v_main_#t~pre5_164|, main_~a~0=v_main_~a~0_165, main_#t~pre6=|v_main_#t~pre6_557|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {10526#(= main_~a~0 0)} is VALID [2022-04-15 07:12:03,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {10526#(= main_~a~0 0)} [123] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {10522#false} is VALID [2022-04-15 07:12:03,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {10522#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {10522#false} is VALID [2022-04-15 07:12:03,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {10522#false} assume !false; {10522#false} is VALID [2022-04-15 07:12:03,125 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 07:12:03,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:12:03,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105220025] [2022-04-15 07:12:03,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105220025] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:03,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:03,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:12:03,878 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:12:03,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1856934684] [2022-04-15 07:12:03,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1856934684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:03,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:03,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 07:12:03,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756978822] [2022-04-15 07:12:03,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:12:03,879 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.0625) internal successors, (66), 31 states have internal predecessors, (66), 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 69 [2022-04-15 07:12:03,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:12:03,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 2.0625) internal successors, (66), 31 states have internal predecessors, (66), 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 07:12:03,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:03,923 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 07:12:03,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:03,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 07:12:03,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=869, Unknown=0, NotChecked=0, Total=992 [2022-04-15 07:12:03,924 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 32 states, 32 states have (on average 2.0625) internal successors, (66), 31 states have internal predecessors, (66), 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 07:12:06,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:06,360 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2022-04-15 07:12:06,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 07:12:06,361 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.0625) internal successors, (66), 31 states have internal predecessors, (66), 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 69 [2022-04-15 07:12:06,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:12:06,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.0625) internal successors, (66), 31 states have internal predecessors, (66), 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 07:12:06,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 108 transitions. [2022-04-15 07:12:06,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.0625) internal successors, (66), 31 states have internal predecessors, (66), 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 07:12:06,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 108 transitions. [2022-04-15 07:12:06,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 108 transitions. [2022-04-15 07:12:06,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:06,436 INFO L225 Difference]: With dead ends: 96 [2022-04-15 07:12:06,436 INFO L226 Difference]: Without dead ends: 85 [2022-04-15 07:12:06,437 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 23 SyntacticMatches, 17 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=363, Invalid=3297, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 07:12:06,438 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 110 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:12:06,438 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 78 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 07:12:06,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-15 07:12:06,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2022-04-15 07:12:06,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:06,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 72 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 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 07:12:06,461 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 72 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 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 07:12:06,461 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 72 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 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 07:12:06,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:06,462 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2022-04-15 07:12:06,462 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2022-04-15 07:12:06,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:06,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:06,462 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 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 85 states. [2022-04-15 07:12:06,462 INFO L87 Difference]: Start difference. First operand has 72 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 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 85 states. [2022-04-15 07:12:06,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:06,463 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2022-04-15 07:12:06,463 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2022-04-15 07:12:06,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:06,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:06,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:06,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:06,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 68 states have internal predecessors, (72), 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 07:12:06,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2022-04-15 07:12:06,464 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 69 [2022-04-15 07:12:06,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:06,464 INFO L478 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2022-04-15 07:12:06,464 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.0625) internal successors, (66), 31 states have internal predecessors, (66), 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 07:12:06,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 75 transitions. [2022-04-15 07:12:06,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:06,594 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2022-04-15 07:12:06,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-15 07:12:06,595 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:06,595 INFO L499 BasicCegarLoop]: trace histogram [22, 22, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:12:06,595 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-15 07:12:06,595 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:06,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:06,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1926916755, now seen corresponding path program 25 times [2022-04-15 07:12:06,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:06,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [654369564] [2022-04-15 07:12:06,821 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:10,900 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:12:10,940 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:11,030 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:15,125 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:12:15,168 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:15,261 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:19,340 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:12:19,382 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:19,522 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:19,522 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:12:19,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1741527683, now seen corresponding path program 1 times [2022-04-15 07:12:19,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:19,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678309171] [2022-04-15 07:12:19,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:19,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:19,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:12:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:19,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {11128#(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); {11122#true} is VALID [2022-04-15 07:12:19,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {11122#true} assume true; {11122#true} is VALID [2022-04-15 07:12:19,543 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11122#true} {11122#true} #68#return; {11122#true} is VALID [2022-04-15 07:12:19,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {11122#true} call ULTIMATE.init(); {11128#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:12:19,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {11128#(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); {11122#true} is VALID [2022-04-15 07:12:19,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {11122#true} assume true; {11122#true} is VALID [2022-04-15 07:12:19,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11122#true} {11122#true} #68#return; {11122#true} is VALID [2022-04-15 07:12:19,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {11122#true} call #t~ret8 := main(); {11122#true} is VALID [2022-04-15 07:12:19,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {11122#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {11127#(= main_~a~0 0)} is VALID [2022-04-15 07:12:19,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {11127#(= main_~a~0 0)} [126] L22-3-->L22-4_primed: Formula: (and (= v_main_~d~0_2179 v_main_~d~0_2153) (= |v_main_#t~pre4_139| |v_main_#t~pre4_138|) (= |v_main_#t~pre7_1549| |v_main_#t~pre7_1527|) (= v_main_~b~0_236 v_main_~b~0_234) (= v_main_~c~0_777 v_main_~c~0_772) (= v_main_~a~0_172 v_main_~a~0_171) (= |v_main_#t~pre6_592| |v_main_#t~pre6_588|) (= |v_main_#t~pre5_171| |v_main_#t~pre5_170|)) InVars {main_#t~pre7=|v_main_#t~pre7_1549|, main_~c~0=v_main_~c~0_777, main_~d~0=v_main_~d~0_2179, main_~b~0=v_main_~b~0_236, main_#t~pre4=|v_main_#t~pre4_139|, main_#t~pre5=|v_main_#t~pre5_171|, main_~a~0=v_main_~a~0_172, main_#t~pre6=|v_main_#t~pre6_592|} OutVars{main_#t~pre7=|v_main_#t~pre7_1527|, main_~c~0=v_main_~c~0_772, main_~d~0=v_main_~d~0_2153, main_~b~0=v_main_~b~0_234, main_#t~pre4=|v_main_#t~pre4_138|, main_#t~pre5=|v_main_#t~pre5_170|, main_~a~0=v_main_~a~0_171, main_#t~pre6=|v_main_#t~pre6_588|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {11127#(= main_~a~0 0)} is VALID [2022-04-15 07:12:19,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {11127#(= main_~a~0 0)} [125] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {11123#false} is VALID [2022-04-15 07:12:19,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {11123#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {11123#false} is VALID [2022-04-15 07:12:19,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {11123#false} assume !false; {11123#false} is VALID [2022-04-15 07:12:19,546 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 07:12:19,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:12:19,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678309171] [2022-04-15 07:12:19,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678309171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:19,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:19,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:12:20,314 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:12:20,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [654369564] [2022-04-15 07:12:20,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [654369564] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:20,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:20,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 07:12:20,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786591480] [2022-04-15 07:12:20,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:12:20,315 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 32 states have internal predecessors, (68), 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 71 [2022-04-15 07:12:20,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:12:20,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 32 states have internal predecessors, (68), 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 07:12:20,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:20,366 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 07:12:20,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:20,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 07:12:20,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=929, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 07:12:20,367 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 32 states have internal predecessors, (68), 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 07:12:23,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:23,066 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2022-04-15 07:12:23,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 07:12:23,066 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 32 states have internal predecessors, (68), 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 71 [2022-04-15 07:12:23,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:12:23,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 32 states have internal predecessors, (68), 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 07:12:23,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 110 transitions. [2022-04-15 07:12:23,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 32 states have internal predecessors, (68), 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 07:12:23,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 110 transitions. [2022-04-15 07:12:23,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 110 transitions. [2022-04-15 07:12:23,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:23,164 INFO L225 Difference]: With dead ends: 98 [2022-04-15 07:12:23,164 INFO L226 Difference]: Without dead ends: 87 [2022-04-15 07:12:23,165 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 27 SyntacticMatches, 14 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=375, Invalid=3531, Unknown=0, NotChecked=0, Total=3906 [2022-04-15 07:12:23,166 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 112 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1726 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:12:23,166 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 93 Invalid, 1794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1726 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 07:12:23,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-15 07:12:23,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2022-04-15 07:12:23,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:23,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 74 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 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 07:12:23,190 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 74 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 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 07:12:23,191 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 74 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 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 07:12:23,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:23,192 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2022-04-15 07:12:23,192 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2022-04-15 07:12:23,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:23,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:23,192 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 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 87 states. [2022-04-15 07:12:23,192 INFO L87 Difference]: Start difference. First operand has 74 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 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 87 states. [2022-04-15 07:12:23,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:23,193 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2022-04-15 07:12:23,193 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2022-04-15 07:12:23,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:23,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:23,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:23,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:23,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 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 07:12:23,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-04-15 07:12:23,194 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 71 [2022-04-15 07:12:23,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:23,194 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-04-15 07:12:23,194 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 32 states have internal predecessors, (68), 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 07:12:23,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 77 transitions. [2022-04-15 07:12:23,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:23,322 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-15 07:12:23,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 07:12:23,322 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:23,322 INFO L499 BasicCegarLoop]: trace histogram [23, 23, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:12:23,322 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-15 07:12:23,322 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:23,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:23,323 INFO L85 PathProgramCache]: Analyzing trace with hash 569919409, now seen corresponding path program 26 times [2022-04-15 07:12:23,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:23,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1191401625] [2022-04-15 07:12:23,580 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:27,665 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:12:27,716 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:27,811 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:31,899 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:12:31,946 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:32,036 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:36,117 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:12:36,165 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:36,304 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:36,305 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:12:36,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1741589187, now seen corresponding path program 1 times [2022-04-15 07:12:36,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:36,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529333815] [2022-04-15 07:12:36,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:36,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:36,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:12:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:36,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {11744#(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); {11738#true} is VALID [2022-04-15 07:12:36,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {11738#true} assume true; {11738#true} is VALID [2022-04-15 07:12:36,328 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11738#true} {11738#true} #68#return; {11738#true} is VALID [2022-04-15 07:12:36,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {11738#true} call ULTIMATE.init(); {11744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:12:36,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {11744#(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); {11738#true} is VALID [2022-04-15 07:12:36,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {11738#true} assume true; {11738#true} is VALID [2022-04-15 07:12:36,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11738#true} {11738#true} #68#return; {11738#true} is VALID [2022-04-15 07:12:36,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {11738#true} call #t~ret8 := main(); {11738#true} is VALID [2022-04-15 07:12:36,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {11738#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {11743#(= main_~a~0 0)} is VALID [2022-04-15 07:12:36,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {11743#(= main_~a~0 0)} [128] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_177| |v_main_#t~pre5_176|)) (.cse1 (= v_main_~a~0_178 v_main_~a~0_177)) (.cse2 (= |v_main_#t~pre7_1643| |v_main_#t~pre7_1620|)) (.cse3 (= v_main_~d~0_2314 v_main_~d~0_2287)) (.cse4 (= v_main_~b~0_244 v_main_~b~0_242)) (.cse5 (= |v_main_#t~pre4_144| |v_main_#t~pre4_143|))) (or (and .cse0 .cse1 (= |v_main_#t~pre6_619| |v_main_#t~pre6_623|) .cse2 .cse3 .cse4 (= v_main_~c~0_812 v_main_~c~0_817) .cse5) (and .cse0 (= v_main_~c~0_817 v_main_~c~0_812) .cse1 .cse2 (= |v_main_#t~pre6_623| |v_main_#t~pre6_619|) .cse3 .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_1643|, main_~c~0=v_main_~c~0_817, main_~d~0=v_main_~d~0_2314, main_~b~0=v_main_~b~0_244, main_#t~pre4=|v_main_#t~pre4_144|, main_#t~pre5=|v_main_#t~pre5_177|, main_~a~0=v_main_~a~0_178, main_#t~pre6=|v_main_#t~pre6_623|} OutVars{main_#t~pre7=|v_main_#t~pre7_1620|, main_~c~0=v_main_~c~0_812, main_~d~0=v_main_~d~0_2287, main_~b~0=v_main_~b~0_242, main_#t~pre4=|v_main_#t~pre4_143|, main_#t~pre5=|v_main_#t~pre5_176|, main_~a~0=v_main_~a~0_177, main_#t~pre6=|v_main_#t~pre6_619|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {11743#(= main_~a~0 0)} is VALID [2022-04-15 07:12:36,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {11743#(= main_~a~0 0)} [127] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {11739#false} is VALID [2022-04-15 07:12:36,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {11739#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {11739#false} is VALID [2022-04-15 07:12:36,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {11739#false} assume !false; {11739#false} is VALID [2022-04-15 07:12:36,331 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 07:12:36,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:12:36,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529333815] [2022-04-15 07:12:36,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529333815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:36,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:36,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:12:37,120 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:12:37,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1191401625] [2022-04-15 07:12:37,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1191401625] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:37,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:37,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 07:12:37,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440362659] [2022-04-15 07:12:37,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:12:37,121 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 33 states have internal predecessors, (70), 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 73 [2022-04-15 07:12:37,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:12:37,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 33 states have internal predecessors, (70), 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 07:12:37,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:37,168 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 07:12:37,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:37,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 07:12:37,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=991, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 07:12:37,169 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 34 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 33 states have internal predecessors, (70), 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 07:12:39,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:39,852 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2022-04-15 07:12:39,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 07:12:39,852 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 33 states have internal predecessors, (70), 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 73 [2022-04-15 07:12:39,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:12:39,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 33 states have internal predecessors, (70), 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 07:12:39,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 115 transitions. [2022-04-15 07:12:39,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 33 states have internal predecessors, (70), 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 07:12:39,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 115 transitions. [2022-04-15 07:12:39,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 115 transitions. [2022-04-15 07:12:39,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:39,946 INFO L225 Difference]: With dead ends: 102 [2022-04-15 07:12:39,946 INFO L226 Difference]: Without dead ends: 91 [2022-04-15 07:12:39,947 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 27 SyntacticMatches, 15 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=387, Invalid=3773, Unknown=0, NotChecked=0, Total=4160 [2022-04-15 07:12:39,948 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 108 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:12:39,948 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 68 Invalid, 1739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1671 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 07:12:39,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-15 07:12:39,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2022-04-15 07:12:39,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:39,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 78 states, 74 states have (on average 1.054054054054054) internal successors, (78), 74 states have internal predecessors, (78), 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 07:12:39,981 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 78 states, 74 states have (on average 1.054054054054054) internal successors, (78), 74 states have internal predecessors, (78), 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 07:12:39,981 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 78 states, 74 states have (on average 1.054054054054054) internal successors, (78), 74 states have internal predecessors, (78), 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 07:12:39,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:39,982 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-04-15 07:12:39,982 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-04-15 07:12:39,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:39,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:39,982 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 74 states have (on average 1.054054054054054) internal successors, (78), 74 states have internal predecessors, (78), 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 91 states. [2022-04-15 07:12:39,982 INFO L87 Difference]: Start difference. First operand has 78 states, 74 states have (on average 1.054054054054054) internal successors, (78), 74 states have internal predecessors, (78), 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 91 states. [2022-04-15 07:12:39,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:39,983 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2022-04-15 07:12:39,983 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-04-15 07:12:39,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:39,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:39,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:39,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:39,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 74 states have (on average 1.054054054054054) internal successors, (78), 74 states have internal predecessors, (78), 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 07:12:39,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-04-15 07:12:39,984 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 73 [2022-04-15 07:12:39,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:39,984 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-04-15 07:12:39,984 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 33 states have internal predecessors, (70), 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 07:12:39,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 81 transitions. [2022-04-15 07:12:40,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:40,126 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-15 07:12:40,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 07:12:40,126 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:40,126 INFO L499 BasicCegarLoop]: trace histogram [24, 24, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:12:40,126 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-15 07:12:40,126 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:40,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:40,127 INFO L85 PathProgramCache]: Analyzing trace with hash -2129439409, now seen corresponding path program 27 times [2022-04-15 07:12:40,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:40,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1884595593] [2022-04-15 07:12:40,331 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:43,417 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:12:43,457 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:43,554 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:47,647 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:12:47,689 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:47,782 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:51,858 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:12:51,903 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:52,057 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:52,058 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:12:52,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1741650691, now seen corresponding path program 1 times [2022-04-15 07:12:52,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:52,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516952101] [2022-04-15 07:12:52,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:52,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:52,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:12:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:52,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {12387#(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); {12381#true} is VALID [2022-04-15 07:12:52,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {12381#true} assume true; {12381#true} is VALID [2022-04-15 07:12:52,080 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12381#true} {12381#true} #68#return; {12381#true} is VALID [2022-04-15 07:12:52,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {12381#true} call ULTIMATE.init(); {12387#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:12:52,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {12387#(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); {12381#true} is VALID [2022-04-15 07:12:52,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {12381#true} assume true; {12381#true} is VALID [2022-04-15 07:12:52,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12381#true} {12381#true} #68#return; {12381#true} is VALID [2022-04-15 07:12:52,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {12381#true} call #t~ret8 := main(); {12381#true} is VALID [2022-04-15 07:12:52,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {12381#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {12386#(= main_~a~0 0)} is VALID [2022-04-15 07:12:52,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {12386#(= main_~a~0 0)} [130] L22-3-->L22-4_primed: Formula: (and (= |v_main_#t~pre5_183| |v_main_#t~pre5_182|) (= v_main_~d~0_2446 v_main_~d~0_2418) (= v_main_~b~0_252 v_main_~b~0_250) (= v_main_~a~0_184 v_main_~a~0_183) (= v_main_~c~0_855 v_main_~c~0_850) (= |v_main_#t~pre6_653| |v_main_#t~pre6_649|) (= |v_main_#t~pre7_1734| |v_main_#t~pre7_1710|) (= |v_main_#t~pre4_149| |v_main_#t~pre4_148|)) InVars {main_#t~pre7=|v_main_#t~pre7_1734|, main_~c~0=v_main_~c~0_855, main_~d~0=v_main_~d~0_2446, main_~b~0=v_main_~b~0_252, main_#t~pre4=|v_main_#t~pre4_149|, main_#t~pre5=|v_main_#t~pre5_183|, main_~a~0=v_main_~a~0_184, main_#t~pre6=|v_main_#t~pre6_653|} OutVars{main_#t~pre7=|v_main_#t~pre7_1710|, main_~c~0=v_main_~c~0_850, main_~d~0=v_main_~d~0_2418, main_~b~0=v_main_~b~0_250, main_#t~pre4=|v_main_#t~pre4_148|, main_#t~pre5=|v_main_#t~pre5_182|, main_~a~0=v_main_~a~0_183, main_#t~pre6=|v_main_#t~pre6_649|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {12386#(= main_~a~0 0)} is VALID [2022-04-15 07:12:52,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {12386#(= main_~a~0 0)} [129] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {12382#false} is VALID [2022-04-15 07:12:52,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {12382#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {12382#false} is VALID [2022-04-15 07:12:52,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {12382#false} assume !false; {12382#false} is VALID [2022-04-15 07:12:52,082 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 07:12:52,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:12:52,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516952101] [2022-04-15 07:12:52,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516952101] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:52,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:52,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:12:52,946 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:12:52,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1884595593] [2022-04-15 07:12:52,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1884595593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:52,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:52,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 07:12:52,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277014069] [2022-04-15 07:12:52,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:12:52,947 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-15 07:12:52,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:12:52,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 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 07:12:52,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:52,997 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 07:12:52,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:52,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 07:12:52,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1055, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 07:12:52,999 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 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 07:12:55,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:55,938 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2022-04-15 07:12:55,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 07:12:55,939 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-15 07:12:55,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:12:55,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 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 07:12:55,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 115 transitions. [2022-04-15 07:12:55,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 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 07:12:55,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 115 transitions. [2022-04-15 07:12:55,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 115 transitions. [2022-04-15 07:12:56,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:56,021 INFO L225 Difference]: With dead ends: 103 [2022-04-15 07:12:56,021 INFO L226 Difference]: Without dead ends: 92 [2022-04-15 07:12:56,022 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 27 SyntacticMatches, 16 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=399, Invalid=4023, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 07:12:56,022 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 151 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1766 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:12:56,022 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 33 Invalid, 1872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1766 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 07:12:56,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-15 07:12:56,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2022-04-15 07:12:56,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:56,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 80 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 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 07:12:56,052 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 80 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 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 07:12:56,052 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 80 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 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 07:12:56,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:56,053 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2022-04-15 07:12:56,053 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2022-04-15 07:12:56,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:56,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:56,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 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 92 states. [2022-04-15 07:12:56,053 INFO L87 Difference]: Start difference. First operand has 80 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 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 92 states. [2022-04-15 07:12:56,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:56,054 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2022-04-15 07:12:56,054 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2022-04-15 07:12:56,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:56,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:56,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:56,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:56,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 76 states have (on average 1.0526315789473684) internal successors, (80), 76 states have internal predecessors, (80), 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 07:12:56,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-04-15 07:12:56,055 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 75 [2022-04-15 07:12:56,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:56,055 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-04-15 07:12:56,055 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 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 07:12:56,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 83 transitions. [2022-04-15 07:12:56,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:56,202 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-04-15 07:12:56,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-15 07:12:56,202 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:56,202 INFO L499 BasicCegarLoop]: trace histogram [24, 24, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:12:56,202 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-15 07:12:56,202 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:56,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:56,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1592996834, now seen corresponding path program 28 times [2022-04-15 07:12:56,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:56,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2117512162] [2022-04-15 07:12:56,420 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:56,533 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:56,626 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:56,727 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:56,817 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:56,929 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:57,084 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:57,085 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:12:57,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1741712195, now seen corresponding path program 1 times [2022-04-15 07:12:57,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:57,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088258255] [2022-04-15 07:12:57,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:57,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:57,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:12:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:57,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {13041#(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); {13035#true} is VALID [2022-04-15 07:12:57,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {13035#true} assume true; {13035#true} is VALID [2022-04-15 07:12:57,110 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13035#true} {13035#true} #68#return; {13035#true} is VALID [2022-04-15 07:12:57,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {13035#true} call ULTIMATE.init(); {13041#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:12:57,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {13041#(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); {13035#true} is VALID [2022-04-15 07:12:57,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {13035#true} assume true; {13035#true} is VALID [2022-04-15 07:12:57,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13035#true} {13035#true} #68#return; {13035#true} is VALID [2022-04-15 07:12:57,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {13035#true} call #t~ret8 := main(); {13035#true} is VALID [2022-04-15 07:12:57,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {13035#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {13040#(= main_~a~0 0)} is VALID [2022-04-15 07:12:57,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {13040#(= main_~a~0 0)} [132] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~b~0_260 v_main_~b~0_258)) (.cse1 (= v_main_~c~0_898 v_main_~c~0_892)) (.cse2 (= |v_main_#t~pre6_686| |v_main_#t~pre6_681|)) (.cse3 (= |v_main_#t~pre7_1825| |v_main_#t~pre7_1801|)) (.cse4 (= |v_main_#t~pre5_189| |v_main_#t~pre5_188|)) (.cse5 (= |v_main_#t~pre4_154| |v_main_#t~pre4_153|)) (.cse6 (= v_main_~d~0_2582 v_main_~d~0_2553))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~a~0_190 v_main_~a~0_189) .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (= v_main_~a~0_189 v_main_~a~0_190) .cse4 .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_1825|, main_~c~0=v_main_~c~0_898, main_~d~0=v_main_~d~0_2582, main_~b~0=v_main_~b~0_260, main_#t~pre4=|v_main_#t~pre4_154|, main_#t~pre5=|v_main_#t~pre5_189|, main_~a~0=v_main_~a~0_190, main_#t~pre6=|v_main_#t~pre6_686|} OutVars{main_#t~pre7=|v_main_#t~pre7_1801|, main_~c~0=v_main_~c~0_892, main_~d~0=v_main_~d~0_2553, main_~b~0=v_main_~b~0_258, main_#t~pre4=|v_main_#t~pre4_153|, main_#t~pre5=|v_main_#t~pre5_188|, main_~a~0=v_main_~a~0_189, main_#t~pre6=|v_main_#t~pre6_681|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {13040#(= main_~a~0 0)} is VALID [2022-04-15 07:12:57,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {13040#(= main_~a~0 0)} [131] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {13036#false} is VALID [2022-04-15 07:12:57,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {13036#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {13036#false} is VALID [2022-04-15 07:12:57,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {13036#false} assume !false; {13036#false} is VALID [2022-04-15 07:12:57,116 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 07:12:57,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:12:57,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088258255] [2022-04-15 07:12:57,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088258255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:57,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:57,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:12:57,973 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:12:57,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2117512162] [2022-04-15 07:12:57,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2117512162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:57,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:57,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 07:12:57,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195411021] [2022-04-15 07:12:57,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:12:57,974 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 35 states have internal predecessors, (75), 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 78 [2022-04-15 07:12:57,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:12:57,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 35 states have internal predecessors, (75), 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 07:12:58,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:58,024 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 07:12:58,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:58,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 07:12:58,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1121, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 07:12:58,025 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 35 states have internal predecessors, (75), 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 07:13:00,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:00,863 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2022-04-15 07:13:00,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 07:13:00,864 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 35 states have internal predecessors, (75), 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 78 [2022-04-15 07:13:00,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:13:00,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 35 states have internal predecessors, (75), 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 07:13:00,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 117 transitions. [2022-04-15 07:13:00,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 35 states have internal predecessors, (75), 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 07:13:00,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 117 transitions. [2022-04-15 07:13:00,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 117 transitions. [2022-04-15 07:13:00,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:00,948 INFO L225 Difference]: With dead ends: 105 [2022-04-15 07:13:00,948 INFO L226 Difference]: Without dead ends: 94 [2022-04-15 07:13:00,949 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 30 SyntacticMatches, 15 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=411, Invalid=4281, Unknown=0, NotChecked=0, Total=4692 [2022-04-15 07:13:00,949 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 155 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:13:00,949 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 18 Invalid, 1822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1713 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 07:13:00,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-15 07:13:00,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 81. [2022-04-15 07:13:00,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:13:00,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 81 states, 77 states have (on average 1.051948051948052) internal successors, (81), 77 states have internal predecessors, (81), 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 07:13:00,977 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 81 states, 77 states have (on average 1.051948051948052) internal successors, (81), 77 states have internal predecessors, (81), 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 07:13:00,977 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 81 states, 77 states have (on average 1.051948051948052) internal successors, (81), 77 states have internal predecessors, (81), 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 07:13:00,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:00,978 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-04-15 07:13:00,978 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2022-04-15 07:13:00,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:00,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:00,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 77 states have (on average 1.051948051948052) internal successors, (81), 77 states have internal predecessors, (81), 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 94 states. [2022-04-15 07:13:00,979 INFO L87 Difference]: Start difference. First operand has 81 states, 77 states have (on average 1.051948051948052) internal successors, (81), 77 states have internal predecessors, (81), 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 94 states. [2022-04-15 07:13:00,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:00,979 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-04-15 07:13:00,979 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2022-04-15 07:13:00,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:00,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:00,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:13:00,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:13:00,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 77 states have (on average 1.051948051948052) internal successors, (81), 77 states have internal predecessors, (81), 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 07:13:00,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2022-04-15 07:13:00,980 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 78 [2022-04-15 07:13:00,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:13:00,980 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2022-04-15 07:13:00,981 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.0833333333333335) internal successors, (75), 35 states have internal predecessors, (75), 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 07:13:00,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 84 transitions. [2022-04-15 07:13:01,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:01,138 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2022-04-15 07:13:01,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-15 07:13:01,138 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:13:01,138 INFO L499 BasicCegarLoop]: trace histogram [25, 25, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:13:01,138 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-15 07:13:01,138 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:13:01,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:13:01,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1927777668, now seen corresponding path program 29 times [2022-04-15 07:13:01,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:01,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1197761080] [2022-04-15 07:13:01,365 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:01,470 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:05,545 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:13:05,588 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:05,673 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:05,770 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:05,870 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:06,028 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:06,029 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:13:06,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1741773699, now seen corresponding path program 1 times [2022-04-15 07:13:06,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:13:06,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023191595] [2022-04-15 07:13:06,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:13:06,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:13:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:06,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:13:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:06,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {13708#(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); {13702#true} is VALID [2022-04-15 07:13:06,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {13702#true} assume true; {13702#true} is VALID [2022-04-15 07:13:06,059 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13702#true} {13702#true} #68#return; {13702#true} is VALID [2022-04-15 07:13:06,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {13702#true} call ULTIMATE.init(); {13708#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:13:06,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {13708#(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); {13702#true} is VALID [2022-04-15 07:13:06,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {13702#true} assume true; {13702#true} is VALID [2022-04-15 07:13:06,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13702#true} {13702#true} #68#return; {13702#true} is VALID [2022-04-15 07:13:06,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {13702#true} call #t~ret8 := main(); {13702#true} is VALID [2022-04-15 07:13:06,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {13702#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {13707#(= main_~a~0 0)} is VALID [2022-04-15 07:13:06,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {13707#(= main_~a~0 0)} [134] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~d~0_2722 v_main_~d~0_2692)) (.cse1 (= |v_main_#t~pre7_1914| |v_main_#t~pre7_1889|)) (.cse2 (= |v_main_#t~pre4_159| |v_main_#t~pre4_158|)) (.cse3 (= v_main_~b~0_268 v_main_~b~0_266)) (.cse4 (= v_main_~c~0_941 v_main_~c~0_935)) (.cse5 (= v_main_~a~0_196 v_main_~a~0_195))) (or (and .cse0 (= |v_main_#t~pre6_719| |v_main_#t~pre6_714|) (= |v_main_#t~pre5_195| |v_main_#t~pre5_194|) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (= |v_main_#t~pre6_714| |v_main_#t~pre6_719|) .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_main_#t~pre5_194| |v_main_#t~pre5_195|)))) InVars {main_#t~pre7=|v_main_#t~pre7_1914|, main_~c~0=v_main_~c~0_941, main_~d~0=v_main_~d~0_2722, main_~b~0=v_main_~b~0_268, main_#t~pre4=|v_main_#t~pre4_159|, main_#t~pre5=|v_main_#t~pre5_195|, main_~a~0=v_main_~a~0_196, main_#t~pre6=|v_main_#t~pre6_719|} OutVars{main_#t~pre7=|v_main_#t~pre7_1889|, main_~c~0=v_main_~c~0_935, main_~d~0=v_main_~d~0_2692, main_~b~0=v_main_~b~0_266, main_#t~pre4=|v_main_#t~pre4_158|, main_#t~pre5=|v_main_#t~pre5_194|, main_~a~0=v_main_~a~0_195, main_#t~pre6=|v_main_#t~pre6_714|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {13707#(= main_~a~0 0)} is VALID [2022-04-15 07:13:06,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {13707#(= main_~a~0 0)} [133] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {13703#false} is VALID [2022-04-15 07:13:06,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {13703#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {13703#false} is VALID [2022-04-15 07:13:06,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {13703#false} assume !false; {13703#false} is VALID [2022-04-15 07:13:06,062 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 07:13:06,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:13:06,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023191595] [2022-04-15 07:13:06,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023191595] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:06,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:06,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:13:06,959 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:13:06,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1197761080] [2022-04-15 07:13:06,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1197761080] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:06,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:06,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-15 07:13:06,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18837566] [2022-04-15 07:13:06,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:13:06,960 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.081081081081081) internal successors, (77), 36 states have internal predecessors, (77), 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 80 [2022-04-15 07:13:06,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:13:06,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 2.081081081081081) internal successors, (77), 36 states have internal predecessors, (77), 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 07:13:07,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:07,012 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-15 07:13:07,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:07,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-15 07:13:07,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1189, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 07:13:07,013 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 37 states, 37 states have (on average 2.081081081081081) internal successors, (77), 36 states have internal predecessors, (77), 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 07:13:10,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:10,179 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2022-04-15 07:13:10,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 07:13:10,180 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.081081081081081) internal successors, (77), 36 states have internal predecessors, (77), 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 80 [2022-04-15 07:13:10,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:13:10,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.081081081081081) internal successors, (77), 36 states have internal predecessors, (77), 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 07:13:10,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 119 transitions. [2022-04-15 07:13:10,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.081081081081081) internal successors, (77), 36 states have internal predecessors, (77), 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 07:13:10,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 119 transitions. [2022-04-15 07:13:10,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 119 transitions. [2022-04-15 07:13:10,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:10,266 INFO L225 Difference]: With dead ends: 107 [2022-04-15 07:13:10,267 INFO L226 Difference]: Without dead ends: 96 [2022-04-15 07:13:10,267 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 33 SyntacticMatches, 13 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=423, Invalid=4547, Unknown=0, NotChecked=0, Total=4970 [2022-04-15 07:13:10,267 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 111 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:13:10,268 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 68 Invalid, 1961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1889 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-15 07:13:10,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-15 07:13:10,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 83. [2022-04-15 07:13:10,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:13:10,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 83 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 79 states have internal predecessors, (83), 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 07:13:10,297 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 83 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 79 states have internal predecessors, (83), 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 07:13:10,297 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 83 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 79 states have internal predecessors, (83), 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 07:13:10,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:10,298 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-15 07:13:10,298 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-04-15 07:13:10,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:10,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:10,298 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 79 states have internal predecessors, (83), 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 96 states. [2022-04-15 07:13:10,298 INFO L87 Difference]: Start difference. First operand has 83 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 79 states have internal predecessors, (83), 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 96 states. [2022-04-15 07:13:10,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:10,299 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-04-15 07:13:10,299 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-04-15 07:13:10,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:10,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:10,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:13:10,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:13:10,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 79 states have internal predecessors, (83), 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 07:13:10,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2022-04-15 07:13:10,300 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 80 [2022-04-15 07:13:10,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:13:10,300 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2022-04-15 07:13:10,300 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.081081081081081) internal successors, (77), 36 states have internal predecessors, (77), 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 07:13:10,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 86 transitions. [2022-04-15 07:13:10,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:10,460 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2022-04-15 07:13:10,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-15 07:13:10,460 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:13:10,460 INFO L499 BasicCegarLoop]: trace histogram [26, 26, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:13:10,460 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-15 07:13:10,460 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:13:10,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:13:10,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1529611942, now seen corresponding path program 30 times [2022-04-15 07:13:10,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:10,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1662559273] [2022-04-15 07:13:10,678 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:14,761 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:13:14,803 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:14,902 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:18,986 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:13:19,029 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:19,124 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:21,276 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:21,426 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:21,427 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:13:21,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1741835203, now seen corresponding path program 1 times [2022-04-15 07:13:21,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:13:21,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641593861] [2022-04-15 07:13:21,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:13:21,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:13:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:21,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:13:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:21,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {14390#(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); {14384#true} is VALID [2022-04-15 07:13:21,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {14384#true} assume true; {14384#true} is VALID [2022-04-15 07:13:21,458 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14384#true} {14384#true} #68#return; {14384#true} is VALID [2022-04-15 07:13:21,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {14384#true} call ULTIMATE.init(); {14390#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:13:21,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {14390#(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); {14384#true} is VALID [2022-04-15 07:13:21,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {14384#true} assume true; {14384#true} is VALID [2022-04-15 07:13:21,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14384#true} {14384#true} #68#return; {14384#true} is VALID [2022-04-15 07:13:21,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {14384#true} call #t~ret8 := main(); {14384#true} is VALID [2022-04-15 07:13:21,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {14384#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {14389#(= main_~a~0 0)} is VALID [2022-04-15 07:13:21,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {14389#(= main_~a~0 0)} [136] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_164| |v_main_#t~pre4_163|)) (.cse1 (= v_main_~b~0_276 v_main_~b~0_274)) (.cse2 (= |v_main_#t~pre6_752| |v_main_#t~pre6_747|)) (.cse3 (= v_main_~a~0_202 v_main_~a~0_201)) (.cse4 (= v_main_~c~0_984 v_main_~c~0_978)) (.cse5 (= v_main_~d~0_2866 v_main_~d~0_2835)) (.cse6 (= |v_main_#t~pre5_201| |v_main_#t~pre5_200|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_main_#t~pre7_2011| |v_main_#t~pre7_1985|) .cse6) (and .cse0 (= |v_main_#t~pre7_1985| |v_main_#t~pre7_2011|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_2011|, main_~c~0=v_main_~c~0_984, main_~d~0=v_main_~d~0_2866, main_~b~0=v_main_~b~0_276, main_#t~pre4=|v_main_#t~pre4_164|, main_#t~pre5=|v_main_#t~pre5_201|, main_~a~0=v_main_~a~0_202, main_#t~pre6=|v_main_#t~pre6_752|} OutVars{main_#t~pre7=|v_main_#t~pre7_1985|, main_~c~0=v_main_~c~0_978, main_~d~0=v_main_~d~0_2835, main_~b~0=v_main_~b~0_274, main_#t~pre4=|v_main_#t~pre4_163|, main_#t~pre5=|v_main_#t~pre5_200|, main_~a~0=v_main_~a~0_201, main_#t~pre6=|v_main_#t~pre6_747|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {14389#(= main_~a~0 0)} is VALID [2022-04-15 07:13:21,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {14389#(= main_~a~0 0)} [135] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {14385#false} is VALID [2022-04-15 07:13:21,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {14385#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {14385#false} is VALID [2022-04-15 07:13:21,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {14385#false} assume !false; {14385#false} is VALID [2022-04-15 07:13:21,461 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 07:13:21,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:13:21,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641593861] [2022-04-15 07:13:21,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641593861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:21,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:21,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:13:22,477 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:13:22,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1662559273] [2022-04-15 07:13:22,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1662559273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:22,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:22,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 07:13:22,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101413924] [2022-04-15 07:13:22,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:13:22,477 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 37 states have internal predecessors, (79), 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 82 [2022-04-15 07:13:22,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:13:22,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 37 states have internal predecessors, (79), 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 07:13:22,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:22,534 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 07:13:22,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:22,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 07:13:22,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1259, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 07:13:22,534 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand has 38 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 37 states have internal predecessors, (79), 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 07:13:26,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:26,190 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2022-04-15 07:13:26,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 07:13:26,190 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 37 states have internal predecessors, (79), 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 82 [2022-04-15 07:13:26,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:13:26,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 37 states have internal predecessors, (79), 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 07:13:26,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 121 transitions. [2022-04-15 07:13:26,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 37 states have internal predecessors, (79), 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 07:13:26,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 121 transitions. [2022-04-15 07:13:26,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 121 transitions. [2022-04-15 07:13:26,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:26,275 INFO L225 Difference]: With dead ends: 109 [2022-04-15 07:13:26,275 INFO L226 Difference]: Without dead ends: 98 [2022-04-15 07:13:26,275 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 29 SyntacticMatches, 18 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=435, Invalid=4821, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 07:13:26,276 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 121 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2297 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 2377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:13:26,276 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 78 Invalid, 2377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2297 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-15 07:13:26,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-15 07:13:26,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2022-04-15 07:13:26,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:13:26,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 85 states, 81 states have (on average 1.0493827160493827) internal successors, (85), 81 states have internal predecessors, (85), 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 07:13:26,306 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 85 states, 81 states have (on average 1.0493827160493827) internal successors, (85), 81 states have internal predecessors, (85), 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 07:13:26,306 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 85 states, 81 states have (on average 1.0493827160493827) internal successors, (85), 81 states have internal predecessors, (85), 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 07:13:26,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:26,306 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2022-04-15 07:13:26,307 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2022-04-15 07:13:26,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:26,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:26,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 81 states have (on average 1.0493827160493827) internal successors, (85), 81 states have internal predecessors, (85), 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 98 states. [2022-04-15 07:13:26,307 INFO L87 Difference]: Start difference. First operand has 85 states, 81 states have (on average 1.0493827160493827) internal successors, (85), 81 states have internal predecessors, (85), 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 98 states. [2022-04-15 07:13:26,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:26,308 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2022-04-15 07:13:26,308 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2022-04-15 07:13:26,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:26,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:26,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:13:26,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:13:26,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 81 states have (on average 1.0493827160493827) internal successors, (85), 81 states have internal predecessors, (85), 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 07:13:26,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2022-04-15 07:13:26,309 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 82 [2022-04-15 07:13:26,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:13:26,309 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2022-04-15 07:13:26,309 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 37 states have internal predecessors, (79), 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 07:13:26,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 88 transitions. [2022-04-15 07:13:26,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:26,477 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2022-04-15 07:13:26,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-15 07:13:26,477 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:13:26,478 INFO L499 BasicCegarLoop]: trace histogram [27, 27, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:13:26,478 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-15 07:13:26,478 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:13:26,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:13:26,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1144438600, now seen corresponding path program 31 times [2022-04-15 07:13:26,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:26,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [143096681] [2022-04-15 07:13:26,673 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:26,787 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:26,883 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:26,997 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:27,093 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:27,219 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:27,378 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:27,378 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:13:27,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1741896707, now seen corresponding path program 1 times [2022-04-15 07:13:27,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:13:27,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794298774] [2022-04-15 07:13:27,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:13:27,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:13:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:27,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:13:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:27,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {15087#(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); {15081#true} is VALID [2022-04-15 07:13:27,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {15081#true} assume true; {15081#true} is VALID [2022-04-15 07:13:27,409 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15081#true} {15081#true} #68#return; {15081#true} is VALID [2022-04-15 07:13:27,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {15081#true} call ULTIMATE.init(); {15087#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:13:27,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {15087#(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); {15081#true} is VALID [2022-04-15 07:13:27,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {15081#true} assume true; {15081#true} is VALID [2022-04-15 07:13:27,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15081#true} {15081#true} #68#return; {15081#true} is VALID [2022-04-15 07:13:27,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {15081#true} call #t~ret8 := main(); {15081#true} is VALID [2022-04-15 07:13:27,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {15081#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {15086#(= main_~a~0 0)} is VALID [2022-04-15 07:13:27,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {15086#(= main_~a~0 0)} [138] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_207| |v_main_#t~pre5_206|)) (.cse1 (= v_main_~c~0_1027 v_main_~c~0_1021)) (.cse2 (= |v_main_#t~pre4_169| |v_main_#t~pre4_168|)) (.cse3 (= v_main_~b~0_284 v_main_~b~0_282)) (.cse4 (= v_main_~a~0_208 v_main_~a~0_207)) (.cse5 (= |v_main_#t~pre6_785| |v_main_#t~pre6_780|))) (or (and (= |v_main_#t~pre7_2111| |v_main_#t~pre7_2084|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= v_main_~d~0_3014 v_main_~d~0_2982)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= v_main_~d~0_2982 v_main_~d~0_3014) (= |v_main_#t~pre7_2084| |v_main_#t~pre7_2111|)))) InVars {main_#t~pre7=|v_main_#t~pre7_2111|, main_~c~0=v_main_~c~0_1027, main_~d~0=v_main_~d~0_3014, main_~b~0=v_main_~b~0_284, main_#t~pre4=|v_main_#t~pre4_169|, main_#t~pre5=|v_main_#t~pre5_207|, main_~a~0=v_main_~a~0_208, main_#t~pre6=|v_main_#t~pre6_785|} OutVars{main_#t~pre7=|v_main_#t~pre7_2084|, main_~c~0=v_main_~c~0_1021, main_~d~0=v_main_~d~0_2982, main_~b~0=v_main_~b~0_282, main_#t~pre4=|v_main_#t~pre4_168|, main_#t~pre5=|v_main_#t~pre5_206|, main_~a~0=v_main_~a~0_207, main_#t~pre6=|v_main_#t~pre6_780|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {15086#(= main_~a~0 0)} is VALID [2022-04-15 07:13:27,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {15086#(= main_~a~0 0)} [137] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {15082#false} is VALID [2022-04-15 07:13:27,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {15082#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {15082#false} is VALID [2022-04-15 07:13:27,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {15082#false} assume !false; {15082#false} is VALID [2022-04-15 07:13:27,412 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 07:13:27,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:13:27,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794298774] [2022-04-15 07:13:27,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794298774] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:27,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:27,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:13:28,473 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:13:28,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [143096681] [2022-04-15 07:13:28,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [143096681] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:28,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:28,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-15 07:13:28,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349262810] [2022-04-15 07:13:28,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:13:28,473 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.076923076923077) internal successors, (81), 38 states have internal predecessors, (81), 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 84 [2022-04-15 07:13:28,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:13:28,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 2.076923076923077) internal successors, (81), 38 states have internal predecessors, (81), 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 07:13:28,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:28,531 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-15 07:13:28,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:28,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-15 07:13:28,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1331, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 07:13:28,532 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 39 states, 39 states have (on average 2.076923076923077) internal successors, (81), 38 states have internal predecessors, (81), 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 07:13:32,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:32,262 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2022-04-15 07:13:32,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 07:13:32,263 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.076923076923077) internal successors, (81), 38 states have internal predecessors, (81), 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 84 [2022-04-15 07:13:32,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:13:32,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.076923076923077) internal successors, (81), 38 states have internal predecessors, (81), 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 07:13:32,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 123 transitions. [2022-04-15 07:13:32,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.076923076923077) internal successors, (81), 38 states have internal predecessors, (81), 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 07:13:32,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 123 transitions. [2022-04-15 07:13:32,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 123 transitions. [2022-04-15 07:13:32,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:32,356 INFO L225 Difference]: With dead ends: 111 [2022-04-15 07:13:32,356 INFO L226 Difference]: Without dead ends: 100 [2022-04-15 07:13:32,357 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 32 SyntacticMatches, 16 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1043 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=447, Invalid=5103, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 07:13:32,357 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 163 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 2495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-15 07:13:32,358 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 53 Invalid, 2495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-15 07:13:32,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-15 07:13:32,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 87. [2022-04-15 07:13:32,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:13:32,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 87 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 83 states have internal predecessors, (87), 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 07:13:32,393 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 87 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 83 states have internal predecessors, (87), 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 07:13:32,393 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 87 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 83 states have internal predecessors, (87), 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 07:13:32,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:32,394 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2022-04-15 07:13:32,394 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2022-04-15 07:13:32,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:32,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:32,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 83 states have internal predecessors, (87), 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 100 states. [2022-04-15 07:13:32,395 INFO L87 Difference]: Start difference. First operand has 87 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 83 states have internal predecessors, (87), 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 100 states. [2022-04-15 07:13:32,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:32,396 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2022-04-15 07:13:32,396 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2022-04-15 07:13:32,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:32,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:32,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:13:32,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:13:32,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 83 states have internal predecessors, (87), 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 07:13:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2022-04-15 07:13:32,397 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 84 [2022-04-15 07:13:32,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:13:32,398 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2022-04-15 07:13:32,398 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.076923076923077) internal successors, (81), 38 states have internal predecessors, (81), 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 07:13:32,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 90 transitions. [2022-04-15 07:13:32,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:32,583 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2022-04-15 07:13:32,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-15 07:13:32,584 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:13:32,584 INFO L499 BasicCegarLoop]: trace histogram [28, 28, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:13:32,584 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-15 07:13:32,584 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:13:32,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:13:32,584 INFO L85 PathProgramCache]: Analyzing trace with hash -360044394, now seen corresponding path program 32 times [2022-04-15 07:13:32,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:32,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1259499342] [2022-04-15 07:13:32,798 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:32,915 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:33,010 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:33,133 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:33,226 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:33,347 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:33,514 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:33,515 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:13:33,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1741958211, now seen corresponding path program 1 times [2022-04-15 07:13:33,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:13:33,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643311643] [2022-04-15 07:13:33,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:13:33,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:13:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:33,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:13:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:33,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {15799#(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); {15793#true} is VALID [2022-04-15 07:13:33,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {15793#true} assume true; {15793#true} is VALID [2022-04-15 07:13:33,543 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15793#true} {15793#true} #68#return; {15793#true} is VALID [2022-04-15 07:13:33,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {15793#true} call ULTIMATE.init(); {15799#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:13:33,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {15799#(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); {15793#true} is VALID [2022-04-15 07:13:33,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {15793#true} assume true; {15793#true} is VALID [2022-04-15 07:13:33,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15793#true} {15793#true} #68#return; {15793#true} is VALID [2022-04-15 07:13:33,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {15793#true} call #t~ret8 := main(); {15793#true} is VALID [2022-04-15 07:13:33,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {15793#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {15798#(= main_~a~0 0)} is VALID [2022-04-15 07:13:33,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {15798#(= main_~a~0 0)} [140] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_214 v_main_~a~0_213)) (.cse1 (= |v_main_#t~pre5_213| |v_main_#t~pre5_212|)) (.cse2 (= v_main_~b~0_292 v_main_~b~0_290)) (.cse3 (= v_main_~d~0_3166 v_main_~d~0_3133)) (.cse4 (= |v_main_#t~pre7_2214| |v_main_#t~pre7_2186|)) (.cse5 (= v_main_~c~0_1070 v_main_~c~0_1064))) (or (and (= |v_main_#t~pre4_173| |v_main_#t~pre4_174|) .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre6_813| |v_main_#t~pre6_818|) .cse5) (and .cse0 (= |v_main_#t~pre6_818| |v_main_#t~pre6_813|) .cse1 .cse2 .cse3 (= |v_main_#t~pre4_174| |v_main_#t~pre4_173|) .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_2214|, main_~c~0=v_main_~c~0_1070, main_~d~0=v_main_~d~0_3166, main_~b~0=v_main_~b~0_292, main_#t~pre4=|v_main_#t~pre4_174|, main_#t~pre5=|v_main_#t~pre5_213|, main_~a~0=v_main_~a~0_214, main_#t~pre6=|v_main_#t~pre6_818|} OutVars{main_#t~pre7=|v_main_#t~pre7_2186|, main_~c~0=v_main_~c~0_1064, main_~d~0=v_main_~d~0_3133, main_~b~0=v_main_~b~0_290, main_#t~pre4=|v_main_#t~pre4_173|, main_#t~pre5=|v_main_#t~pre5_212|, main_~a~0=v_main_~a~0_213, main_#t~pre6=|v_main_#t~pre6_813|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {15798#(= main_~a~0 0)} is VALID [2022-04-15 07:13:33,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {15798#(= main_~a~0 0)} [139] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {15794#false} is VALID [2022-04-15 07:13:33,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {15794#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {15794#false} is VALID [2022-04-15 07:13:33,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {15794#false} assume !false; {15794#false} is VALID [2022-04-15 07:13:33,546 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 07:13:33,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:13:33,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643311643] [2022-04-15 07:13:33,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643311643] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:33,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:33,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:13:34,600 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:13:34,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1259499342] [2022-04-15 07:13:34,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1259499342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:34,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:34,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 07:13:34,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490548672] [2022-04-15 07:13:34,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:13:34,601 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.075) internal successors, (83), 39 states have internal predecessors, (83), 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 86 [2022-04-15 07:13:34,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:13:34,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 2.075) internal successors, (83), 39 states have internal predecessors, (83), 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 07:13:34,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:34,658 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 07:13:34,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:34,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 07:13:34,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1405, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 07:13:34,659 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand has 40 states, 40 states have (on average 2.075) internal successors, (83), 39 states have internal predecessors, (83), 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 07:13:38,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:38,329 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2022-04-15 07:13:38,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 07:13:38,329 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.075) internal successors, (83), 39 states have internal predecessors, (83), 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 86 [2022-04-15 07:13:38,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:13:38,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.075) internal successors, (83), 39 states have internal predecessors, (83), 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 07:13:38,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 125 transitions. [2022-04-15 07:13:38,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.075) internal successors, (83), 39 states have internal predecessors, (83), 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 07:13:38,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 125 transitions. [2022-04-15 07:13:38,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 125 transitions. [2022-04-15 07:13:38,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:38,422 INFO L225 Difference]: With dead ends: 113 [2022-04-15 07:13:38,422 INFO L226 Difference]: Without dead ends: 102 [2022-04-15 07:13:38,422 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 32 SyntacticMatches, 17 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=459, Invalid=5393, Unknown=0, NotChecked=0, Total=5852 [2022-04-15 07:13:38,423 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 126 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 2336 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 2420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 2336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:13:38,423 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 38 Invalid, 2420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 2336 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-15 07:13:38,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-15 07:13:38,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 89. [2022-04-15 07:13:38,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:13:38,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 89 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 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 07:13:38,457 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 89 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 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 07:13:38,457 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 89 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 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 07:13:38,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:38,458 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2022-04-15 07:13:38,458 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2022-04-15 07:13:38,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:38,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:38,458 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 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 102 states. [2022-04-15 07:13:38,458 INFO L87 Difference]: Start difference. First operand has 89 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 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 102 states. [2022-04-15 07:13:38,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:38,459 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2022-04-15 07:13:38,459 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2022-04-15 07:13:38,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:38,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:38,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:13:38,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:13:38,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 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 07:13:38,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2022-04-15 07:13:38,460 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 86 [2022-04-15 07:13:38,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:13:38,460 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2022-04-15 07:13:38,460 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.075) internal successors, (83), 39 states have internal predecessors, (83), 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 07:13:38,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 92 transitions. [2022-04-15 07:13:38,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:38,665 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2022-04-15 07:13:38,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-15 07:13:38,666 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:13:38,666 INFO L499 BasicCegarLoop]: trace histogram [29, 29, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:13:38,666 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-15 07:13:38,666 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:13:38,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:13:38,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1823510772, now seen corresponding path program 33 times [2022-04-15 07:13:38,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:38,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1106075629] [2022-04-15 07:13:38,948 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:43,042 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:13:43,090 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:43,183 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:47,270 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:13:47,320 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:47,422 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:51,517 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:13:51,575 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:51,810 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:51,810 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:13:51,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1742019715, now seen corresponding path program 1 times [2022-04-15 07:13:51,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:13:51,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376472326] [2022-04-15 07:13:51,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:13:51,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:13:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:51,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:13:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:51,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {16526#(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); {16520#true} is VALID [2022-04-15 07:13:51,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {16520#true} assume true; {16520#true} is VALID [2022-04-15 07:13:51,836 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16520#true} {16520#true} #68#return; {16520#true} is VALID [2022-04-15 07:13:51,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {16520#true} call ULTIMATE.init(); {16526#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:13:51,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {16526#(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); {16520#true} is VALID [2022-04-15 07:13:51,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {16520#true} assume true; {16520#true} is VALID [2022-04-15 07:13:51,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16520#true} {16520#true} #68#return; {16520#true} is VALID [2022-04-15 07:13:51,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {16520#true} call #t~ret8 := main(); {16520#true} is VALID [2022-04-15 07:13:51,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {16520#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {16525#(= main_~a~0 0)} is VALID [2022-04-15 07:13:51,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {16525#(= main_~a~0 0)} [142] L22-3-->L22-4_primed: Formula: (and (= |v_main_#t~pre6_851| |v_main_#t~pre6_846|) (= v_main_~c~0_1113 v_main_~c~0_1107) (= |v_main_#t~pre5_219| |v_main_#t~pre5_218|) (= |v_main_#t~pre7_2320| |v_main_#t~pre7_2291|) (= |v_main_#t~pre4_179| |v_main_#t~pre4_178|) (= v_main_~a~0_220 v_main_~a~0_219) (= v_main_~d~0_3322 v_main_~d~0_3288) (= v_main_~b~0_300 v_main_~b~0_298)) InVars {main_#t~pre7=|v_main_#t~pre7_2320|, main_~c~0=v_main_~c~0_1113, main_~d~0=v_main_~d~0_3322, main_~b~0=v_main_~b~0_300, main_#t~pre4=|v_main_#t~pre4_179|, main_#t~pre5=|v_main_#t~pre5_219|, main_~a~0=v_main_~a~0_220, main_#t~pre6=|v_main_#t~pre6_851|} OutVars{main_#t~pre7=|v_main_#t~pre7_2291|, main_~c~0=v_main_~c~0_1107, main_~d~0=v_main_~d~0_3288, main_~b~0=v_main_~b~0_298, main_#t~pre4=|v_main_#t~pre4_178|, main_#t~pre5=|v_main_#t~pre5_218|, main_~a~0=v_main_~a~0_219, main_#t~pre6=|v_main_#t~pre6_846|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {16525#(= main_~a~0 0)} is VALID [2022-04-15 07:13:51,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {16525#(= main_~a~0 0)} [141] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {16521#false} is VALID [2022-04-15 07:13:51,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {16521#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {16521#false} is VALID [2022-04-15 07:13:51,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {16521#false} assume !false; {16521#false} is VALID [2022-04-15 07:13:51,839 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 07:13:51,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:13:51,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376472326] [2022-04-15 07:13:51,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376472326] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:51,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:51,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:13:53,190 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:13:53,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1106075629] [2022-04-15 07:13:53,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1106075629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:53,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:53,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-15 07:13:53,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139703609] [2022-04-15 07:13:53,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:13:53,191 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.073170731707317) internal successors, (85), 40 states have internal predecessors, (85), 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 88 [2022-04-15 07:13:53,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:13:53,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 2.073170731707317) internal successors, (85), 40 states have internal predecessors, (85), 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 07:13:53,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:53,272 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-15 07:13:53,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:53,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-15 07:13:53,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1481, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 07:13:53,273 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand has 41 states, 41 states have (on average 2.073170731707317) internal successors, (85), 40 states have internal predecessors, (85), 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 07:13:57,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:57,352 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2022-04-15 07:13:57,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-15 07:13:57,352 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.073170731707317) internal successors, (85), 40 states have internal predecessors, (85), 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 88 [2022-04-15 07:13:57,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:13:57,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.073170731707317) internal successors, (85), 40 states have internal predecessors, (85), 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 07:13:57,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 130 transitions. [2022-04-15 07:13:57,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.073170731707317) internal successors, (85), 40 states have internal predecessors, (85), 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 07:13:57,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 130 transitions. [2022-04-15 07:13:57,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 130 transitions. [2022-04-15 07:13:57,449 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 07:13:57,450 INFO L225 Difference]: With dead ends: 117 [2022-04-15 07:13:57,450 INFO L226 Difference]: Without dead ends: 106 [2022-04-15 07:13:57,451 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 29 SyntacticMatches, 21 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1177 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=471, Invalid=5691, Unknown=0, NotChecked=0, Total=6162 [2022-04-15 07:13:57,451 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 164 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 2559 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 2681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-15 07:13:57,451 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 28 Invalid, 2681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2559 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-15 07:13:57,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-15 07:13:57,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 93. [2022-04-15 07:13:57,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:13:57,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 93 states, 89 states have (on average 1.0449438202247192) internal successors, (93), 89 states have internal predecessors, (93), 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 07:13:57,497 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 93 states, 89 states have (on average 1.0449438202247192) internal successors, (93), 89 states have internal predecessors, (93), 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 07:13:57,497 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 93 states, 89 states have (on average 1.0449438202247192) internal successors, (93), 89 states have internal predecessors, (93), 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 07:13:57,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:57,498 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2022-04-15 07:13:57,498 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2022-04-15 07:13:57,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:57,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:57,499 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 89 states have (on average 1.0449438202247192) internal successors, (93), 89 states have internal predecessors, (93), 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 106 states. [2022-04-15 07:13:57,499 INFO L87 Difference]: Start difference. First operand has 93 states, 89 states have (on average 1.0449438202247192) internal successors, (93), 89 states have internal predecessors, (93), 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 106 states. [2022-04-15 07:13:57,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:57,500 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2022-04-15 07:13:57,500 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2022-04-15 07:13:57,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:57,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:57,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:13:57,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:13:57,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 89 states have (on average 1.0449438202247192) internal successors, (93), 89 states have internal predecessors, (93), 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 07:13:57,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2022-04-15 07:13:57,502 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 88 [2022-04-15 07:13:57,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:13:57,502 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2022-04-15 07:13:57,502 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.073170731707317) internal successors, (85), 40 states have internal predecessors, (85), 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 07:13:57,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 96 transitions. [2022-04-15 07:13:57,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:57,684 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2022-04-15 07:13:57,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-15 07:13:57,684 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:13:57,684 INFO L499 BasicCegarLoop]: trace histogram [30, 30, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:13:57,685 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-04-15 07:13:57,685 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:13:57,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:13:57,685 INFO L85 PathProgramCache]: Analyzing trace with hash -18982446, now seen corresponding path program 34 times [2022-04-15 07:13:57,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:57,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1980929792] [2022-04-15 07:13:57,914 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:00,060 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:14:00,110 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:00,208 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:02,317 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:14:02,371 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:02,465 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:06,546 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:14:06,596 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:06,767 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:06,768 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:14:06,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1742081219, now seen corresponding path program 1 times [2022-04-15 07:14:06,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:14:06,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636037317] [2022-04-15 07:14:06,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:14:06,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:14:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:14:06,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:14:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:14:06,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {17280#(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); {17274#true} is VALID [2022-04-15 07:14:06,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {17274#true} assume true; {17274#true} is VALID [2022-04-15 07:14:06,795 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17274#true} {17274#true} #68#return; {17274#true} is VALID [2022-04-15 07:14:06,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {17274#true} call ULTIMATE.init(); {17280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:14:06,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {17280#(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); {17274#true} is VALID [2022-04-15 07:14:06,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {17274#true} assume true; {17274#true} is VALID [2022-04-15 07:14:06,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17274#true} {17274#true} #68#return; {17274#true} is VALID [2022-04-15 07:14:06,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {17274#true} call #t~ret8 := main(); {17274#true} is VALID [2022-04-15 07:14:06,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {17274#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {17279#(= main_~a~0 0)} is VALID [2022-04-15 07:14:06,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {17279#(= main_~a~0 0)} [144] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_226 v_main_~a~0_225)) (.cse1 (= v_main_~b~0_308 v_main_~b~0_306)) (.cse2 (= v_main_~c~0_1154 v_main_~c~0_1148)) (.cse3 (= v_main_~d~0_3475 v_main_~d~0_3440)) (.cse4 (= |v_main_#t~pre5_225| |v_main_#t~pre5_224|)) (.cse5 (= |v_main_#t~pre4_184| |v_main_#t~pre4_183|)) (.cse6 (= |v_main_#t~pre7_2423| |v_main_#t~pre7_2393|))) (or (and .cse0 .cse1 (= |v_main_#t~pre6_883| |v_main_#t~pre6_878|) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (= |v_main_#t~pre6_878| |v_main_#t~pre6_883|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_2423|, main_~c~0=v_main_~c~0_1154, main_~d~0=v_main_~d~0_3475, main_~b~0=v_main_~b~0_308, main_#t~pre4=|v_main_#t~pre4_184|, main_#t~pre5=|v_main_#t~pre5_225|, main_~a~0=v_main_~a~0_226, main_#t~pre6=|v_main_#t~pre6_883|} OutVars{main_#t~pre7=|v_main_#t~pre7_2393|, main_~c~0=v_main_~c~0_1148, main_~d~0=v_main_~d~0_3440, main_~b~0=v_main_~b~0_306, main_#t~pre4=|v_main_#t~pre4_183|, main_#t~pre5=|v_main_#t~pre5_224|, main_~a~0=v_main_~a~0_225, main_#t~pre6=|v_main_#t~pre6_878|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {17279#(= main_~a~0 0)} is VALID [2022-04-15 07:14:06,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {17279#(= main_~a~0 0)} [143] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {17275#false} is VALID [2022-04-15 07:14:06,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {17275#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {17275#false} is VALID [2022-04-15 07:14:06,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {17275#false} assume !false; {17275#false} is VALID [2022-04-15 07:14:06,797 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 07:14:06,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:14:06,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636037317] [2022-04-15 07:14:06,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636037317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:14:06,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:14:06,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:14:08,070 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:14:08,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1980929792] [2022-04-15 07:14:08,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1980929792] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:14:08,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:14:08,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-15 07:14:08,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586638385] [2022-04-15 07:14:08,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:14:08,071 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 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 90 [2022-04-15 07:14:08,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:14:08,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 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 07:14:08,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:14:08,131 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-15 07:14:08,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:14:08,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-15 07:14:08,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1559, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 07:14:08,132 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 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 07:14:12,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:14:12,421 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2022-04-15 07:14:12,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-15 07:14:12,421 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 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 90 [2022-04-15 07:14:12,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:14:12,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 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 07:14:12,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 130 transitions. [2022-04-15 07:14:12,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 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 07:14:12,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 130 transitions. [2022-04-15 07:14:12,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 130 transitions. [2022-04-15 07:14:12,532 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 07:14:12,533 INFO L225 Difference]: With dead ends: 118 [2022-04-15 07:14:12,533 INFO L226 Difference]: Without dead ends: 107 [2022-04-15 07:14:12,533 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 27 SyntacticMatches, 24 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1242 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=483, Invalid=5997, Unknown=0, NotChecked=0, Total=6480 [2022-04-15 07:14:12,534 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 156 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 2631 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 2749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-15 07:14:12,534 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 118 Invalid, 2749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2631 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-15 07:14:12,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-15 07:14:12,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2022-04-15 07:14:12,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:14:12,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 95 states, 91 states have (on average 1.043956043956044) internal successors, (95), 91 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 07:14:12,577 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 95 states, 91 states have (on average 1.043956043956044) internal successors, (95), 91 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 07:14:12,577 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 95 states, 91 states have (on average 1.043956043956044) internal successors, (95), 91 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 07:14:12,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:14:12,578 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2022-04-15 07:14:12,578 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2022-04-15 07:14:12,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:14:12,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:14:12,579 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 91 states have (on average 1.043956043956044) internal successors, (95), 91 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 107 states. [2022-04-15 07:14:12,579 INFO L87 Difference]: Start difference. First operand has 95 states, 91 states have (on average 1.043956043956044) internal successors, (95), 91 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 107 states. [2022-04-15 07:14:12,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:14:12,580 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2022-04-15 07:14:12,580 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2022-04-15 07:14:12,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:14:12,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:14:12,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:14:12,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:14:12,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 91 states have (on average 1.043956043956044) internal successors, (95), 91 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 07:14:12,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2022-04-15 07:14:12,581 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 90 [2022-04-15 07:14:12,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:14:12,581 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2022-04-15 07:14:12,581 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 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 07:14:12,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 98 transitions. [2022-04-15 07:14:12,777 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 07:14:12,777 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2022-04-15 07:14:12,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-15 07:14:12,778 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:14:12,778 INFO L499 BasicCegarLoop]: trace histogram [30, 30, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:14:12,778 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-04-15 07:14:12,778 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:14:12,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:14:12,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1299109051, now seen corresponding path program 35 times [2022-04-15 07:14:12,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:14:12,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [629516332] [2022-04-15 07:14:13,009 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:13,129 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:13,231 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:13,352 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:13,455 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:13,587 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:13,768 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:13,769 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:14:13,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1742142723, now seen corresponding path program 1 times [2022-04-15 07:14:13,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:14:13,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942247163] [2022-04-15 07:14:13,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:14:13,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:14:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:14:13,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:14:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:14:13,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {18045#(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); {18039#true} is VALID [2022-04-15 07:14:13,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {18039#true} assume true; {18039#true} is VALID [2022-04-15 07:14:13,792 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18039#true} {18039#true} #68#return; {18039#true} is VALID [2022-04-15 07:14:13,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {18039#true} call ULTIMATE.init(); {18045#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:14:13,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {18045#(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); {18039#true} is VALID [2022-04-15 07:14:13,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {18039#true} assume true; {18039#true} is VALID [2022-04-15 07:14:13,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18039#true} {18039#true} #68#return; {18039#true} is VALID [2022-04-15 07:14:13,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {18039#true} call #t~ret8 := main(); {18039#true} is VALID [2022-04-15 07:14:13,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {18039#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {18044#(= main_~a~0 0)} is VALID [2022-04-15 07:14:13,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {18044#(= main_~a~0 0)} [146] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_1200 v_main_~c~0_1193)) (.cse1 (= |v_main_#t~pre5_231| |v_main_#t~pre5_230|)) (.cse2 (= v_main_~d~0_3632 v_main_~d~0_3596)) (.cse3 (= |v_main_#t~pre7_2526| |v_main_#t~pre7_2496|)) (.cse4 (= v_main_~a~0_232 v_main_~a~0_231)) (.cse5 (= |v_main_#t~pre4_189| |v_main_#t~pre4_188|)) (.cse6 (= v_main_~b~0_316 v_main_~b~0_314))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |v_main_#t~pre6_912| |v_main_#t~pre6_918|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre6_918| |v_main_#t~pre6_912|) .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_2526|, main_~c~0=v_main_~c~0_1200, main_~d~0=v_main_~d~0_3632, main_~b~0=v_main_~b~0_316, main_#t~pre4=|v_main_#t~pre4_189|, main_#t~pre5=|v_main_#t~pre5_231|, main_~a~0=v_main_~a~0_232, main_#t~pre6=|v_main_#t~pre6_918|} OutVars{main_#t~pre7=|v_main_#t~pre7_2496|, main_~c~0=v_main_~c~0_1193, main_~d~0=v_main_~d~0_3596, main_~b~0=v_main_~b~0_314, main_#t~pre4=|v_main_#t~pre4_188|, main_#t~pre5=|v_main_#t~pre5_230|, main_~a~0=v_main_~a~0_231, main_#t~pre6=|v_main_#t~pre6_912|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {18044#(= main_~a~0 0)} is VALID [2022-04-15 07:14:13,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {18044#(= main_~a~0 0)} [145] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {18040#false} is VALID [2022-04-15 07:14:13,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {18040#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {18040#false} is VALID [2022-04-15 07:14:13,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {18040#false} assume !false; {18040#false} is VALID [2022-04-15 07:14:13,804 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 07:14:13,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:14:13,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942247163] [2022-04-15 07:14:13,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942247163] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:14:13,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:14:13,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:14:15,175 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:14:15,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [629516332] [2022-04-15 07:14:15,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [629516332] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:14:15,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:14:15,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-15 07:14:15,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310274698] [2022-04-15 07:14:15,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:14:15,177 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 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 93 [2022-04-15 07:14:15,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:14:15,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 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 07:14:15,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:14:15,238 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-15 07:14:15,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:14:15,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-15 07:14:15,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1639, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 07:14:15,239 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 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 07:14:19,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:14:19,693 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2022-04-15 07:14:19,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-15 07:14:19,693 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 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 93 [2022-04-15 07:14:19,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:14:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 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 07:14:19,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 132 transitions. [2022-04-15 07:14:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 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 07:14:19,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 132 transitions. [2022-04-15 07:14:19,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 132 transitions. [2022-04-15 07:14:19,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:14:19,786 INFO L225 Difference]: With dead ends: 120 [2022-04-15 07:14:19,787 INFO L226 Difference]: Without dead ends: 109 [2022-04-15 07:14:19,787 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 26 SyntacticMatches, 27 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=495, Invalid=6311, Unknown=0, NotChecked=0, Total=6806 [2022-04-15 07:14:19,787 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 176 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 2926 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 3059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 2926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:14:19,787 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 38 Invalid, 3059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 2926 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-15 07:14:19,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-15 07:14:19,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 96. [2022-04-15 07:14:19,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:14:19,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 96 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 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 07:14:19,826 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 96 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 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 07:14:19,826 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 96 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 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 07:14:19,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:14:19,827 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2022-04-15 07:14:19,827 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2022-04-15 07:14:19,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:14:19,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:14:19,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 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 109 states. [2022-04-15 07:14:19,827 INFO L87 Difference]: Start difference. First operand has 96 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 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 109 states. [2022-04-15 07:14:19,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:14:19,828 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2022-04-15 07:14:19,828 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2022-04-15 07:14:19,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:14:19,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:14:19,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:14:19,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:14:19,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 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 07:14:19,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 99 transitions. [2022-04-15 07:14:19,829 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 99 transitions. Word has length 93 [2022-04-15 07:14:19,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:14:19,830 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 99 transitions. [2022-04-15 07:14:19,830 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 42 states have internal predecessors, (90), 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 07:14:19,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 99 transitions. [2022-04-15 07:14:20,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:14:20,029 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 99 transitions. [2022-04-15 07:14:20,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-15 07:14:20,029 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:14:20,029 INFO L499 BasicCegarLoop]: trace histogram [31, 31, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:14:20,029 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-04-15 07:14:20,030 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:14:20,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:14:20,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1457862695, now seen corresponding path program 36 times [2022-04-15 07:14:20,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:14:20,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [697714867] [2022-04-15 07:14:20,284 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:24,374 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:14:24,420 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:24,539 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:24,640 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:24,759 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:26,861 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:14:26,903 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:27,091 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:27,092 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:14:27,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1742204227, now seen corresponding path program 1 times [2022-04-15 07:14:27,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:14:27,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868882418] [2022-04-15 07:14:27,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:14:27,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:14:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:14:27,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:14:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:14:27,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {18823#(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); {18817#true} is VALID [2022-04-15 07:14:27,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {18817#true} assume true; {18817#true} is VALID [2022-04-15 07:14:27,115 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18817#true} {18817#true} #68#return; {18817#true} is VALID [2022-04-15 07:14:27,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {18817#true} call ULTIMATE.init(); {18823#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:14:27,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {18823#(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); {18817#true} is VALID [2022-04-15 07:14:27,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {18817#true} assume true; {18817#true} is VALID [2022-04-15 07:14:27,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18817#true} {18817#true} #68#return; {18817#true} is VALID [2022-04-15 07:14:27,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {18817#true} call #t~ret8 := main(); {18817#true} is VALID [2022-04-15 07:14:27,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {18817#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {18822#(= main_~a~0 0)} is VALID [2022-04-15 07:14:27,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {18822#(= main_~a~0 0)} [148] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_238 v_main_~a~0_237)) (.cse1 (= |v_main_#t~pre4_194| |v_main_#t~pre4_193|)) (.cse2 (= v_main_~b~0_324 v_main_~b~0_322)) (.cse3 (= v_main_~d~0_3793 v_main_~d~0_3756)) (.cse4 (= |v_main_#t~pre7_2627| |v_main_#t~pre7_2596|)) (.cse5 (= |v_main_#t~pre5_237| |v_main_#t~pre5_236|))) (or (and (= v_main_~c~0_1246 v_main_~c~0_1239) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_main_#t~pre6_953| |v_main_#t~pre6_947|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_main_#t~pre6_947| |v_main_#t~pre6_953|) (= v_main_~c~0_1239 v_main_~c~0_1246)))) InVars {main_#t~pre7=|v_main_#t~pre7_2627|, main_~c~0=v_main_~c~0_1246, main_~d~0=v_main_~d~0_3793, main_~b~0=v_main_~b~0_324, main_#t~pre4=|v_main_#t~pre4_194|, main_#t~pre5=|v_main_#t~pre5_237|, main_~a~0=v_main_~a~0_238, main_#t~pre6=|v_main_#t~pre6_953|} OutVars{main_#t~pre7=|v_main_#t~pre7_2596|, main_~c~0=v_main_~c~0_1239, main_~d~0=v_main_~d~0_3756, main_~b~0=v_main_~b~0_322, main_#t~pre4=|v_main_#t~pre4_193|, main_#t~pre5=|v_main_#t~pre5_236|, main_~a~0=v_main_~a~0_237, main_#t~pre6=|v_main_#t~pre6_947|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {18822#(= main_~a~0 0)} is VALID [2022-04-15 07:14:27,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {18822#(= main_~a~0 0)} [147] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {18818#false} is VALID [2022-04-15 07:14:27,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {18818#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {18818#false} is VALID [2022-04-15 07:14:27,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {18818#false} assume !false; {18818#false} is VALID [2022-04-15 07:14:27,118 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 07:14:27,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:14:27,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868882418] [2022-04-15 07:14:27,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868882418] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:14:27,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:14:27,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:14:28,456 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:14:28,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [697714867] [2022-04-15 07:14:28,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [697714867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:14:28,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:14:28,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-15 07:14:28,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137985741] [2022-04-15 07:14:28,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:14:28,457 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 43 states have internal predecessors, (92), 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 95 [2022-04-15 07:14:28,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:14:28,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 43 states have internal predecessors, (92), 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 07:14:28,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:14:28,523 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-15 07:14:28,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:14:28,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-15 07:14:28,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1721, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 07:14:28,524 INFO L87 Difference]: Start difference. First operand 96 states and 99 transitions. Second operand has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 43 states have internal predecessors, (92), 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 07:14:33,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:14:33,188 INFO L93 Difference]: Finished difference Result 122 states and 134 transitions. [2022-04-15 07:14:33,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-15 07:14:33,188 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 43 states have internal predecessors, (92), 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 95 [2022-04-15 07:14:33,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:14:33,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 43 states have internal predecessors, (92), 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 07:14:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 134 transitions. [2022-04-15 07:14:33,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 43 states have internal predecessors, (92), 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 07:14:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 134 transitions. [2022-04-15 07:14:33,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 134 transitions. [2022-04-15 07:14:33,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:14:33,284 INFO L225 Difference]: With dead ends: 122 [2022-04-15 07:14:33,284 INFO L226 Difference]: Without dead ends: 111 [2022-04-15 07:14:33,284 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 33 SyntacticMatches, 21 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1340 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=507, Invalid=6633, Unknown=0, NotChecked=0, Total=7140 [2022-04-15 07:14:33,284 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 170 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3035 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 3165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 3035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:14:33,285 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 18 Invalid, 3165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 3035 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-15 07:14:33,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-15 07:14:33,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 98. [2022-04-15 07:14:33,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:14:33,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 98 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 94 states have internal predecessors, (98), 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 07:14:33,325 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 98 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 94 states have internal predecessors, (98), 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 07:14:33,325 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 98 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 94 states have internal predecessors, (98), 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 07:14:33,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:14:33,326 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2022-04-15 07:14:33,326 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2022-04-15 07:14:33,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:14:33,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:14:33,326 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 94 states have internal predecessors, (98), 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 111 states. [2022-04-15 07:14:33,326 INFO L87 Difference]: Start difference. First operand has 98 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 94 states have internal predecessors, (98), 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 111 states. [2022-04-15 07:14:33,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:14:33,327 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2022-04-15 07:14:33,327 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2022-04-15 07:14:33,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:14:33,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:14:33,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:14:33,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:14:33,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 94 states have internal predecessors, (98), 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 07:14:33,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2022-04-15 07:14:33,328 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 95 [2022-04-15 07:14:33,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:14:33,328 INFO L478 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2022-04-15 07:14:33,328 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.090909090909091) internal successors, (92), 43 states have internal predecessors, (92), 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 07:14:33,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 101 transitions. [2022-04-15 07:14:33,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:14:33,531 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2022-04-15 07:14:33,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-15 07:14:33,531 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:14:33,531 INFO L499 BasicCegarLoop]: trace histogram [32, 32, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:14:33,531 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-04-15 07:14:33,532 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:14:33,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:14:33,532 INFO L85 PathProgramCache]: Analyzing trace with hash -912888969, now seen corresponding path program 37 times [2022-04-15 07:14:33,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:14:33,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1506726341] [2022-04-15 07:14:33,760 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:37,845 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:14:37,896 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:37,993 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:42,081 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:14:42,134 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:42,232 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:46,319 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:14:46,368 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:46,556 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:46,556 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:14:46,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1742265731, now seen corresponding path program 1 times [2022-04-15 07:14:46,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:14:46,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441574279] [2022-04-15 07:14:46,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:14:46,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:14:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:14:46,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:14:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:14:46,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {19616#(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); {19610#true} is VALID [2022-04-15 07:14:46,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {19610#true} assume true; {19610#true} is VALID [2022-04-15 07:14:46,577 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19610#true} {19610#true} #68#return; {19610#true} is VALID [2022-04-15 07:14:46,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {19610#true} call ULTIMATE.init(); {19616#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:14:46,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {19616#(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); {19610#true} is VALID [2022-04-15 07:14:46,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {19610#true} assume true; {19610#true} is VALID [2022-04-15 07:14:46,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19610#true} {19610#true} #68#return; {19610#true} is VALID [2022-04-15 07:14:46,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {19610#true} call #t~ret8 := main(); {19610#true} is VALID [2022-04-15 07:14:46,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {19610#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {19615#(= main_~a~0 0)} is VALID [2022-04-15 07:14:46,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {19615#(= main_~a~0 0)} [150] L22-3-->L22-4_primed: Formula: (and (= v_main_~d~0_3958 v_main_~d~0_3920) (= |v_main_#t~pre4_199| |v_main_#t~pre4_198|) (= |v_main_#t~pre6_988| |v_main_#t~pre6_982|) (= v_main_~a~0_244 v_main_~a~0_243) (= v_main_~b~0_332 v_main_~b~0_330) (= v_main_~c~0_1292 v_main_~c~0_1285) (= |v_main_#t~pre5_243| |v_main_#t~pre5_242|) (= |v_main_#t~pre7_2736| |v_main_#t~pre7_2704|)) InVars {main_#t~pre7=|v_main_#t~pre7_2736|, main_~c~0=v_main_~c~0_1292, main_~d~0=v_main_~d~0_3958, main_~b~0=v_main_~b~0_332, main_#t~pre4=|v_main_#t~pre4_199|, main_#t~pre5=|v_main_#t~pre5_243|, main_~a~0=v_main_~a~0_244, main_#t~pre6=|v_main_#t~pre6_988|} OutVars{main_#t~pre7=|v_main_#t~pre7_2704|, main_~c~0=v_main_~c~0_1285, main_~d~0=v_main_~d~0_3920, main_~b~0=v_main_~b~0_330, main_#t~pre4=|v_main_#t~pre4_198|, main_#t~pre5=|v_main_#t~pre5_242|, main_~a~0=v_main_~a~0_243, main_#t~pre6=|v_main_#t~pre6_982|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {19615#(= main_~a~0 0)} is VALID [2022-04-15 07:14:46,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {19615#(= main_~a~0 0)} [149] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {19611#false} is VALID [2022-04-15 07:14:46,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {19611#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {19611#false} is VALID [2022-04-15 07:14:46,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {19611#false} assume !false; {19611#false} is VALID [2022-04-15 07:14:46,579 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 07:14:46,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:14:46,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441574279] [2022-04-15 07:14:46,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441574279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:14:46,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:14:46,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:14:47,879 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:14:47,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1506726341] [2022-04-15 07:14:47,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1506726341] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:14:47,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:14:47,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-15 07:14:47,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227376127] [2022-04-15 07:14:47,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:14:47,880 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 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 97 [2022-04-15 07:14:47,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:14:47,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 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 07:14:47,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:14:47,949 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-15 07:14:47,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:14:47,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-15 07:14:47,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1805, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 07:14:47,949 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 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 07:14:52,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:14:52,600 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2022-04-15 07:14:52,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-15 07:14:52,600 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 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 97 [2022-04-15 07:14:52,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:14:52,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 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 07:14:52,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 136 transitions. [2022-04-15 07:14:52,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 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 07:14:52,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 136 transitions. [2022-04-15 07:14:52,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 136 transitions. [2022-04-15 07:14:52,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:14:52,699 INFO L225 Difference]: With dead ends: 124 [2022-04-15 07:14:52,699 INFO L226 Difference]: Without dead ends: 113 [2022-04-15 07:14:52,700 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 34 SyntacticMatches, 21 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1373 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=519, Invalid=6963, Unknown=0, NotChecked=0, Total=7482 [2022-04-15 07:14:52,700 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 127 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3050 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 3140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 3050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:14:52,700 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 108 Invalid, 3140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 3050 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-15 07:14:52,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-15 07:14:52,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 100. [2022-04-15 07:14:52,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:14:52,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 100 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 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 07:14:52,749 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 100 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 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 07:14:52,749 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 100 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 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 07:14:52,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:14:52,750 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2022-04-15 07:14:52,751 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2022-04-15 07:14:52,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:14:52,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:14:52,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 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 113 states. [2022-04-15 07:14:52,751 INFO L87 Difference]: Start difference. First operand has 100 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 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 113 states. [2022-04-15 07:14:52,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:14:52,752 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2022-04-15 07:14:52,752 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2022-04-15 07:14:52,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:14:52,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:14:52,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:14:52,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:14:52,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 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 07:14:52,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2022-04-15 07:14:52,753 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 97 [2022-04-15 07:14:52,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:14:52,753 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2022-04-15 07:14:52,753 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 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 07:14:52,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 103 transitions. [2022-04-15 07:14:52,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:14:52,958 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2022-04-15 07:14:52,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-15 07:14:52,958 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:14:52,958 INFO L499 BasicCegarLoop]: trace histogram [33, 33, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:14:52,958 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-04-15 07:14:52,958 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:14:52,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:14:52,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1179148395, now seen corresponding path program 38 times [2022-04-15 07:14:52,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:14:52,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [902963654] [2022-04-15 07:14:53,198 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:57,285 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:14:57,328 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:57,422 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:01,504 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:15:01,547 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:01,638 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:05,718 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:15:05,765 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:05,933 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:05,934 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:15:05,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1742327235, now seen corresponding path program 1 times [2022-04-15 07:15:05,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:15:05,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253100343] [2022-04-15 07:15:05,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:15:05,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:15:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:15:05,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:15:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:15:05,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {20424#(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); {20418#true} is VALID [2022-04-15 07:15:05,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {20418#true} assume true; {20418#true} is VALID [2022-04-15 07:15:05,972 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20418#true} {20418#true} #68#return; {20418#true} is VALID [2022-04-15 07:15:05,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {20418#true} call ULTIMATE.init(); {20424#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:15:05,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {20424#(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); {20418#true} is VALID [2022-04-15 07:15:05,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {20418#true} assume true; {20418#true} is VALID [2022-04-15 07:15:05,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20418#true} {20418#true} #68#return; {20418#true} is VALID [2022-04-15 07:15:05,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {20418#true} call #t~ret8 := main(); {20418#true} is VALID [2022-04-15 07:15:05,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {20418#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {20423#(= main_~a~0 0)} is VALID [2022-04-15 07:15:05,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {20423#(= main_~a~0 0)} [152] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~d~0_4127 v_main_~d~0_4088)) (.cse1 (= |v_main_#t~pre7_2848| |v_main_#t~pre7_2815|)) (.cse2 (= v_main_~b~0_340 v_main_~b~0_338)) (.cse3 (= |v_main_#t~pre5_249| |v_main_#t~pre5_248|)) (.cse4 (= |v_main_#t~pre4_204| |v_main_#t~pre4_203|))) (or (and .cse0 (= |v_main_#t~pre6_1017| |v_main_#t~pre6_1023|) .cse1 .cse2 .cse3 (= v_main_~a~0_249 v_main_~a~0_250) (= v_main_~c~0_1331 v_main_~c~0_1338) .cse4) (and .cse0 .cse1 (= v_main_~c~0_1338 v_main_~c~0_1331) .cse2 .cse3 (= |v_main_#t~pre6_1023| |v_main_#t~pre6_1017|) .cse4 (= v_main_~a~0_250 v_main_~a~0_249)))) InVars {main_#t~pre7=|v_main_#t~pre7_2848|, main_~c~0=v_main_~c~0_1338, main_~d~0=v_main_~d~0_4127, main_~b~0=v_main_~b~0_340, main_#t~pre4=|v_main_#t~pre4_204|, main_#t~pre5=|v_main_#t~pre5_249|, main_~a~0=v_main_~a~0_250, main_#t~pre6=|v_main_#t~pre6_1023|} OutVars{main_#t~pre7=|v_main_#t~pre7_2815|, main_~c~0=v_main_~c~0_1331, main_~d~0=v_main_~d~0_4088, main_~b~0=v_main_~b~0_338, main_#t~pre4=|v_main_#t~pre4_203|, main_#t~pre5=|v_main_#t~pre5_248|, main_~a~0=v_main_~a~0_249, main_#t~pre6=|v_main_#t~pre6_1017|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {20423#(= main_~a~0 0)} is VALID [2022-04-15 07:15:05,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {20423#(= main_~a~0 0)} [151] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {20419#false} is VALID [2022-04-15 07:15:05,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {20419#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {20419#false} is VALID [2022-04-15 07:15:05,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {20419#false} assume !false; {20419#false} is VALID [2022-04-15 07:15:05,974 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 07:15:05,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:15:05,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253100343] [2022-04-15 07:15:05,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253100343] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:15:05,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:15:05,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:15:07,383 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:15:07,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [902963654] [2022-04-15 07:15:07,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [902963654] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:15:07,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:15:07,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-15 07:15:07,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12783493] [2022-04-15 07:15:07,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:15:07,384 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 45 states have internal predecessors, (96), 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 07:15:07,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:15:07,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 45 states have internal predecessors, (96), 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 07:15:07,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:07,454 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-15 07:15:07,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:15:07,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-15 07:15:07,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1891, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 07:15:07,454 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. Second operand has 46 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 45 states have internal predecessors, (96), 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 07:15:12,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:12,874 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2022-04-15 07:15:12,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-15 07:15:12,874 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 45 states have internal predecessors, (96), 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 07:15:12,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:15:12,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 45 states have internal predecessors, (96), 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 07:15:12,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 138 transitions. [2022-04-15 07:15:12,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 45 states have internal predecessors, (96), 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 07:15:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 138 transitions. [2022-04-15 07:15:12,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 138 transitions. [2022-04-15 07:15:12,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:12,984 INFO L225 Difference]: With dead ends: 126 [2022-04-15 07:15:12,984 INFO L226 Difference]: Without dead ends: 115 [2022-04-15 07:15:12,985 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 35 SyntacticMatches, 21 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1449 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=531, Invalid=7301, Unknown=0, NotChecked=0, Total=7832 [2022-04-15 07:15:12,985 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 138 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 3499 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 3597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 3499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:15:12,985 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 63 Invalid, 3597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 3499 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-15 07:15:12,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-15 07:15:13,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 102. [2022-04-15 07:15:13,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:15:13,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 102 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 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 07:15:13,032 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 102 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 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 07:15:13,032 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 102 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 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 07:15:13,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:13,033 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2022-04-15 07:15:13,033 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2022-04-15 07:15:13,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:15:13,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:15:13,034 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 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 115 states. [2022-04-15 07:15:13,034 INFO L87 Difference]: Start difference. First operand has 102 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 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 115 states. [2022-04-15 07:15:13,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:13,035 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2022-04-15 07:15:13,035 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2022-04-15 07:15:13,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:15:13,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:15:13,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:15:13,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:15:13,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 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 07:15:13,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2022-04-15 07:15:13,036 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 99 [2022-04-15 07:15:13,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:15:13,036 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2022-04-15 07:15:13,036 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 45 states have internal predecessors, (96), 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 07:15:13,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 105 transitions. [2022-04-15 07:15:13,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:13,265 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-15 07:15:13,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-15 07:15:13,266 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:15:13,266 INFO L499 BasicCegarLoop]: trace histogram [34, 34, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:15:13,266 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-04-15 07:15:13,266 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:15:13,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:15:13,266 INFO L85 PathProgramCache]: Analyzing trace with hash 643580979, now seen corresponding path program 39 times [2022-04-15 07:15:13,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:15:13,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [562170345] [2022-04-15 07:15:13,505 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:13,635 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:13,735 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:13,863 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:13,956 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:14,073 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:14,241 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:14,242 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:15:14,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1742388739, now seen corresponding path program 1 times [2022-04-15 07:15:14,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:15:14,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704823053] [2022-04-15 07:15:14,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:15:14,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:15:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:15:14,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:15:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:15:14,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {21247#(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); {21241#true} is VALID [2022-04-15 07:15:14,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {21241#true} assume true; {21241#true} is VALID [2022-04-15 07:15:14,270 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21241#true} {21241#true} #68#return; {21241#true} is VALID [2022-04-15 07:15:14,270 INFO L272 TraceCheckUtils]: 0: Hoare triple {21241#true} call ULTIMATE.init(); {21247#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:15:14,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {21247#(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); {21241#true} is VALID [2022-04-15 07:15:14,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {21241#true} assume true; {21241#true} is VALID [2022-04-15 07:15:14,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21241#true} {21241#true} #68#return; {21241#true} is VALID [2022-04-15 07:15:14,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {21241#true} call #t~ret8 := main(); {21241#true} is VALID [2022-04-15 07:15:14,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {21241#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {21246#(= main_~a~0 0)} is VALID [2022-04-15 07:15:14,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {21246#(= main_~a~0 0)} [154] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~b~0_348 v_main_~b~0_346)) (.cse1 (= v_main_~a~0_256 v_main_~a~0_255)) (.cse2 (= |v_main_#t~pre7_2963| |v_main_#t~pre7_2929|)) (.cse3 (= |v_main_#t~pre5_255| |v_main_#t~pre5_254|)) (.cse4 (= |v_main_#t~pre4_209| |v_main_#t~pre4_208|)) (.cse5 (= v_main_~d~0_4300 v_main_~d~0_4260)) (.cse6 (= |v_main_#t~pre6_1058| |v_main_#t~pre6_1052|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~c~0_1384 v_main_~c~0_1377) .cse5 .cse6) (and .cse0 (= v_main_~c~0_1377 v_main_~c~0_1384) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_2963|, main_~c~0=v_main_~c~0_1384, main_~d~0=v_main_~d~0_4300, main_~b~0=v_main_~b~0_348, main_#t~pre4=|v_main_#t~pre4_209|, main_#t~pre5=|v_main_#t~pre5_255|, main_~a~0=v_main_~a~0_256, main_#t~pre6=|v_main_#t~pre6_1058|} OutVars{main_#t~pre7=|v_main_#t~pre7_2929|, main_~c~0=v_main_~c~0_1377, main_~d~0=v_main_~d~0_4260, main_~b~0=v_main_~b~0_346, main_#t~pre4=|v_main_#t~pre4_208|, main_#t~pre5=|v_main_#t~pre5_254|, main_~a~0=v_main_~a~0_255, main_#t~pre6=|v_main_#t~pre6_1052|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {21246#(= main_~a~0 0)} is VALID [2022-04-15 07:15:14,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {21246#(= main_~a~0 0)} [153] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {21242#false} is VALID [2022-04-15 07:15:14,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {21242#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {21242#false} is VALID [2022-04-15 07:15:14,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {21242#false} assume !false; {21242#false} is VALID [2022-04-15 07:15:14,272 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 07:15:14,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:15:14,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704823053] [2022-04-15 07:15:14,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704823053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:15:14,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:15:14,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:15:15,754 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:15:15,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [562170345] [2022-04-15 07:15:15,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [562170345] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:15:15,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:15:15,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-15 07:15:15,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581582769] [2022-04-15 07:15:15,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:15:15,755 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 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 101 [2022-04-15 07:15:15,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:15:15,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 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 07:15:15,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:15,820 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-15 07:15:15,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:15:15,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-15 07:15:15,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1979, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 07:15:15,820 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 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 07:15:21,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:21,459 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2022-04-15 07:15:21,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-15 07:15:21,459 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 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 101 [2022-04-15 07:15:21,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:15:21,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 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 07:15:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 140 transitions. [2022-04-15 07:15:21,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 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 07:15:21,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 140 transitions. [2022-04-15 07:15:21,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 140 transitions. [2022-04-15 07:15:21,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:21,559 INFO L225 Difference]: With dead ends: 128 [2022-04-15 07:15:21,559 INFO L226 Difference]: Without dead ends: 117 [2022-04-15 07:15:21,560 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 35 SyntacticMatches, 22 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1519 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=543, Invalid=7647, Unknown=0, NotChecked=0, Total=8190 [2022-04-15 07:15:21,560 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 131 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 3772 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 3866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 3772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:15:21,560 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 138 Invalid, 3866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 3772 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-15 07:15:21,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-15 07:15:21,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 104. [2022-04-15 07:15:21,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:15:21,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 104 states, 100 states have (on average 1.04) internal successors, (104), 100 states have internal predecessors, (104), 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 07:15:21,618 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 104 states, 100 states have (on average 1.04) internal successors, (104), 100 states have internal predecessors, (104), 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 07:15:21,618 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 104 states, 100 states have (on average 1.04) internal successors, (104), 100 states have internal predecessors, (104), 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 07:15:21,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:21,619 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2022-04-15 07:15:21,619 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2022-04-15 07:15:21,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:15:21,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:15:21,619 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 100 states have (on average 1.04) internal successors, (104), 100 states have internal predecessors, (104), 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 117 states. [2022-04-15 07:15:21,619 INFO L87 Difference]: Start difference. First operand has 104 states, 100 states have (on average 1.04) internal successors, (104), 100 states have internal predecessors, (104), 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 117 states. [2022-04-15 07:15:21,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:21,620 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2022-04-15 07:15:21,620 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2022-04-15 07:15:21,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:15:21,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:15:21,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:15:21,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:15:21,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 100 states have (on average 1.04) internal successors, (104), 100 states have internal predecessors, (104), 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 07:15:21,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 107 transitions. [2022-04-15 07:15:21,621 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 107 transitions. Word has length 101 [2022-04-15 07:15:21,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:15:21,622 INFO L478 AbstractCegarLoop]: Abstraction has 104 states and 107 transitions. [2022-04-15 07:15:21,622 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 46 states have internal predecessors, (98), 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 07:15:21,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 107 transitions. [2022-04-15 07:15:21,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:21,850 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 107 transitions. [2022-04-15 07:15:21,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-15 07:15:21,850 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:15:21,850 INFO L499 BasicCegarLoop]: trace histogram [35, 35, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:15:21,850 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-04-15 07:15:21,850 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:15:21,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:15:21,850 INFO L85 PathProgramCache]: Analyzing trace with hash -60147375, now seen corresponding path program 40 times [2022-04-15 07:15:21,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:15:21,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [725427208] [2022-04-15 07:15:22,064 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:22,181 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:22,282 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:22,410 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:22,499 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:22,614 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:22,799 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:22,799 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:15:22,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1742450243, now seen corresponding path program 1 times [2022-04-15 07:15:22,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:15:22,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169909227] [2022-04-15 07:15:22,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:15:22,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:15:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:15:22,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:15:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:15:22,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {22085#(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); {22079#true} is VALID [2022-04-15 07:15:22,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {22079#true} assume true; {22079#true} is VALID [2022-04-15 07:15:22,822 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22079#true} {22079#true} #68#return; {22079#true} is VALID [2022-04-15 07:15:22,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {22079#true} call ULTIMATE.init(); {22085#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:15:22,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {22085#(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); {22079#true} is VALID [2022-04-15 07:15:22,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {22079#true} assume true; {22079#true} is VALID [2022-04-15 07:15:22,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22079#true} {22079#true} #68#return; {22079#true} is VALID [2022-04-15 07:15:22,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {22079#true} call #t~ret8 := main(); {22079#true} is VALID [2022-04-15 07:15:22,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {22079#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {22084#(= main_~a~0 0)} is VALID [2022-04-15 07:15:22,824 INFO L290 TraceCheckUtils]: 6: Hoare triple {22084#(= main_~a~0 0)} [156] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~b~0_356 v_main_~b~0_354)) (.cse1 (= v_main_~a~0_262 v_main_~a~0_261)) (.cse2 (= |v_main_#t~pre7_3081| |v_main_#t~pre7_3046|)) (.cse3 (= |v_main_#t~pre4_214| |v_main_#t~pre4_213|)) (.cse4 (= v_main_~d~0_4477 v_main_~d~0_4436)) (.cse5 (= v_main_~c~0_1430 v_main_~c~0_1423))) (or (and .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~pre5_261| |v_main_#t~pre5_260|) .cse4 (= |v_main_#t~pre6_1093| |v_main_#t~pre6_1087|) .cse5) (and (= |v_main_#t~pre6_1087| |v_main_#t~pre6_1093|) (= |v_main_#t~pre5_260| |v_main_#t~pre5_261|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_3081|, main_~c~0=v_main_~c~0_1430, main_~d~0=v_main_~d~0_4477, main_~b~0=v_main_~b~0_356, main_#t~pre4=|v_main_#t~pre4_214|, main_#t~pre5=|v_main_#t~pre5_261|, main_~a~0=v_main_~a~0_262, main_#t~pre6=|v_main_#t~pre6_1093|} OutVars{main_#t~pre7=|v_main_#t~pre7_3046|, main_~c~0=v_main_~c~0_1423, main_~d~0=v_main_~d~0_4436, main_~b~0=v_main_~b~0_354, main_#t~pre4=|v_main_#t~pre4_213|, main_#t~pre5=|v_main_#t~pre5_260|, main_~a~0=v_main_~a~0_261, main_#t~pre6=|v_main_#t~pre6_1087|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {22084#(= main_~a~0 0)} is VALID [2022-04-15 07:15:22,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {22084#(= main_~a~0 0)} [155] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {22080#false} is VALID [2022-04-15 07:15:22,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {22080#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {22080#false} is VALID [2022-04-15 07:15:22,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {22080#false} assume !false; {22080#false} is VALID [2022-04-15 07:15:22,824 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 07:15:22,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:15:22,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169909227] [2022-04-15 07:15:22,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169909227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:15:22,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:15:22,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:15:24,506 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:15:24,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [725427208] [2022-04-15 07:15:24,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [725427208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:15:24,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:15:24,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-15 07:15:24,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783616452] [2022-04-15 07:15:24,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:15:24,507 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 47 states have internal predecessors, (100), 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 103 [2022-04-15 07:15:24,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:15:24,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 47 states have internal predecessors, (100), 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 07:15:24,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:24,580 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-15 07:15:24,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:15:24,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-15 07:15:24,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2069, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 07:15:24,580 INFO L87 Difference]: Start difference. First operand 104 states and 107 transitions. Second operand has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 47 states have internal predecessors, (100), 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 07:15:30,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:30,892 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2022-04-15 07:15:30,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-15 07:15:30,892 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 47 states have internal predecessors, (100), 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 103 [2022-04-15 07:15:30,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:15:30,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 47 states have internal predecessors, (100), 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 07:15:30,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 145 transitions. [2022-04-15 07:15:30,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 47 states have internal predecessors, (100), 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 07:15:30,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 145 transitions. [2022-04-15 07:15:30,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 145 transitions. [2022-04-15 07:15:30,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:30,999 INFO L225 Difference]: With dead ends: 132 [2022-04-15 07:15:31,000 INFO L226 Difference]: Without dead ends: 121 [2022-04-15 07:15:31,000 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 32 SyntacticMatches, 26 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1590 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=555, Invalid=8001, Unknown=0, NotChecked=0, Total=8556 [2022-04-15 07:15:31,000 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 183 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 4225 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 4370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 4225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-15 07:15:31,000 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 153 Invalid, 4370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 4225 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-15 07:15:31,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-15 07:15:31,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 108. [2022-04-15 07:15:31,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:15:31,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 108 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 104 states have internal predecessors, (108), 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 07:15:31,052 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 108 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 104 states have internal predecessors, (108), 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 07:15:31,052 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 108 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 104 states have internal predecessors, (108), 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 07:15:31,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:31,053 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2022-04-15 07:15:31,053 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2022-04-15 07:15:31,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:15:31,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:15:31,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 104 states have internal predecessors, (108), 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 121 states. [2022-04-15 07:15:31,054 INFO L87 Difference]: Start difference. First operand has 108 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 104 states have internal predecessors, (108), 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 121 states. [2022-04-15 07:15:31,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:31,055 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2022-04-15 07:15:31,055 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2022-04-15 07:15:31,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:15:31,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:15:31,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:15:31,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:15:31,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 104 states have internal predecessors, (108), 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 07:15:31,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2022-04-15 07:15:31,056 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 103 [2022-04-15 07:15:31,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:15:31,056 INFO L478 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2022-04-15 07:15:31,056 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 47 states have internal predecessors, (100), 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 07:15:31,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 108 states and 111 transitions. [2022-04-15 07:15:31,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:31,314 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2022-04-15 07:15:31,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-15 07:15:31,314 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:15:31,314 INFO L499 BasicCegarLoop]: trace histogram [36, 36, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:15:31,314 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-04-15 07:15:31,314 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:15:31,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:15:31,314 INFO L85 PathProgramCache]: Analyzing trace with hash -2033230097, now seen corresponding path program 41 times [2022-04-15 07:15:31,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:15:31,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [678700064] [2022-04-15 07:15:32,153 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:32,272 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:32,373 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:32,504 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:32,595 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:32,719 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:32,903 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:32,903 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:15:32,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1742511747, now seen corresponding path program 1 times [2022-04-15 07:15:32,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:15:32,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309802433] [2022-04-15 07:15:32,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:15:32,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:15:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:15:32,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:15:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:15:32,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {22950#(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); {22944#true} is VALID [2022-04-15 07:15:32,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {22944#true} assume true; {22944#true} is VALID [2022-04-15 07:15:32,924 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22944#true} {22944#true} #68#return; {22944#true} is VALID [2022-04-15 07:15:32,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {22944#true} call ULTIMATE.init(); {22950#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:15:32,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {22950#(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); {22944#true} is VALID [2022-04-15 07:15:32,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {22944#true} assume true; {22944#true} is VALID [2022-04-15 07:15:32,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22944#true} {22944#true} #68#return; {22944#true} is VALID [2022-04-15 07:15:32,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {22944#true} call #t~ret8 := main(); {22944#true} is VALID [2022-04-15 07:15:32,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {22944#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {22949#(= main_~a~0 0)} is VALID [2022-04-15 07:15:32,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {22949#(= main_~a~0 0)} [158] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre7_3196| |v_main_#t~pre7_3160|)) (.cse1 (= |v_main_#t~pre4_219| |v_main_#t~pre4_218|)) (.cse2 (= v_main_~a~0_268 v_main_~a~0_267)) (.cse3 (= v_main_~b~0_364 v_main_~b~0_362)) (.cse4 (= v_main_~c~0_1474 v_main_~c~0_1467)) (.cse5 (= v_main_~d~0_4651 v_main_~d~0_4609)) (.cse6 (= |v_main_#t~pre5_267| |v_main_#t~pre5_266|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre6_1121| |v_main_#t~pre6_1127|) .cse5 .cse6) (and (= |v_main_#t~pre6_1127| |v_main_#t~pre6_1121|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_3196|, main_~c~0=v_main_~c~0_1474, main_~d~0=v_main_~d~0_4651, main_~b~0=v_main_~b~0_364, main_#t~pre4=|v_main_#t~pre4_219|, main_#t~pre5=|v_main_#t~pre5_267|, main_~a~0=v_main_~a~0_268, main_#t~pre6=|v_main_#t~pre6_1127|} OutVars{main_#t~pre7=|v_main_#t~pre7_3160|, main_~c~0=v_main_~c~0_1467, main_~d~0=v_main_~d~0_4609, main_~b~0=v_main_~b~0_362, main_#t~pre4=|v_main_#t~pre4_218|, main_#t~pre5=|v_main_#t~pre5_266|, main_~a~0=v_main_~a~0_267, main_#t~pre6=|v_main_#t~pre6_1121|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {22949#(= main_~a~0 0)} is VALID [2022-04-15 07:15:32,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {22949#(= main_~a~0 0)} [157] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {22945#false} is VALID [2022-04-15 07:15:32,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {22945#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {22945#false} is VALID [2022-04-15 07:15:32,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {22945#false} assume !false; {22945#false} is VALID [2022-04-15 07:15:32,925 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 07:15:32,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:15:32,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309802433] [2022-04-15 07:15:32,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309802433] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:15:32,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:15:32,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:15:34,406 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:15:34,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [678700064] [2022-04-15 07:15:34,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [678700064] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:15:34,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:15:34,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-15 07:15:34,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127948928] [2022-04-15 07:15:34,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:15:34,407 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2022-04-15 07:15:34,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:15:34,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 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 07:15:34,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:34,474 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-15 07:15:34,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:15:34,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-15 07:15:34,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2256, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 07:15:34,475 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. Second operand has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 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 07:15:41,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:41,023 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2022-04-15 07:15:41,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-15 07:15:41,023 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2022-04-15 07:15:41,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:15:41,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 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 07:15:41,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 141 transitions. [2022-04-15 07:15:41,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 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 07:15:41,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 141 transitions. [2022-04-15 07:15:41,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 141 transitions. [2022-04-15 07:15:41,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:41,126 INFO L225 Difference]: With dead ends: 130 [2022-04-15 07:15:41,126 INFO L226 Difference]: Without dead ends: 119 [2022-04-15 07:15:41,127 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 42 SyntacticMatches, 16 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1725 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=576, Invalid=8736, Unknown=0, NotChecked=0, Total=9312 [2022-04-15 07:15:41,127 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 125 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 4354 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 4455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 4354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:15:41,127 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 212 Invalid, 4455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 4354 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-15 07:15:41,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-15 07:15:41,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2022-04-15 07:15:41,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:15:41,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 112 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 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 07:15:41,179 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 112 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 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 07:15:41,179 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 112 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 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 07:15:41,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:41,180 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2022-04-15 07:15:41,180 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2022-04-15 07:15:41,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:15:41,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:15:41,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 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 119 states. [2022-04-15 07:15:41,181 INFO L87 Difference]: Start difference. First operand has 112 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 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 119 states. [2022-04-15 07:15:41,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:41,182 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2022-04-15 07:15:41,182 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2022-04-15 07:15:41,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:15:41,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:15:41,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:15:41,182 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:15:41,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 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 07:15:41,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 115 transitions. [2022-04-15 07:15:41,183 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 115 transitions. Word has length 105 [2022-04-15 07:15:41,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:15:41,183 INFO L478 AbstractCegarLoop]: Abstraction has 112 states and 115 transitions. [2022-04-15 07:15:41,183 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 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 07:15:41,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 112 states and 115 transitions. [2022-04-15 07:15:41,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:41,450 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 115 transitions. [2022-04-15 07:15:41,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-15 07:15:41,450 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:15:41,450 INFO L499 BasicCegarLoop]: trace histogram [36, 36, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:15:41,450 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-04-15 07:15:41,451 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:15:41,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:15:41,451 INFO L85 PathProgramCache]: Analyzing trace with hash 326718754, now seen corresponding path program 42 times [2022-04-15 07:15:41,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:15:41,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [324286797] [2022-04-15 07:15:42,282 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:42,399 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:42,494 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:42,629 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:42,722 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:42,851 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:43,046 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:43,047 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:15:43,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1742573251, now seen corresponding path program 1 times [2022-04-15 07:15:43,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:15:43,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825583276] [2022-04-15 07:15:43,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:15:43,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:15:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:15:43,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:15:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:15:43,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {23821#(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); {23815#true} is VALID [2022-04-15 07:15:43,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {23815#true} assume true; {23815#true} is VALID [2022-04-15 07:15:43,068 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23815#true} {23815#true} #68#return; {23815#true} is VALID [2022-04-15 07:15:43,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {23815#true} call ULTIMATE.init(); {23821#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:15:43,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {23821#(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); {23815#true} is VALID [2022-04-15 07:15:43,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {23815#true} assume true; {23815#true} is VALID [2022-04-15 07:15:43,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23815#true} {23815#true} #68#return; {23815#true} is VALID [2022-04-15 07:15:43,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {23815#true} call #t~ret8 := main(); {23815#true} is VALID [2022-04-15 07:15:43,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {23815#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {23820#(= main_~a~0 0)} is VALID [2022-04-15 07:15:43,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {23820#(= main_~a~0 0)} [160] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_276| |v_main_#t~pre5_274|)) (.cse1 (= v_main_~b~0_378 v_main_~b~0_375)) (.cse2 (= |v_main_#t~pre7_3311| |v_main_#t~pre7_3275|)) (.cse3 (= |v_main_#t~pre6_1161| |v_main_#t~pre6_1155|)) (.cse4 (= v_main_~a~0_274 v_main_~a~0_273)) (.cse5 (= |v_main_#t~pre4_224| |v_main_#t~pre4_223|)) (.cse6 (= v_main_~d~0_4826 v_main_~d~0_4784))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= v_main_~c~0_1523 v_main_~c~0_1515)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~c~0_1515 v_main_~c~0_1523) .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_3311|, main_~c~0=v_main_~c~0_1523, main_~d~0=v_main_~d~0_4826, main_~b~0=v_main_~b~0_378, main_#t~pre4=|v_main_#t~pre4_224|, main_#t~pre5=|v_main_#t~pre5_276|, main_~a~0=v_main_~a~0_274, main_#t~pre6=|v_main_#t~pre6_1161|} OutVars{main_#t~pre7=|v_main_#t~pre7_3275|, main_~c~0=v_main_~c~0_1515, main_~d~0=v_main_~d~0_4784, main_~b~0=v_main_~b~0_375, main_#t~pre4=|v_main_#t~pre4_223|, main_#t~pre5=|v_main_#t~pre5_274|, main_~a~0=v_main_~a~0_273, main_#t~pre6=|v_main_#t~pre6_1155|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {23820#(= main_~a~0 0)} is VALID [2022-04-15 07:15:43,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {23820#(= main_~a~0 0)} [159] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {23816#false} is VALID [2022-04-15 07:15:43,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {23816#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {23816#false} is VALID [2022-04-15 07:15:43,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {23816#false} assume !false; {23816#false} is VALID [2022-04-15 07:15:43,070 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 07:15:43,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:15:43,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825583276] [2022-04-15 07:15:43,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825583276] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:15:43,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:15:43,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:15:44,810 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:15:44,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [324286797] [2022-04-15 07:15:44,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [324286797] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:15:44,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:15:44,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-15 07:15:44,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618147336] [2022-04-15 07:15:44,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:15:44,811 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 50 states have internal predecessors, (105), 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 108 [2022-04-15 07:15:44,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:15:44,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 51 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 50 states have internal predecessors, (105), 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 07:15:44,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:44,880 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-15 07:15:44,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:15:44,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-15 07:15:44,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2353, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 07:15:44,881 INFO L87 Difference]: Start difference. First operand 112 states and 115 transitions. Second operand has 51 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 50 states have internal predecessors, (105), 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 07:15:50,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:50,849 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2022-04-15 07:15:50,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-15 07:15:50,849 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 50 states have internal predecessors, (105), 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 108 [2022-04-15 07:15:50,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:15:50,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 50 states have internal predecessors, (105), 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 07:15:50,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 141 transitions. [2022-04-15 07:15:50,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 50 states have internal predecessors, (105), 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 07:15:50,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 141 transitions. [2022-04-15 07:15:50,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 141 transitions. [2022-04-15 07:15:50,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:50,958 INFO L225 Difference]: With dead ends: 131 [2022-04-15 07:15:50,958 INFO L226 Difference]: Without dead ends: 120 [2022-04-15 07:15:50,958 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 35 SyntacticMatches, 25 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1915 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=585, Invalid=9117, Unknown=0, NotChecked=0, Total=9702 [2022-04-15 07:15:50,959 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 133 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 3962 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 4070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 3962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-15 07:15:50,959 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 52 Invalid, 4070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 3962 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-15 07:15:50,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-15 07:15:51,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2022-04-15 07:15:51,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:15:51,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 113 states, 109 states have (on average 1.036697247706422) internal successors, (113), 109 states have internal predecessors, (113), 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 07:15:51,018 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 113 states, 109 states have (on average 1.036697247706422) internal successors, (113), 109 states have internal predecessors, (113), 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 07:15:51,018 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 113 states, 109 states have (on average 1.036697247706422) internal successors, (113), 109 states have internal predecessors, (113), 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 07:15:51,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:51,019 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2022-04-15 07:15:51,019 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2022-04-15 07:15:51,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:15:51,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:15:51,019 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 109 states have (on average 1.036697247706422) internal successors, (113), 109 states have internal predecessors, (113), 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 07:15:51,019 INFO L87 Difference]: Start difference. First operand has 113 states, 109 states have (on average 1.036697247706422) internal successors, (113), 109 states have internal predecessors, (113), 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 07:15:51,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:51,020 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2022-04-15 07:15:51,020 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2022-04-15 07:15:51,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:15:51,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:15:51,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:15:51,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:15:51,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 109 states have (on average 1.036697247706422) internal successors, (113), 109 states have internal predecessors, (113), 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 07:15:51,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 116 transitions. [2022-04-15 07:15:51,027 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 116 transitions. Word has length 108 [2022-04-15 07:15:51,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:15:51,027 INFO L478 AbstractCegarLoop]: Abstraction has 113 states and 116 transitions. [2022-04-15 07:15:51,027 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.0588235294117645) internal successors, (105), 50 states have internal predecessors, (105), 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 07:15:51,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 113 states and 116 transitions. [2022-04-15 07:15:51,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:51,280 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2022-04-15 07:15:51,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-15 07:15:51,280 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:15:51,280 INFO L499 BasicCegarLoop]: trace histogram [36, 36, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:15:51,280 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-04-15 07:15:51,280 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:15:51,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:15:51,281 INFO L85 PathProgramCache]: Analyzing trace with hash 751982443, now seen corresponding path program 43 times [2022-04-15 07:15:51,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:15:51,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [483747090] [2022-04-15 07:15:52,121 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:52,226 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:52,318 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:52,429 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:52,524 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:52,632 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:52,731 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:52,775 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:52,780 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:15:52,781 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:15:52,955 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:52,956 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:15:52,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1742634755, now seen corresponding path program 1 times [2022-04-15 07:15:52,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:15:52,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303391958] [2022-04-15 07:15:52,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:15:52,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:15:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:15:52,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:15:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:15:52,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {24701#(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); {24695#true} is VALID [2022-04-15 07:15:52,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {24695#true} assume true; {24695#true} is VALID [2022-04-15 07:15:52,983 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24695#true} {24695#true} #68#return; {24695#true} is VALID [2022-04-15 07:15:52,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {24695#true} call ULTIMATE.init(); {24701#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:15:52,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {24701#(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); {24695#true} is VALID [2022-04-15 07:15:52,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {24695#true} assume true; {24695#true} is VALID [2022-04-15 07:15:52,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24695#true} {24695#true} #68#return; {24695#true} is VALID [2022-04-15 07:15:52,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {24695#true} call #t~ret8 := main(); {24695#true} is VALID [2022-04-15 07:15:52,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {24695#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {24700#(= main_~a~0 0)} is VALID [2022-04-15 07:15:52,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {24700#(= main_~a~0 0)} [162] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_1592 v_main_~c~0_1583)) (.cse1 (= |v_main_#t~pre5_291| |v_main_#t~pre5_289|)) (.cse2 (= v_main_~d~0_5012 v_main_~d~0_4969)) (.cse3 (= |v_main_#t~pre6_1205| |v_main_#t~pre6_1198|)) (.cse4 (= v_main_~b~0_399 v_main_~b~0_396)) (.cse5 (= |v_main_#t~pre4_229| |v_main_#t~pre4_228|))) (or (and .cse0 (= v_main_~a~0_280 v_main_~a~0_279) .cse1 .cse2 .cse3 (= |v_main_#t~pre7_3427| |v_main_#t~pre7_3391|) .cse4 .cse5) (and .cse0 (= v_main_~a~0_279 v_main_~a~0_280) .cse1 .cse2 .cse3 (= |v_main_#t~pre7_3391| |v_main_#t~pre7_3427|) .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_3427|, main_~c~0=v_main_~c~0_1592, main_~d~0=v_main_~d~0_5012, main_~b~0=v_main_~b~0_399, main_#t~pre4=|v_main_#t~pre4_229|, main_#t~pre5=|v_main_#t~pre5_291|, main_~a~0=v_main_~a~0_280, main_#t~pre6=|v_main_#t~pre6_1205|} OutVars{main_#t~pre7=|v_main_#t~pre7_3391|, main_~c~0=v_main_~c~0_1583, main_~d~0=v_main_~d~0_4969, main_~b~0=v_main_~b~0_396, main_#t~pre4=|v_main_#t~pre4_228|, main_#t~pre5=|v_main_#t~pre5_289|, main_~a~0=v_main_~a~0_279, main_#t~pre6=|v_main_#t~pre6_1198|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {24700#(= main_~a~0 0)} is VALID [2022-04-15 07:15:52,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {24700#(= main_~a~0 0)} [161] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {24696#false} is VALID [2022-04-15 07:15:52,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {24696#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {24696#false} is VALID [2022-04-15 07:15:52,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {24696#false} assume !false; {24696#false} is VALID [2022-04-15 07:15:52,985 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 07:15:52,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:15:52,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303391958] [2022-04-15 07:15:52,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303391958] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:15:52,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:15:52,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:15:54,833 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:15:54,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [483747090] [2022-04-15 07:15:54,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [483747090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:15:54,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:15:54,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-15 07:15:54,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226536548] [2022-04-15 07:15:54,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:15:54,835 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 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 111 [2022-04-15 07:15:54,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:15:54,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 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 07:15:54,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:54,926 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-15 07:15:54,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:15:54,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-15 07:15:54,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2452, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 07:15:54,926 INFO L87 Difference]: Start difference. First operand 113 states and 116 transitions. Second operand has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 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 07:16:01,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:01,565 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2022-04-15 07:16:01,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-15 07:16:01,565 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 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 111 [2022-04-15 07:16:01,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:16:01,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 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 07:16:01,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 143 transitions. [2022-04-15 07:16:01,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 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 07:16:01,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 143 transitions. [2022-04-15 07:16:01,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 143 transitions. [2022-04-15 07:16:01,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:16:01,674 INFO L225 Difference]: With dead ends: 133 [2022-04-15 07:16:01,674 INFO L226 Difference]: Without dead ends: 122 [2022-04-15 07:16:01,675 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 40 SyntacticMatches, 22 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2015 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=594, Invalid=9506, Unknown=0, NotChecked=0, Total=10100 [2022-04-15 07:16:01,675 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 136 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 3896 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 4006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 3896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:16:01,675 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 42 Invalid, 4006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 3896 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-15 07:16:01,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-15 07:16:01,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2022-04-15 07:16:01,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:16:01,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 114 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 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 07:16:01,728 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 114 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 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 07:16:01,728 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 114 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 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 07:16:01,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:01,729 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2022-04-15 07:16:01,729 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2022-04-15 07:16:01,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:16:01,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:16:01,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 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 122 states. [2022-04-15 07:16:01,729 INFO L87 Difference]: Start difference. First operand has 114 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 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 122 states. [2022-04-15 07:16:01,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:01,730 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2022-04-15 07:16:01,730 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2022-04-15 07:16:01,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:16:01,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:16:01,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:16:01,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:16:01,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 110 states have internal predecessors, (114), 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 07:16:01,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 117 transitions. [2022-04-15 07:16:01,732 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 117 transitions. Word has length 111 [2022-04-15 07:16:01,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:16:01,732 INFO L478 AbstractCegarLoop]: Abstraction has 114 states and 117 transitions. [2022-04-15 07:16:01,732 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 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 07:16:01,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 114 states and 117 transitions. [2022-04-15 07:16:01,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:16:01,998 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2022-04-15 07:16:01,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-15 07:16:01,999 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:16:01,999 INFO L499 BasicCegarLoop]: trace histogram [37, 37, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:16:01,999 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-04-15 07:16:01,999 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:16:01,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:16:01,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1034444425, now seen corresponding path program 44 times [2022-04-15 07:16:01,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:16:02,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1485126810] [2022-04-15 07:16:02,900 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:16:03,023 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:16:03,148 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:16:03,265 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:16:03,308 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:16:03,315 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:16:03,315 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:16:03,492 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:16:03,492 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:16:03,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1742696259, now seen corresponding path program 1 times [2022-04-15 07:16:03,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:16:03,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123313241] [2022-04-15 07:16:03,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:16:03,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:16:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:16:03,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:16:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:16:03,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {25594#(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); {25588#true} is VALID [2022-04-15 07:16:03,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {25588#true} assume true; {25588#true} is VALID [2022-04-15 07:16:03,522 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25588#true} {25588#true} #68#return; {25588#true} is VALID [2022-04-15 07:16:03,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {25588#true} call ULTIMATE.init(); {25594#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:16:03,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {25594#(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); {25588#true} is VALID [2022-04-15 07:16:03,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {25588#true} assume true; {25588#true} is VALID [2022-04-15 07:16:03,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25588#true} {25588#true} #68#return; {25588#true} is VALID [2022-04-15 07:16:03,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {25588#true} call #t~ret8 := main(); {25588#true} is VALID [2022-04-15 07:16:03,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {25588#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {25593#(= main_~a~0 0)} is VALID [2022-04-15 07:16:03,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {25593#(= main_~a~0 0)} [164] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_234| |v_main_#t~pre4_233|)) (.cse1 (= |v_main_#t~pre5_312| |v_main_#t~pre5_310|)) (.cse2 (= v_main_~a~0_286 v_main_~a~0_285)) (.cse3 (= v_main_~b~0_427 v_main_~b~0_424)) (.cse4 (= |v_main_#t~pre7_3537| |v_main_#t~pre7_3500|)) (.cse5 (= v_main_~d~0_5190 v_main_~d~0_5146))) (or (and .cse0 (= |v_main_#t~pre6_1238| |v_main_#t~pre6_1245|) .cse1 .cse2 .cse3 .cse4 (= v_main_~c~0_1650 v_main_~c~0_1659) .cse5) (and .cse0 (= v_main_~c~0_1659 v_main_~c~0_1650) .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre6_1245| |v_main_#t~pre6_1238|) .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_3537|, main_~c~0=v_main_~c~0_1659, main_~d~0=v_main_~d~0_5190, main_~b~0=v_main_~b~0_427, main_#t~pre4=|v_main_#t~pre4_234|, main_#t~pre5=|v_main_#t~pre5_312|, main_~a~0=v_main_~a~0_286, main_#t~pre6=|v_main_#t~pre6_1245|} OutVars{main_#t~pre7=|v_main_#t~pre7_3500|, main_~c~0=v_main_~c~0_1650, main_~d~0=v_main_~d~0_5146, main_~b~0=v_main_~b~0_424, main_#t~pre4=|v_main_#t~pre4_233|, main_#t~pre5=|v_main_#t~pre5_310|, main_~a~0=v_main_~a~0_285, main_#t~pre6=|v_main_#t~pre6_1238|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {25593#(= main_~a~0 0)} is VALID [2022-04-15 07:16:03,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {25593#(= main_~a~0 0)} [163] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {25589#false} is VALID [2022-04-15 07:16:03,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {25589#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {25589#false} is VALID [2022-04-15 07:16:03,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {25589#false} assume !false; {25589#false} is VALID [2022-04-15 07:16:03,524 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 07:16:03,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:16:03,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123313241] [2022-04-15 07:16:03,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123313241] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:16:03,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:16:03,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:16:05,344 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:16:05,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1485126810] [2022-04-15 07:16:05,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1485126810] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:16:05,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:16:05,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-15 07:16:05,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912500002] [2022-04-15 07:16:05,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:16:05,355 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 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 113 [2022-04-15 07:16:05,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:16:05,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 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 07:16:05,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:16:05,435 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-15 07:16:05,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:16:05,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-15 07:16:05,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2553, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 07:16:05,436 INFO L87 Difference]: Start difference. First operand 114 states and 117 transitions. Second operand has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 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 07:16:12,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:12,103 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2022-04-15 07:16:12,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-15 07:16:12,103 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 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 113 [2022-04-15 07:16:12,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:16:12,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 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 07:16:12,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 145 transitions. [2022-04-15 07:16:12,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 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 07:16:12,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 145 transitions. [2022-04-15 07:16:12,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 145 transitions. [2022-04-15 07:16:12,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:16:12,238 INFO L225 Difference]: With dead ends: 135 [2022-04-15 07:16:12,238 INFO L226 Difference]: Without dead ends: 124 [2022-04-15 07:16:12,238 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 38 SyntacticMatches, 25 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2186 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=603, Invalid=9903, Unknown=0, NotChecked=0, Total=10506 [2022-04-15 07:16:12,239 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 138 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4374 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 4486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 4374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:16:12,239 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 32 Invalid, 4486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 4374 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-15 07:16:12,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-15 07:16:12,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 116. [2022-04-15 07:16:12,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:16:12,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 116 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 112 states have internal predecessors, (116), 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 07:16:12,302 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 116 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 112 states have internal predecessors, (116), 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 07:16:12,302 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 116 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 112 states have internal predecessors, (116), 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 07:16:12,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:12,303 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2022-04-15 07:16:12,303 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2022-04-15 07:16:12,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:16:12,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:16:12,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 112 states have internal predecessors, (116), 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 07:16:12,304 INFO L87 Difference]: Start difference. First operand has 116 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 112 states have internal predecessors, (116), 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 07:16:12,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:12,305 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2022-04-15 07:16:12,305 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2022-04-15 07:16:12,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:16:12,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:16:12,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:16:12,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:16:12,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 112 states have internal predecessors, (116), 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 07:16:12,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2022-04-15 07:16:12,307 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 113 [2022-04-15 07:16:12,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:16:12,307 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2022-04-15 07:16:12,307 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.0754716981132075) internal successors, (110), 52 states have internal predecessors, (110), 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 07:16:12,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 119 transitions. [2022-04-15 07:16:12,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:16:12,578 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2022-04-15 07:16:12,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-15 07:16:12,580 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:16:12,580 INFO L499 BasicCegarLoop]: trace histogram [38, 38, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:16:12,580 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-04-15 07:16:12,581 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:16:12,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:16:12,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1897469479, now seen corresponding path program 45 times [2022-04-15 07:16:12,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:16:12,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1476199477] [2022-04-15 07:16:13,508 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:16:13,640 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:16:13,770 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:16:13,887 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:16:14,011 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:16:14,142 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:16:14,354 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:16:14,355 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:16:14,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1742757763, now seen corresponding path program 1 times [2022-04-15 07:16:14,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:16:14,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617281485] [2022-04-15 07:16:14,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:16:14,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:16:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:16:14,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:16:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:16:14,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {26502#(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); {26496#true} is VALID [2022-04-15 07:16:14,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {26496#true} assume true; {26496#true} is VALID [2022-04-15 07:16:14,395 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26496#true} {26496#true} #68#return; {26496#true} is VALID [2022-04-15 07:16:14,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {26496#true} call ULTIMATE.init(); {26502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:16:14,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {26502#(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); {26496#true} is VALID [2022-04-15 07:16:14,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {26496#true} assume true; {26496#true} is VALID [2022-04-15 07:16:14,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26496#true} {26496#true} #68#return; {26496#true} is VALID [2022-04-15 07:16:14,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {26496#true} call #t~ret8 := main(); {26496#true} is VALID [2022-04-15 07:16:14,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {26496#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {26501#(= main_~a~0 0)} is VALID [2022-04-15 07:16:14,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {26501#(= main_~a~0 0)} [166] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre7_3659| |v_main_#t~pre7_3621|)) (.cse1 (= |v_main_#t~pre6_1289| |v_main_#t~pre6_1282|)) (.cse2 (= v_main_~b~0_455 v_main_~b~0_452)) (.cse3 (= v_main_~a~0_292 v_main_~a~0_291)) (.cse4 (= |v_main_#t~pre5_333| |v_main_#t~pre5_331|)) (.cse5 (= |v_main_#t~pre4_239| |v_main_#t~pre4_238|)) (.cse6 (= v_main_~d~0_5381 v_main_~d~0_5336))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~c~0_1724 v_main_~c~0_1715) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~c~0_1715 v_main_~c~0_1724) .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_3659|, main_~c~0=v_main_~c~0_1724, main_~d~0=v_main_~d~0_5381, main_~b~0=v_main_~b~0_455, main_#t~pre4=|v_main_#t~pre4_239|, main_#t~pre5=|v_main_#t~pre5_333|, main_~a~0=v_main_~a~0_292, main_#t~pre6=|v_main_#t~pre6_1289|} OutVars{main_#t~pre7=|v_main_#t~pre7_3621|, main_~c~0=v_main_~c~0_1715, main_~d~0=v_main_~d~0_5336, main_~b~0=v_main_~b~0_452, main_#t~pre4=|v_main_#t~pre4_238|, main_#t~pre5=|v_main_#t~pre5_331|, main_~a~0=v_main_~a~0_291, main_#t~pre6=|v_main_#t~pre6_1282|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {26501#(= main_~a~0 0)} is VALID [2022-04-15 07:16:14,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {26501#(= main_~a~0 0)} [165] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {26497#false} is VALID [2022-04-15 07:16:14,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {26497#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {26497#false} is VALID [2022-04-15 07:16:14,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {26497#false} assume !false; {26497#false} is VALID [2022-04-15 07:16:14,404 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 07:16:14,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:16:14,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617281485] [2022-04-15 07:16:14,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617281485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:16:14,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:16:14,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:16:16,258 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:16:16,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1476199477] [2022-04-15 07:16:16,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1476199477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:16:16,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:16:16,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-04-15 07:16:16,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994343382] [2022-04-15 07:16:16,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:16:16,259 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 53 states have internal predecessors, (112), 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 07:16:16,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:16:16,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 53 states have internal predecessors, (112), 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 07:16:16,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:16:16,340 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-15 07:16:16,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:16:16,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-15 07:16:16,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=2656, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 07:16:16,340 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 53 states have internal predecessors, (112), 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 07:16:23,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:23,384 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2022-04-15 07:16:23,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-15 07:16:23,384 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 53 states have internal predecessors, (112), 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 07:16:23,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:16:23,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 53 states have internal predecessors, (112), 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 07:16:23,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 147 transitions. [2022-04-15 07:16:23,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 53 states have internal predecessors, (112), 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 07:16:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 147 transitions. [2022-04-15 07:16:23,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 147 transitions. [2022-04-15 07:16:23,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:16:23,496 INFO L225 Difference]: With dead ends: 137 [2022-04-15 07:16:23,496 INFO L226 Difference]: Without dead ends: 126 [2022-04-15 07:16:23,497 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 35 SyntacticMatches, 29 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2337 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=612, Invalid=10308, Unknown=0, NotChecked=0, Total=10920 [2022-04-15 07:16:23,498 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 185 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 4725 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 4886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 4725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:16:23,498 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 52 Invalid, 4886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 4725 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-15 07:16:23,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-04-15 07:16:23,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 118. [2022-04-15 07:16:23,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:16:23,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 118 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 114 states have internal predecessors, (118), 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 07:16:23,576 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 118 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 114 states have internal predecessors, (118), 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 07:16:23,576 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 118 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 114 states have internal predecessors, (118), 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 07:16:23,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:23,578 INFO L93 Difference]: Finished difference Result 126 states and 132 transitions. [2022-04-15 07:16:23,578 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2022-04-15 07:16:23,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:16:23,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:16:23,578 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 114 states have internal predecessors, (118), 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 126 states. [2022-04-15 07:16:23,578 INFO L87 Difference]: Start difference. First operand has 118 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 114 states have internal predecessors, (118), 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 126 states. [2022-04-15 07:16:23,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:23,580 INFO L93 Difference]: Finished difference Result 126 states and 132 transitions. [2022-04-15 07:16:23,580 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2022-04-15 07:16:23,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:16:23,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:16:23,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:16:23,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:16:23,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 114 states have (on average 1.0350877192982457) internal successors, (118), 114 states have internal predecessors, (118), 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 07:16:23,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 121 transitions. [2022-04-15 07:16:23,582 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 121 transitions. Word has length 115 [2022-04-15 07:16:23,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:16:23,582 INFO L478 AbstractCegarLoop]: Abstraction has 118 states and 121 transitions. [2022-04-15 07:16:23,582 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 53 states have internal predecessors, (112), 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 07:16:23,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 121 transitions. [2022-04-15 07:16:23,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:16:23,943 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2022-04-15 07:16:23,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-15 07:16:23,943 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:16:23,943 INFO L499 BasicCegarLoop]: trace histogram [39, 39, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:16:23,944 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-04-15 07:16:23,944 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:16:23,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:16:23,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1959109051, now seen corresponding path program 46 times [2022-04-15 07:16:23,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:16:23,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1056235411] [2022-04-15 07:16:24,925 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:16:25,032 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:16:25,150 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:16:25,282 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:16:25,393 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:16:25,503 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:16:25,724 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:16:25,724 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:16:25,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1742819267, now seen corresponding path program 1 times [2022-04-15 07:16:25,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:16:25,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090112895] [2022-04-15 07:16:25,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:16:25,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:16:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:16:25,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:16:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:16:25,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {27425#(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); {27419#true} is VALID [2022-04-15 07:16:25,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {27419#true} assume true; {27419#true} is VALID [2022-04-15 07:16:25,751 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27419#true} {27419#true} #68#return; {27419#true} is VALID [2022-04-15 07:16:25,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {27419#true} call ULTIMATE.init(); {27425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:16:25,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {27425#(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); {27419#true} is VALID [2022-04-15 07:16:25,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {27419#true} assume true; {27419#true} is VALID [2022-04-15 07:16:25,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27419#true} {27419#true} #68#return; {27419#true} is VALID [2022-04-15 07:16:25,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {27419#true} call #t~ret8 := main(); {27419#true} is VALID [2022-04-15 07:16:25,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {27419#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {27424#(= main_~a~0 0)} is VALID [2022-04-15 07:16:25,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {27424#(= main_~a~0 0)} [168] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~b~0_483 v_main_~b~0_480)) (.cse1 (= v_main_~d~0_5576 v_main_~d~0_5530)) (.cse2 (= |v_main_#t~pre4_244| |v_main_#t~pre4_243|)) (.cse3 (= v_main_~a~0_298 v_main_~a~0_297)) (.cse4 (= |v_main_#t~pre5_354| |v_main_#t~pre5_352|)) (.cse5 (= |v_main_#t~pre7_3784| |v_main_#t~pre7_3745|))) (or (and .cse0 .cse1 (= v_main_~c~0_1789 v_main_~c~0_1780) .cse2 .cse3 .cse4 .cse5 (= |v_main_#t~pre6_1333| |v_main_#t~pre6_1326|)) (and .cse0 (= v_main_~c~0_1780 v_main_~c~0_1789) .cse1 (= |v_main_#t~pre6_1326| |v_main_#t~pre6_1333|) .cse2 .cse3 .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_3784|, main_~c~0=v_main_~c~0_1789, main_~d~0=v_main_~d~0_5576, main_~b~0=v_main_~b~0_483, main_#t~pre4=|v_main_#t~pre4_244|, main_#t~pre5=|v_main_#t~pre5_354|, main_~a~0=v_main_~a~0_298, main_#t~pre6=|v_main_#t~pre6_1333|} OutVars{main_#t~pre7=|v_main_#t~pre7_3745|, main_~c~0=v_main_~c~0_1780, main_~d~0=v_main_~d~0_5530, main_~b~0=v_main_~b~0_480, main_#t~pre4=|v_main_#t~pre4_243|, main_#t~pre5=|v_main_#t~pre5_352|, main_~a~0=v_main_~a~0_297, main_#t~pre6=|v_main_#t~pre6_1326|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {27424#(= main_~a~0 0)} is VALID [2022-04-15 07:16:25,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {27424#(= main_~a~0 0)} [167] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {27420#false} is VALID [2022-04-15 07:16:25,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {27420#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {27420#false} is VALID [2022-04-15 07:16:25,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {27420#false} assume !false; {27420#false} is VALID [2022-04-15 07:16:25,755 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 07:16:25,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:16:25,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090112895] [2022-04-15 07:16:25,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090112895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:16:25,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:16:25,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:16:27,634 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:16:27,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1056235411] [2022-04-15 07:16:27,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1056235411] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:16:27,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:16:27,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-15 07:16:27,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960134904] [2022-04-15 07:16:27,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:16:27,635 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 54 states have internal predecessors, (114), 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 117 [2022-04-15 07:16:27,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:16:27,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 54 states have internal predecessors, (114), 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 07:16:27,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:16:27,711 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-15 07:16:27,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:16:27,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-15 07:16:27,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=2761, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 07:16:27,712 INFO L87 Difference]: Start difference. First operand 118 states and 121 transitions. Second operand has 55 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 54 states have internal predecessors, (114), 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 07:16:34,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:34,917 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2022-04-15 07:16:34,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-15 07:16:34,918 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 54 states have internal predecessors, (114), 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 117 [2022-04-15 07:16:34,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:16:34,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 54 states have internal predecessors, (114), 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 07:16:34,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 149 transitions. [2022-04-15 07:16:34,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 54 states have internal predecessors, (114), 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 07:16:34,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 149 transitions. [2022-04-15 07:16:34,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 149 transitions. [2022-04-15 07:16:35,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:16:35,025 INFO L225 Difference]: With dead ends: 139 [2022-04-15 07:16:35,025 INFO L226 Difference]: Without dead ends: 128 [2022-04-15 07:16:35,026 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 39 SyntacticMatches, 26 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2542 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=621, Invalid=10721, Unknown=0, NotChecked=0, Total=11342 [2022-04-15 07:16:35,026 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 171 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 4770 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 4921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 4770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:16:35,026 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 107 Invalid, 4921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 4770 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-15 07:16:35,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-15 07:16:35,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2022-04-15 07:16:35,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:16:35,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 120 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 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 07:16:35,092 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 120 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 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 07:16:35,092 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 120 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 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 07:16:35,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:35,093 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2022-04-15 07:16:35,093 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2022-04-15 07:16:35,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:16:35,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:16:35,093 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 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 128 states. [2022-04-15 07:16:35,093 INFO L87 Difference]: Start difference. First operand has 120 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 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 128 states. [2022-04-15 07:16:35,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:35,096 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2022-04-15 07:16:35,096 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2022-04-15 07:16:35,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:16:35,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:16:35,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:16:35,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:16:35,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 116 states have (on average 1.0344827586206897) internal successors, (120), 116 states have internal predecessors, (120), 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 07:16:35,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 123 transitions. [2022-04-15 07:16:35,098 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 123 transitions. Word has length 117 [2022-04-15 07:16:35,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:16:35,098 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 123 transitions. [2022-04-15 07:16:35,099 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.0727272727272728) internal successors, (114), 54 states have internal predecessors, (114), 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 07:16:35,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 120 states and 123 transitions. [2022-04-15 07:16:35,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:16:35,434 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 123 transitions. [2022-04-15 07:16:35,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-15 07:16:35,435 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:16:35,435 INFO L499 BasicCegarLoop]: trace histogram [40, 40, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:16:35,435 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-04-15 07:16:35,435 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:16:35,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:16:35,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1574299933, now seen corresponding path program 47 times [2022-04-15 07:16:35,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:16:35,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [233813246] [2022-04-15 07:16:36,320 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:16:40,402 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:16:40,450 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:16:40,562 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:16:40,685 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:16:44,769 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:16:44,827 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:16:44,940 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:16:45,158 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:16:45,158 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:16:45,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1742880771, now seen corresponding path program 1 times [2022-04-15 07:16:45,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:16:45,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676427670] [2022-04-15 07:16:45,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:16:45,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:16:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:16:45,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:16:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:16:45,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {28363#(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); {28357#true} is VALID [2022-04-15 07:16:45,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {28357#true} assume true; {28357#true} is VALID [2022-04-15 07:16:45,188 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28357#true} {28357#true} #68#return; {28357#true} is VALID [2022-04-15 07:16:45,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {28357#true} call ULTIMATE.init(); {28363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:16:45,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {28363#(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); {28357#true} is VALID [2022-04-15 07:16:45,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {28357#true} assume true; {28357#true} is VALID [2022-04-15 07:16:45,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28357#true} {28357#true} #68#return; {28357#true} is VALID [2022-04-15 07:16:45,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {28357#true} call #t~ret8 := main(); {28357#true} is VALID [2022-04-15 07:16:45,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {28357#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {28362#(= main_~a~0 0)} is VALID [2022-04-15 07:16:45,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {28362#(= main_~a~0 0)} [170] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_304 v_main_~a~0_303)) (.cse1 (= |v_main_#t~pre7_3912| |v_main_#t~pre7_3872|)) (.cse2 (= |v_main_#t~pre4_249| |v_main_#t~pre4_248|)) (.cse3 (= v_main_~d~0_5775 v_main_~d~0_5728)) (.cse4 (= |v_main_#t~pre5_375| |v_main_#t~pre5_373|)) (.cse5 (= v_main_~c~0_1854 v_main_~c~0_1845)) (.cse6 (= |v_main_#t~pre6_1377| |v_main_#t~pre6_1370|))) (or (and .cse0 (= v_main_~b~0_511 v_main_~b~0_508) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~b~0_508 v_main_~b~0_511) .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_3912|, main_~c~0=v_main_~c~0_1854, main_~d~0=v_main_~d~0_5775, main_~b~0=v_main_~b~0_511, main_#t~pre4=|v_main_#t~pre4_249|, main_#t~pre5=|v_main_#t~pre5_375|, main_~a~0=v_main_~a~0_304, main_#t~pre6=|v_main_#t~pre6_1377|} OutVars{main_#t~pre7=|v_main_#t~pre7_3872|, main_~c~0=v_main_~c~0_1845, main_~d~0=v_main_~d~0_5728, main_~b~0=v_main_~b~0_508, main_#t~pre4=|v_main_#t~pre4_248|, main_#t~pre5=|v_main_#t~pre5_373|, main_~a~0=v_main_~a~0_303, main_#t~pre6=|v_main_#t~pre6_1370|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {28362#(= main_~a~0 0)} is VALID [2022-04-15 07:16:45,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {28362#(= main_~a~0 0)} [169] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {28358#false} is VALID [2022-04-15 07:16:45,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {28358#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {28358#false} is VALID [2022-04-15 07:16:45,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {28358#false} assume !false; {28358#false} is VALID [2022-04-15 07:16:45,191 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 07:16:45,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:16:45,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676427670] [2022-04-15 07:16:45,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676427670] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:16:45,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:16:45,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:16:47,141 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:16:47,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [233813246] [2022-04-15 07:16:47,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [233813246] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:16:47,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:16:47,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-04-15 07:16:47,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809459698] [2022-04-15 07:16:47,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:16:47,141 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 55 states have internal predecessors, (116), 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 119 [2022-04-15 07:16:47,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:16:47,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 56 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 55 states have internal predecessors, (116), 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 07:16:47,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:16:47,223 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-15 07:16:47,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:16:47,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-15 07:16:47,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=2868, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 07:16:47,224 INFO L87 Difference]: Start difference. First operand 120 states and 123 transitions. Second operand has 56 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 55 states have internal predecessors, (116), 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 07:16:54,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:54,682 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2022-04-15 07:16:54,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-15 07:16:54,682 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 55 states have internal predecessors, (116), 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 119 [2022-04-15 07:16:54,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:16:54,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 55 states have internal predecessors, (116), 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 07:16:54,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 151 transitions. [2022-04-15 07:16:54,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 55 states have internal predecessors, (116), 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 07:16:54,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 151 transitions. [2022-04-15 07:16:54,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 151 transitions. [2022-04-15 07:16:54,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:16:54,806 INFO L225 Difference]: With dead ends: 141 [2022-04-15 07:16:54,806 INFO L226 Difference]: Without dead ends: 130 [2022-04-15 07:16:54,807 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 38 SyntacticMatches, 28 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2695 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=630, Invalid=11142, Unknown=0, NotChecked=0, Total=11772 [2022-04-15 07:16:54,807 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 135 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 4900 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 5012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 4900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:16:54,807 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 167 Invalid, 5012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 4900 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-15 07:16:54,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-15 07:16:54,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 122. [2022-04-15 07:16:54,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:16:54,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 122 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 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 07:16:54,870 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 122 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 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 07:16:54,870 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 122 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 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 07:16:54,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:54,871 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2022-04-15 07:16:54,871 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2022-04-15 07:16:54,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:16:54,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:16:54,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 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 130 states. [2022-04-15 07:16:54,872 INFO L87 Difference]: Start difference. First operand has 122 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 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 130 states. [2022-04-15 07:16:54,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:54,872 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2022-04-15 07:16:54,873 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2022-04-15 07:16:54,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:16:54,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:16:54,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:16:54,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:16:54,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 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 07:16:54,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 125 transitions. [2022-04-15 07:16:54,874 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 125 transitions. Word has length 119 [2022-04-15 07:16:54,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:16:54,874 INFO L478 AbstractCegarLoop]: Abstraction has 122 states and 125 transitions. [2022-04-15 07:16:54,874 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.0714285714285716) internal successors, (116), 55 states have internal predecessors, (116), 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 07:16:54,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 122 states and 125 transitions. [2022-04-15 07:16:55,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:16:55,191 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 125 transitions. [2022-04-15 07:16:55,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-15 07:16:55,192 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:16:55,192 INFO L499 BasicCegarLoop]: trace histogram [41, 41, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:16:55,192 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-04-15 07:16:55,192 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:16:55,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:16:55,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1139924991, now seen corresponding path program 48 times [2022-04-15 07:16:55,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:16:55,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [824269331] [2022-04-15 07:16:56,120 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:00,198 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:17:00,239 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:00,356 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:00,473 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:02,584 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:17:02,627 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:02,747 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:02,967 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:02,967 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:17:02,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1742942275, now seen corresponding path program 1 times [2022-04-15 07:17:02,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:17:02,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482528450] [2022-04-15 07:17:02,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:17:02,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:17:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:17:02,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:17:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:17:02,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {29316#(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); {29310#true} is VALID [2022-04-15 07:17:02,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {29310#true} assume true; {29310#true} is VALID [2022-04-15 07:17:02,999 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29310#true} {29310#true} #68#return; {29310#true} is VALID [2022-04-15 07:17:02,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {29310#true} call ULTIMATE.init(); {29316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:17:02,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {29316#(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); {29310#true} is VALID [2022-04-15 07:17:02,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {29310#true} assume true; {29310#true} is VALID [2022-04-15 07:17:02,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29310#true} {29310#true} #68#return; {29310#true} is VALID [2022-04-15 07:17:02,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {29310#true} call #t~ret8 := main(); {29310#true} is VALID [2022-04-15 07:17:03,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {29310#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {29315#(= main_~a~0 0)} is VALID [2022-04-15 07:17:03,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {29315#(= main_~a~0 0)} [172] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre7_4043| |v_main_#t~pre7_4002|)) (.cse1 (= |v_main_#t~pre4_254| |v_main_#t~pre4_253|)) (.cse2 (= v_main_~d~0_5978 v_main_~d~0_5930)) (.cse3 (= v_main_~c~0_1919 v_main_~c~0_1910)) (.cse4 (= v_main_~b~0_539 v_main_~b~0_536)) (.cse5 (= |v_main_#t~pre5_396| |v_main_#t~pre5_394|))) (or (and .cse0 (= |v_main_#t~pre6_1421| |v_main_#t~pre6_1414|) .cse1 .cse2 .cse3 .cse4 (= v_main_~a~0_310 v_main_~a~0_309) .cse5) (and .cse0 .cse1 (= v_main_~a~0_309 v_main_~a~0_310) .cse2 .cse3 .cse4 (= |v_main_#t~pre6_1414| |v_main_#t~pre6_1421|) .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_4043|, main_~c~0=v_main_~c~0_1919, main_~d~0=v_main_~d~0_5978, main_~b~0=v_main_~b~0_539, main_#t~pre4=|v_main_#t~pre4_254|, main_#t~pre5=|v_main_#t~pre5_396|, main_~a~0=v_main_~a~0_310, main_#t~pre6=|v_main_#t~pre6_1421|} OutVars{main_#t~pre7=|v_main_#t~pre7_4002|, main_~c~0=v_main_~c~0_1910, main_~d~0=v_main_~d~0_5930, main_~b~0=v_main_~b~0_536, main_#t~pre4=|v_main_#t~pre4_253|, main_#t~pre5=|v_main_#t~pre5_394|, main_~a~0=v_main_~a~0_309, main_#t~pre6=|v_main_#t~pre6_1414|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {29315#(= main_~a~0 0)} is VALID [2022-04-15 07:17:03,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {29315#(= main_~a~0 0)} [171] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {29311#false} is VALID [2022-04-15 07:17:03,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {29311#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {29311#false} is VALID [2022-04-15 07:17:03,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {29311#false} assume !false; {29311#false} is VALID [2022-04-15 07:17:03,001 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 07:17:03,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:17:03,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482528450] [2022-04-15 07:17:03,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482528450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:17:03,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:17:03,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:17:04,851 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:17:04,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [824269331] [2022-04-15 07:17:04,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [824269331] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:17:04,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:17:04,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-04-15 07:17:04,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033192178] [2022-04-15 07:17:04,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:17:04,852 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 56 states have internal predecessors, (118), 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 121 [2022-04-15 07:17:04,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:17:04,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 56 states have internal predecessors, (118), 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 07:17:04,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:17:04,930 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-04-15 07:17:04,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:17:04,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-04-15 07:17:04,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=2977, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 07:17:04,931 INFO L87 Difference]: Start difference. First operand 122 states and 125 transitions. Second operand has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 56 states have internal predecessors, (118), 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 07:17:13,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:13,196 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2022-04-15 07:17:13,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-15 07:17:13,196 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 56 states have internal predecessors, (118), 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 121 [2022-04-15 07:17:13,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:17:13,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 56 states have internal predecessors, (118), 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 07:17:13,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 156 transitions. [2022-04-15 07:17:13,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 56 states have internal predecessors, (118), 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 07:17:13,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 156 transitions. [2022-04-15 07:17:13,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 156 transitions. [2022-04-15 07:17:13,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:17:13,316 INFO L225 Difference]: With dead ends: 145 [2022-04-15 07:17:13,316 INFO L226 Difference]: Without dead ends: 134 [2022-04-15 07:17:13,317 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 48 SyntacticMatches, 19 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2749 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=639, Invalid=11571, Unknown=0, NotChecked=0, Total=12210 [2022-04-15 07:17:13,317 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 193 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5578 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 5748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 5578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-15 07:17:13,317 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 82 Invalid, 5748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 5578 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-15 07:17:13,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-15 07:17:13,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 126. [2022-04-15 07:17:13,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:17:13,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 126 states, 122 states have (on average 1.0327868852459017) internal successors, (126), 122 states have internal predecessors, (126), 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 07:17:13,392 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 126 states, 122 states have (on average 1.0327868852459017) internal successors, (126), 122 states have internal predecessors, (126), 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 07:17:13,392 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 126 states, 122 states have (on average 1.0327868852459017) internal successors, (126), 122 states have internal predecessors, (126), 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 07:17:13,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:13,393 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2022-04-15 07:17:13,393 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2022-04-15 07:17:13,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:17:13,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:17:13,394 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 122 states have (on average 1.0327868852459017) internal successors, (126), 122 states have internal predecessors, (126), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 134 states. [2022-04-15 07:17:13,394 INFO L87 Difference]: Start difference. First operand has 126 states, 122 states have (on average 1.0327868852459017) internal successors, (126), 122 states have internal predecessors, (126), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 134 states. [2022-04-15 07:17:13,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:13,395 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2022-04-15 07:17:13,395 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2022-04-15 07:17:13,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:17:13,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:17:13,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:17:13,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:17:13,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 122 states have (on average 1.0327868852459017) internal successors, (126), 122 states have internal predecessors, (126), 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 07:17:13,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 129 transitions. [2022-04-15 07:17:13,396 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 129 transitions. Word has length 121 [2022-04-15 07:17:13,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:17:13,396 INFO L478 AbstractCegarLoop]: Abstraction has 126 states and 129 transitions. [2022-04-15 07:17:13,396 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.0701754385964914) internal successors, (118), 56 states have internal predecessors, (118), 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 07:17:13,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 126 states and 129 transitions. [2022-04-15 07:17:13,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:17:13,738 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 129 transitions. [2022-04-15 07:17:13,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-15 07:17:13,739 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:17:13,739 INFO L499 BasicCegarLoop]: trace histogram [42, 42, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:17:13,739 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-04-15 07:17:13,739 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:17:13,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:17:13,739 INFO L85 PathProgramCache]: Analyzing trace with hash -317433441, now seen corresponding path program 49 times [2022-04-15 07:17:13,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:17:13,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [505059404] [2022-04-15 07:17:14,652 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:18,735 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:17:18,784 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:18,904 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:19,019 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:23,103 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:17:23,154 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:23,270 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:23,489 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:23,489 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:17:23,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1743003779, now seen corresponding path program 1 times [2022-04-15 07:17:23,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:17:23,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521769218] [2022-04-15 07:17:23,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:17:23,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:17:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:17:23,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:17:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:17:23,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {30296#(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); {30290#true} is VALID [2022-04-15 07:17:23,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {30290#true} assume true; {30290#true} is VALID [2022-04-15 07:17:23,525 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30290#true} {30290#true} #68#return; {30290#true} is VALID [2022-04-15 07:17:23,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {30290#true} call ULTIMATE.init(); {30296#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:17:23,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {30296#(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); {30290#true} is VALID [2022-04-15 07:17:23,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {30290#true} assume true; {30290#true} is VALID [2022-04-15 07:17:23,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30290#true} {30290#true} #68#return; {30290#true} is VALID [2022-04-15 07:17:23,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {30290#true} call #t~ret8 := main(); {30290#true} is VALID [2022-04-15 07:17:23,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {30290#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {30295#(= main_~a~0 0)} is VALID [2022-04-15 07:17:23,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {30295#(= main_~a~0 0)} [174] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre7_4171| |v_main_#t~pre7_4129|)) (.cse1 (= |v_main_#t~pre5_417| |v_main_#t~pre5_415|)) (.cse2 (= v_main_~a~0_316 v_main_~a~0_315)) (.cse3 (= v_main_~b~0_567 v_main_~b~0_564)) (.cse4 (= v_main_~d~0_6178 v_main_~d~0_6129)) (.cse5 (= |v_main_#t~pre4_259| |v_main_#t~pre4_258|))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~pre6_1457| |v_main_#t~pre6_1464|) .cse3 (= v_main_~c~0_1973 v_main_~c~0_1982) .cse4 .cse5) (and .cse0 .cse1 .cse2 (= |v_main_#t~pre6_1464| |v_main_#t~pre6_1457|) (= v_main_~c~0_1982 v_main_~c~0_1973) .cse3 .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_4171|, main_~c~0=v_main_~c~0_1982, main_~d~0=v_main_~d~0_6178, main_~b~0=v_main_~b~0_567, main_#t~pre4=|v_main_#t~pre4_259|, main_#t~pre5=|v_main_#t~pre5_417|, main_~a~0=v_main_~a~0_316, main_#t~pre6=|v_main_#t~pre6_1464|} OutVars{main_#t~pre7=|v_main_#t~pre7_4129|, main_~c~0=v_main_~c~0_1973, main_~d~0=v_main_~d~0_6129, main_~b~0=v_main_~b~0_564, main_#t~pre4=|v_main_#t~pre4_258|, main_#t~pre5=|v_main_#t~pre5_415|, main_~a~0=v_main_~a~0_315, main_#t~pre6=|v_main_#t~pre6_1457|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {30295#(= main_~a~0 0)} is VALID [2022-04-15 07:17:23,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {30295#(= main_~a~0 0)} [173] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {30291#false} is VALID [2022-04-15 07:17:23,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {30291#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {30291#false} is VALID [2022-04-15 07:17:23,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {30291#false} assume !false; {30291#false} is VALID [2022-04-15 07:17:23,527 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 07:17:23,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:17:23,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521769218] [2022-04-15 07:17:23,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521769218] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:17:23,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:17:23,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:17:25,543 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:17:25,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [505059404] [2022-04-15 07:17:25,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [505059404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:17:25,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:17:25,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2022-04-15 07:17:25,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174769282] [2022-04-15 07:17:25,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:17:25,544 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 57 states have internal predecessors, (120), 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 123 [2022-04-15 07:17:25,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:17:25,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 58 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 57 states have internal predecessors, (120), 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 07:17:25,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:17:25,625 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-04-15 07:17:25,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:17:25,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-04-15 07:17:25,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=3088, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 07:17:25,626 INFO L87 Difference]: Start difference. First operand 126 states and 129 transitions. Second operand has 58 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 57 states have internal predecessors, (120), 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 07:17:33,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:33,142 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2022-04-15 07:17:33,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-04-15 07:17:33,142 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 57 states have internal predecessors, (120), 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 123 [2022-04-15 07:17:33,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:17:33,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 57 states have internal predecessors, (120), 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 07:17:33,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 156 transitions. [2022-04-15 07:17:33,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 57 states have internal predecessors, (120), 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 07:17:33,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 156 transitions. [2022-04-15 07:17:33,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 156 transitions. [2022-04-15 07:17:33,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:17:33,263 INFO L225 Difference]: With dead ends: 146 [2022-04-15 07:17:33,263 INFO L226 Difference]: Without dead ends: 135 [2022-04-15 07:17:33,264 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 46 SyntacticMatches, 22 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2978 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=648, Invalid=12008, Unknown=0, NotChecked=0, Total=12656 [2022-04-15 07:17:33,264 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 139 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 5040 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 5158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 5040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:17:33,264 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 132 Invalid, 5158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 5040 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-15 07:17:33,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-15 07:17:33,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2022-04-15 07:17:33,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:17:33,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 128 states, 124 states have (on average 1.032258064516129) internal successors, (128), 124 states have internal predecessors, (128), 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 07:17:33,335 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 128 states, 124 states have (on average 1.032258064516129) internal successors, (128), 124 states have internal predecessors, (128), 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 07:17:33,335 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 128 states, 124 states have (on average 1.032258064516129) internal successors, (128), 124 states have internal predecessors, (128), 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 07:17:33,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:33,336 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2022-04-15 07:17:33,336 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2022-04-15 07:17:33,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:17:33,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:17:33,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 124 states have (on average 1.032258064516129) internal successors, (128), 124 states have internal predecessors, (128), 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 135 states. [2022-04-15 07:17:33,336 INFO L87 Difference]: Start difference. First operand has 128 states, 124 states have (on average 1.032258064516129) internal successors, (128), 124 states have internal predecessors, (128), 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 135 states. [2022-04-15 07:17:33,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:33,337 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2022-04-15 07:17:33,337 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2022-04-15 07:17:33,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:17:33,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:17:33,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:17:33,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:17:33,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 124 states have (on average 1.032258064516129) internal successors, (128), 124 states have internal predecessors, (128), 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 07:17:33,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 131 transitions. [2022-04-15 07:17:33,339 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 131 transitions. Word has length 123 [2022-04-15 07:17:33,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:17:33,339 INFO L478 AbstractCegarLoop]: Abstraction has 128 states and 131 transitions. [2022-04-15 07:17:33,339 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.0689655172413794) internal successors, (120), 57 states have internal predecessors, (120), 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 07:17:33,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 131 transitions. [2022-04-15 07:17:33,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:17:33,651 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 131 transitions. [2022-04-15 07:17:33,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-15 07:17:33,651 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:17:33,651 INFO L499 BasicCegarLoop]: trace histogram [42, 42, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:17:33,651 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-04-15 07:17:33,651 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:17:33,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:17:33,652 INFO L85 PathProgramCache]: Analyzing trace with hash 727819726, now seen corresponding path program 50 times [2022-04-15 07:17:33,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:17:33,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1870935474] [2022-04-15 07:17:34,564 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:34,664 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:34,771 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:34,891 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:34,991 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:35,104 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:35,357 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:35,357 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:17:35,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1743065283, now seen corresponding path program 1 times [2022-04-15 07:17:35,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:17:35,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394998401] [2022-04-15 07:17:35,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:17:35,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:17:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:17:35,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:17:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:17:35,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {31287#(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); {31281#true} is VALID [2022-04-15 07:17:35,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {31281#true} assume true; {31281#true} is VALID [2022-04-15 07:17:35,385 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31281#true} {31281#true} #68#return; {31281#true} is VALID [2022-04-15 07:17:35,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {31281#true} call ULTIMATE.init(); {31287#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:17:35,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {31287#(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); {31281#true} is VALID [2022-04-15 07:17:35,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {31281#true} assume true; {31281#true} is VALID [2022-04-15 07:17:35,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31281#true} {31281#true} #68#return; {31281#true} is VALID [2022-04-15 07:17:35,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {31281#true} call #t~ret8 := main(); {31281#true} is VALID [2022-04-15 07:17:35,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {31281#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {31286#(= main_~a~0 0)} is VALID [2022-04-15 07:17:35,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {31286#(= main_~a~0 0)} [176] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~d~0_6382 v_main_~d~0_6332)) (.cse1 (= |v_main_#t~pre5_438| |v_main_#t~pre5_436|)) (.cse2 (= v_main_~b~0_595 v_main_~b~0_592)) (.cse3 (= |v_main_#t~pre7_4299| |v_main_#t~pre7_4257|)) (.cse4 (= v_main_~a~0_322 v_main_~a~0_321)) (.cse5 (= |v_main_#t~pre4_264| |v_main_#t~pre4_263|))) (or (and .cse0 .cse1 .cse2 (= v_main_~c~0_2050 v_main_~c~0_2040) .cse3 .cse4 (= |v_main_#t~pre6_1510| |v_main_#t~pre6_1502|) .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~c~0_2040 v_main_~c~0_2050) (= |v_main_#t~pre6_1502| |v_main_#t~pre6_1510|) .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_4299|, main_~c~0=v_main_~c~0_2050, main_~d~0=v_main_~d~0_6382, main_~b~0=v_main_~b~0_595, main_#t~pre4=|v_main_#t~pre4_264|, main_#t~pre5=|v_main_#t~pre5_438|, main_~a~0=v_main_~a~0_322, main_#t~pre6=|v_main_#t~pre6_1510|} OutVars{main_#t~pre7=|v_main_#t~pre7_4257|, main_~c~0=v_main_~c~0_2040, main_~d~0=v_main_~d~0_6332, main_~b~0=v_main_~b~0_592, main_#t~pre4=|v_main_#t~pre4_263|, main_#t~pre5=|v_main_#t~pre5_436|, main_~a~0=v_main_~a~0_321, main_#t~pre6=|v_main_#t~pre6_1502|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {31286#(= main_~a~0 0)} is VALID [2022-04-15 07:17:35,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {31286#(= main_~a~0 0)} [175] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {31282#false} is VALID [2022-04-15 07:17:35,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {31282#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {31282#false} is VALID [2022-04-15 07:17:35,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {31282#false} assume !false; {31282#false} is VALID [2022-04-15 07:17:35,387 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 07:17:35,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:17:35,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394998401] [2022-04-15 07:17:35,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394998401] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:17:35,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:17:35,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:17:37,548 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:17:37,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1870935474] [2022-04-15 07:17:37,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1870935474] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:17:37,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:17:37,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-04-15 07:17:37,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508236488] [2022-04-15 07:17:37,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:17:37,549 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 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 126 [2022-04-15 07:17:37,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:17:37,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 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 07:17:37,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:17:37,643 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-04-15 07:17:37,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:17:37,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-04-15 07:17:37,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=3201, Unknown=0, NotChecked=0, Total=3422 [2022-04-15 07:17:37,643 INFO L87 Difference]: Start difference. First operand 128 states and 131 transitions. Second operand has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 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 07:17:45,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:45,832 INFO L93 Difference]: Finished difference Result 148 states and 158 transitions. [2022-04-15 07:17:45,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-04-15 07:17:45,832 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 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 126 [2022-04-15 07:17:45,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:17:45,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 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 07:17:45,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 158 transitions. [2022-04-15 07:17:45,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 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 07:17:45,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 158 transitions. [2022-04-15 07:17:45,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 158 transitions. [2022-04-15 07:17:45,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:17:45,948 INFO L225 Difference]: With dead ends: 148 [2022-04-15 07:17:45,948 INFO L226 Difference]: Without dead ends: 137 [2022-04-15 07:17:45,948 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 35 SyntacticMatches, 35 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3197 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=657, Invalid=12453, Unknown=0, NotChecked=0, Total=13110 [2022-04-15 07:17:45,949 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 179 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 5420 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 5581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 5420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-15 07:17:45,949 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 102 Invalid, 5581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 5420 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-15 07:17:45,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-15 07:17:46,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 129. [2022-04-15 07:17:46,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:17:46,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 129 states, 125 states have (on average 1.032) internal successors, (129), 125 states have internal predecessors, (129), 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 07:17:46,022 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 129 states, 125 states have (on average 1.032) internal successors, (129), 125 states have internal predecessors, (129), 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 07:17:46,022 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 129 states, 125 states have (on average 1.032) internal successors, (129), 125 states have internal predecessors, (129), 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 07:17:46,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:46,024 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2022-04-15 07:17:46,024 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 143 transitions. [2022-04-15 07:17:46,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:17:46,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:17:46,024 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 125 states have (on average 1.032) internal successors, (129), 125 states have internal predecessors, (129), 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 137 states. [2022-04-15 07:17:46,024 INFO L87 Difference]: Start difference. First operand has 129 states, 125 states have (on average 1.032) internal successors, (129), 125 states have internal predecessors, (129), 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 137 states. [2022-04-15 07:17:46,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:46,025 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2022-04-15 07:17:46,025 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 143 transitions. [2022-04-15 07:17:46,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:17:46,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:17:46,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:17:46,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:17:46,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 125 states have (on average 1.032) internal successors, (129), 125 states have internal predecessors, (129), 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 07:17:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 132 transitions. [2022-04-15 07:17:46,027 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 132 transitions. Word has length 126 [2022-04-15 07:17:46,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:17:46,027 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 132 transitions. [2022-04-15 07:17:46,027 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 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 07:17:46,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 129 states and 132 transitions. [2022-04-15 07:17:46,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:17:46,364 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 132 transitions. [2022-04-15 07:17:46,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-04-15 07:17:46,364 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:17:46,364 INFO L499 BasicCegarLoop]: trace histogram [43, 43, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:17:46,364 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-04-15 07:17:46,365 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:17:46,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:17:46,365 INFO L85 PathProgramCache]: Analyzing trace with hash -711090132, now seen corresponding path program 51 times [2022-04-15 07:17:46,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:17:46,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1481543617] [2022-04-15 07:17:47,271 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:51,361 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:17:51,410 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:51,518 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:51,636 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:53,825 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:53,955 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:54,239 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:54,239 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:17:54,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1743126787, now seen corresponding path program 1 times [2022-04-15 07:17:54,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:17:54,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349880139] [2022-04-15 07:17:54,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:17:54,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:17:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:17:54,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:17:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:17:54,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {32291#(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); {32285#true} is VALID [2022-04-15 07:17:54,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {32285#true} assume true; {32285#true} is VALID [2022-04-15 07:17:54,264 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32285#true} {32285#true} #68#return; {32285#true} is VALID [2022-04-15 07:17:54,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {32285#true} call ULTIMATE.init(); {32291#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:17:54,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {32291#(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); {32285#true} is VALID [2022-04-15 07:17:54,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {32285#true} assume true; {32285#true} is VALID [2022-04-15 07:17:54,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32285#true} {32285#true} #68#return; {32285#true} is VALID [2022-04-15 07:17:54,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {32285#true} call #t~ret8 := main(); {32285#true} is VALID [2022-04-15 07:17:54,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {32285#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {32290#(= main_~a~0 0)} is VALID [2022-04-15 07:17:54,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {32290#(= main_~a~0 0)} [178] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre6_1556| |v_main_#t~pre6_1548|)) (.cse1 (= |v_main_#t~pre7_4430| |v_main_#t~pre7_4387|)) (.cse2 (= v_main_~d~0_6590 v_main_~d~0_6539)) (.cse3 (= v_main_~a~0_328 v_main_~a~0_327)) (.cse4 (= |v_main_#t~pre5_459| |v_main_#t~pre5_457|)) (.cse5 (= |v_main_#t~pre4_269| |v_main_#t~pre4_268|)) (.cse6 (= v_main_~b~0_623 v_main_~b~0_620))) (or (and .cse0 (= v_main_~c~0_2108 v_main_~c~0_2118) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (= v_main_~c~0_2118 v_main_~c~0_2108) .cse4 .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_4430|, main_~c~0=v_main_~c~0_2118, main_~d~0=v_main_~d~0_6590, main_~b~0=v_main_~b~0_623, main_#t~pre4=|v_main_#t~pre4_269|, main_#t~pre5=|v_main_#t~pre5_459|, main_~a~0=v_main_~a~0_328, main_#t~pre6=|v_main_#t~pre6_1556|} OutVars{main_#t~pre7=|v_main_#t~pre7_4387|, main_~c~0=v_main_~c~0_2108, main_~d~0=v_main_~d~0_6539, main_~b~0=v_main_~b~0_620, main_#t~pre4=|v_main_#t~pre4_268|, main_#t~pre5=|v_main_#t~pre5_457|, main_~a~0=v_main_~a~0_327, main_#t~pre6=|v_main_#t~pre6_1548|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {32290#(= main_~a~0 0)} is VALID [2022-04-15 07:17:54,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {32290#(= main_~a~0 0)} [177] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {32286#false} is VALID [2022-04-15 07:17:54,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {32286#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {32286#false} is VALID [2022-04-15 07:17:54,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {32286#false} assume !false; {32286#false} is VALID [2022-04-15 07:17:54,266 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 07:17:54,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:17:54,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349880139] [2022-04-15 07:17:54,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349880139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:17:54,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:17:54,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:17:56,380 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:17:56,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1481543617] [2022-04-15 07:17:56,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1481543617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:17:56,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:17:56,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-04-15 07:17:56,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817905560] [2022-04-15 07:17:56,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:17:56,381 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 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 128 [2022-04-15 07:17:56,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:17:56,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 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 07:17:56,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:17:56,471 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-04-15 07:17:56,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:17:56,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-04-15 07:17:56,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=3316, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 07:17:56,472 INFO L87 Difference]: Start difference. First operand 129 states and 132 transitions. Second operand has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 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 07:18:06,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:18:06,091 INFO L93 Difference]: Finished difference Result 150 states and 160 transitions. [2022-04-15 07:18:06,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-15 07:18:06,091 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 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 128 [2022-04-15 07:18:06,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:18:06,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 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 07:18:06,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 160 transitions. [2022-04-15 07:18:06,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 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 07:18:06,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 160 transitions. [2022-04-15 07:18:06,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 160 transitions. [2022-04-15 07:18:06,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:18:06,228 INFO L225 Difference]: With dead ends: 150 [2022-04-15 07:18:06,228 INFO L226 Difference]: Without dead ends: 139 [2022-04-15 07:18:06,229 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 44 SyntacticMatches, 27 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3261 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=666, Invalid=12906, Unknown=0, NotChecked=0, Total=13572 [2022-04-15 07:18:06,229 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 189 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6174 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 6343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 6174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:18:06,229 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 87 Invalid, 6343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 6174 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-15 07:18:06,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-15 07:18:06,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 131. [2022-04-15 07:18:06,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:18:06,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 131 states, 127 states have (on average 1.031496062992126) internal successors, (131), 127 states have internal predecessors, (131), 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 07:18:06,331 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 131 states, 127 states have (on average 1.031496062992126) internal successors, (131), 127 states have internal predecessors, (131), 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 07:18:06,331 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 131 states, 127 states have (on average 1.031496062992126) internal successors, (131), 127 states have internal predecessors, (131), 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 07:18:06,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:18:06,332 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2022-04-15 07:18:06,332 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2022-04-15 07:18:06,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:18:06,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:18:06,333 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 127 states have (on average 1.031496062992126) internal successors, (131), 127 states have internal predecessors, (131), 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 139 states. [2022-04-15 07:18:06,333 INFO L87 Difference]: Start difference. First operand has 131 states, 127 states have (on average 1.031496062992126) internal successors, (131), 127 states have internal predecessors, (131), 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 139 states. [2022-04-15 07:18:06,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:18:06,334 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2022-04-15 07:18:06,334 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2022-04-15 07:18:06,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:18:06,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:18:06,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:18:06,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:18:06,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 127 states have (on average 1.031496062992126) internal successors, (131), 127 states have internal predecessors, (131), 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 07:18:06,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 134 transitions. [2022-04-15 07:18:06,336 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 134 transitions. Word has length 128 [2022-04-15 07:18:06,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:18:06,336 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 134 transitions. [2022-04-15 07:18:06,337 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 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 07:18:06,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 134 transitions. [2022-04-15 07:18:06,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:18:06,718 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 134 transitions. [2022-04-15 07:18:06,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-15 07:18:06,719 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:18:06,719 INFO L499 BasicCegarLoop]: trace histogram [44, 44, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:18:06,719 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-04-15 07:18:06,719 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:18:06,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:18:06,719 INFO L85 PathProgramCache]: Analyzing trace with hash -523994358, now seen corresponding path program 52 times [2022-04-15 07:18:06,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:18:06,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [325987458] [2022-04-15 07:18:07,667 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:11,747 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:18:11,788 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:11,900 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:12,020 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:14,122 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:18:14,165 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:14,280 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:14,508 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:14,508 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:18:14,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1743188291, now seen corresponding path program 1 times [2022-04-15 07:18:14,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:18:14,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173381524] [2022-04-15 07:18:14,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:18:14,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:18:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:18:14,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:18:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:18:14,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {33310#(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); {33304#true} is VALID [2022-04-15 07:18:14,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {33304#true} assume true; {33304#true} is VALID [2022-04-15 07:18:14,530 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33304#true} {33304#true} #68#return; {33304#true} is VALID [2022-04-15 07:18:14,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {33304#true} call ULTIMATE.init(); {33310#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:18:14,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {33310#(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); {33304#true} is VALID [2022-04-15 07:18:14,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {33304#true} assume true; {33304#true} is VALID [2022-04-15 07:18:14,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33304#true} {33304#true} #68#return; {33304#true} is VALID [2022-04-15 07:18:14,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {33304#true} call #t~ret8 := main(); {33304#true} is VALID [2022-04-15 07:18:14,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {33304#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {33309#(= main_~a~0 0)} is VALID [2022-04-15 07:18:14,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {33309#(= main_~a~0 0)} [180] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_274| |v_main_#t~pre4_273|)) (.cse1 (= v_main_~c~0_2186 v_main_~c~0_2176)) (.cse2 (= |v_main_#t~pre6_1602| |v_main_#t~pre6_1594|)) (.cse3 (= v_main_~a~0_334 v_main_~a~0_333)) (.cse4 (= |v_main_#t~pre7_4564| |v_main_#t~pre7_4520|)) (.cse5 (= v_main_~d~0_6802 v_main_~d~0_6750))) (or (and .cse0 (= v_main_~b~0_651 v_main_~b~0_648) .cse1 .cse2 (= |v_main_#t~pre5_480| |v_main_#t~pre5_478|) .cse3 .cse4 .cse5) (and .cse0 (= v_main_~b~0_648 v_main_~b~0_651) .cse1 .cse2 (= |v_main_#t~pre5_478| |v_main_#t~pre5_480|) .cse3 .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_4564|, main_~c~0=v_main_~c~0_2186, main_~d~0=v_main_~d~0_6802, main_~b~0=v_main_~b~0_651, main_#t~pre4=|v_main_#t~pre4_274|, main_#t~pre5=|v_main_#t~pre5_480|, main_~a~0=v_main_~a~0_334, main_#t~pre6=|v_main_#t~pre6_1602|} OutVars{main_#t~pre7=|v_main_#t~pre7_4520|, main_~c~0=v_main_~c~0_2176, main_~d~0=v_main_~d~0_6750, main_~b~0=v_main_~b~0_648, main_#t~pre4=|v_main_#t~pre4_273|, main_#t~pre5=|v_main_#t~pre5_478|, main_~a~0=v_main_~a~0_333, main_#t~pre6=|v_main_#t~pre6_1594|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {33309#(= main_~a~0 0)} is VALID [2022-04-15 07:18:14,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {33309#(= main_~a~0 0)} [179] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {33305#false} is VALID [2022-04-15 07:18:14,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {33305#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {33305#false} is VALID [2022-04-15 07:18:14,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {33305#false} assume !false; {33305#false} is VALID [2022-04-15 07:18:14,532 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 07:18:14,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:18:14,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173381524] [2022-04-15 07:18:14,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173381524] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:18:14,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:18:14,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:18:16,757 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:18:16,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [325987458] [2022-04-15 07:18:16,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [325987458] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:18:16,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:18:16,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-04-15 07:18:16,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756462267] [2022-04-15 07:18:16,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:18:16,758 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 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 130 [2022-04-15 07:18:16,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:18:16,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 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 07:18:16,841 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 07:18:16,841 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-04-15 07:18:16,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:18:16,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-04-15 07:18:16,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=3433, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 07:18:16,842 INFO L87 Difference]: Start difference. First operand 131 states and 134 transitions. Second operand has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 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 07:18:26,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:18:26,082 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2022-04-15 07:18:26,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-15 07:18:26,082 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 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 130 [2022-04-15 07:18:26,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:18:26,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 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 07:18:26,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 162 transitions. [2022-04-15 07:18:26,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 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 07:18:26,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 162 transitions. [2022-04-15 07:18:26,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 162 transitions. [2022-04-15 07:18:26,198 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 07:18:26,199 INFO L225 Difference]: With dead ends: 152 [2022-04-15 07:18:26,199 INFO L226 Difference]: Without dead ends: 141 [2022-04-15 07:18:26,200 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 38 SyntacticMatches, 34 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3632 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=675, Invalid=13367, Unknown=0, NotChecked=0, Total=14042 [2022-04-15 07:18:26,200 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 145 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 6244 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 6368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 6244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:18:26,200 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 262 Invalid, 6368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 6244 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-15 07:18:26,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-15 07:18:26,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 133. [2022-04-15 07:18:26,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:18:26,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 133 states, 129 states have (on average 1.0310077519379846) internal successors, (133), 129 states have internal predecessors, (133), 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 07:18:26,276 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 133 states, 129 states have (on average 1.0310077519379846) internal successors, (133), 129 states have internal predecessors, (133), 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 07:18:26,276 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 133 states, 129 states have (on average 1.0310077519379846) internal successors, (133), 129 states have internal predecessors, (133), 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 07:18:26,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:18:26,277 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2022-04-15 07:18:26,277 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 147 transitions. [2022-04-15 07:18:26,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:18:26,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:18:26,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 129 states have (on average 1.0310077519379846) internal successors, (133), 129 states have internal predecessors, (133), 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 141 states. [2022-04-15 07:18:26,277 INFO L87 Difference]: Start difference. First operand has 133 states, 129 states have (on average 1.0310077519379846) internal successors, (133), 129 states have internal predecessors, (133), 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 141 states. [2022-04-15 07:18:26,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:18:26,278 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2022-04-15 07:18:26,278 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 147 transitions. [2022-04-15 07:18:26,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:18:26,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:18:26,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:18:26,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:18:26,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 129 states have (on average 1.0310077519379846) internal successors, (133), 129 states have internal predecessors, (133), 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 07:18:26,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2022-04-15 07:18:26,280 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 130 [2022-04-15 07:18:26,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:18:26,280 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2022-04-15 07:18:26,280 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 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 07:18:26,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 133 states and 136 transitions. [2022-04-15 07:18:26,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:18:26,645 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2022-04-15 07:18:26,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-15 07:18:26,645 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:18:26,645 INFO L499 BasicCegarLoop]: trace histogram [45, 45, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:18:26,645 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-04-15 07:18:26,645 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:18:26,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:18:26,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1113581976, now seen corresponding path program 53 times [2022-04-15 07:18:26,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:18:26,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1140850442] [2022-04-15 07:18:27,565 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:29,702 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:29,811 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:29,926 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:34,013 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:18:34,062 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:34,181 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:34,416 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:34,416 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:18:34,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1743249795, now seen corresponding path program 1 times [2022-04-15 07:18:34,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:18:34,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955060271] [2022-04-15 07:18:34,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:18:34,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:18:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:18:34,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:18:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:18:34,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {34344#(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); {34338#true} is VALID [2022-04-15 07:18:34,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {34338#true} assume true; {34338#true} is VALID [2022-04-15 07:18:34,453 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34338#true} {34338#true} #68#return; {34338#true} is VALID [2022-04-15 07:18:34,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {34338#true} call ULTIMATE.init(); {34344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:18:34,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {34344#(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); {34338#true} is VALID [2022-04-15 07:18:34,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {34338#true} assume true; {34338#true} is VALID [2022-04-15 07:18:34,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34338#true} {34338#true} #68#return; {34338#true} is VALID [2022-04-15 07:18:34,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {34338#true} call #t~ret8 := main(); {34338#true} is VALID [2022-04-15 07:18:34,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {34338#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {34343#(= main_~a~0 0)} is VALID [2022-04-15 07:18:34,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {34343#(= main_~a~0 0)} [182] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~b~0_679 v_main_~b~0_676)) (.cse1 (= v_main_~a~0_340 v_main_~a~0_339)) (.cse2 (= |v_main_#t~pre4_279| |v_main_#t~pre4_278|)) (.cse3 (= |v_main_#t~pre5_501| |v_main_#t~pre5_499|))) (or (and .cse0 (= v_main_~c~0_2244 v_main_~c~0_2254) (= |v_main_#t~pre7_4656| |v_main_#t~pre7_4701|) (= |v_main_#t~pre6_1640| |v_main_#t~pre6_1648|) .cse1 .cse2 (= v_main_~d~0_6965 v_main_~d~0_7018) .cse3) (and .cse0 (= |v_main_#t~pre6_1648| |v_main_#t~pre6_1640|) .cse1 .cse2 (= |v_main_#t~pre7_4701| |v_main_#t~pre7_4656|) .cse3 (= v_main_~c~0_2254 v_main_~c~0_2244) (= v_main_~d~0_7018 v_main_~d~0_6965)))) InVars {main_#t~pre7=|v_main_#t~pre7_4701|, main_~c~0=v_main_~c~0_2254, main_~d~0=v_main_~d~0_7018, main_~b~0=v_main_~b~0_679, main_#t~pre4=|v_main_#t~pre4_279|, main_#t~pre5=|v_main_#t~pre5_501|, main_~a~0=v_main_~a~0_340, main_#t~pre6=|v_main_#t~pre6_1648|} OutVars{main_#t~pre7=|v_main_#t~pre7_4656|, main_~c~0=v_main_~c~0_2244, main_~d~0=v_main_~d~0_6965, main_~b~0=v_main_~b~0_676, main_#t~pre4=|v_main_#t~pre4_278|, main_#t~pre5=|v_main_#t~pre5_499|, main_~a~0=v_main_~a~0_339, main_#t~pre6=|v_main_#t~pre6_1640|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {34343#(= main_~a~0 0)} is VALID [2022-04-15 07:18:34,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {34343#(= main_~a~0 0)} [181] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {34339#false} is VALID [2022-04-15 07:18:34,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {34339#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {34339#false} is VALID [2022-04-15 07:18:34,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {34339#false} assume !false; {34339#false} is VALID [2022-04-15 07:18:34,456 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 07:18:34,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:18:34,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955060271] [2022-04-15 07:18:34,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955060271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:18:34,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:18:34,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:18:36,397 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:18:36,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1140850442] [2022-04-15 07:18:36,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1140850442] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:18:36,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:18:36,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-04-15 07:18:36,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463781141] [2022-04-15 07:18:36,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:18:36,398 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 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 132 [2022-04-15 07:18:36,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:18:36,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 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 07:18:36,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:18:36,480 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-04-15 07:18:36,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:18:36,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-04-15 07:18:36,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3552, Unknown=0, NotChecked=0, Total=3782 [2022-04-15 07:18:36,481 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 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 07:18:44,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:18:44,367 INFO L93 Difference]: Finished difference Result 154 states and 164 transitions. [2022-04-15 07:18:44,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-04-15 07:18:44,367 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 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 132 [2022-04-15 07:18:44,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:18:44,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 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 07:18:44,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 164 transitions. [2022-04-15 07:18:44,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 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 07:18:44,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 164 transitions. [2022-04-15 07:18:44,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 164 transitions. [2022-04-15 07:18:44,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:18:44,499 INFO L225 Difference]: With dead ends: 154 [2022-04-15 07:18:44,499 INFO L226 Difference]: Without dead ends: 143 [2022-04-15 07:18:44,499 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 59 SyntacticMatches, 14 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=684, Invalid=13836, Unknown=0, NotChecked=0, Total=14520 [2022-04-15 07:18:44,500 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 155 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5206 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 5338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 5206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:18:44,500 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 82 Invalid, 5338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 5206 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-15 07:18:44,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-15 07:18:44,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2022-04-15 07:18:44,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:18:44,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 135 states, 131 states have (on average 1.0305343511450382) internal successors, (135), 131 states have internal predecessors, (135), 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 07:18:44,593 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 135 states, 131 states have (on average 1.0305343511450382) internal successors, (135), 131 states have internal predecessors, (135), 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 07:18:44,593 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 135 states, 131 states have (on average 1.0305343511450382) internal successors, (135), 131 states have internal predecessors, (135), 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 07:18:44,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:18:44,594 INFO L93 Difference]: Finished difference Result 143 states and 149 transitions. [2022-04-15 07:18:44,594 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 149 transitions. [2022-04-15 07:18:44,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:18:44,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:18:44,595 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 131 states have (on average 1.0305343511450382) internal successors, (135), 131 states have internal predecessors, (135), 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 143 states. [2022-04-15 07:18:44,595 INFO L87 Difference]: Start difference. First operand has 135 states, 131 states have (on average 1.0305343511450382) internal successors, (135), 131 states have internal predecessors, (135), 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 143 states. [2022-04-15 07:18:44,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:18:44,596 INFO L93 Difference]: Finished difference Result 143 states and 149 transitions. [2022-04-15 07:18:44,596 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 149 transitions. [2022-04-15 07:18:44,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:18:44,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:18:44,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:18:44,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:18:44,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.0305343511450382) internal successors, (135), 131 states have internal predecessors, (135), 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 07:18:44,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 138 transitions. [2022-04-15 07:18:44,597 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 138 transitions. Word has length 132 [2022-04-15 07:18:44,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:18:44,598 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 138 transitions. [2022-04-15 07:18:44,598 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 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 07:18:44,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 138 transitions. [2022-04-15 07:18:44,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:18:44,947 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 138 transitions. [2022-04-15 07:18:44,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-15 07:18:44,947 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:18:44,947 INFO L499 BasicCegarLoop]: trace histogram [46, 46, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:18:44,947 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-04-15 07:18:44,947 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:18:44,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:18:44,948 INFO L85 PathProgramCache]: Analyzing trace with hash -771599802, now seen corresponding path program 54 times [2022-04-15 07:18:44,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:18:44,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1073213004] [2022-04-15 07:18:45,906 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:46,006 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:46,119 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:46,234 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:46,334 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:46,447 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:46,691 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:46,691 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:18:46,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1743311299, now seen corresponding path program 1 times [2022-04-15 07:18:46,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:18:46,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815405041] [2022-04-15 07:18:46,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:18:46,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:18:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:18:46,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:18:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:18:46,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {35393#(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); {35387#true} is VALID [2022-04-15 07:18:46,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {35387#true} assume true; {35387#true} is VALID [2022-04-15 07:18:46,722 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35387#true} {35387#true} #68#return; {35387#true} is VALID [2022-04-15 07:18:46,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {35387#true} call ULTIMATE.init(); {35393#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:18:46,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {35393#(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); {35387#true} is VALID [2022-04-15 07:18:46,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {35387#true} assume true; {35387#true} is VALID [2022-04-15 07:18:46,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35387#true} {35387#true} #68#return; {35387#true} is VALID [2022-04-15 07:18:46,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {35387#true} call #t~ret8 := main(); {35387#true} is VALID [2022-04-15 07:18:46,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {35387#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {35392#(= main_~a~0 0)} is VALID [2022-04-15 07:18:46,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {35392#(= main_~a~0 0)} [184] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_346 v_main_~a~0_345)) (.cse1 (= |v_main_#t~pre7_4841| |v_main_#t~pre7_4795|)) (.cse2 (= |v_main_#t~pre5_522| |v_main_#t~pre5_520|)) (.cse3 (= v_main_~d~0_7238 v_main_~d~0_7184)) (.cse4 (= v_main_~c~0_2322 v_main_~c~0_2312))) (or (and .cse0 .cse1 .cse2 (= v_main_~b~0_704 v_main_~b~0_707) (= |v_main_#t~pre6_1686| |v_main_#t~pre6_1694|) (= |v_main_#t~pre4_283| |v_main_#t~pre4_284|) .cse3 .cse4) (and .cse0 .cse1 (= |v_main_#t~pre4_284| |v_main_#t~pre4_283|) .cse2 (= |v_main_#t~pre6_1694| |v_main_#t~pre6_1686|) (= v_main_~b~0_707 v_main_~b~0_704) .cse3 .cse4))) InVars {main_#t~pre7=|v_main_#t~pre7_4841|, main_~c~0=v_main_~c~0_2322, main_~d~0=v_main_~d~0_7238, main_~b~0=v_main_~b~0_707, main_#t~pre4=|v_main_#t~pre4_284|, main_#t~pre5=|v_main_#t~pre5_522|, main_~a~0=v_main_~a~0_346, main_#t~pre6=|v_main_#t~pre6_1694|} OutVars{main_#t~pre7=|v_main_#t~pre7_4795|, main_~c~0=v_main_~c~0_2312, main_~d~0=v_main_~d~0_7184, main_~b~0=v_main_~b~0_704, main_#t~pre4=|v_main_#t~pre4_283|, main_#t~pre5=|v_main_#t~pre5_520|, main_~a~0=v_main_~a~0_345, main_#t~pre6=|v_main_#t~pre6_1686|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {35392#(= main_~a~0 0)} is VALID [2022-04-15 07:18:46,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {35392#(= main_~a~0 0)} [183] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {35388#false} is VALID [2022-04-15 07:18:46,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {35388#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {35388#false} is VALID [2022-04-15 07:18:46,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {35388#false} assume !false; {35388#false} is VALID [2022-04-15 07:18:46,724 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 07:18:46,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:18:46,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815405041] [2022-04-15 07:18:46,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815405041] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:18:46,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:18:46,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:18:49,012 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:18:49,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1073213004] [2022-04-15 07:18:49,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1073213004] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:18:49,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:18:49,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-04-15 07:18:49,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047333964] [2022-04-15 07:18:49,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:18:49,013 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 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 134 [2022-04-15 07:18:49,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:18:49,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 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 07:18:49,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:18:49,100 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-04-15 07:18:49,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:18:49,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-04-15 07:18:49,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=3673, Unknown=0, NotChecked=0, Total=3906 [2022-04-15 07:18:49,101 INFO L87 Difference]: Start difference. First operand 135 states and 138 transitions. Second operand has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 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 07:18:57,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:18:57,650 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2022-04-15 07:18:57,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-15 07:18:57,650 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 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 134 [2022-04-15 07:18:57,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:18:57,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 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 07:18:57,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 166 transitions. [2022-04-15 07:18:57,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 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 07:18:57,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 166 transitions. [2022-04-15 07:18:57,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 166 transitions. [2022-04-15 07:18:57,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:18:57,776 INFO L225 Difference]: With dead ends: 156 [2022-04-15 07:18:57,776 INFO L226 Difference]: Without dead ends: 145 [2022-04-15 07:18:57,777 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 45 SyntacticMatches, 29 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3902 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=693, Invalid=14313, Unknown=0, NotChecked=0, Total=15006 [2022-04-15 07:18:57,777 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 203 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 5654 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 5835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 5654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-15 07:18:57,777 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 27 Invalid, 5835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 5654 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-15 07:18:57,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-04-15 07:18:57,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 137. [2022-04-15 07:18:57,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:18:57,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 137 states, 133 states have (on average 1.0300751879699248) internal successors, (137), 133 states have internal predecessors, (137), 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 07:18:57,858 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 137 states, 133 states have (on average 1.0300751879699248) internal successors, (137), 133 states have internal predecessors, (137), 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 07:18:57,858 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 137 states, 133 states have (on average 1.0300751879699248) internal successors, (137), 133 states have internal predecessors, (137), 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 07:18:57,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:18:57,859 INFO L93 Difference]: Finished difference Result 145 states and 151 transitions. [2022-04-15 07:18:57,859 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 151 transitions. [2022-04-15 07:18:57,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:18:57,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:18:57,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 133 states have (on average 1.0300751879699248) internal successors, (137), 133 states have internal predecessors, (137), 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 145 states. [2022-04-15 07:18:57,860 INFO L87 Difference]: Start difference. First operand has 137 states, 133 states have (on average 1.0300751879699248) internal successors, (137), 133 states have internal predecessors, (137), 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 145 states. [2022-04-15 07:18:57,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:18:57,861 INFO L93 Difference]: Finished difference Result 145 states and 151 transitions. [2022-04-15 07:18:57,861 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 151 transitions. [2022-04-15 07:18:57,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:18:57,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:18:57,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:18:57,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:18:57,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 133 states have (on average 1.0300751879699248) internal successors, (137), 133 states have internal predecessors, (137), 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 07:18:57,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 140 transitions. [2022-04-15 07:18:57,863 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 140 transitions. Word has length 134 [2022-04-15 07:18:57,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:18:57,863 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 140 transitions. [2022-04-15 07:18:57,863 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 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 07:18:57,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 140 transitions. [2022-04-15 07:18:58,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:18:58,225 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 140 transitions. [2022-04-15 07:18:58,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-04-15 07:18:58,225 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:18:58,225 INFO L499 BasicCegarLoop]: trace histogram [47, 47, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:18:58,225 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-04-15 07:18:58,225 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:18:58,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:18:58,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1455754916, now seen corresponding path program 55 times [2022-04-15 07:18:58,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:18:58,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1039499572] [2022-04-15 07:18:59,137 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:59,266 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:59,399 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:59,526 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:59,646 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:59,755 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:19:00,006 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:19:00,007 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:19:00,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1743372803, now seen corresponding path program 1 times [2022-04-15 07:19:00,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:19:00,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612232697] [2022-04-15 07:19:00,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:19:00,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:19:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:19:00,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:19:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:19:00,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {36457#(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); {36451#true} is VALID [2022-04-15 07:19:00,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {36451#true} assume true; {36451#true} is VALID [2022-04-15 07:19:00,031 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36451#true} {36451#true} #68#return; {36451#true} is VALID [2022-04-15 07:19:00,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {36451#true} call ULTIMATE.init(); {36457#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:19:00,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {36457#(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); {36451#true} is VALID [2022-04-15 07:19:00,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {36451#true} assume true; {36451#true} is VALID [2022-04-15 07:19:00,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36451#true} {36451#true} #68#return; {36451#true} is VALID [2022-04-15 07:19:00,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {36451#true} call #t~ret8 := main(); {36451#true} is VALID [2022-04-15 07:19:00,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {36451#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {36456#(= main_~a~0 0)} is VALID [2022-04-15 07:19:00,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {36456#(= main_~a~0 0)} [186] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~b~0_735 v_main_~b~0_732)) (.cse1 (= |v_main_#t~pre5_543| |v_main_#t~pre5_541|)) (.cse2 (= |v_main_#t~pre7_4984| |v_main_#t~pre7_4937|)) (.cse3 (= |v_main_#t~pre4_289| |v_main_#t~pre4_288|)) (.cse4 (= v_main_~a~0_352 v_main_~a~0_351)) (.cse5 (= v_main_~d~0_7462 v_main_~d~0_7407))) (or (and (= |v_main_#t~pre6_1740| |v_main_#t~pre6_1732|) .cse0 (= v_main_~c~0_2390 v_main_~c~0_2380) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= |v_main_#t~pre6_1732| |v_main_#t~pre6_1740|) .cse0 (= v_main_~c~0_2380 v_main_~c~0_2390) .cse1 .cse2 .cse3 .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_4984|, main_~c~0=v_main_~c~0_2390, main_~d~0=v_main_~d~0_7462, main_~b~0=v_main_~b~0_735, main_#t~pre4=|v_main_#t~pre4_289|, main_#t~pre5=|v_main_#t~pre5_543|, main_~a~0=v_main_~a~0_352, main_#t~pre6=|v_main_#t~pre6_1740|} OutVars{main_#t~pre7=|v_main_#t~pre7_4937|, main_~c~0=v_main_~c~0_2380, main_~d~0=v_main_~d~0_7407, main_~b~0=v_main_~b~0_732, main_#t~pre4=|v_main_#t~pre4_288|, main_#t~pre5=|v_main_#t~pre5_541|, main_~a~0=v_main_~a~0_351, main_#t~pre6=|v_main_#t~pre6_1732|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {36456#(= main_~a~0 0)} is VALID [2022-04-15 07:19:00,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {36456#(= main_~a~0 0)} [185] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {36452#false} is VALID [2022-04-15 07:19:00,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {36452#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {36452#false} is VALID [2022-04-15 07:19:00,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {36452#false} assume !false; {36452#false} is VALID [2022-04-15 07:19:00,033 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 07:19:00,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:19:00,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612232697] [2022-04-15 07:19:00,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612232697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:19:00,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:19:00,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:19:02,242 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:19:02,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1039499572] [2022-04-15 07:19:02,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1039499572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:19:02,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:19:02,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-15 07:19:02,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355470566] [2022-04-15 07:19:02,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:19:02,243 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 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 136 [2022-04-15 07:19:02,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:19:02,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 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 07:19:02,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:19:02,330 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-15 07:19:02,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:19:02,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-15 07:19:02,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=3796, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 07:19:02,331 INFO L87 Difference]: Start difference. First operand 137 states and 140 transitions. Second operand has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 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 07:19:12,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:19:12,206 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2022-04-15 07:19:12,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-04-15 07:19:12,206 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 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 136 [2022-04-15 07:19:12,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:19:12,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 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 07:19:12,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 171 transitions. [2022-04-15 07:19:12,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 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 07:19:12,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 171 transitions. [2022-04-15 07:19:12,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 171 transitions. [2022-04-15 07:19:12,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:19:12,334 INFO L225 Difference]: With dead ends: 160 [2022-04-15 07:19:12,334 INFO L226 Difference]: Without dead ends: 149 [2022-04-15 07:19:12,334 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 47 SyntacticMatches, 28 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3924 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=702, Invalid=14798, Unknown=0, NotChecked=0, Total=15500 [2022-04-15 07:19:12,335 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 208 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 6701 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 6888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 6701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:19:12,335 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 137 Invalid, 6888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 6701 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-04-15 07:19:12,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-15 07:19:12,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 141. [2022-04-15 07:19:12,418 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:19:12,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 141 states, 137 states have (on average 1.0291970802919708) internal successors, (141), 137 states have internal predecessors, (141), 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 07:19:12,419 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 141 states, 137 states have (on average 1.0291970802919708) internal successors, (141), 137 states have internal predecessors, (141), 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 07:19:12,419 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 141 states, 137 states have (on average 1.0291970802919708) internal successors, (141), 137 states have internal predecessors, (141), 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 07:19:12,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:19:12,420 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2022-04-15 07:19:12,420 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 155 transitions. [2022-04-15 07:19:12,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:19:12,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:19:12,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 137 states have (on average 1.0291970802919708) internal successors, (141), 137 states have internal predecessors, (141), 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 149 states. [2022-04-15 07:19:12,420 INFO L87 Difference]: Start difference. First operand has 141 states, 137 states have (on average 1.0291970802919708) internal successors, (141), 137 states have internal predecessors, (141), 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 149 states. [2022-04-15 07:19:12,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:19:12,421 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2022-04-15 07:19:12,421 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 155 transitions. [2022-04-15 07:19:12,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:19:12,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:19:12,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:19:12,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:19:12,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 137 states have (on average 1.0291970802919708) internal successors, (141), 137 states have internal predecessors, (141), 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 07:19:12,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 144 transitions. [2022-04-15 07:19:12,423 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 144 transitions. Word has length 136 [2022-04-15 07:19:12,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:19:12,423 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 144 transitions. [2022-04-15 07:19:12,423 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 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 07:19:12,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 141 states and 144 transitions. [2022-04-15 07:19:12,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:19:12,821 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 144 transitions. [2022-04-15 07:19:12,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-15 07:19:12,822 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:19:12,822 INFO L499 BasicCegarLoop]: trace histogram [48, 48, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:19:12,822 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-04-15 07:19:12,822 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:19:12,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:19:12,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1245041790, now seen corresponding path program 56 times [2022-04-15 07:19:12,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:19:12,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1325240003] [2022-04-15 07:19:13,729 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:19:13,846 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:19:13,955 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:19:14,084 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:19:14,202 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:19:14,321 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:19:14,595 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:19:14,595 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:19:14,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1743434307, now seen corresponding path program 1 times [2022-04-15 07:19:14,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:19:14,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53843011] [2022-04-15 07:19:14,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:19:14,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:19:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:19:14,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:19:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:19:14,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {37548#(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); {37542#true} is VALID [2022-04-15 07:19:14,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-15 07:19:14,623 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37542#true} {37542#true} #68#return; {37542#true} is VALID [2022-04-15 07:19:14,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {37542#true} call ULTIMATE.init(); {37548#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:19:14,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {37548#(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); {37542#true} is VALID [2022-04-15 07:19:14,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {37542#true} assume true; {37542#true} is VALID [2022-04-15 07:19:14,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37542#true} {37542#true} #68#return; {37542#true} is VALID [2022-04-15 07:19:14,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {37542#true} call #t~ret8 := main(); {37542#true} is VALID [2022-04-15 07:19:14,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {37542#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {37547#(= main_~a~0 0)} is VALID [2022-04-15 07:19:14,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {37547#(= main_~a~0 0)} [188] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre7_5124| |v_main_#t~pre7_5076|)) (.cse1 (= v_main_~b~0_763 v_main_~b~0_760)) (.cse2 (= |v_main_#t~pre5_564| |v_main_#t~pre5_562|)) (.cse3 (= |v_main_#t~pre4_294| |v_main_#t~pre4_293|)) (.cse4 (= v_main_~d~0_7683 v_main_~d~0_7627)) (.cse5 (= v_main_~a~0_358 v_main_~a~0_357))) (or (and (= |v_main_#t~pre6_1777| |v_main_#t~pre6_1785|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= v_main_~c~0_2446 v_main_~c~0_2456)) (and .cse0 .cse1 (= |v_main_#t~pre6_1785| |v_main_#t~pre6_1777|) (= v_main_~c~0_2456 v_main_~c~0_2446) .cse2 .cse3 .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_5124|, main_~c~0=v_main_~c~0_2456, main_~d~0=v_main_~d~0_7683, main_~b~0=v_main_~b~0_763, main_#t~pre4=|v_main_#t~pre4_294|, main_#t~pre5=|v_main_#t~pre5_564|, main_~a~0=v_main_~a~0_358, main_#t~pre6=|v_main_#t~pre6_1785|} OutVars{main_#t~pre7=|v_main_#t~pre7_5076|, main_~c~0=v_main_~c~0_2446, main_~d~0=v_main_~d~0_7627, main_~b~0=v_main_~b~0_760, main_#t~pre4=|v_main_#t~pre4_293|, main_#t~pre5=|v_main_#t~pre5_562|, main_~a~0=v_main_~a~0_357, main_#t~pre6=|v_main_#t~pre6_1777|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {37547#(= main_~a~0 0)} is VALID [2022-04-15 07:19:14,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {37547#(= main_~a~0 0)} [187] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {37543#false} is VALID [2022-04-15 07:19:14,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {37543#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {37543#false} is VALID [2022-04-15 07:19:14,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {37543#false} assume !false; {37543#false} is VALID [2022-04-15 07:19:14,633 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 07:19:14,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:19:14,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53843011] [2022-04-15 07:19:14,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53843011] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:19:14,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:19:14,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:19:17,080 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:19:17,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1325240003] [2022-04-15 07:19:17,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1325240003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:19:17,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:19:17,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2022-04-15 07:19:17,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712806004] [2022-04-15 07:19:17,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:19:17,081 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 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 138 [2022-04-15 07:19:17,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:19:17,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 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 07:19:17,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:19:17,171 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-04-15 07:19:17,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:19:17,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-04-15 07:19:17,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=3921, Unknown=0, NotChecked=0, Total=4160 [2022-04-15 07:19:17,172 INFO L87 Difference]: Start difference. First operand 141 states and 144 transitions. Second operand has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 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 07:19:27,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:19:27,314 INFO L93 Difference]: Finished difference Result 161 states and 171 transitions. [2022-04-15 07:19:27,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-15 07:19:27,314 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 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 138 [2022-04-15 07:19:27,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:19:27,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 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 07:19:27,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 171 transitions. [2022-04-15 07:19:27,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 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 07:19:27,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 171 transitions. [2022-04-15 07:19:27,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 171 transitions. [2022-04-15 07:19:27,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:19:27,441 INFO L225 Difference]: With dead ends: 161 [2022-04-15 07:19:27,441 INFO L226 Difference]: Without dead ends: 150 [2022-04-15 07:19:27,442 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 43 SyntacticMatches, 33 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4292 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=711, Invalid=15291, Unknown=0, NotChecked=0, Total=16002 [2022-04-15 07:19:27,442 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 190 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 7085 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 7260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 7085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-15 07:19:27,443 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 92 Invalid, 7260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 7085 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-15 07:19:27,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-15 07:19:27,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 143. [2022-04-15 07:19:27,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:19:27,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 143 states, 139 states have (on average 1.0287769784172662) internal successors, (143), 139 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 07:19:27,545 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 143 states, 139 states have (on average 1.0287769784172662) internal successors, (143), 139 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 07:19:27,545 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 143 states, 139 states have (on average 1.0287769784172662) internal successors, (143), 139 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 07:19:27,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:19:27,546 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2022-04-15 07:19:27,546 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 156 transitions. [2022-04-15 07:19:27,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:19:27,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:19:27,546 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 139 states have (on average 1.0287769784172662) internal successors, (143), 139 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 150 states. [2022-04-15 07:19:27,547 INFO L87 Difference]: Start difference. First operand has 143 states, 139 states have (on average 1.0287769784172662) internal successors, (143), 139 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 150 states. [2022-04-15 07:19:27,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:19:27,548 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2022-04-15 07:19:27,548 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 156 transitions. [2022-04-15 07:19:27,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:19:27,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:19:27,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:19:27,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:19:27,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 139 states have (on average 1.0287769784172662) internal successors, (143), 139 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 07:19:27,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 146 transitions. [2022-04-15 07:19:27,549 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 146 transitions. Word has length 138 [2022-04-15 07:19:27,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:19:27,550 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 146 transitions. [2022-04-15 07:19:27,550 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 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 07:19:27,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 143 states and 146 transitions. [2022-04-15 07:19:27,936 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 07:19:27,936 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 146 transitions. [2022-04-15 07:19:27,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-04-15 07:19:27,936 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:19:27,936 INFO L499 BasicCegarLoop]: trace histogram [48, 48, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:19:27,937 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-04-15 07:19:27,937 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:19:27,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:19:27,937 INFO L85 PathProgramCache]: Analyzing trace with hash 167077131, now seen corresponding path program 57 times [2022-04-15 07:19:27,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:19:27,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1291408030] [2022-04-15 07:19:28,860 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:19:32,935 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:19:32,975 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:19:33,090 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:19:33,207 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:19:35,307 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:19:35,350 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:19:35,474 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:19:35,722 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:19:35,722 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:19:35,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1743495811, now seen corresponding path program 1 times [2022-04-15 07:19:35,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:19:35,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476778466] [2022-04-15 07:19:35,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:19:35,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:19:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:19:35,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:19:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:19:35,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {38650#(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); {38644#true} is VALID [2022-04-15 07:19:35,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {38644#true} assume true; {38644#true} is VALID [2022-04-15 07:19:35,752 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38644#true} {38644#true} #68#return; {38644#true} is VALID [2022-04-15 07:19:35,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {38644#true} call ULTIMATE.init(); {38650#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:19:35,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {38650#(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); {38644#true} is VALID [2022-04-15 07:19:35,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {38644#true} assume true; {38644#true} is VALID [2022-04-15 07:19:35,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38644#true} {38644#true} #68#return; {38644#true} is VALID [2022-04-15 07:19:35,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {38644#true} call #t~ret8 := main(); {38644#true} is VALID [2022-04-15 07:19:35,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {38644#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {38649#(= main_~a~0 0)} is VALID [2022-04-15 07:19:35,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {38649#(= main_~a~0 0)} [190] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~d~0_7908 v_main_~d~0_7851)) (.cse1 (= |v_main_#t~pre4_299| |v_main_#t~pre4_298|)) (.cse2 (= v_main_~c~0_2527 v_main_~c~0_2516)) (.cse3 (= v_main_~a~0_364 v_main_~a~0_363)) (.cse4 (= |v_main_#t~pre6_1833| |v_main_#t~pre6_1824|)) (.cse5 (= |v_main_#t~pre7_5264| |v_main_#t~pre7_5216|)) (.cse6 (= |v_main_#t~pre5_585| |v_main_#t~pre5_583|))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~b~0_791 v_main_~b~0_788) .cse4 .cse5 .cse6) (and .cse0 .cse1 (= v_main_~b~0_788 v_main_~b~0_791) .cse2 .cse3 .cse4 .cse5 .cse6))) InVars {main_#t~pre7=|v_main_#t~pre7_5264|, main_~c~0=v_main_~c~0_2527, main_~d~0=v_main_~d~0_7908, main_~b~0=v_main_~b~0_791, main_#t~pre4=|v_main_#t~pre4_299|, main_#t~pre5=|v_main_#t~pre5_585|, main_~a~0=v_main_~a~0_364, main_#t~pre6=|v_main_#t~pre6_1833|} OutVars{main_#t~pre7=|v_main_#t~pre7_5216|, main_~c~0=v_main_~c~0_2516, main_~d~0=v_main_~d~0_7851, main_~b~0=v_main_~b~0_788, main_#t~pre4=|v_main_#t~pre4_298|, main_#t~pre5=|v_main_#t~pre5_583|, main_~a~0=v_main_~a~0_363, main_#t~pre6=|v_main_#t~pre6_1824|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {38649#(= main_~a~0 0)} is VALID [2022-04-15 07:19:35,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {38649#(= main_~a~0 0)} [189] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {38645#false} is VALID [2022-04-15 07:19:35,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {38645#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {38645#false} is VALID [2022-04-15 07:19:35,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {38645#false} assume !false; {38645#false} is VALID [2022-04-15 07:19:35,753 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 07:19:35,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:19:35,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476778466] [2022-04-15 07:19:35,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476778466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:19:35,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:19:35,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:19:38,068 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:19:38,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1291408030] [2022-04-15 07:19:38,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1291408030] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:19:38,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:19:38,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-04-15 07:19:38,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004853904] [2022-04-15 07:19:38,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:19:38,069 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.090909090909091) internal successors, (138), 65 states have internal predecessors, (138), 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 141 [2022-04-15 07:19:38,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:19:38,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 66 states, 66 states have (on average 2.090909090909091) internal successors, (138), 65 states have internal predecessors, (138), 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 07:19:38,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:19:38,157 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-04-15 07:19:38,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:19:38,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-04-15 07:19:38,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=4048, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 07:19:38,158 INFO L87 Difference]: Start difference. First operand 143 states and 146 transitions. Second operand has 66 states, 66 states have (on average 2.090909090909091) internal successors, (138), 65 states have internal predecessors, (138), 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 07:19:48,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:19:48,464 INFO L93 Difference]: Finished difference Result 163 states and 173 transitions. [2022-04-15 07:19:48,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-15 07:19:48,465 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.090909090909091) internal successors, (138), 65 states have internal predecessors, (138), 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 141 [2022-04-15 07:19:48,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:19:48,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 2.090909090909091) internal successors, (138), 65 states have internal predecessors, (138), 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 07:19:48,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 173 transitions. [2022-04-15 07:19:48,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 2.090909090909091) internal successors, (138), 65 states have internal predecessors, (138), 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 07:19:48,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 173 transitions. [2022-04-15 07:19:48,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 173 transitions. [2022-04-15 07:19:48,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:19:48,590 INFO L225 Difference]: With dead ends: 163 [2022-04-15 07:19:48,590 INFO L226 Difference]: Without dead ends: 152 [2022-04-15 07:19:48,590 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 49 SyntacticMatches, 29 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4251 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=720, Invalid=15792, Unknown=0, NotChecked=0, Total=16512 [2022-04-15 07:19:48,591 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 163 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 7092 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 7234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 7092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-15 07:19:48,591 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 172 Invalid, 7234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 7092 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-04-15 07:19:48,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-04-15 07:19:48,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 144. [2022-04-15 07:19:48,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:19:48,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 144 states, 140 states have (on average 1.0285714285714285) internal successors, (144), 140 states have internal predecessors, (144), 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 07:19:48,681 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 144 states, 140 states have (on average 1.0285714285714285) internal successors, (144), 140 states have internal predecessors, (144), 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 07:19:48,681 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 144 states, 140 states have (on average 1.0285714285714285) internal successors, (144), 140 states have internal predecessors, (144), 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 07:19:48,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:19:48,683 INFO L93 Difference]: Finished difference Result 152 states and 158 transitions. [2022-04-15 07:19:48,683 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 158 transitions. [2022-04-15 07:19:48,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:19:48,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:19:48,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 140 states have (on average 1.0285714285714285) internal successors, (144), 140 states have internal predecessors, (144), 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 152 states. [2022-04-15 07:19:48,683 INFO L87 Difference]: Start difference. First operand has 144 states, 140 states have (on average 1.0285714285714285) internal successors, (144), 140 states have internal predecessors, (144), 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 152 states. [2022-04-15 07:19:48,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:19:48,684 INFO L93 Difference]: Finished difference Result 152 states and 158 transitions. [2022-04-15 07:19:48,684 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 158 transitions. [2022-04-15 07:19:48,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:19:48,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:19:48,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:19:48,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:19:48,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 140 states have (on average 1.0285714285714285) internal successors, (144), 140 states have internal predecessors, (144), 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 07:19:48,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 147 transitions. [2022-04-15 07:19:48,686 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 147 transitions. Word has length 141 [2022-04-15 07:19:48,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:19:48,686 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 147 transitions. [2022-04-15 07:19:48,686 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.090909090909091) internal successors, (138), 65 states have internal predecessors, (138), 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 07:19:48,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 147 transitions. [2022-04-15 07:19:49,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:19:49,099 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 147 transitions. [2022-04-15 07:19:49,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-15 07:19:49,100 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:19:49,100 INFO L499 BasicCegarLoop]: trace histogram [49, 49, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:19:49,100 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-04-15 07:19:49,100 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:19:49,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:19:49,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1581155369, now seen corresponding path program 58 times [2022-04-15 07:19:49,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:19:49,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1260528931] [2022-04-15 07:19:49,987 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:19:50,108 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:19:50,219 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:19:50,336 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:19:50,461 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:19:50,567 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:19:50,809 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:19:50,810 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:19:50,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1743557315, now seen corresponding path program 1 times [2022-04-15 07:19:50,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:19:50,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800491776] [2022-04-15 07:19:50,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:19:50,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:19:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:19:50,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:19:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:19:50,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {39765#(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); {39759#true} is VALID [2022-04-15 07:19:50,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {39759#true} assume true; {39759#true} is VALID [2022-04-15 07:19:50,856 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39759#true} {39759#true} #68#return; {39759#true} is VALID [2022-04-15 07:19:50,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {39759#true} call ULTIMATE.init(); {39765#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:19:50,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {39765#(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); {39759#true} is VALID [2022-04-15 07:19:50,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {39759#true} assume true; {39759#true} is VALID [2022-04-15 07:19:50,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39759#true} {39759#true} #68#return; {39759#true} is VALID [2022-04-15 07:19:50,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {39759#true} call #t~ret8 := main(); {39759#true} is VALID [2022-04-15 07:19:50,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {39759#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {39764#(= main_~a~0 0)} is VALID [2022-04-15 07:19:50,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {39764#(= main_~a~0 0)} [192] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_304| |v_main_#t~pre4_303|)) (.cse1 (= |v_main_#t~pre7_5407| |v_main_#t~pre7_5358|)) (.cse2 (= |v_main_#t~pre5_606| |v_main_#t~pre5_604|)) (.cse3 (= v_main_~d~0_8137 v_main_~d~0_8079)) (.cse4 (= v_main_~b~0_819 v_main_~b~0_816)) (.cse5 (= |v_main_#t~pre6_1881| |v_main_#t~pre6_1872|))) (or (and (= v_main_~c~0_2598 v_main_~c~0_2587) .cse0 .cse1 (= v_main_~a~0_370 v_main_~a~0_369) .cse2 .cse3 .cse4 .cse5) (and (= v_main_~c~0_2587 v_main_~c~0_2598) .cse0 (= v_main_~a~0_369 v_main_~a~0_370) .cse1 .cse2 .cse3 .cse4 .cse5))) InVars {main_#t~pre7=|v_main_#t~pre7_5407|, main_~c~0=v_main_~c~0_2598, main_~d~0=v_main_~d~0_8137, main_~b~0=v_main_~b~0_819, main_#t~pre4=|v_main_#t~pre4_304|, main_#t~pre5=|v_main_#t~pre5_606|, main_~a~0=v_main_~a~0_370, main_#t~pre6=|v_main_#t~pre6_1881|} OutVars{main_#t~pre7=|v_main_#t~pre7_5358|, main_~c~0=v_main_~c~0_2587, main_~d~0=v_main_~d~0_8079, main_~b~0=v_main_~b~0_816, main_#t~pre4=|v_main_#t~pre4_303|, main_#t~pre5=|v_main_#t~pre5_604|, main_~a~0=v_main_~a~0_369, main_#t~pre6=|v_main_#t~pre6_1872|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {39764#(= main_~a~0 0)} is VALID [2022-04-15 07:19:50,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {39764#(= main_~a~0 0)} [191] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {39760#false} is VALID [2022-04-15 07:19:50,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {39760#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {39760#false} is VALID [2022-04-15 07:19:50,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {39760#false} assume !false; {39760#false} is VALID [2022-04-15 07:19:50,858 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 07:19:50,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:19:50,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800491776] [2022-04-15 07:19:50,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800491776] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:19:50,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:19:50,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:19:53,268 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:19:53,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1260528931] [2022-04-15 07:19:53,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1260528931] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:19:53,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:19:53,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2022-04-15 07:19:53,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076030434] [2022-04-15 07:19:53,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:19:53,269 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.08955223880597) internal successors, (140), 66 states have internal predecessors, (140), 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 143 [2022-04-15 07:19:53,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:19:53,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 67 states, 67 states have (on average 2.08955223880597) internal successors, (140), 66 states have internal predecessors, (140), 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 07:19:53,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:19:53,365 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-04-15 07:19:53,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:19:53,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-04-15 07:19:53,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=4177, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 07:19:53,366 INFO L87 Difference]: Start difference. First operand 144 states and 147 transitions. Second operand has 67 states, 67 states have (on average 2.08955223880597) internal successors, (140), 66 states have internal predecessors, (140), 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 07:20:03,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:03,305 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2022-04-15 07:20:03,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-04-15 07:20:03,305 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.08955223880597) internal successors, (140), 66 states have internal predecessors, (140), 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 143 [2022-04-15 07:20:03,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:20:03,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 2.08955223880597) internal successors, (140), 66 states have internal predecessors, (140), 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 07:20:03,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 175 transitions. [2022-04-15 07:20:03,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 2.08955223880597) internal successors, (140), 66 states have internal predecessors, (140), 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 07:20:03,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 175 transitions. [2022-04-15 07:20:03,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 175 transitions. [2022-04-15 07:20:03,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:20:03,435 INFO L225 Difference]: With dead ends: 165 [2022-04-15 07:20:03,435 INFO L226 Difference]: Without dead ends: 154 [2022-04-15 07:20:03,436 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 54 SyntacticMatches, 25 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4431 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=729, Invalid=16301, Unknown=0, NotChecked=0, Total=17030 [2022-04-15 07:20:03,436 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 165 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6722 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 6866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 6722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:20:03,436 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 82 Invalid, 6866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 6722 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-04-15 07:20:03,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-04-15 07:20:03,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2022-04-15 07:20:03,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:20:03,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand has 146 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 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 07:20:03,526 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand has 146 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 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 07:20:03,526 INFO L87 Difference]: Start difference. First operand 154 states. Second operand has 146 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 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 07:20:03,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:03,527 INFO L93 Difference]: Finished difference Result 154 states and 160 transitions. [2022-04-15 07:20:03,527 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 160 transitions. [2022-04-15 07:20:03,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:20:03,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:20:03,528 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 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 154 states. [2022-04-15 07:20:03,528 INFO L87 Difference]: Start difference. First operand has 146 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 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 154 states. [2022-04-15 07:20:03,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:03,529 INFO L93 Difference]: Finished difference Result 154 states and 160 transitions. [2022-04-15 07:20:03,529 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 160 transitions. [2022-04-15 07:20:03,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:20:03,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:20:03,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:20:03,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:20:03,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 142 states have (on average 1.028169014084507) internal successors, (146), 142 states have internal predecessors, (146), 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 07:20:03,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 149 transitions. [2022-04-15 07:20:03,530 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 149 transitions. Word has length 143 [2022-04-15 07:20:03,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:20:03,531 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 149 transitions. [2022-04-15 07:20:03,531 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 2.08955223880597) internal successors, (140), 66 states have internal predecessors, (140), 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 07:20:03,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 149 transitions. [2022-04-15 07:20:03,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:20:03,938 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 149 transitions. [2022-04-15 07:20:03,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-15 07:20:03,939 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:20:03,939 INFO L499 BasicCegarLoop]: trace histogram [50, 50, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:20:03,939 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-04-15 07:20:03,939 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:20:03,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:20:03,939 INFO L85 PathProgramCache]: Analyzing trace with hash -994290745, now seen corresponding path program 59 times [2022-04-15 07:20:03,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:20:03,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1302188692] [2022-04-15 07:20:04,869 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:20:07,090 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:20:07,138 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:20:07,274 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:20:07,415 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:20:11,507 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:20:11,554 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:20:11,685 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:20:12,001 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:20:12,001 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:20:12,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1743618819, now seen corresponding path program 1 times [2022-04-15 07:20:12,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:20:12,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436304649] [2022-04-15 07:20:12,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:20:12,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:20:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:20:12,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:20:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:20:12,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {40895#(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); {40889#true} is VALID [2022-04-15 07:20:12,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {40889#true} assume true; {40889#true} is VALID [2022-04-15 07:20:12,041 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40889#true} {40889#true} #68#return; {40889#true} is VALID [2022-04-15 07:20:12,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {40889#true} call ULTIMATE.init(); {40895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:20:12,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {40895#(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); {40889#true} is VALID [2022-04-15 07:20:12,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {40889#true} assume true; {40889#true} is VALID [2022-04-15 07:20:12,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40889#true} {40889#true} #68#return; {40889#true} is VALID [2022-04-15 07:20:12,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {40889#true} call #t~ret8 := main(); {40889#true} is VALID [2022-04-15 07:20:12,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {40889#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {40894#(= main_~a~0 0)} is VALID [2022-04-15 07:20:12,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {40894#(= main_~a~0 0)} [194] L22-3-->L22-4_primed: Formula: (and (= v_main_~a~0_376 v_main_~a~0_375) (= |v_main_#t~pre6_1929| |v_main_#t~pre6_1920|) (= v_main_~d~0_8370 v_main_~d~0_8311) (= v_main_~c~0_2669 v_main_~c~0_2658) (= |v_main_#t~pre5_627| |v_main_#t~pre5_625|) (= |v_main_#t~pre7_5553| |v_main_#t~pre7_5503|) (= v_main_~b~0_847 v_main_~b~0_844) (= |v_main_#t~pre4_309| |v_main_#t~pre4_308|)) InVars {main_#t~pre7=|v_main_#t~pre7_5553|, main_~c~0=v_main_~c~0_2669, main_~d~0=v_main_~d~0_8370, main_~b~0=v_main_~b~0_847, main_#t~pre4=|v_main_#t~pre4_309|, main_#t~pre5=|v_main_#t~pre5_627|, main_~a~0=v_main_~a~0_376, main_#t~pre6=|v_main_#t~pre6_1929|} OutVars{main_#t~pre7=|v_main_#t~pre7_5503|, main_~c~0=v_main_~c~0_2658, main_~d~0=v_main_~d~0_8311, main_~b~0=v_main_~b~0_844, main_#t~pre4=|v_main_#t~pre4_308|, main_#t~pre5=|v_main_#t~pre5_625|, main_~a~0=v_main_~a~0_375, main_#t~pre6=|v_main_#t~pre6_1920|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {40894#(= main_~a~0 0)} is VALID [2022-04-15 07:20:12,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {40894#(= main_~a~0 0)} [193] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {40890#false} is VALID [2022-04-15 07:20:12,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {40890#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {40890#false} is VALID [2022-04-15 07:20:12,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {40890#false} assume !false; {40890#false} is VALID [2022-04-15 07:20:12,043 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 07:20:12,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:20:12,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436304649] [2022-04-15 07:20:12,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436304649] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:20:12,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:20:12,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:20:14,718 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:20:14,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1302188692] [2022-04-15 07:20:14,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1302188692] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:20:14,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:20:14,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2022-04-15 07:20:14,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761371672] [2022-04-15 07:20:14,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:20:14,719 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.088235294117647) internal successors, (142), 67 states have internal predecessors, (142), 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 145 [2022-04-15 07:20:14,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:20:14,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 68 states, 68 states have (on average 2.088235294117647) internal successors, (142), 67 states have internal predecessors, (142), 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 07:20:14,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:20:14,823 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-04-15 07:20:14,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:20:14,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-04-15 07:20:14,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=4308, Unknown=0, NotChecked=0, Total=4556 [2022-04-15 07:20:14,823 INFO L87 Difference]: Start difference. First operand 146 states and 149 transitions. Second operand has 68 states, 68 states have (on average 2.088235294117647) internal successors, (142), 67 states have internal predecessors, (142), 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 07:20:25,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:25,916 INFO L93 Difference]: Finished difference Result 167 states and 177 transitions. [2022-04-15 07:20:25,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-04-15 07:20:25,917 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.088235294117647) internal successors, (142), 67 states have internal predecessors, (142), 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 145 [2022-04-15 07:20:25,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:20:25,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 2.088235294117647) internal successors, (142), 67 states have internal predecessors, (142), 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 07:20:25,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 177 transitions. [2022-04-15 07:20:25,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 2.088235294117647) internal successors, (142), 67 states have internal predecessors, (142), 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 07:20:25,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 177 transitions. [2022-04-15 07:20:25,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 177 transitions. [2022-04-15 07:20:26,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:20:26,043 INFO L225 Difference]: With dead ends: 167 [2022-04-15 07:20:26,043 INFO L226 Difference]: Without dead ends: 156 [2022-04-15 07:20:26,044 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 46 SyntacticMatches, 34 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4624 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=738, Invalid=16818, Unknown=0, NotChecked=0, Total=17556 [2022-04-15 07:20:26,044 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 197 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 7516 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 7697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 7516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:20:26,044 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 97 Invalid, 7697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 7516 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-04-15 07:20:26,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-04-15 07:20:26,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 148. [2022-04-15 07:20:26,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:20:26,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 148 states, 144 states have (on average 1.0277777777777777) internal successors, (148), 144 states have internal predecessors, (148), 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 07:20:26,134 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 148 states, 144 states have (on average 1.0277777777777777) internal successors, (148), 144 states have internal predecessors, (148), 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 07:20:26,134 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 148 states, 144 states have (on average 1.0277777777777777) internal successors, (148), 144 states have internal predecessors, (148), 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 07:20:26,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:26,136 INFO L93 Difference]: Finished difference Result 156 states and 162 transitions. [2022-04-15 07:20:26,136 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 162 transitions. [2022-04-15 07:20:26,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:20:26,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:20:26,136 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 144 states have (on average 1.0277777777777777) internal successors, (148), 144 states have internal predecessors, (148), 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 156 states. [2022-04-15 07:20:26,136 INFO L87 Difference]: Start difference. First operand has 148 states, 144 states have (on average 1.0277777777777777) internal successors, (148), 144 states have internal predecessors, (148), 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 156 states. [2022-04-15 07:20:26,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:26,137 INFO L93 Difference]: Finished difference Result 156 states and 162 transitions. [2022-04-15 07:20:26,137 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 162 transitions. [2022-04-15 07:20:26,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:20:26,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:20:26,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:20:26,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:20:26,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 144 states have (on average 1.0277777777777777) internal successors, (148), 144 states have internal predecessors, (148), 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 07:20:26,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 151 transitions. [2022-04-15 07:20:26,139 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 151 transitions. Word has length 145 [2022-04-15 07:20:26,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:20:26,139 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 151 transitions. [2022-04-15 07:20:26,139 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 2.088235294117647) internal successors, (142), 67 states have internal predecessors, (142), 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 07:20:26,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 151 transitions. [2022-04-15 07:20:26,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:20:26,554 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 151 transitions. [2022-04-15 07:20:26,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-15 07:20:26,554 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:20:26,554 INFO L499 BasicCegarLoop]: trace histogram [51, 51, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:20:26,554 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-04-15 07:20:26,554 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:20:26,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:20:26,555 INFO L85 PathProgramCache]: Analyzing trace with hash -2096843803, now seen corresponding path program 60 times [2022-04-15 07:20:26,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:20:26,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1620171232] [2022-04-15 07:20:27,421 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:20:27,542 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:20:27,657 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:20:27,774 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:20:27,888 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:20:28,002 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:20:28,251 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:20:28,251 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:20:28,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1743680323, now seen corresponding path program 1 times [2022-04-15 07:20:28,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:20:28,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288472468] [2022-04-15 07:20:28,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:20:28,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:20:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:20:28,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:20:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:20:28,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {42040#(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); {42034#true} is VALID [2022-04-15 07:20:28,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {42034#true} assume true; {42034#true} is VALID [2022-04-15 07:20:28,280 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42034#true} {42034#true} #68#return; {42034#true} is VALID [2022-04-15 07:20:28,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {42034#true} call ULTIMATE.init(); {42040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:20:28,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {42040#(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); {42034#true} is VALID [2022-04-15 07:20:28,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {42034#true} assume true; {42034#true} is VALID [2022-04-15 07:20:28,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42034#true} {42034#true} #68#return; {42034#true} is VALID [2022-04-15 07:20:28,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {42034#true} call #t~ret8 := main(); {42034#true} is VALID [2022-04-15 07:20:28,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {42034#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {42039#(= main_~a~0 0)} is VALID [2022-04-15 07:20:28,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {42039#(= main_~a~0 0)} [196] L22-3-->L22-4_primed: Formula: (and (= |v_main_#t~pre5_648| |v_main_#t~pre5_646|) (= |v_main_#t~pre7_5702| |v_main_#t~pre7_5651|) (= v_main_~c~0_2740 v_main_~c~0_2729) (= v_main_~d~0_8607 v_main_~d~0_8547) (= v_main_~a~0_382 v_main_~a~0_381) (= |v_main_#t~pre4_314| |v_main_#t~pre4_313|) (= v_main_~b~0_875 v_main_~b~0_872) (= |v_main_#t~pre6_1977| |v_main_#t~pre6_1968|)) InVars {main_#t~pre7=|v_main_#t~pre7_5702|, main_~c~0=v_main_~c~0_2740, main_~d~0=v_main_~d~0_8607, main_~b~0=v_main_~b~0_875, main_#t~pre4=|v_main_#t~pre4_314|, main_#t~pre5=|v_main_#t~pre5_648|, main_~a~0=v_main_~a~0_382, main_#t~pre6=|v_main_#t~pre6_1977|} OutVars{main_#t~pre7=|v_main_#t~pre7_5651|, main_~c~0=v_main_~c~0_2729, main_~d~0=v_main_~d~0_8547, main_~b~0=v_main_~b~0_872, main_#t~pre4=|v_main_#t~pre4_313|, main_#t~pre5=|v_main_#t~pre5_646|, main_~a~0=v_main_~a~0_381, main_#t~pre6=|v_main_#t~pre6_1968|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {42039#(= main_~a~0 0)} is VALID [2022-04-15 07:20:28,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {42039#(= main_~a~0 0)} [195] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {42035#false} is VALID [2022-04-15 07:20:28,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {42035#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {42035#false} is VALID [2022-04-15 07:20:28,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {42035#false} assume !false; {42035#false} is VALID [2022-04-15 07:20:28,282 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 07:20:28,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:20:28,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288472468] [2022-04-15 07:20:28,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288472468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:20:28,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:20:28,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:20:30,841 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:20:30,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1620171232] [2022-04-15 07:20:30,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1620171232] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:20:30,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:20:30,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2022-04-15 07:20:30,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146640300] [2022-04-15 07:20:30,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:20:30,846 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 68 states have internal predecessors, (144), 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 147 [2022-04-15 07:20:30,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:20:30,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 69 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 68 states have internal predecessors, (144), 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 07:20:30,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:20:30,940 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-04-15 07:20:30,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:20:30,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-04-15 07:20:30,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=4441, Unknown=0, NotChecked=0, Total=4692 [2022-04-15 07:20:30,941 INFO L87 Difference]: Start difference. First operand 148 states and 151 transitions. Second operand has 69 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 68 states have internal predecessors, (144), 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 07:20:40,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:40,865 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2022-04-15 07:20:40,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-04-15 07:20:40,865 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 68 states have internal predecessors, (144), 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 147 [2022-04-15 07:20:40,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:20:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 68 states have internal predecessors, (144), 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 07:20:40,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 179 transitions. [2022-04-15 07:20:40,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 68 states have internal predecessors, (144), 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 07:20:40,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 179 transitions. [2022-04-15 07:20:40,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 179 transitions. [2022-04-15 07:20:40,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:20:40,996 INFO L225 Difference]: With dead ends: 169 [2022-04-15 07:20:40,996 INFO L226 Difference]: Without dead ends: 158 [2022-04-15 07:20:40,997 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 47 SyntacticMatches, 34 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4806 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=747, Invalid=17343, Unknown=0, NotChecked=0, Total=18090 [2022-04-15 07:20:40,998 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 169 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6610 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 6758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 6610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:20:40,998 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 82 Invalid, 6758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 6610 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-15 07:20:40,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-04-15 07:20:41,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 150. [2022-04-15 07:20:41,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:20:41,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 150 states, 146 states have (on average 1.0273972602739727) internal successors, (150), 146 states have internal predecessors, (150), 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 07:20:41,100 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 150 states, 146 states have (on average 1.0273972602739727) internal successors, (150), 146 states have internal predecessors, (150), 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 07:20:41,101 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 150 states, 146 states have (on average 1.0273972602739727) internal successors, (150), 146 states have internal predecessors, (150), 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 07:20:41,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:41,102 INFO L93 Difference]: Finished difference Result 158 states and 164 transitions. [2022-04-15 07:20:41,102 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 164 transitions. [2022-04-15 07:20:41,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:20:41,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:20:41,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 146 states have (on average 1.0273972602739727) internal successors, (150), 146 states have internal predecessors, (150), 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 158 states. [2022-04-15 07:20:41,102 INFO L87 Difference]: Start difference. First operand has 150 states, 146 states have (on average 1.0273972602739727) internal successors, (150), 146 states have internal predecessors, (150), 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 158 states. [2022-04-15 07:20:41,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:41,104 INFO L93 Difference]: Finished difference Result 158 states and 164 transitions. [2022-04-15 07:20:41,104 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 164 transitions. [2022-04-15 07:20:41,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:20:41,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:20:41,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:20:41,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:20:41,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 146 states have (on average 1.0273972602739727) internal successors, (150), 146 states have internal predecessors, (150), 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 07:20:41,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 153 transitions. [2022-04-15 07:20:41,105 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 153 transitions. Word has length 147 [2022-04-15 07:20:41,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:20:41,105 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 153 transitions. [2022-04-15 07:20:41,106 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 68 states have internal predecessors, (144), 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 07:20:41,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 153 transitions. [2022-04-15 07:20:41,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:20:41,539 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 153 transitions. [2022-04-15 07:20:41,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-15 07:20:41,540 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:20:41,540 INFO L499 BasicCegarLoop]: trace histogram [52, 52, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:20:41,540 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-04-15 07:20:41,540 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:20:41,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:20:41,540 INFO L85 PathProgramCache]: Analyzing trace with hash -793410429, now seen corresponding path program 61 times [2022-04-15 07:20:41,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:20:41,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1609853123] [2022-04-15 07:20:42,422 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:20:42,544 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:20:42,658 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:20:42,782 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:20:42,884 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:20:42,996 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:20:43,257 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:20:43,257 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:20:43,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1743741827, now seen corresponding path program 1 times [2022-04-15 07:20:43,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:20:43,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202382952] [2022-04-15 07:20:43,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:20:43,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:20:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:20:43,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:20:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:20:43,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {43200#(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); {43194#true} is VALID [2022-04-15 07:20:43,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {43194#true} assume true; {43194#true} is VALID [2022-04-15 07:20:43,281 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43194#true} {43194#true} #68#return; {43194#true} is VALID [2022-04-15 07:20:43,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {43194#true} call ULTIMATE.init(); {43200#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:20:43,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {43200#(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); {43194#true} is VALID [2022-04-15 07:20:43,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {43194#true} assume true; {43194#true} is VALID [2022-04-15 07:20:43,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43194#true} {43194#true} #68#return; {43194#true} is VALID [2022-04-15 07:20:43,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {43194#true} call #t~ret8 := main(); {43194#true} is VALID [2022-04-15 07:20:43,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {43194#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~a~0 := 0; {43199#(= main_~a~0 0)} is VALID [2022-04-15 07:20:43,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {43199#(= main_~a~0 0)} [198] L22-3-->L22-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_388 v_main_~a~0_387)) (.cse1 (= |v_main_#t~pre7_5854| |v_main_#t~pre7_5802|)) (.cse2 (= |v_main_#t~pre4_319| |v_main_#t~pre4_318|)) (.cse3 (= v_main_~d~0_8848 v_main_~d~0_8787)) (.cse4 (= |v_main_#t~pre5_669| |v_main_#t~pre5_667|))) (or (and .cse0 (= v_main_~c~0_2811 v_main_~c~0_2800) (= v_main_~b~0_903 v_main_~b~0_900) .cse1 (= |v_main_#t~pre6_2025| |v_main_#t~pre6_2016|) .cse2 .cse3 .cse4) (and (= v_main_~b~0_900 v_main_~b~0_903) (= |v_main_#t~pre6_2016| |v_main_#t~pre6_2025|) .cse0 (= v_main_~c~0_2800 v_main_~c~0_2811) .cse1 .cse2 .cse3 .cse4))) InVars {main_#t~pre7=|v_main_#t~pre7_5854|, main_~c~0=v_main_~c~0_2811, main_~d~0=v_main_~d~0_8848, main_~b~0=v_main_~b~0_903, main_#t~pre4=|v_main_#t~pre4_319|, main_#t~pre5=|v_main_#t~pre5_669|, main_~a~0=v_main_~a~0_388, main_#t~pre6=|v_main_#t~pre6_2025|} OutVars{main_#t~pre7=|v_main_#t~pre7_5802|, main_~c~0=v_main_~c~0_2800, main_~d~0=v_main_~d~0_8787, main_~b~0=v_main_~b~0_900, main_#t~pre4=|v_main_#t~pre4_318|, main_#t~pre5=|v_main_#t~pre5_667|, main_~a~0=v_main_~a~0_387, main_#t~pre6=|v_main_#t~pre6_2016|} AuxVars[] AssignedVars[main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {43199#(= main_~a~0 0)} is VALID [2022-04-15 07:20:43,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {43199#(= main_~a~0 0)} [197] L22-4_primed-->L22-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {43195#false} is VALID [2022-04-15 07:20:43,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {43195#false} assume !(((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0); {43195#false} is VALID [2022-04-15 07:20:43,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {43195#false} assume !false; {43195#false} is VALID [2022-04-15 07:20:43,283 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 07:20:43,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:20:43,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202382952] [2022-04-15 07:20:43,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202382952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:20:43,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:20:43,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:20:45,946 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:20:45,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1609853123] [2022-04-15 07:20:45,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1609853123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:20:45,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:20:45,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2022-04-15 07:20:45,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122911342] [2022-04-15 07:20:45,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:20:45,947 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 2.085714285714286) internal successors, (146), 69 states have internal predecessors, (146), 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 149 [2022-04-15 07:20:45,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:20:45,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 70 states, 70 states have (on average 2.085714285714286) internal successors, (146), 69 states have internal predecessors, (146), 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 07:20:46,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:20:46,048 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-04-15 07:20:46,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:20:46,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-04-15 07:20:46,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=4576, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 07:20:46,049 INFO L87 Difference]: Start difference. First operand 150 states and 153 transitions. Second operand has 70 states, 70 states have (on average 2.085714285714286) internal successors, (146), 69 states have internal predecessors, (146), 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)