/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci02.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-86f66a4 [2020-07-07 13:03:10,616 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 13:03:10,618 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 13:03:10,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 13:03:10,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 13:03:10,631 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 13:03:10,632 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 13:03:10,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 13:03:10,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 13:03:10,636 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 13:03:10,637 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 13:03:10,639 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 13:03:10,639 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 13:03:10,645 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 13:03:10,647 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 13:03:10,650 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 13:03:10,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 13:03:10,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 13:03:10,655 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 13:03:10,659 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 13:03:10,660 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 13:03:10,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 13:03:10,665 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 13:03:10,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 13:03:10,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 13:03:10,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 13:03:10,670 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 13:03:10,671 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 13:03:10,671 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 13:03:10,673 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 13:03:10,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 13:03:10,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 13:03:10,674 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 13:03:10,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 13:03:10,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 13:03:10,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 13:03:10,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 13:03:10,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 13:03:10,681 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 13:03:10,683 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 13:03:10,684 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 13:03:10,685 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-07 13:03:10,700 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 13:03:10,700 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 13:03:10,701 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 13:03:10,702 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 13:03:10,702 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 13:03:10,702 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 13:03:10,702 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 13:03:10,702 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 13:03:10,703 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 13:03:10,703 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 13:03:10,704 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 13:03:10,704 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 13:03:10,704 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 13:03:10,704 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 13:03:10,705 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 13:03:10,705 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-07 13:03:10,705 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 13:03:10,705 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 13:03:10,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 13:03:10,706 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 13:03:10,706 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-07 13:03:10,706 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 13:03:10,706 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-07 13:03:10,958 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 13:03:10,970 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 13:03:10,973 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 13:03:10,974 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 13:03:10,975 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 13:03:10,975 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci02.c [2020-07-07 13:03:11,060 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7244516b8/7cda972c85974ae4bf928b0b54ce43c5/FLAG750e5b578 [2020-07-07 13:03:11,493 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 13:03:11,494 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci02.c [2020-07-07 13:03:11,500 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7244516b8/7cda972c85974ae4bf928b0b54ce43c5/FLAG750e5b578 [2020-07-07 13:03:11,883 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7244516b8/7cda972c85974ae4bf928b0b54ce43c5 [2020-07-07 13:03:11,892 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 13:03:11,893 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 13:03:11,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 13:03:11,895 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 13:03:11,898 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 13:03:11,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:03:11" (1/1) ... [2020-07-07 13:03:11,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a093839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:11, skipping insertion in model container [2020-07-07 13:03:11,902 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:03:11" (1/1) ... [2020-07-07 13:03:11,910 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 13:03:11,931 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 13:03:12,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:03:12,108 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 13:03:12,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:03:12,137 INFO L208 MainTranslator]: Completed translation [2020-07-07 13:03:12,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:12 WrapperNode [2020-07-07 13:03:12,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 13:03:12,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 13:03:12,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 13:03:12,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 13:03:12,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:12" (1/1) ... [2020-07-07 13:03:12,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:12" (1/1) ... [2020-07-07 13:03:12,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:12" (1/1) ... [2020-07-07 13:03:12,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:12" (1/1) ... [2020-07-07 13:03:12,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:12" (1/1) ... [2020-07-07 13:03:12,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:12" (1/1) ... [2020-07-07 13:03:12,164 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:12" (1/1) ... [2020-07-07 13:03:12,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 13:03:12,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 13:03:12,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 13:03:12,166 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 13:03:12,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 13:03:12,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 13:03:12,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 13:03:12,316 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-07 13:03:12,316 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 13:03:12,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 13:03:12,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 13:03:12,317 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-07 13:03:12,317 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 13:03:12,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 13:03:12,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 13:03:12,489 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 13:03:12,489 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-07 13:03:12,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:03:12 BoogieIcfgContainer [2020-07-07 13:03:12,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 13:03:12,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 13:03:12,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 13:03:12,497 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 13:03:12,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 01:03:11" (1/3) ... [2020-07-07 13:03:12,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d2ac5c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:03:12, skipping insertion in model container [2020-07-07 13:03:12,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:12" (2/3) ... [2020-07-07 13:03:12,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d2ac5c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:03:12, skipping insertion in model container [2020-07-07 13:03:12,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:03:12" (3/3) ... [2020-07-07 13:03:12,500 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci02.c [2020-07-07 13:03:12,508 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-07 13:03:12,515 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 13:03:12,529 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 13:03:12,550 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 13:03:12,550 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 13:03:12,550 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-07 13:03:12,550 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 13:03:12,550 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 13:03:12,551 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 13:03:12,551 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 13:03:12,551 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 13:03:12,565 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2020-07-07 13:03:12,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-07 13:03:12,575 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:12,576 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:12,577 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:12,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:12,583 INFO L82 PathProgramCache]: Analyzing trace with hash 2085313281, now seen corresponding path program 1 times [2020-07-07 13:03:12,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:12,592 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1158611243] [2020-07-07 13:03:12,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:03:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:12,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:03:12,791 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:12,798 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1158611243] [2020-07-07 13:03:12,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:12,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:03:12,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125844472] [2020-07-07 13:03:12,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:03:12,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:12,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:03:12,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:03:12,832 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. [2020-07-07 13:03:12,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:12,927 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2020-07-07 13:03:12,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 13:03:12,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-07 13:03:12,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:12,940 INFO L225 Difference]: With dead ends: 44 [2020-07-07 13:03:12,940 INFO L226 Difference]: Without dead ends: 28 [2020-07-07 13:03:12,944 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-07 13:03:12,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-07 13:03:12,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-07 13:03:12,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-07 13:03:12,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-07-07 13:03:12,996 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2020-07-07 13:03:12,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:12,997 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-07-07 13:03:12,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:03:12,997 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-07 13:03:12,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-07 13:03:12,999 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:13,000 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:13,000 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 13:03:13,000 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:13,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:13,001 INFO L82 PathProgramCache]: Analyzing trace with hash -93144392, now seen corresponding path program 1 times [2020-07-07 13:03:13,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:13,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1735193380] [2020-07-07 13:03:13,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:03:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:13,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:03:13,088 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:13,088 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1735193380] [2020-07-07 13:03:13,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:13,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:03:13,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015592068] [2020-07-07 13:03:13,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:03:13,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:13,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:03:13,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:03:13,091 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2020-07-07 13:03:13,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:13,158 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-07-07 13:03:13,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 13:03:13,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-07 13:03:13,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:13,161 INFO L225 Difference]: With dead ends: 36 [2020-07-07 13:03:13,161 INFO L226 Difference]: Without dead ends: 30 [2020-07-07 13:03:13,163 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-07 13:03:13,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-07 13:03:13,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-07-07 13:03:13,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-07 13:03:13,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-07-07 13:03:13,175 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2020-07-07 13:03:13,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:13,176 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-07-07 13:03:13,176 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:03:13,176 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-07 13:03:13,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-07 13:03:13,178 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:13,178 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:13,178 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 13:03:13,179 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:13,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:13,179 INFO L82 PathProgramCache]: Analyzing trace with hash 37359445, now seen corresponding path program 1 times [2020-07-07 13:03:13,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:13,180 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [225980019] [2020-07-07 13:03:13,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:03:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:13,360 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-07 13:03:13,360 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:13,361 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [225980019] [2020-07-07 13:03:13,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:13,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-07 13:03:13,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637719164] [2020-07-07 13:03:13,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-07 13:03:13,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:13,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-07 13:03:13,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-07 13:03:13,363 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2020-07-07 13:03:13,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:13,465 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2020-07-07 13:03:13,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-07 13:03:13,466 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-07 13:03:13,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:13,468 INFO L225 Difference]: With dead ends: 52 [2020-07-07 13:03:13,468 INFO L226 Difference]: Without dead ends: 30 [2020-07-07 13:03:13,470 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-07 13:03:13,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-07 13:03:13,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-07 13:03:13,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-07 13:03:13,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-07 13:03:13,481 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 33 [2020-07-07 13:03:13,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:13,482 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-07 13:03:13,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-07 13:03:13,482 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-07 13:03:13,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-07 13:03:13,484 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:13,484 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:13,485 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 13:03:13,485 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:13,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:13,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1599890626, now seen corresponding path program 1 times [2020-07-07 13:03:13,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:13,486 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2041350230] [2020-07-07 13:03:13,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 17 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.001s / 0.002s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.002s total Resizing node table from 113 to 223 [2020-07-07 13:03:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:13,661 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-07 13:03:13,661 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:13,662 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2041350230] [2020-07-07 13:03:13,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:13,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-07 13:03:13,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804448548] [2020-07-07 13:03:13,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-07 13:03:13,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:13,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-07 13:03:13,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-07 13:03:13,664 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 7 states. [2020-07-07 13:03:13,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:13,761 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2020-07-07 13:03:13,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-07 13:03:13,762 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-07-07 13:03:13,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:13,764 INFO L225 Difference]: With dead ends: 56 [2020-07-07 13:03:13,764 INFO L226 Difference]: Without dead ends: 50 [2020-07-07 13:03:13,765 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-07 13:03:13,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-07 13:03:13,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-07-07 13:03:13,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-07 13:03:13,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2020-07-07 13:03:13,781 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 34 [2020-07-07 13:03:13,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:13,782 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2020-07-07 13:03:13,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-07 13:03:13,782 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2020-07-07 13:03:13,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-07 13:03:13,784 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:13,784 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:13,785 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 13:03:13,785 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:13,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:13,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1509057080, now seen corresponding path program 2 times [2020-07-07 13:03:13,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:13,786 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1569828888] [2020-07-07 13:03:13,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-07 13:03:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:13,989 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-07 13:03:13,990 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:13,990 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1569828888] [2020-07-07 13:03:13,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:13,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 13:03:13,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329609417] [2020-07-07 13:03:13,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 13:03:13,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:13,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 13:03:13,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-07 13:03:13,993 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand 9 states. [2020-07-07 13:03:14,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:14,152 INFO L93 Difference]: Finished difference Result 111 states and 156 transitions. [2020-07-07 13:03:14,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-07 13:03:14,154 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2020-07-07 13:03:14,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:14,158 INFO L225 Difference]: With dead ends: 111 [2020-07-07 13:03:14,158 INFO L226 Difference]: Without dead ends: 67 [2020-07-07 13:03:14,162 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-07-07 13:03:14,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-07 13:03:14,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2020-07-07 13:03:14,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-07 13:03:14,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2020-07-07 13:03:14,186 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 51 [2020-07-07 13:03:14,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:14,188 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2020-07-07 13:03:14,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 13:03:14,188 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2020-07-07 13:03:14,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-07 13:03:14,194 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:14,194 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:14,195 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 13:03:14,195 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:14,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:14,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1009539825, now seen corresponding path program 3 times [2020-07-07 13:03:14,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:14,197 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [565349191] [2020-07-07 13:03:14,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-07 13:03:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:14,373 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-07 13:03:14,373 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:14,374 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [565349191] [2020-07-07 13:03:14,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:14,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 13:03:14,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589884018] [2020-07-07 13:03:14,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 13:03:14,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:14,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 13:03:14,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-07 13:03:14,376 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand 9 states. [2020-07-07 13:03:14,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:14,496 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2020-07-07 13:03:14,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-07 13:03:14,497 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2020-07-07 13:03:14,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:14,499 INFO L225 Difference]: With dead ends: 89 [2020-07-07 13:03:14,500 INFO L226 Difference]: Without dead ends: 83 [2020-07-07 13:03:14,500 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-07 13:03:14,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-07 13:03:14,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2020-07-07 13:03:14,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-07 13:03:14,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 103 transitions. [2020-07-07 13:03:14,519 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 103 transitions. Word has length 52 [2020-07-07 13:03:14,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:14,520 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 103 transitions. [2020-07-07 13:03:14,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 13:03:14,520 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2020-07-07 13:03:14,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-07-07 13:03:14,525 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:14,525 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:14,526 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 13:03:14,526 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:14,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:14,526 INFO L82 PathProgramCache]: Analyzing trace with hash -858055544, now seen corresponding path program 4 times [2020-07-07 13:03:14,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:14,527 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1424931234] [2020-07-07 13:03:14,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-07 13:03:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:14,907 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 17 proven. 70 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2020-07-07 13:03:14,907 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:14,908 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1424931234] [2020-07-07 13:03:14,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:14,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-07 13:03:14,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313878837] [2020-07-07 13:03:14,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-07 13:03:14,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:14,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-07 13:03:14,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-07-07 13:03:14,910 INFO L87 Difference]: Start difference. First operand 77 states and 103 transitions. Second operand 15 states. [2020-07-07 13:03:15,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:15,211 INFO L93 Difference]: Finished difference Result 142 states and 213 transitions. [2020-07-07 13:03:15,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-07 13:03:15,211 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 123 [2020-07-07 13:03:15,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:15,214 INFO L225 Difference]: With dead ends: 142 [2020-07-07 13:03:15,215 INFO L226 Difference]: Without dead ends: 73 [2020-07-07 13:03:15,217 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2020-07-07 13:03:15,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-07 13:03:15,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2020-07-07 13:03:15,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-07 13:03:15,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2020-07-07 13:03:15,230 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 123 [2020-07-07 13:03:15,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:15,231 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2020-07-07 13:03:15,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-07 13:03:15,231 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2020-07-07 13:03:15,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-07-07 13:03:15,233 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:15,234 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:15,234 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-07 13:03:15,234 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:15,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:15,235 INFO L82 PathProgramCache]: Analyzing trace with hash -145654990, now seen corresponding path program 5 times [2020-07-07 13:03:15,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:15,235 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [446153698] [2020-07-07 13:03:15,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 113 to 223 [2020-07-07 13:03:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:15,744 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 47 proven. 92 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2020-07-07 13:03:15,744 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:15,745 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [446153698] [2020-07-07 13:03:15,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:15,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-07-07 13:03:15,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492841225] [2020-07-07 13:03:15,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-07 13:03:15,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:15,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-07 13:03:15,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2020-07-07 13:03:15,750 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand 18 states. [2020-07-07 13:03:16,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:16,214 INFO L93 Difference]: Finished difference Result 149 states and 214 transitions. [2020-07-07 13:03:16,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-07 13:03:16,214 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 193 [2020-07-07 13:03:16,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:16,218 INFO L225 Difference]: With dead ends: 149 [2020-07-07 13:03:16,218 INFO L226 Difference]: Without dead ends: 92 [2020-07-07 13:03:16,219 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=622, Unknown=0, NotChecked=0, Total=812 [2020-07-07 13:03:16,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-07 13:03:16,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2020-07-07 13:03:16,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-07 13:03:16,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2020-07-07 13:03:16,247 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 193 [2020-07-07 13:03:16,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:16,248 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2020-07-07 13:03:16,248 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-07 13:03:16,248 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2020-07-07 13:03:16,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2020-07-07 13:03:16,250 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:16,251 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:16,251 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-07 13:03:16,251 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:16,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:16,252 INFO L82 PathProgramCache]: Analyzing trace with hash -217722271, now seen corresponding path program 6 times [2020-07-07 13:03:16,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:16,252 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1043713658] [2020-07-07 13:03:16,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 139 to 277 Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-07 13:03:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2020-07-07 13:03:16,743 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:16,743 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1043713658] [2020-07-07 13:03:16,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:16,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-07 13:03:16,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031205353] [2020-07-07 13:03:16,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-07 13:03:16,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:16,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-07 13:03:16,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-07-07 13:03:16,746 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand 15 states. [2020-07-07 13:03:16,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:16,985 INFO L93 Difference]: Finished difference Result 248 states and 331 transitions. [2020-07-07 13:03:16,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-07 13:03:16,986 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 228 [2020-07-07 13:03:16,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:16,990 INFO L225 Difference]: With dead ends: 248 [2020-07-07 13:03:16,990 INFO L226 Difference]: Without dead ends: 242 [2020-07-07 13:03:16,991 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-07-07 13:03:16,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-07-07 13:03:17,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 218. [2020-07-07 13:03:17,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-07-07 13:03:17,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 295 transitions. [2020-07-07 13:03:17,024 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 295 transitions. Word has length 228 [2020-07-07 13:03:17,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:17,025 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 295 transitions. [2020-07-07 13:03:17,025 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-07 13:03:17,025 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 295 transitions. [2020-07-07 13:03:17,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2020-07-07 13:03:17,032 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:17,032 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 13, 13, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:17,033 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-07 13:03:17,033 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:17,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:17,033 INFO L82 PathProgramCache]: Analyzing trace with hash 868038776, now seen corresponding path program 7 times [2020-07-07 13:03:17,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:17,034 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [954186501] [2020-07-07 13:03:17,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 139 to 277 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 Garbage collection #1: 23 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 23 to 43 Garbage collection #2: 43 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 43 to 83 Garbage collection #3: 83 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 83 to 163 Garbage collection #4: 163 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 163 to 317 [2020-07-07 13:03:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:17,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2020-07-07 13:03:17,965 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:17,965 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [954186501] [2020-07-07 13:03:17,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:17,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-07-07 13:03:17,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604588048] [2020-07-07 13:03:17,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-07 13:03:17,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:17,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-07 13:03:17,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2020-07-07 13:03:17,970 INFO L87 Difference]: Start difference. First operand 218 states and 295 transitions. Second operand 17 states. [2020-07-07 13:03:18,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:18,292 INFO L93 Difference]: Finished difference Result 559 states and 806 transitions. [2020-07-07 13:03:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-07 13:03:18,292 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 369 [2020-07-07 13:03:18,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:18,301 INFO L225 Difference]: With dead ends: 559 [2020-07-07 13:03:18,301 INFO L226 Difference]: Without dead ends: 553 [2020-07-07 13:03:18,303 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-07-07 13:03:18,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-07-07 13:03:18,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 523. [2020-07-07 13:03:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2020-07-07 13:03:18,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 763 transitions. [2020-07-07 13:03:18,381 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 763 transitions. Word has length 369 [2020-07-07 13:03:18,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:18,383 INFO L479 AbstractCegarLoop]: Abstraction has 523 states and 763 transitions. [2020-07-07 13:03:18,383 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-07 13:03:18,383 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 763 transitions. [2020-07-07 13:03:18,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2020-07-07 13:03:18,397 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:18,398 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 21, 21, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:18,398 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-07 13:03:18,398 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:18,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:18,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1155108958, now seen corresponding path program 8 times [2020-07-07 13:03:18,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:18,399 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1819124035] [2020-07-07 13:03:18,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 23 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 23 to 43 Garbage collection #2: 43 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 43 to 83 Garbage collection #3: 83 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 83 to 163 Garbage collection #4: 163 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 163 to 317 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 Garbage collection #1: 23 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 23 to 43 Garbage collection #2: 43 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 43 to 83 Garbage collection #3: 83 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 83 to 163 Garbage collection #4: 163 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 163 to 317 [2020-07-07 13:03:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:20,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2657 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 2297 trivial. 0 not checked. [2020-07-07 13:03:20,635 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:20,636 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1819124035] [2020-07-07 13:03:20,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:20,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-07-07 13:03:20,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496382960] [2020-07-07 13:03:20,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-07 13:03:20,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:20,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-07 13:03:20,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2020-07-07 13:03:20,638 INFO L87 Difference]: Start difference. First operand 523 states and 763 transitions. Second operand 19 states. [2020-07-07 13:03:21,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:21,016 INFO L93 Difference]: Finished difference Result 1224 states and 1887 transitions. [2020-07-07 13:03:21,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-07 13:03:21,017 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 598 [2020-07-07 13:03:21,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:21,035 INFO L225 Difference]: With dead ends: 1224 [2020-07-07 13:03:21,035 INFO L226 Difference]: Without dead ends: 1218 [2020-07-07 13:03:21,037 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2020-07-07 13:03:21,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-07-07 13:03:21,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1182. [2020-07-07 13:03:21,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1182 states. [2020-07-07 13:03:21,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1837 transitions. [2020-07-07 13:03:21,154 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1837 transitions. Word has length 598 [2020-07-07 13:03:21,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:21,155 INFO L479 AbstractCegarLoop]: Abstraction has 1182 states and 1837 transitions. [2020-07-07 13:03:21,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-07 13:03:21,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1837 transitions. [2020-07-07 13:03:21,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 969 [2020-07-07 13:03:21,193 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:21,194 INFO L422 BasicCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 34, 34, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:21,194 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-07 13:03:21,194 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:21,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:21,195 INFO L82 PathProgramCache]: Analyzing trace with hash 959941073, now seen corresponding path program 9 times [2020-07-07 13:03:21,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:21,195 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1954843157] [2020-07-07 13:03:21,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 113 to 223 Garbage collection #1: 23 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 23 to 43 Garbage collection #2: 43 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 43 to 83 Garbage collection #3: 83 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 83 to 163 Garbage collection #4: 163 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 163 to 317 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 Garbage collection #1: 29 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 29 to 53 Garbage collection #2: 53 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 53 to 103 Garbage collection #3: 103 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 103 to 199 Garbage collection #4: 199 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 199 to 397 Garbage collection #1: 23 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 23 to 43 Garbage collection #2: 43 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 43 to 83 Garbage collection #3: 83 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 83 to 163 Garbage collection #4: 163 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 163 to 317 [2020-07-07 13:03:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6959 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6959 trivial. 0 not checked. [2020-07-07 13:03:28,056 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:28,056 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1954843157] [2020-07-07 13:03:28,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:28,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2020-07-07 13:03:28,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705020306] [2020-07-07 13:03:28,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-07-07 13:03:28,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:28,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-07-07 13:03:28,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2020-07-07 13:03:28,058 INFO L87 Difference]: Start difference. First operand 1182 states and 1837 transitions. Second operand 28 states. [2020-07-07 13:03:30,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:30,300 INFO L93 Difference]: Finished difference Result 4395 states and 7450 transitions. [2020-07-07 13:03:30,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-07-07 13:03:30,301 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 968 [2020-07-07 13:03:30,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:30,375 INFO L225 Difference]: With dead ends: 4395 [2020-07-07 13:03:30,376 INFO L226 Difference]: Without dead ends: 4389 [2020-07-07 13:03:30,385 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=167, Invalid=2383, Unknown=0, NotChecked=0, Total=2550 [2020-07-07 13:03:30,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4389 states. [2020-07-07 13:03:30,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4389 to 1222. [2020-07-07 13:03:30,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2020-07-07 13:03:30,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1931 transitions. [2020-07-07 13:03:30,658 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1931 transitions. Word has length 968 [2020-07-07 13:03:30,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:30,660 INFO L479 AbstractCegarLoop]: Abstraction has 1222 states and 1931 transitions. [2020-07-07 13:03:30,660 INFO L480 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-07-07 13:03:30,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1931 transitions. [2020-07-07 13:03:30,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1039 [2020-07-07 13:03:30,673 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:30,674 INFO L422 BasicCegarLoop]: trace histogram [117, 117, 94, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 36, 36, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:30,674 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-07 13:03:30,675 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:30,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:30,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1116283279, now seen corresponding path program 10 times [2020-07-07 13:03:30,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:30,676 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1922600811] [2020-07-07 13:03:30,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 23 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 23 to 43 Garbage collection #2: 43 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 43 to 83 Garbage collection #3: 83 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 83 to 163 Garbage collection #4: 163 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 163 to 317 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 Garbage collection #1: 29 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 29 to 53 Garbage collection #2: 53 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 53 to 103 Garbage collection #3: 103 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 103 to 199 Garbage collection #4: 199 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 199 to 397 Garbage collection #1: 23 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 23 to 43 Garbage collection #2: 43 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 43 to 83 Garbage collection #3: 83 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 83 to 163 Garbage collection #4: 163 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 163 to 317 [2020-07-07 13:03:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:34,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6706 backedges. 168 proven. 714 refuted. 0 times theorem prover too weak. 5824 trivial. 0 not checked. [2020-07-07 13:03:34,349 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:34,350 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1922600811] [2020-07-07 13:03:34,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:34,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-07-07 13:03:34,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124125155] [2020-07-07 13:03:34,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-07-07 13:03:34,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:34,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-07-07 13:03:34,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2020-07-07 13:03:34,354 INFO L87 Difference]: Start difference. First operand 1222 states and 1931 transitions. Second operand 25 states. [2020-07-07 13:03:35,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:35,065 INFO L93 Difference]: Finished difference Result 1419 states and 2333 transitions. [2020-07-07 13:03:35,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-07-07 13:03:35,066 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 1038 [2020-07-07 13:03:35,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:35,070 INFO L225 Difference]: With dead ends: 1419 [2020-07-07 13:03:35,070 INFO L226 Difference]: Without dead ends: 207 [2020-07-07 13:03:35,082 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=481, Invalid=1499, Unknown=0, NotChecked=0, Total=1980 [2020-07-07 13:03:35,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-07-07 13:03:35,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 165. [2020-07-07 13:03:35,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-07-07 13:03:35,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2020-07-07 13:03:35,100 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 1038 [2020-07-07 13:03:35,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:35,101 INFO L479 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2020-07-07 13:03:35,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-07-07 13:03:35,102 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2020-07-07 13:03:35,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1075 [2020-07-07 13:03:35,114 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:35,115 INFO L422 BasicCegarLoop]: trace histogram [121, 121, 98, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 38, 38, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:35,116 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-07 13:03:35,116 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:35,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:35,117 INFO L82 PathProgramCache]: Analyzing trace with hash 618834515, now seen corresponding path program 11 times [2020-07-07 13:03:35,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:35,121 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [582888620] [2020-07-07 13:03:35,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 23 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 23 to 43 Garbage collection #2: 43 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 43 to 83 Garbage collection #3: 83 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 83 to 163 Garbage collection #4: 163 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 163 to 317 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-07 13:03:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:38,129 INFO L134 CoverageAnalysis]: Checked inductivity of 9373 backedges. 77 proven. 771 refuted. 0 times theorem prover too weak. 8525 trivial. 0 not checked. [2020-07-07 13:03:38,129 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:38,129 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [582888620] [2020-07-07 13:03:38,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:38,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-07-07 13:03:38,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755215799] [2020-07-07 13:03:38,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-07 13:03:38,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:38,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-07 13:03:38,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-07-07 13:03:38,131 INFO L87 Difference]: Start difference. First operand 165 states and 244 transitions. Second operand 16 states. [2020-07-07 13:03:38,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:38,444 INFO L93 Difference]: Finished difference Result 333 states and 526 transitions. [2020-07-07 13:03:38,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-07 13:03:38,445 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1074 [2020-07-07 13:03:38,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:38,447 INFO L225 Difference]: With dead ends: 333 [2020-07-07 13:03:38,447 INFO L226 Difference]: Without dead ends: 178 [2020-07-07 13:03:38,450 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2020-07-07 13:03:38,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-07-07 13:03:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 167. [2020-07-07 13:03:38,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2020-07-07 13:03:38,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 237 transitions. [2020-07-07 13:03:38,464 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 237 transitions. Word has length 1074 [2020-07-07 13:03:38,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:38,465 INFO L479 AbstractCegarLoop]: Abstraction has 167 states and 237 transitions. [2020-07-07 13:03:38,465 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-07 13:03:38,465 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 237 transitions. [2020-07-07 13:03:38,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1057 [2020-07-07 13:03:38,475 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:38,475 INFO L422 BasicCegarLoop]: trace histogram [119, 119, 96, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 37, 37, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:38,475 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-07 13:03:38,476 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:38,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:38,476 INFO L82 PathProgramCache]: Analyzing trace with hash -44294930, now seen corresponding path program 12 times [2020-07-07 13:03:38,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:38,476 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [958291359] [2020-07-07 13:03:38,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 23 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 23 to 43 Garbage collection #2: 43 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 43 to 83 Garbage collection #3: 83 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 83 to 163 Garbage collection #4: 163 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 163 to 317 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 Garbage collection #1: 29 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 29 to 53 Garbage collection #2: 53 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 53 to 103 Garbage collection #3: 103 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 103 to 199 Garbage collection #4: 199 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 199 to 397 Garbage collection #1: 23 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 23 to 43 Garbage collection #2: 43 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 43 to 83 Garbage collection #3: 83 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 83 to 163 Garbage collection #4: 163 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 163 to 317 [2020-07-07 13:03:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:41,487 INFO L134 CoverageAnalysis]: Checked inductivity of 9030 backedges. 124 proven. 774 refuted. 0 times theorem prover too weak. 8132 trivial. 0 not checked. [2020-07-07 13:03:41,487 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:41,487 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [958291359] [2020-07-07 13:03:41,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:41,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-07-07 13:03:41,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986934473] [2020-07-07 13:03:41,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-07 13:03:41,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:41,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-07 13:03:41,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2020-07-07 13:03:41,489 INFO L87 Difference]: Start difference. First operand 167 states and 237 transitions. Second operand 20 states. [2020-07-07 13:03:41,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:41,956 INFO L93 Difference]: Finished difference Result 336 states and 511 transitions. [2020-07-07 13:03:41,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-07 13:03:41,957 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1056 [2020-07-07 13:03:41,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:41,960 INFO L225 Difference]: With dead ends: 336 [2020-07-07 13:03:41,960 INFO L226 Difference]: Without dead ends: 179 [2020-07-07 13:03:41,962 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=684, Unknown=0, NotChecked=0, Total=870 [2020-07-07 13:03:41,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-07-07 13:03:41,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 160. [2020-07-07 13:03:41,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-07-07 13:03:41,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 222 transitions. [2020-07-07 13:03:41,976 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 222 transitions. Word has length 1056 [2020-07-07 13:03:41,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:41,976 INFO L479 AbstractCegarLoop]: Abstraction has 160 states and 222 transitions. [2020-07-07 13:03:41,977 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-07 13:03:41,977 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 222 transitions. [2020-07-07 13:03:41,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1480 [2020-07-07 13:03:41,993 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:41,994 INFO L422 BasicCegarLoop]: trace histogram [167, 167, 135, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 52, 52, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:41,994 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-07 13:03:41,994 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:41,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:41,994 INFO L82 PathProgramCache]: Analyzing trace with hash 404913365, now seen corresponding path program 13 times [2020-07-07 13:03:41,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:41,995 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1564499805] [2020-07-07 13:03:41,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 23 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 23 to 43 Garbage collection #2: 43 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 43 to 83 Garbage collection #3: 83 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 83 to 163 Garbage collection #4: 163 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 163 to 317 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 Garbage collection #1: 29 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 29 to 53 Garbage collection #2: 53 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 53 to 103 Garbage collection #3: 103 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 103 to 199 Garbage collection #4: 199 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 199 to 397 Garbage collection #1: 23 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 23 to 43 Garbage collection #2: 43 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 43 to 83 Garbage collection #3: 83 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 83 to 163 Garbage collection #4: 163 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 163 to 317 [2020-07-07 13:03:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:43,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:47,697 INFO L134 CoverageAnalysis]: Checked inductivity of 17906 backedges. 147 proven. 996 refuted. 0 times theorem prover too weak. 16763 trivial. 0 not checked. [2020-07-07 13:03:47,697 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:47,697 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1564499805] [2020-07-07 13:03:47,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:47,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2020-07-07 13:03:47,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116516888] [2020-07-07 13:03:47,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-07-07 13:03:47,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:47,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-07-07 13:03:47,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2020-07-07 13:03:47,700 INFO L87 Difference]: Start difference. First operand 160 states and 222 transitions. Second operand 34 states. [2020-07-07 13:03:48,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:48,845 INFO L93 Difference]: Finished difference Result 354 states and 603 transitions. [2020-07-07 13:03:48,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2020-07-07 13:03:48,846 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 1479 [2020-07-07 13:03:48,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:48,851 INFO L225 Difference]: With dead ends: 354 [2020-07-07 13:03:48,851 INFO L226 Difference]: Without dead ends: 204 [2020-07-07 13:03:48,855 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=700, Invalid=2960, Unknown=0, NotChecked=0, Total=3660 [2020-07-07 13:03:48,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-07-07 13:03:48,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 173. [2020-07-07 13:03:48,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-07-07 13:03:48,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 246 transitions. [2020-07-07 13:03:48,870 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 246 transitions. Word has length 1479 [2020-07-07 13:03:48,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:48,871 INFO L479 AbstractCegarLoop]: Abstraction has 173 states and 246 transitions. [2020-07-07 13:03:48,871 INFO L480 AbstractCegarLoop]: Interpolant automaton has 34 states. [2020-07-07 13:03:48,871 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 246 transitions. [2020-07-07 13:03:48,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1198 [2020-07-07 13:03:48,882 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:48,883 INFO L422 BasicCegarLoop]: trace histogram [135, 135, 109, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 42, 42, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:48,883 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-07 13:03:48,884 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:48,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:48,884 INFO L82 PathProgramCache]: Analyzing trace with hash 886142123, now seen corresponding path program 14 times [2020-07-07 13:03:48,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:48,884 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [721714714] [2020-07-07 13:03:48,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 23 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 23 to 43 Garbage collection #2: 43 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 43 to 83 Garbage collection #3: 83 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 83 to 163 Garbage collection #4: 163 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 163 to 317 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.001s total Resizing node table from 113 to 223 Garbage collection #1: 29 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 29 to 53 Garbage collection #2: 53 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 53 to 103 Garbage collection #3: 103 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 103 to 199 Garbage collection #4: 199 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 199 to 397 Garbage collection #1: 23 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 23 to 43 Garbage collection #2: 43 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 43 to 83 Garbage collection #3: 83 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 83 to 163 Garbage collection #4: 163 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 163 to 317 [2020-07-07 13:03:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:52,669 INFO L134 CoverageAnalysis]: Checked inductivity of 12222 backedges. 294 proven. 726 refuted. 0 times theorem prover too weak. 11202 trivial. 0 not checked. [2020-07-07 13:03:52,669 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:52,669 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [721714714] [2020-07-07 13:03:52,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:52,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2020-07-07 13:03:52,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294690308] [2020-07-07 13:03:52,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-07-07 13:03:52,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:52,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-07-07 13:03:52,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2020-07-07 13:03:52,673 INFO L87 Difference]: Start difference. First operand 173 states and 246 transitions. Second operand 28 states. [2020-07-07 13:03:53,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:53,408 INFO L93 Difference]: Finished difference Result 351 states and 505 transitions. [2020-07-07 13:03:53,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-07-07 13:03:53,408 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1197 [2020-07-07 13:03:53,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:53,413 INFO L225 Difference]: With dead ends: 351 [2020-07-07 13:03:53,413 INFO L226 Difference]: Without dead ends: 188 [2020-07-07 13:03:53,416 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=342, Invalid=1380, Unknown=0, NotChecked=0, Total=1722 [2020-07-07 13:03:53,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-07-07 13:03:53,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 165. [2020-07-07 13:03:53,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-07-07 13:03:53,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 219 transitions. [2020-07-07 13:03:53,431 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 219 transitions. Word has length 1197 [2020-07-07 13:03:53,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:53,432 INFO L479 AbstractCegarLoop]: Abstraction has 165 states and 219 transitions. [2020-07-07 13:03:53,432 INFO L480 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-07-07 13:03:53,432 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 219 transitions. [2020-07-07 13:03:53,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1568 [2020-07-07 13:03:53,450 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:53,450 INFO L422 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 55, 55, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:53,451 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-07 13:03:53,451 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:53,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:53,451 INFO L82 PathProgramCache]: Analyzing trace with hash -2089916126, now seen corresponding path program 15 times [2020-07-07 13:03:53,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:53,452 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1310758888] [2020-07-07 13:03:53,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 19 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 19 to 37 Garbage collection #2: 37 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 37 to 73 Garbage collection #3: 73 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 73 to 139 Garbage collection #4: 139 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 139 to 277 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 Garbage collection #1: 23 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 23 to 43 Garbage collection #2: 43 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 43 to 83 Garbage collection #3: 83 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 83 to 163 Garbage collection #4: 163 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 163 to 317 Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 Garbage collection #1: 23 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 23 to 43 Garbage collection #2: 43 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 43 to 83 Garbage collection #3: 83 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 83 to 163 Garbage collection #4: 163 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 163 to 317 Garbage collection #1: 23 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 23 to 43 Garbage collection #2: 43 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 43 to 83 Garbage collection #3: 83 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 83 to 163 Garbage collection #4: 163 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 163 to 317 Garbage collection #1: 29 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 29 to 53 Garbage collection #2: 53 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 53 to 103 Garbage collection #3: 103 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 103 to 199 Garbage collection #4: 199 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 199 to 397 [2020-07-07 13:03:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:54,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:54,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:58,654 INFO L134 CoverageAnalysis]: Checked inductivity of 21472 backedges. 8 proven. 647 refuted. 0 times theorem prover too weak. 20817 trivial. 0 not checked. [2020-07-07 13:03:58,654 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:58,655 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1310758888] [2020-07-07 13:03:58,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:58,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-07-07 13:03:58,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134338085] [2020-07-07 13:03:58,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-07 13:03:58,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:58,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-07 13:03:58,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=245, Unknown=0, NotChecked=0, Total=380 [2020-07-07 13:03:58,657 INFO L87 Difference]: Start difference. First operand 165 states and 219 transitions. Second operand 20 states. [2020-07-07 13:03:58,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:58,992 INFO L93 Difference]: Finished difference Result 331 states and 461 transitions. [2020-07-07 13:03:58,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-07 13:03:58,992 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1567 [2020-07-07 13:03:58,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:58,996 INFO L225 Difference]: With dead ends: 331 [2020-07-07 13:03:58,997 INFO L226 Difference]: Without dead ends: 0 [2020-07-07 13:03:59,000 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=272, Unknown=0, NotChecked=0, Total=420 [2020-07-07 13:03:59,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-07 13:03:59,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-07 13:03:59,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-07 13:03:59,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-07 13:03:59,001 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1567 [2020-07-07 13:03:59,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:59,001 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-07 13:03:59,002 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-07 13:03:59,002 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-07 13:03:59,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-07 13:03:59,002 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-07 13:03:59,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-07 13:04:03,226 WARN L193 SmtUtils]: Spent 800.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 89 [2020-07-07 13:04:03,340 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 6 [2020-07-07 13:04:04,216 WARN L193 SmtUtils]: Spent 861.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 84 [2020-07-07 13:04:04,843 WARN L193 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 62 [2020-07-07 13:04:05,545 WARN L193 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 62 [2020-07-07 13:04:06,157 WARN L193 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 65 [2020-07-07 13:04:06,841 WARN L193 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 93 [2020-07-07 13:04:07,717 WARN L193 SmtUtils]: Spent 871.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 84 [2020-07-07 13:04:07,901 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 6 [2020-07-07 13:04:08,661 WARN L193 SmtUtils]: Spent 754.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 89 [2020-07-07 13:04:08,759 INFO L264 CegarLoopResult]: At program point fibonacciFINAL(lines 14 22) the Hoare annotation is: (let ((.cse9 (<= 5 fibonacci_~n)) (.cse7 (<= 1 |fibonacci_#res|)) (.cse8 (<= |fibonacci_#res| 1)) (.cse1 (= fibonacci_~n |fibonacci_#in~n|))) (let ((.cse0 (and (<= 3 |fibonacci_#res|) (<= |fibonacci_#res| 3) (<= fibonacci_~n 4) .cse1)) (.cse2 (and (<= fibonacci_~n 2) .cse7 .cse8 .cse1)) (.cse3 (and (<= 2 |fibonacci_#res|) (<= 3 fibonacci_~n) (<= fibonacci_~n 3) .cse1 (<= |fibonacci_#res| 2))) (.cse6 (not (<= 2 |fibonacci_#in~n|))) (.cse4 (and (<= fibonacci_~n 5) (<= 5 |fibonacci_#res|) .cse1 .cse9 (<= |fibonacci_#res| 5))) (.cse5 (and (<= fibonacci_~n 6) (<= 8 |fibonacci_#res|) (<= |fibonacci_#res| 8) .cse1 .cse9))) (and (or (not (<= |fibonacci_#in~n| 4)) (not (<= 4 |fibonacci_#in~n|)) .cse0) (or (and (<= 34 |fibonacci_#res|) (<= |fibonacci_#res| 34) .cse1 (<= 9 fibonacci_~n)) .cse2 (and (<= fibonacci_~n 8) (<= 21 |fibonacci_#res|) (<= |fibonacci_#res| 21) .cse1 (<= 8 fibonacci_~n)) .cse3 (and (<= 10 fibonacci_~n) .cse1) .cse4 .cse0 .cse5 (and (<= |fibonacci_#res| 13) (<= 13 |fibonacci_#res|) (<= fibonacci_~n 7) .cse1) .cse6) (or (and (<= |fibonacci_#in~n| 0) .cse1) (and .cse7 .cse8 .cse1) (not (<= |fibonacci_#in~n| 1))) (or .cse2 .cse3 .cse6 (not (<= |fibonacci_#in~n| 3))) (or (not (<= |fibonacci_#in~n| 5)) (not (<= 5 |fibonacci_#in~n|)) .cse4) (or (not (<= |fibonacci_#in~n| 6)) (not (<= 6 |fibonacci_#in~n|)) .cse5) (or (and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|)) (< 0 fibonacci_~n))))) [2020-07-07 13:04:08,760 INFO L271 CegarLoopResult]: At program point fibonacciENTRY(lines 14 22) the Hoare annotation is: true [2020-07-07 13:04:08,760 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (< 1 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|)) [2020-07-07 13:04:08,760 INFO L264 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: (let ((.cse5 (<= 5 fibonacci_~n)) (.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (let ((.cse1 (and (<= 10 fibonacci_~n) .cse0)) (.cse2 (and (<= |fibonacci_#t~ret0| 21) (<= fibonacci_~n 9) .cse0 (<= 9 fibonacci_~n) (<= 21 |fibonacci_#t~ret0|))) (.cse3 (and (<= fibonacci_~n 8) (<= |fibonacci_#t~ret0| 13) .cse0 (<= 8 fibonacci_~n) (<= 13 |fibonacci_#t~ret0|))) (.cse4 (and (<= |fibonacci_#t~ret0| 3) (<= fibonacci_~n 5) (<= 3 |fibonacci_#t~ret0|) .cse5))) (and (or (and (<= fibonacci_~n 7) .cse0) .cse1 .cse2 .cse3) (or (and (<= 7 fibonacci_~n) (<= |fibonacci_#t~ret0| 8) (<= 8 |fibonacci_#t~ret0|)) .cse4 .cse1 (and (<= 5 |fibonacci_#t~ret0|) (<= fibonacci_~n 6) (<= |fibonacci_#t~ret0| 5) .cse5) (and (<= |fibonacci_#t~ret0| 2) (<= fibonacci_~n 4) (<= 2 |fibonacci_#t~ret0|) (<= 4 |fibonacci_#in~n|)) .cse2 .cse3 (and (<= |fibonacci_#t~ret0| 1) (<= 1 |fibonacci_#t~ret0|) (<= fibonacci_~n 3))) (or (not (<= |fibonacci_#in~n| 5)) .cse4 (not (<= 5 |fibonacci_#in~n|))) (not (<= |fibonacci_#in~n| 1))))) [2020-07-07 13:04:08,760 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (<= |fibonacci_#in~n| 1) (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|)) [2020-07-07 13:04:08,760 INFO L264 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (let ((.cse5 (<= 5 fibonacci_~n)) (.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (let ((.cse1 (and (<= 10 fibonacci_~n) .cse0)) (.cse2 (and (<= |fibonacci_#t~ret0| 21) (<= fibonacci_~n 9) .cse0 (<= 9 fibonacci_~n) (<= 21 |fibonacci_#t~ret0|))) (.cse3 (and (<= fibonacci_~n 8) (<= |fibonacci_#t~ret0| 13) .cse0 (<= 8 fibonacci_~n) (<= 13 |fibonacci_#t~ret0|))) (.cse4 (and (<= |fibonacci_#t~ret0| 3) (<= fibonacci_~n 5) (<= 3 |fibonacci_#t~ret0|) .cse5))) (and (or (and (<= fibonacci_~n 7) .cse0) .cse1 .cse2 .cse3) (or (and (<= 7 fibonacci_~n) (<= |fibonacci_#t~ret0| 8) (<= 8 |fibonacci_#t~ret0|)) .cse4 .cse1 (and (<= 5 |fibonacci_#t~ret0|) (<= fibonacci_~n 6) (<= |fibonacci_#t~ret0| 5) .cse5) (and (<= |fibonacci_#t~ret0| 2) (<= fibonacci_~n 4) (<= 2 |fibonacci_#t~ret0|) (<= 4 |fibonacci_#in~n|)) .cse2 .cse3 (and (<= |fibonacci_#t~ret0| 1) (<= 1 |fibonacci_#t~ret0|) (<= fibonacci_~n 3))) (or (not (<= |fibonacci_#in~n| 5)) .cse4 (not (<= 5 |fibonacci_#in~n|))) (not (<= |fibonacci_#in~n| 1))))) [2020-07-07 13:04:08,761 INFO L264 CegarLoopResult]: At program point fibonacciEXIT(lines 14 22) the Hoare annotation is: (let ((.cse9 (<= 5 fibonacci_~n)) (.cse7 (<= 1 |fibonacci_#res|)) (.cse8 (<= |fibonacci_#res| 1)) (.cse1 (= fibonacci_~n |fibonacci_#in~n|))) (let ((.cse0 (and (<= 3 |fibonacci_#res|) (<= |fibonacci_#res| 3) (<= fibonacci_~n 4) .cse1)) (.cse2 (and (<= fibonacci_~n 2) .cse7 .cse8 .cse1)) (.cse3 (and (<= 2 |fibonacci_#res|) (<= 3 fibonacci_~n) (<= fibonacci_~n 3) .cse1 (<= |fibonacci_#res| 2))) (.cse6 (not (<= 2 |fibonacci_#in~n|))) (.cse4 (and (<= fibonacci_~n 5) (<= 5 |fibonacci_#res|) .cse1 .cse9 (<= |fibonacci_#res| 5))) (.cse5 (and (<= fibonacci_~n 6) (<= 8 |fibonacci_#res|) (<= |fibonacci_#res| 8) .cse1 .cse9))) (and (or (not (<= |fibonacci_#in~n| 4)) (not (<= 4 |fibonacci_#in~n|)) .cse0) (or (and (<= 34 |fibonacci_#res|) (<= |fibonacci_#res| 34) .cse1 (<= 9 fibonacci_~n)) .cse2 (and (<= fibonacci_~n 8) (<= 21 |fibonacci_#res|) (<= |fibonacci_#res| 21) .cse1 (<= 8 fibonacci_~n)) .cse3 (and (<= 10 fibonacci_~n) .cse1) .cse4 .cse0 .cse5 (and (<= |fibonacci_#res| 13) (<= 13 |fibonacci_#res|) (<= fibonacci_~n 7) .cse1) .cse6) (or (and (<= |fibonacci_#in~n| 0) .cse1) (and .cse7 .cse8 .cse1) (not (<= |fibonacci_#in~n| 1))) (or .cse2 .cse3 .cse6 (not (<= |fibonacci_#in~n| 3))) (or (not (<= |fibonacci_#in~n| 5)) (not (<= 5 |fibonacci_#in~n|)) .cse4) (or (not (<= |fibonacci_#in~n| 6)) (not (<= 6 |fibonacci_#in~n|)) .cse5) (or (and (<= |fibonacci_#res| 0) (<= 0 |fibonacci_#res|)) (< 0 fibonacci_~n))))) [2020-07-07 13:04:08,761 INFO L264 CegarLoopResult]: At program point L17(lines 17 21) the Hoare annotation is: (and (< 0 fibonacci_~n) (= fibonacci_~n |fibonacci_#in~n|)) [2020-07-07 13:04:08,761 INFO L264 CegarLoopResult]: At program point L20-3(line 20) the Hoare annotation is: (let ((.cse2 (<= |fibonacci_#t~ret0| 1)) (.cse3 (<= 1 |fibonacci_#t~ret0|)) (.cse0 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|))) (let ((.cse1 (and (<= fibonacci_~n 2) (< 1 fibonacci_~n) .cse2 .cse3 (<= .cse0 1) (<= 1 .cse0)))) (and (or (and (<= 8 .cse0) (<= 5 |fibonacci_#t~ret0|) (<= .cse0 8) (<= fibonacci_~n 6) (<= |fibonacci_#t~ret0| 5) (<= 6 fibonacci_~n)) (not (<= 4 |fibonacci_#in~n|)) (and (<= |fibonacci_#t~ret0| 3) (<= fibonacci_~n 5) (<= 5 .cse0) (<= 3 |fibonacci_#t~ret0|) (<= 5 fibonacci_~n) (<= .cse0 5)) (and (<= 3 .cse0) (<= |fibonacci_#t~ret0| 2) (<= .cse0 3) (<= fibonacci_~n 4) (<= 2 |fibonacci_#t~ret0|)) (and (<= .cse0 21) (<= 21 .cse0) (<= |fibonacci_#t~ret0| 13) (<= 8 fibonacci_~n) (<= 13 |fibonacci_#t~ret0|)) (<= 9 fibonacci_~n) (and (<= 7 fibonacci_~n) (<= |fibonacci_#t~ret0| 8) (<= 13 .cse0) (<= 8 |fibonacci_#t~ret0|) (<= fibonacci_~n 7) (<= .cse0 13))) (or .cse1 (not (<= |fibonacci_#in~n| 2))) (or (and (<= .cse0 2) .cse2 .cse3 (<= 2 .cse0)) .cse1 (not (<= |fibonacci_#in~n| 3))) (let ((.cse4 (= fibonacci_~n |fibonacci_#in~n|))) (or (and (<= fibonacci_~n 8) .cse4) (and (<= 10 fibonacci_~n) .cse4) (and (<= .cse0 34) (<= |fibonacci_#t~ret0| 21) .cse4 (<= 34 .cse0) (<= 21 |fibonacci_#t~ret0|))))))) [2020-07-07 13:04:08,761 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (<= |fibonacci_#in~n| 0) (= fibonacci_~n |fibonacci_#in~n|)) [2020-07-07 13:04:08,761 INFO L264 CegarLoopResult]: At program point L20-4(line 20) the Hoare annotation is: (let ((.cse2 (<= |fibonacci_#t~ret0| 1)) (.cse3 (<= 1 |fibonacci_#t~ret0|)) (.cse0 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|))) (let ((.cse1 (and (<= fibonacci_~n 2) (< 1 fibonacci_~n) .cse2 .cse3 (<= .cse0 1) (<= 1 .cse0)))) (and (or (and (<= 8 .cse0) (<= 5 |fibonacci_#t~ret0|) (<= .cse0 8) (<= fibonacci_~n 6) (<= |fibonacci_#t~ret0| 5) (<= 6 fibonacci_~n)) (not (<= 4 |fibonacci_#in~n|)) (and (<= |fibonacci_#t~ret0| 3) (<= fibonacci_~n 5) (<= 5 .cse0) (<= 3 |fibonacci_#t~ret0|) (<= 5 fibonacci_~n) (<= .cse0 5)) (and (<= 3 .cse0) (<= |fibonacci_#t~ret0| 2) (<= .cse0 3) (<= fibonacci_~n 4) (<= 2 |fibonacci_#t~ret0|)) (and (<= .cse0 21) (<= 21 .cse0) (<= |fibonacci_#t~ret0| 13) (<= 8 fibonacci_~n) (<= 13 |fibonacci_#t~ret0|)) (<= 9 fibonacci_~n) (and (<= 7 fibonacci_~n) (<= |fibonacci_#t~ret0| 8) (<= 13 .cse0) (<= 8 |fibonacci_#t~ret0|) (<= fibonacci_~n 7) (<= .cse0 13))) (or .cse1 (not (<= |fibonacci_#in~n| 2))) (or (and (<= .cse0 2) .cse2 .cse3 (<= 2 .cse0)) .cse1 (not (<= |fibonacci_#in~n| 3))) (let ((.cse4 (= fibonacci_~n |fibonacci_#in~n|))) (or (and (<= fibonacci_~n 8) .cse4) (and (<= 10 fibonacci_~n) .cse4) (and (<= .cse0 34) (<= |fibonacci_#t~ret0| 21) .cse4 (<= 34 .cse0) (<= 21 |fibonacci_#t~ret0|))))))) [2020-07-07 13:04:08,761 INFO L264 CegarLoopResult]: At program point L15(lines 15 21) the Hoare annotation is: (= fibonacci_~n |fibonacci_#in~n|) [2020-07-07 13:04:08,762 INFO L264 CegarLoopResult]: At program point L20-5(line 20) the Hoare annotation is: (let ((.cse0 (<= |fibonacci_#t~ret0| 1)) (.cse1 (<= 1 |fibonacci_#t~ret0|)) (.cse3 (= fibonacci_~n |fibonacci_#in~n|)) (.cse2 (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0|))) (or (and (<= fibonacci_~n 2) (<= 1 |fibonacci_#res|) (< 1 fibonacci_~n) .cse0 (<= |fibonacci_#res| 1) .cse1 (<= .cse2 1) (<= 1 .cse2) .cse3) (and (<= 3 |fibonacci_#res|) (<= 3 .cse2) (<= |fibonacci_#res| 3) (<= |fibonacci_#t~ret0| 2) (<= .cse2 3) (<= fibonacci_~n 4) (<= 2 |fibonacci_#t~ret0|) (<= 4 |fibonacci_#in~n|) .cse3) (and (<= 7 fibonacci_~n) (<= |fibonacci_#res| 13) (<= |fibonacci_#t~ret0| 8) (<= 13 .cse2) (<= 8 |fibonacci_#t~ret0|) (<= 13 |fibonacci_#res|) (<= fibonacci_~n 7) .cse3 (<= .cse2 13)) (and (<= .cse2 21) (<= fibonacci_~n 8) (<= 21 |fibonacci_#res|) (<= 21 .cse2) (<= |fibonacci_#t~ret0| 13) (<= |fibonacci_#res| 21) .cse3 (<= 8 fibonacci_~n) (<= 13 |fibonacci_#t~ret0|)) (and (<= 8 .cse2) (<= 5 |fibonacci_#t~ret0|) (<= .cse2 8) (<= fibonacci_~n 6) (<= |fibonacci_#t~ret0| 5) (<= 8 |fibonacci_#res|) (<= |fibonacci_#res| 8) (<= 6 fibonacci_~n) .cse3) (and (<= 10 fibonacci_~n) .cse3) (and (<= .cse2 2) .cse0 .cse1 (<= 2 |fibonacci_#res|) (<= 2 .cse2) (<= 3 fibonacci_~n) (<= fibonacci_~n 3) .cse3 (<= |fibonacci_#res| 2)) (and (<= |fibonacci_#t~ret0| 3) (<= fibonacci_~n 5) (<= 5 .cse2) (<= 5 |fibonacci_#res|) (<= 3 |fibonacci_#t~ret0|) .cse3 (<= 5 fibonacci_~n) (<= .cse2 5) (<= |fibonacci_#res| 5)) (and (<= 34 |fibonacci_#res|) (<= .cse2 34) (<= |fibonacci_#t~ret0| 21) (<= |fibonacci_#res| 34) (<= 9 fibonacci_~n) .cse3 (<= 34 .cse2) (<= 21 |fibonacci_#t~ret0|)))) [2020-07-07 13:04:08,762 INFO L264 CegarLoopResult]: At program point L20-6(line 20) the Hoare annotation is: (let ((.cse1 (and (<= fibonacci_~n 2) (<= 1 |fibonacci_#res|) (< 1 fibonacci_~n) (<= |fibonacci_#res| 1))) (.cse2 (and (<= 2 |fibonacci_#res|) (<= 3 fibonacci_~n) (<= fibonacci_~n 3) (<= |fibonacci_#res| 2))) (.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (and (or (and (<= fibonacci_~n 8) .cse0) (and (<= 10 fibonacci_~n) .cse0) (and (<= 34 |fibonacci_#res|) (<= |fibonacci_#res| 34))) (or .cse1 .cse2 (not (<= |fibonacci_#in~n| 3))) (or (and (<= 3 |fibonacci_#res|) (<= |fibonacci_#res| 3) (<= fibonacci_~n 4)) .cse1 (and (<= fibonacci_~n 5) (<= 5 |fibonacci_#res|) (<= 5 fibonacci_~n) (<= |fibonacci_#res| 5)) .cse2 (and (<= 21 |fibonacci_#res|) (<= |fibonacci_#res| 21) (<= 8 fibonacci_~n)) (and (<= fibonacci_~n 6) (<= 8 |fibonacci_#res|) (<= |fibonacci_#res| 8) (<= 6 fibonacci_~n)) (and .cse0 (<= 9 fibonacci_~n)) (and (<= 7 fibonacci_~n) (<= |fibonacci_#res| 13) (<= 13 |fibonacci_#res|) (<= fibonacci_~n 7))))) [2020-07-07 13:04:08,762 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-07 13:04:08,762 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-07 13:04:08,762 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-07 13:04:08,762 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-07 13:04:08,762 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-07 13:04:08,762 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-07 13:04:08,763 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 31) the Hoare annotation is: false [2020-07-07 13:04:08,763 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: false [2020-07-07 13:04:08,763 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 25 33) the Hoare annotation is: true [2020-07-07 13:04:08,763 INFO L264 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (<= 9 main_~x~0) [2020-07-07 13:04:08,763 INFO L264 CegarLoopResult]: At program point L28(lines 28 32) the Hoare annotation is: (and (<= main_~result~0 34) (<= 9 main_~x~0) (< 33 main_~result~0)) [2020-07-07 13:04:08,763 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (and (<= main_~x~0 9) (<= 9 main_~x~0)) [2020-07-07 13:04:08,763 INFO L264 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: (and (<= |main_#t~ret2| 34) (<= 34 |main_#t~ret2|) (<= 9 main_~x~0)) [2020-07-07 13:04:08,763 INFO L264 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: (and (<= |main_#t~ret2| 34) (<= 34 |main_#t~ret2|) (<= 9 main_~x~0)) [2020-07-07 13:04:08,764 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 25 33) the Hoare annotation is: (<= 9 main_~x~0) [2020-07-07 13:04:08,764 INFO L264 CegarLoopResult]: At program point L27-3(line 27) the Hoare annotation is: (and (<= |main_#t~ret2| 34) (<= 34 |main_#t~ret2|) (<= main_~result~0 34) (<= 9 main_~x~0) (< 33 main_~result~0)) [2020-07-07 13:04:08,764 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 25 33) the Hoare annotation is: (<= 9 main_~x~0) [2020-07-07 13:04:08,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 01:04:08 BoogieIcfgContainer [2020-07-07 13:04:08,785 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 13:04:08,786 INFO L168 Benchmark]: Toolchain (without parser) took 56893.24 ms. Allocated memory was 138.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 104.0 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2020-07-07 13:04:08,787 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.9 MB. Free memory was 122.3 MB in the beginning and 122.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-07 13:04:08,788 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.05 ms. Allocated memory is still 138.9 MB. Free memory was 103.8 MB in the beginning and 94.5 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-07-07 13:04:08,788 INFO L168 Benchmark]: Boogie Preprocessor took 26.31 ms. Allocated memory is still 138.9 MB. Free memory was 94.5 MB in the beginning and 93.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-07 13:04:08,789 INFO L168 Benchmark]: RCFGBuilder took 327.77 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 93.1 MB in the beginning and 171.0 MB in the end (delta: -77.8 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2020-07-07 13:04:08,789 INFO L168 Benchmark]: TraceAbstraction took 56290.61 ms. Allocated memory was 203.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 170.3 MB in the beginning and 2.3 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2020-07-07 13:04:08,792 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 138.9 MB. Free memory was 122.3 MB in the beginning and 122.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 244.05 ms. Allocated memory is still 138.9 MB. Free memory was 103.8 MB in the beginning and 94.5 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.31 ms. Allocated memory is still 138.9 MB. Free memory was 94.5 MB in the beginning and 93.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 327.77 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 93.1 MB in the beginning and 171.0 MB in the end (delta: -77.8 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 56290.61 ms. Allocated memory was 203.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 170.3 MB in the beginning and 2.3 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 31]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 14]: Procedure Contract for fibonacci Derived contract for procedure fibonacci: (((((((!(\old(n) <= 4) || !(4 <= \old(n))) || (((3 <= \result && \result <= 3) && n <= 4) && n == \old(n))) && ((((((((((((34 <= \result && \result <= 34) && n == \old(n)) && 9 <= n) || (((n <= 2 && 1 <= \result) && \result <= 1) && n == \old(n))) || ((((n <= 8 && 21 <= \result) && \result <= 21) && n == \old(n)) && 8 <= n)) || ((((2 <= \result && 3 <= n) && n <= 3) && n == \old(n)) && \result <= 2)) || (10 <= n && n == \old(n))) || ((((n <= 5 && 5 <= \result) && n == \old(n)) && 5 <= n) && \result <= 5)) || (((3 <= \result && \result <= 3) && n <= 4) && n == \old(n))) || ((((n <= 6 && 8 <= \result) && \result <= 8) && n == \old(n)) && 5 <= n)) || (((\result <= 13 && 13 <= \result) && n <= 7) && n == \old(n))) || !(2 <= \old(n)))) && (((\old(n) <= 0 && n == \old(n)) || ((1 <= \result && \result <= 1) && n == \old(n))) || !(\old(n) <= 1))) && ((((((n <= 2 && 1 <= \result) && \result <= 1) && n == \old(n)) || ((((2 <= \result && 3 <= n) && n <= 3) && n == \old(n)) && \result <= 2)) || !(2 <= \old(n))) || !(\old(n) <= 3))) && ((!(\old(n) <= 5) || !(5 <= \old(n))) || ((((n <= 5 && 5 <= \result) && n == \old(n)) && 5 <= n) && \result <= 5))) && ((!(\old(n) <= 6) || !(6 <= \old(n))) || ((((n <= 6 && 8 <= \result) && \result <= 8) && n == \old(n)) && 5 <= n))) && ((\result <= 0 && 0 <= \result) || 0 < n) - ProcedureContractResult [Line: 25]: Procedure Contract for main Derived contract for procedure main: 9 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 46.4s, OverallIterations: 18, TraceHistogramMax: 177, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 789 SDtfs, 2126 SDslu, 4881 SDs, 0 SdLazy, 6025 SolverSat, 1843 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2935 GetRequests, 2544 SyntacticMatches, 0 SemanticMatches, 391 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3016 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1222occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 3413 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 31 LocationsWithAnnotation, 5127 PreInvPairs, 8455 NumberOfFragments, 1856 HoareAnnotationTreeSize, 5127 FomulaSimplifications, 80285 FormulaSimplificationTreeSizeReduction, 3.3s HoareSimplificationTime, 31 FomulaSimplificationsInter, 25093 FormulaSimplificationTreeSizeReductionInter, 6.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...