/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_8.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:20:02,673 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:20:02,677 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:20:02,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:20:02,697 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:20:02,699 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:20:02,700 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:20:02,702 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:20:02,704 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:20:02,705 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:20:02,706 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:20:02,707 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:20:02,707 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:20:02,708 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:20:02,709 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:20:02,711 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:20:02,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:20:02,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:20:02,714 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:20:02,716 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:20:02,717 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:20:02,718 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:20:02,720 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:20:02,720 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:20:02,723 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:20:02,723 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:20:02,723 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:20:02,724 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:20:02,724 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:20:02,725 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:20:02,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:20:02,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:20:02,727 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:20:02,728 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:20:02,729 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:20:02,729 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:20:02,729 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:20:02,730 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:20:02,730 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:20:02,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:20:02,731 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:20:02,732 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 21:20:02,753 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:20:02,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:20:02,755 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:20:02,756 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:20:02,756 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:20:02,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:20:02,757 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:20:02,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:20:02,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:20:02,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:20:02,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:20:02,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:20:02,759 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:20:02,759 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:20:02,759 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:20:02,760 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:20:02,760 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:20:02,760 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:20:02,760 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:20:02,760 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:20:02,761 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:20:02,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:20:02,761 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:20:02,761 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:20:02,762 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:20:02,762 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:20:02,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:20:02,762 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:20:02,762 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:20:03,034 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:20:03,055 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:20:03,059 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:20:03,060 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:20:03,061 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:20:03,061 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2019-11-06 21:20:03,137 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/472419627/4b4affd8d73148cfbb7d438338b039b6/FLAG09e21ec02 [2019-11-06 21:20:03,624 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:20:03,625 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2019-11-06 21:20:03,633 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/472419627/4b4affd8d73148cfbb7d438338b039b6/FLAG09e21ec02 [2019-11-06 21:20:03,985 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/472419627/4b4affd8d73148cfbb7d438338b039b6 [2019-11-06 21:20:03,995 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:20:03,997 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:20:03,998 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:20:03,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:20:04,001 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:20:04,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:20:03" (1/1) ... [2019-11-06 21:20:04,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@710022fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:04, skipping insertion in model container [2019-11-06 21:20:04,005 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:20:03" (1/1) ... [2019-11-06 21:20:04,012 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:20:04,031 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:20:04,226 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:20:04,230 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:20:04,252 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:20:04,263 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:20:04,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:04 WrapperNode [2019-11-06 21:20:04,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:20:04,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:20:04,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:20:04,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:20:04,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:04" (1/1) ... [2019-11-06 21:20:04,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:04" (1/1) ... [2019-11-06 21:20:04,363 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:04" (1/1) ... [2019-11-06 21:20:04,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:04" (1/1) ... [2019-11-06 21:20:04,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:04" (1/1) ... [2019-11-06 21:20:04,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:04" (1/1) ... [2019-11-06 21:20:04,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:04" (1/1) ... [2019-11-06 21:20:04,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:20:04,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:20:04,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:20:04,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:20:04,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:04" (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 [2019-11-06 21:20:04,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:20:04,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:20:04,456 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:20:04,456 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:20:04,456 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 21:20:04,456 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:20:04,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:20:04,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:20:04,788 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:20:04,789 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 21:20:04,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:20:04 BoogieIcfgContainer [2019-11-06 21:20:04,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:20:04,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:20:04,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:20:04,795 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:20:04,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:20:03" (1/3) ... [2019-11-06 21:20:04,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd54025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:20:04, skipping insertion in model container [2019-11-06 21:20:04,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:20:04" (2/3) ... [2019-11-06 21:20:04,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd54025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:20:04, skipping insertion in model container [2019-11-06 21:20:04,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:20:04" (3/3) ... [2019-11-06 21:20:04,798 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2019-11-06 21:20:04,808 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:20:04,816 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 21:20:04,827 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 21:20:04,852 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:20:04,852 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:20:04,852 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:20:04,853 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:20:04,853 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:20:04,853 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:20:04,853 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:20:04,853 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:20:04,869 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-11-06 21:20:04,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 21:20:04,873 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:04,874 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:04,875 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:04,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:04,881 INFO L82 PathProgramCache]: Analyzing trace with hash 577441593, now seen corresponding path program 1 times [2019-11-06 21:20:04,889 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:04,890 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156840524] [2019-11-06 21:20:04,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:04,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:05,058 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156840524] [2019-11-06 21:20:05,059 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:05,059 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:05,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122098217] [2019-11-06 21:20:05,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:05,066 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:05,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:05,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,085 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2019-11-06 21:20:05,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:05,172 INFO L93 Difference]: Finished difference Result 75 states and 126 transitions. [2019-11-06 21:20:05,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:05,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-06 21:20:05,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:05,188 INFO L225 Difference]: With dead ends: 75 [2019-11-06 21:20:05,188 INFO L226 Difference]: Without dead ends: 60 [2019-11-06 21:20:05,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-06 21:20:05,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-11-06 21:20:05,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-06 21:20:05,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2019-11-06 21:20:05,263 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 18 [2019-11-06 21:20:05,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:05,264 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2019-11-06 21:20:05,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:05,265 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2019-11-06 21:20:05,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 21:20:05,267 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:05,268 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:05,269 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:05,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:05,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1278506171, now seen corresponding path program 1 times [2019-11-06 21:20:05,271 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:05,272 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992384045] [2019-11-06 21:20:05,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:05,361 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992384045] [2019-11-06 21:20:05,361 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:05,361 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:05,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674689688] [2019-11-06 21:20:05,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:05,364 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:05,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:05,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,365 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2019-11-06 21:20:05,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:05,406 INFO L93 Difference]: Finished difference Result 97 states and 172 transitions. [2019-11-06 21:20:05,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:05,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-06 21:20:05,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:05,413 INFO L225 Difference]: With dead ends: 97 [2019-11-06 21:20:05,413 INFO L226 Difference]: Without dead ends: 60 [2019-11-06 21:20:05,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-06 21:20:05,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-11-06 21:20:05,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-06 21:20:05,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 101 transitions. [2019-11-06 21:20:05,430 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 101 transitions. Word has length 18 [2019-11-06 21:20:05,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:05,431 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 101 transitions. [2019-11-06 21:20:05,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:05,431 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2019-11-06 21:20:05,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 21:20:05,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:05,433 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:05,433 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:05,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:05,434 INFO L82 PathProgramCache]: Analyzing trace with hash 721034227, now seen corresponding path program 1 times [2019-11-06 21:20:05,434 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:05,434 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132110803] [2019-11-06 21:20:05,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:05,502 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132110803] [2019-11-06 21:20:05,503 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:05,503 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:05,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072795897] [2019-11-06 21:20:05,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:05,506 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:05,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:05,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,507 INFO L87 Difference]: Start difference. First operand 58 states and 101 transitions. Second operand 3 states. [2019-11-06 21:20:05,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:05,535 INFO L93 Difference]: Finished difference Result 90 states and 153 transitions. [2019-11-06 21:20:05,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:05,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-06 21:20:05,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:05,545 INFO L225 Difference]: With dead ends: 90 [2019-11-06 21:20:05,545 INFO L226 Difference]: Without dead ends: 63 [2019-11-06 21:20:05,546 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-06 21:20:05,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-11-06 21:20:05,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-06 21:20:05,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 103 transitions. [2019-11-06 21:20:05,568 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 103 transitions. Word has length 19 [2019-11-06 21:20:05,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:05,568 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 103 transitions. [2019-11-06 21:20:05,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:05,571 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2019-11-06 21:20:05,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 21:20:05,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:05,572 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:05,572 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:05,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:05,573 INFO L82 PathProgramCache]: Analyzing trace with hash 979199665, now seen corresponding path program 1 times [2019-11-06 21:20:05,573 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:05,573 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124082556] [2019-11-06 21:20:05,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:05,617 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124082556] [2019-11-06 21:20:05,617 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:05,617 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:05,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843113717] [2019-11-06 21:20:05,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:05,618 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:05,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:05,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,619 INFO L87 Difference]: Start difference. First operand 61 states and 103 transitions. Second operand 3 states. [2019-11-06 21:20:05,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:05,659 INFO L93 Difference]: Finished difference Result 112 states and 192 transitions. [2019-11-06 21:20:05,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:05,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-06 21:20:05,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:05,664 INFO L225 Difference]: With dead ends: 112 [2019-11-06 21:20:05,664 INFO L226 Difference]: Without dead ends: 110 [2019-11-06 21:20:05,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-06 21:20:05,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2019-11-06 21:20:05,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-06 21:20:05,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 136 transitions. [2019-11-06 21:20:05,689 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 136 transitions. Word has length 19 [2019-11-06 21:20:05,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:05,689 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 136 transitions. [2019-11-06 21:20:05,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:05,689 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 136 transitions. [2019-11-06 21:20:05,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 21:20:05,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:05,692 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:05,692 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:05,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:05,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1680264243, now seen corresponding path program 1 times [2019-11-06 21:20:05,694 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:05,694 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978058555] [2019-11-06 21:20:05,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:05,773 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978058555] [2019-11-06 21:20:05,773 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:05,773 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:05,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379965056] [2019-11-06 21:20:05,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:05,774 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:05,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:05,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,775 INFO L87 Difference]: Start difference. First operand 80 states and 136 transitions. Second operand 3 states. [2019-11-06 21:20:05,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:05,800 INFO L93 Difference]: Finished difference Result 184 states and 318 transitions. [2019-11-06 21:20:05,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:05,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-06 21:20:05,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:05,803 INFO L225 Difference]: With dead ends: 184 [2019-11-06 21:20:05,803 INFO L226 Difference]: Without dead ends: 112 [2019-11-06 21:20:05,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-06 21:20:05,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-11-06 21:20:05,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-06 21:20:05,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 186 transitions. [2019-11-06 21:20:05,814 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 186 transitions. Word has length 19 [2019-11-06 21:20:05,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:05,814 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 186 transitions. [2019-11-06 21:20:05,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:05,814 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 186 transitions. [2019-11-06 21:20:05,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 21:20:05,815 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:05,816 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:05,816 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:05,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:05,816 INFO L82 PathProgramCache]: Analyzing trace with hash 290632912, now seen corresponding path program 1 times [2019-11-06 21:20:05,817 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:05,817 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110908661] [2019-11-06 21:20:05,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:05,847 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110908661] [2019-11-06 21:20:05,847 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:05,847 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:05,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324729377] [2019-11-06 21:20:05,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:05,848 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:05,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:05,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,849 INFO L87 Difference]: Start difference. First operand 110 states and 186 transitions. Second operand 3 states. [2019-11-06 21:20:05,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:05,866 INFO L93 Difference]: Finished difference Result 165 states and 277 transitions. [2019-11-06 21:20:05,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:05,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-06 21:20:05,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:05,868 INFO L225 Difference]: With dead ends: 165 [2019-11-06 21:20:05,868 INFO L226 Difference]: Without dead ends: 114 [2019-11-06 21:20:05,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-06 21:20:05,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2019-11-06 21:20:05,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-06 21:20:05,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 186 transitions. [2019-11-06 21:20:05,884 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 186 transitions. Word has length 20 [2019-11-06 21:20:05,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:05,884 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 186 transitions. [2019-11-06 21:20:05,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:05,884 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 186 transitions. [2019-11-06 21:20:05,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 21:20:05,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:05,888 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:05,889 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:05,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:05,889 INFO L82 PathProgramCache]: Analyzing trace with hash 548798350, now seen corresponding path program 1 times [2019-11-06 21:20:05,889 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:05,890 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655571503] [2019-11-06 21:20:05,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:05,928 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655571503] [2019-11-06 21:20:05,928 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:05,928 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:05,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555994178] [2019-11-06 21:20:05,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:05,929 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:05,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:05,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,930 INFO L87 Difference]: Start difference. First operand 112 states and 186 transitions. Second operand 3 states. [2019-11-06 21:20:05,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:05,949 INFO L93 Difference]: Finished difference Result 204 states and 344 transitions. [2019-11-06 21:20:05,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:05,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-06 21:20:05,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:05,952 INFO L225 Difference]: With dead ends: 204 [2019-11-06 21:20:05,952 INFO L226 Difference]: Without dead ends: 202 [2019-11-06 21:20:05,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-06 21:20:05,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 152. [2019-11-06 21:20:05,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-06 21:20:05,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 250 transitions. [2019-11-06 21:20:05,966 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 250 transitions. Word has length 20 [2019-11-06 21:20:05,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:05,967 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 250 transitions. [2019-11-06 21:20:05,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:05,967 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 250 transitions. [2019-11-06 21:20:05,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 21:20:05,969 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:05,969 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:05,969 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:05,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:05,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1249862928, now seen corresponding path program 1 times [2019-11-06 21:20:05,970 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:05,970 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856123536] [2019-11-06 21:20:05,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:06,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:06,008 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856123536] [2019-11-06 21:20:06,009 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:06,009 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:06,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749868636] [2019-11-06 21:20:06,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:06,010 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:06,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:06,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:06,011 INFO L87 Difference]: Start difference. First operand 152 states and 250 transitions. Second operand 3 states. [2019-11-06 21:20:06,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:06,058 INFO L93 Difference]: Finished difference Result 352 states and 584 transitions. [2019-11-06 21:20:06,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:06,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-06 21:20:06,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:06,061 INFO L225 Difference]: With dead ends: 352 [2019-11-06 21:20:06,061 INFO L226 Difference]: Without dead ends: 210 [2019-11-06 21:20:06,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:06,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-06 21:20:06,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2019-11-06 21:20:06,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-11-06 21:20:06,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 338 transitions. [2019-11-06 21:20:06,084 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 338 transitions. Word has length 20 [2019-11-06 21:20:06,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:06,087 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 338 transitions. [2019-11-06 21:20:06,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:06,087 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 338 transitions. [2019-11-06 21:20:06,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 21:20:06,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:06,089 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:06,089 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:06,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:06,090 INFO L82 PathProgramCache]: Analyzing trace with hash -166905624, now seen corresponding path program 1 times [2019-11-06 21:20:06,090 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:06,090 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403399896] [2019-11-06 21:20:06,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:06,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:06,143 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403399896] [2019-11-06 21:20:06,144 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:06,144 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:06,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496779583] [2019-11-06 21:20:06,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:06,146 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:06,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:06,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:06,147 INFO L87 Difference]: Start difference. First operand 208 states and 338 transitions. Second operand 3 states. [2019-11-06 21:20:06,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:06,181 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2019-11-06 21:20:06,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:06,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-06 21:20:06,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:06,183 INFO L225 Difference]: With dead ends: 312 [2019-11-06 21:20:06,183 INFO L226 Difference]: Without dead ends: 214 [2019-11-06 21:20:06,184 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:06,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-06 21:20:06,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2019-11-06 21:20:06,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-06 21:20:06,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 338 transitions. [2019-11-06 21:20:06,211 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 338 transitions. Word has length 21 [2019-11-06 21:20:06,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:06,211 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 338 transitions. [2019-11-06 21:20:06,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:06,214 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 338 transitions. [2019-11-06 21:20:06,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 21:20:06,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:06,216 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:06,216 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:06,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:06,220 INFO L82 PathProgramCache]: Analyzing trace with hash 91259814, now seen corresponding path program 1 times [2019-11-06 21:20:06,220 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:06,220 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780713555] [2019-11-06 21:20:06,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:06,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:06,246 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780713555] [2019-11-06 21:20:06,246 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:06,246 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:06,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124167899] [2019-11-06 21:20:06,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:06,247 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:06,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:06,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:06,248 INFO L87 Difference]: Start difference. First operand 212 states and 338 transitions. Second operand 3 states. [2019-11-06 21:20:06,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:06,272 INFO L93 Difference]: Finished difference Result 380 states and 616 transitions. [2019-11-06 21:20:06,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:06,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-06 21:20:06,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:06,275 INFO L225 Difference]: With dead ends: 380 [2019-11-06 21:20:06,276 INFO L226 Difference]: Without dead ends: 378 [2019-11-06 21:20:06,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:06,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-11-06 21:20:06,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 296. [2019-11-06 21:20:06,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-11-06 21:20:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 462 transitions. [2019-11-06 21:20:06,291 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 462 transitions. Word has length 21 [2019-11-06 21:20:06,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:06,292 INFO L462 AbstractCegarLoop]: Abstraction has 296 states and 462 transitions. [2019-11-06 21:20:06,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:06,292 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 462 transitions. [2019-11-06 21:20:06,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 21:20:06,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:06,294 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:06,294 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:06,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:06,294 INFO L82 PathProgramCache]: Analyzing trace with hash 792324392, now seen corresponding path program 1 times [2019-11-06 21:20:06,295 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:06,295 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905911733] [2019-11-06 21:20:06,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:06,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:06,321 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905911733] [2019-11-06 21:20:06,321 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:06,322 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:06,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449740613] [2019-11-06 21:20:06,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:06,323 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:06,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:06,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:06,323 INFO L87 Difference]: Start difference. First operand 296 states and 462 transitions. Second operand 3 states. [2019-11-06 21:20:06,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:06,347 INFO L93 Difference]: Finished difference Result 684 states and 1072 transitions. [2019-11-06 21:20:06,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:06,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-06 21:20:06,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:06,350 INFO L225 Difference]: With dead ends: 684 [2019-11-06 21:20:06,351 INFO L226 Difference]: Without dead ends: 402 [2019-11-06 21:20:06,352 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:06,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-11-06 21:20:06,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2019-11-06 21:20:06,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-11-06 21:20:06,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 614 transitions. [2019-11-06 21:20:06,369 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 614 transitions. Word has length 21 [2019-11-06 21:20:06,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:06,369 INFO L462 AbstractCegarLoop]: Abstraction has 400 states and 614 transitions. [2019-11-06 21:20:06,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:06,369 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 614 transitions. [2019-11-06 21:20:06,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 21:20:06,370 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:06,371 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:06,371 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:06,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:06,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1465698011, now seen corresponding path program 1 times [2019-11-06 21:20:06,371 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:06,372 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221473444] [2019-11-06 21:20:06,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:06,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:06,409 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221473444] [2019-11-06 21:20:06,409 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:06,409 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:06,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864489721] [2019-11-06 21:20:06,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:06,410 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:06,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:06,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:06,411 INFO L87 Difference]: Start difference. First operand 400 states and 614 transitions. Second operand 3 states. [2019-11-06 21:20:06,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:06,436 INFO L93 Difference]: Finished difference Result 600 states and 916 transitions. [2019-11-06 21:20:06,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:06,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-06 21:20:06,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:06,439 INFO L225 Difference]: With dead ends: 600 [2019-11-06 21:20:06,439 INFO L226 Difference]: Without dead ends: 410 [2019-11-06 21:20:06,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:06,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-11-06 21:20:06,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2019-11-06 21:20:06,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-11-06 21:20:06,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 614 transitions. [2019-11-06 21:20:06,457 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 614 transitions. Word has length 22 [2019-11-06 21:20:06,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:06,458 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 614 transitions. [2019-11-06 21:20:06,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:06,458 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 614 transitions. [2019-11-06 21:20:06,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 21:20:06,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:06,460 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:06,460 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:06,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:06,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1207532573, now seen corresponding path program 1 times [2019-11-06 21:20:06,461 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:06,461 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466391624] [2019-11-06 21:20:06,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:06,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:06,491 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466391624] [2019-11-06 21:20:06,491 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:06,492 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:06,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247305281] [2019-11-06 21:20:06,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:06,493 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:06,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:06,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:06,495 INFO L87 Difference]: Start difference. First operand 408 states and 614 transitions. Second operand 3 states. [2019-11-06 21:20:06,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:06,519 INFO L93 Difference]: Finished difference Result 716 states and 1096 transitions. [2019-11-06 21:20:06,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:06,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-06 21:20:06,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:06,525 INFO L225 Difference]: With dead ends: 716 [2019-11-06 21:20:06,525 INFO L226 Difference]: Without dead ends: 714 [2019-11-06 21:20:06,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:06,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-11-06 21:20:06,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 584. [2019-11-06 21:20:06,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-11-06 21:20:06,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 854 transitions. [2019-11-06 21:20:06,547 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 854 transitions. Word has length 22 [2019-11-06 21:20:06,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:06,548 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 854 transitions. [2019-11-06 21:20:06,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:06,548 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 854 transitions. [2019-11-06 21:20:06,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 21:20:06,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:06,552 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:06,552 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:06,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:06,552 INFO L82 PathProgramCache]: Analyzing trace with hash -506467995, now seen corresponding path program 1 times [2019-11-06 21:20:06,553 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:06,553 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894037762] [2019-11-06 21:20:06,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:06,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:06,580 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894037762] [2019-11-06 21:20:06,581 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:06,581 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:06,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162261747] [2019-11-06 21:20:06,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:06,582 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:06,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:06,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:06,582 INFO L87 Difference]: Start difference. First operand 584 states and 854 transitions. Second operand 3 states. [2019-11-06 21:20:06,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:06,615 INFO L93 Difference]: Finished difference Result 1340 states and 1960 transitions. [2019-11-06 21:20:06,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:06,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-06 21:20:06,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:06,620 INFO L225 Difference]: With dead ends: 1340 [2019-11-06 21:20:06,620 INFO L226 Difference]: Without dead ends: 778 [2019-11-06 21:20:06,622 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:06,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-11-06 21:20:06,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 776. [2019-11-06 21:20:06,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-11-06 21:20:06,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1110 transitions. [2019-11-06 21:20:06,650 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1110 transitions. Word has length 22 [2019-11-06 21:20:06,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:06,650 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1110 transitions. [2019-11-06 21:20:06,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:06,650 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1110 transitions. [2019-11-06 21:20:06,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-06 21:20:06,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:06,652 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:06,652 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:06,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:06,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1221411293, now seen corresponding path program 1 times [2019-11-06 21:20:06,653 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:06,653 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888722666] [2019-11-06 21:20:06,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:06,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:06,684 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888722666] [2019-11-06 21:20:06,684 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:06,684 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:06,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095540477] [2019-11-06 21:20:06,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:06,685 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:06,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:06,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:06,686 INFO L87 Difference]: Start difference. First operand 776 states and 1110 transitions. Second operand 3 states. [2019-11-06 21:20:06,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:06,714 INFO L93 Difference]: Finished difference Result 1164 states and 1656 transitions. [2019-11-06 21:20:06,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:06,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-06 21:20:06,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:06,719 INFO L225 Difference]: With dead ends: 1164 [2019-11-06 21:20:06,719 INFO L226 Difference]: Without dead ends: 794 [2019-11-06 21:20:06,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:06,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-11-06 21:20:06,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 792. [2019-11-06 21:20:06,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-11-06 21:20:06,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1110 transitions. [2019-11-06 21:20:06,751 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1110 transitions. Word has length 23 [2019-11-06 21:20:06,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:06,751 INFO L462 AbstractCegarLoop]: Abstraction has 792 states and 1110 transitions. [2019-11-06 21:20:06,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:06,752 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1110 transitions. [2019-11-06 21:20:06,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-06 21:20:06,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:06,754 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:06,754 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:06,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:06,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1479576731, now seen corresponding path program 1 times [2019-11-06 21:20:06,755 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:06,755 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455233715] [2019-11-06 21:20:06,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:06,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:06,787 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455233715] [2019-11-06 21:20:06,788 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:06,788 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:06,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993506872] [2019-11-06 21:20:06,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:06,791 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:06,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:06,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:06,791 INFO L87 Difference]: Start difference. First operand 792 states and 1110 transitions. Second operand 3 states. [2019-11-06 21:20:06,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:06,828 INFO L93 Difference]: Finished difference Result 1356 states and 1928 transitions. [2019-11-06 21:20:06,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:06,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-06 21:20:06,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:06,835 INFO L225 Difference]: With dead ends: 1356 [2019-11-06 21:20:06,836 INFO L226 Difference]: Without dead ends: 1354 [2019-11-06 21:20:06,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:06,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-11-06 21:20:06,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1160. [2019-11-06 21:20:06,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2019-11-06 21:20:06,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1574 transitions. [2019-11-06 21:20:06,883 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1574 transitions. Word has length 23 [2019-11-06 21:20:06,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:06,884 INFO L462 AbstractCegarLoop]: Abstraction has 1160 states and 1574 transitions. [2019-11-06 21:20:06,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:06,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1574 transitions. [2019-11-06 21:20:06,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-06 21:20:06,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:06,887 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:06,887 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:06,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:06,887 INFO L82 PathProgramCache]: Analyzing trace with hash -2114325987, now seen corresponding path program 1 times [2019-11-06 21:20:06,888 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:06,888 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078856644] [2019-11-06 21:20:06,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:06,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:06,920 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078856644] [2019-11-06 21:20:06,920 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:06,920 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:06,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742220215] [2019-11-06 21:20:06,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:06,921 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:06,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:06,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:06,922 INFO L87 Difference]: Start difference. First operand 1160 states and 1574 transitions. Second operand 3 states. [2019-11-06 21:20:06,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:06,965 INFO L93 Difference]: Finished difference Result 2636 states and 3560 transitions. [2019-11-06 21:20:06,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:06,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-06 21:20:06,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:06,972 INFO L225 Difference]: With dead ends: 2636 [2019-11-06 21:20:06,973 INFO L226 Difference]: Without dead ends: 1514 [2019-11-06 21:20:06,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:06,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2019-11-06 21:20:07,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1512. [2019-11-06 21:20:07,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2019-11-06 21:20:07,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1990 transitions. [2019-11-06 21:20:07,021 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1990 transitions. Word has length 23 [2019-11-06 21:20:07,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:07,021 INFO L462 AbstractCegarLoop]: Abstraction has 1512 states and 1990 transitions. [2019-11-06 21:20:07,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:07,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1990 transitions. [2019-11-06 21:20:07,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 21:20:07,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:07,024 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:07,024 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:07,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:07,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1377545862, now seen corresponding path program 1 times [2019-11-06 21:20:07,025 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:07,025 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245316134] [2019-11-06 21:20:07,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:07,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:07,044 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245316134] [2019-11-06 21:20:07,044 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:07,044 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:07,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228566457] [2019-11-06 21:20:07,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:07,045 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:07,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:07,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:07,045 INFO L87 Difference]: Start difference. First operand 1512 states and 1990 transitions. Second operand 3 states. [2019-11-06 21:20:07,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:07,082 INFO L93 Difference]: Finished difference Result 2268 states and 2968 transitions. [2019-11-06 21:20:07,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:07,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-06 21:20:07,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:07,090 INFO L225 Difference]: With dead ends: 2268 [2019-11-06 21:20:07,090 INFO L226 Difference]: Without dead ends: 1546 [2019-11-06 21:20:07,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:07,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2019-11-06 21:20:07,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1544. [2019-11-06 21:20:07,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-11-06 21:20:07,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1990 transitions. [2019-11-06 21:20:07,136 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1990 transitions. Word has length 24 [2019-11-06 21:20:07,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:07,137 INFO L462 AbstractCegarLoop]: Abstraction has 1544 states and 1990 transitions. [2019-11-06 21:20:07,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:07,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1990 transitions. [2019-11-06 21:20:07,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 21:20:07,139 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:07,139 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:07,140 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:07,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:07,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1119380424, now seen corresponding path program 1 times [2019-11-06 21:20:07,140 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:07,140 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734616412] [2019-11-06 21:20:07,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:07,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:07,172 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734616412] [2019-11-06 21:20:07,173 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:07,173 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:07,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128270984] [2019-11-06 21:20:07,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:07,174 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:07,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:07,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:07,176 INFO L87 Difference]: Start difference. First operand 1544 states and 1990 transitions. Second operand 3 states. [2019-11-06 21:20:07,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:07,244 INFO L93 Difference]: Finished difference Result 2572 states and 3336 transitions. [2019-11-06 21:20:07,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:07,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-06 21:20:07,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:07,260 INFO L225 Difference]: With dead ends: 2572 [2019-11-06 21:20:07,260 INFO L226 Difference]: Without dead ends: 2570 [2019-11-06 21:20:07,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:07,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2019-11-06 21:20:07,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2312. [2019-11-06 21:20:07,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-11-06 21:20:07,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2886 transitions. [2019-11-06 21:20:07,352 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2886 transitions. Word has length 24 [2019-11-06 21:20:07,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:07,354 INFO L462 AbstractCegarLoop]: Abstraction has 2312 states and 2886 transitions. [2019-11-06 21:20:07,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:07,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2886 transitions. [2019-11-06 21:20:07,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 21:20:07,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:07,360 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:20:07,360 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:07,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:07,361 INFO L82 PathProgramCache]: Analyzing trace with hash -418315846, now seen corresponding path program 1 times [2019-11-06 21:20:07,361 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:07,362 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462736813] [2019-11-06 21:20:07,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:07,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:07,389 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462736813] [2019-11-06 21:20:07,390 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:07,390 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:07,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641274688] [2019-11-06 21:20:07,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:07,391 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:07,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:07,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:07,392 INFO L87 Difference]: Start difference. First operand 2312 states and 2886 transitions. Second operand 3 states. [2019-11-06 21:20:07,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:07,476 INFO L93 Difference]: Finished difference Result 5196 states and 6408 transitions. [2019-11-06 21:20:07,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:07,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-06 21:20:07,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:07,488 INFO L225 Difference]: With dead ends: 5196 [2019-11-06 21:20:07,488 INFO L226 Difference]: Without dead ends: 2954 [2019-11-06 21:20:07,492 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:07,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2019-11-06 21:20:07,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2952. [2019-11-06 21:20:07,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2019-11-06 21:20:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 3526 transitions. [2019-11-06 21:20:07,596 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 3526 transitions. Word has length 24 [2019-11-06 21:20:07,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:07,596 INFO L462 AbstractCegarLoop]: Abstraction has 2952 states and 3526 transitions. [2019-11-06 21:20:07,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 3526 transitions. [2019-11-06 21:20:07,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 21:20:07,600 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:07,601 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-06 21:20:07,601 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:07,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:07,601 INFO L82 PathProgramCache]: Analyzing trace with hash -340838702, now seen corresponding path program 1 times [2019-11-06 21:20:07,601 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:07,602 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224006146] [2019-11-06 21:20:07,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:07,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:07,627 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224006146] [2019-11-06 21:20:07,627 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:07,627 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:07,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031560001] [2019-11-06 21:20:07,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:07,628 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:07,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:07,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:07,628 INFO L87 Difference]: Start difference. First operand 2952 states and 3526 transitions. Second operand 3 states. [2019-11-06 21:20:07,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:07,688 INFO L93 Difference]: Finished difference Result 4428 states and 5256 transitions. [2019-11-06 21:20:07,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:07,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-06 21:20:07,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:07,701 INFO L225 Difference]: With dead ends: 4428 [2019-11-06 21:20:07,702 INFO L226 Difference]: Without dead ends: 3018 [2019-11-06 21:20:07,705 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:07,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2019-11-06 21:20:07,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3016. [2019-11-06 21:20:07,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2019-11-06 21:20:07,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3526 transitions. [2019-11-06 21:20:07,789 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3526 transitions. Word has length 25 [2019-11-06 21:20:07,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:07,789 INFO L462 AbstractCegarLoop]: Abstraction has 3016 states and 3526 transitions. [2019-11-06 21:20:07,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:07,789 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3526 transitions. [2019-11-06 21:20:07,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 21:20:07,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:07,794 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-06 21:20:07,794 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:07,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:07,795 INFO L82 PathProgramCache]: Analyzing trace with hash -82673264, now seen corresponding path program 1 times [2019-11-06 21:20:07,795 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:07,795 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866725702] [2019-11-06 21:20:07,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:07,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:07,824 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866725702] [2019-11-06 21:20:07,824 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:07,824 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:07,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802649804] [2019-11-06 21:20:07,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:07,825 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:07,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:07,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:07,826 INFO L87 Difference]: Start difference. First operand 3016 states and 3526 transitions. Second operand 3 states. [2019-11-06 21:20:07,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:07,918 INFO L93 Difference]: Finished difference Result 8650 states and 9799 transitions. [2019-11-06 21:20:07,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:07,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-06 21:20:07,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:07,967 INFO L225 Difference]: With dead ends: 8650 [2019-11-06 21:20:07,967 INFO L226 Difference]: Without dead ends: 3016 [2019-11-06 21:20:07,978 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:07,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2019-11-06 21:20:08,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 3016. [2019-11-06 21:20:08,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2019-11-06 21:20:08,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3270 transitions. [2019-11-06 21:20:08,062 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3270 transitions. Word has length 25 [2019-11-06 21:20:08,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:08,062 INFO L462 AbstractCegarLoop]: Abstraction has 3016 states and 3270 transitions. [2019-11-06 21:20:08,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:08,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2019-11-06 21:20:08,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 21:20:08,067 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:20:08,067 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-06 21:20:08,067 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:20:08,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:20:08,067 INFO L82 PathProgramCache]: Analyzing trace with hash -783737842, now seen corresponding path program 1 times [2019-11-06 21:20:08,068 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:20:08,068 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964747809] [2019-11-06 21:20:08,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:20:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:20:08,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:20:08,091 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964747809] [2019-11-06 21:20:08,091 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:20:08,091 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:20:08,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567503725] [2019-11-06 21:20:08,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:20:08,092 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:20:08,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:20:08,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:08,092 INFO L87 Difference]: Start difference. First operand 3016 states and 3270 transitions. Second operand 3 states. [2019-11-06 21:20:08,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:08,138 INFO L93 Difference]: Finished difference Result 3016 states and 3270 transitions. [2019-11-06 21:20:08,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:08,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-06 21:20:08,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:08,139 INFO L225 Difference]: With dead ends: 3016 [2019-11-06 21:20:08,139 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 21:20:08,145 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:20:08,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 21:20:08,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 21:20:08,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 21:20:08,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 21:20:08,146 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-11-06 21:20:08,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:08,147 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 21:20:08,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:08,147 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 21:20:08,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 21:20:08,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 21:20:08,174 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-11-06 21:20:08,174 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:20:08,174 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:20:08,174 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-06 21:20:08,174 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-06 21:20:08,174 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-06 21:20:08,175 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-11-06 21:20:08,175 INFO L439 ceAbstractionStarter]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2019-11-06 21:20:08,175 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2019-11-06 21:20:08,175 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 135) no Hoare annotation was computed. [2019-11-06 21:20:08,175 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2019-11-06 21:20:08,175 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-11-06 21:20:08,175 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2019-11-06 21:20:08,176 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2019-11-06 21:20:08,176 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 135) no Hoare annotation was computed. [2019-11-06 21:20:08,176 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-11-06 21:20:08,176 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2019-11-06 21:20:08,176 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2019-11-06 21:20:08,176 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-06 21:20:08,177 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2019-11-06 21:20:08,177 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2019-11-06 21:20:08,177 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2019-11-06 21:20:08,178 INFO L443 ceAbstractionStarter]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2019-11-06 21:20:08,178 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2019-11-06 21:20:08,178 INFO L443 ceAbstractionStarter]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2019-11-06 21:20:08,178 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-06 21:20:08,178 INFO L446 ceAbstractionStarter]: At program point L131(lines 5 135) the Hoare annotation is: true [2019-11-06 21:20:08,178 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2019-11-06 21:20:08,178 INFO L443 ceAbstractionStarter]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2019-11-06 21:20:08,178 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-06 21:20:08,178 INFO L443 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2019-11-06 21:20:08,179 INFO L443 ceAbstractionStarter]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2019-11-06 21:20:08,179 INFO L446 ceAbstractionStarter]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2019-11-06 21:20:08,179 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2019-11-06 21:20:08,179 INFO L443 ceAbstractionStarter]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2019-11-06 21:20:08,179 INFO L443 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2019-11-06 21:20:08,179 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2019-11-06 21:20:08,179 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2019-11-06 21:20:08,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:20:08 BoogieIcfgContainer [2019-11-06 21:20:08,188 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-06 21:20:08,191 INFO L168 Benchmark]: Toolchain (without parser) took 4193.41 ms. Allocated memory was 138.4 MB in the beginning and 291.0 MB in the end (delta: 152.6 MB). Free memory was 102.6 MB in the beginning and 195.4 MB in the end (delta: -92.7 MB). Peak memory consumption was 59.8 MB. Max. memory is 7.1 GB. [2019-11-06 21:20:08,191 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 138.4 MB. Free memory is still 120.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-06 21:20:08,192 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.97 ms. Allocated memory is still 138.4 MB. Free memory was 102.2 MB in the beginning and 91.7 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-11-06 21:20:08,193 INFO L168 Benchmark]: Boogie Preprocessor took 128.63 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 91.7 MB in the beginning and 180.1 MB in the end (delta: -88.4 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2019-11-06 21:20:08,193 INFO L168 Benchmark]: RCFGBuilder took 396.47 ms. Allocated memory is still 202.4 MB. Free memory was 180.1 MB in the beginning and 163.0 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 7.1 GB. [2019-11-06 21:20:08,196 INFO L168 Benchmark]: TraceAbstraction took 3396.91 ms. Allocated memory was 202.4 MB in the beginning and 291.0 MB in the end (delta: 88.6 MB). Free memory was 163.0 MB in the beginning and 195.4 MB in the end (delta: -32.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 7.1 GB. [2019-11-06 21:20:08,203 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48 ms. Allocated memory is still 138.4 MB. Free memory is still 120.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 266.97 ms. Allocated memory is still 138.4 MB. Free memory was 102.2 MB in the beginning and 91.7 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 128.63 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 91.7 MB in the beginning and 180.1 MB in the end (delta: -88.4 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 396.47 ms. Allocated memory is still 202.4 MB. Free memory was 180.1 MB in the beginning and 163.0 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3396.91 ms. Allocated memory was 202.4 MB in the beginning and 291.0 MB in the end (delta: 88.6 MB). Free memory was 163.0 MB in the beginning and 195.4 MB in the end (delta: -32.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 1 error locations. Result: SAFE, OverallTime: 3.3s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1573 SDtfs, 755 SDslu, 1056 SDs, 0 SdLazy, 121 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3016occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 790 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 266 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 19027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...