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/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:50:22,621 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:50:22,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:50:22,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:50:22,643 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:50:22,645 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:50:22,647 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:50:22,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:50:22,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:50:22,665 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:50:22,667 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:50:22,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:50:22,670 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:50:22,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:50:22,674 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:50:22,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:50:22,677 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:50:22,679 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:50:22,681 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:50:22,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:50:22,690 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:50:22,691 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:50:22,692 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:50:22,693 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:50:22,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:50:22,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:50:22,696 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:50:22,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:50:22,699 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:50:22,700 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:50:22,701 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:50:22,703 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:50:22,703 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:50:22,704 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:50:22,706 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:50:22,706 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:50:22,707 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:50:22,707 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:50:22,707 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:50:22,710 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:50:22,710 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:50:22,712 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-09-08 11:50:22,740 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:50:22,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:50:22,747 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:50:22,748 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:50:22,748 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:50:22,748 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:50:22,748 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:50:22,749 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:50:22,749 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:50:22,749 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:50:22,749 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:50:22,749 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:50:22,750 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:50:22,750 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:50:22,750 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:50:22,751 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:50:22,752 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:50:22,752 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:50:22,752 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:50:22,752 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:50:22,752 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:50:22,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:50:22,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:50:22,754 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:50:22,754 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:50:22,754 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:50:22,754 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:50:22,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:50:22,755 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:50:22,789 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:50:22,807 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:50:22,810 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:50:22,814 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:50:22,814 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:50:22,815 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 11:50:22,875 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e5031c4b/aada330ee46c41899502b1c7ed193868/FLAG0fdb94264 [2019-09-08 11:50:23,486 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:50:23,486 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 11:50:23,514 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e5031c4b/aada330ee46c41899502b1c7ed193868/FLAG0fdb94264 [2019-09-08 11:50:23,728 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e5031c4b/aada330ee46c41899502b1c7ed193868 [2019-09-08 11:50:23,739 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:50:23,740 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:50:23,741 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:50:23,741 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:50:23,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:50:23,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:50:23" (1/1) ... [2019-09-08 11:50:23,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309d6d0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:50:23, skipping insertion in model container [2019-09-08 11:50:23,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:50:23" (1/1) ... [2019-09-08 11:50:23,757 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:50:23,836 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:50:24,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:50:24,469 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:50:24,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:50:24,874 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:50:24,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:50:24 WrapperNode [2019-09-08 11:50:24,875 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:50:24,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:50:24,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:50:24,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:50:24,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:50:24" (1/1) ... [2019-09-08 11:50:24,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:50:24" (1/1) ... [2019-09-08 11:50:24,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:50:24" (1/1) ... [2019-09-08 11:50:24,916 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:50:24" (1/1) ... [2019-09-08 11:50:24,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:50:24" (1/1) ... [2019-09-08 11:50:24,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:50:24" (1/1) ... [2019-09-08 11:50:24,991 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:50:24" (1/1) ... [2019-09-08 11:50:25,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:50:25,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:50:25,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:50:25,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:50:25,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:50:24" (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-09-08 11:50:25,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:50:25,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:50:25,080 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:50:25,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:50:25,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:50:25,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:50:25,082 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:50:25,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:50:25,082 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:50:25,082 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:50:25,082 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:50:25,083 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:50:25,083 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:50:25,083 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:50:25,084 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:50:25,085 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:50:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:50:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:50:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:50:26,645 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:50:26,646 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:50:26,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:50:26 BoogieIcfgContainer [2019-09-08 11:50:26,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:50:26,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:50:26,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:50:26,652 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:50:26,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:50:23" (1/3) ... [2019-09-08 11:50:26,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6027a553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:50:26, skipping insertion in model container [2019-09-08 11:50:26,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:50:24" (2/3) ... [2019-09-08 11:50:26,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6027a553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:50:26, skipping insertion in model container [2019-09-08 11:50:26,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:50:26" (3/3) ... [2019-09-08 11:50:26,659 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2019-09-08 11:50:26,669 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:50:26,695 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-09-08 11:50:26,716 INFO L252 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2019-09-08 11:50:26,760 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:50:26,761 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:50:26,761 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:50:26,762 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:50:26,762 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:50:26,762 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:50:26,762 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:50:26,762 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:50:26,762 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:50:26,805 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states. [2019-09-08 11:50:26,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 11:50:26,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:26,837 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:26,839 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:26,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:26,845 INFO L82 PathProgramCache]: Analyzing trace with hash -2051434743, now seen corresponding path program 1 times [2019-09-08 11:50:26,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:26,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:26,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:26,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:26,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:27,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:50:27,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:27,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:50:27,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:50:27,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:50:27,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:50:27,422 INFO L87 Difference]: Start difference. First operand 363 states. Second operand 5 states. [2019-09-08 11:50:27,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:27,864 INFO L93 Difference]: Finished difference Result 578 states and 982 transitions. [2019-09-08 11:50:27,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:50:27,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-08 11:50:27,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:27,894 INFO L225 Difference]: With dead ends: 578 [2019-09-08 11:50:27,894 INFO L226 Difference]: Without dead ends: 298 [2019-09-08 11:50:27,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:50:27,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-08 11:50:27,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2019-09-08 11:50:27,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-08 11:50:27,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 371 transitions. [2019-09-08 11:50:28,000 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 371 transitions. Word has length 63 [2019-09-08 11:50:28,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:28,001 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 371 transitions. [2019-09-08 11:50:28,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:50:28,001 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 371 transitions. [2019-09-08 11:50:28,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 11:50:28,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:28,004 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:28,005 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:28,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:28,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1195165915, now seen corresponding path program 1 times [2019-09-08 11:50:28,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:28,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:28,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:28,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:28,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:28,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:50:28,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:28,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:50:28,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:50:28,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:50:28,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:50:28,259 INFO L87 Difference]: Start difference. First operand 298 states and 371 transitions. Second operand 5 states. [2019-09-08 11:50:28,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:28,515 INFO L93 Difference]: Finished difference Result 501 states and 640 transitions. [2019-09-08 11:50:28,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:50:28,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-08 11:50:28,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:28,518 INFO L225 Difference]: With dead ends: 501 [2019-09-08 11:50:28,518 INFO L226 Difference]: Without dead ends: 272 [2019-09-08 11:50:28,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:50:28,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-08 11:50:28,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2019-09-08 11:50:28,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-08 11:50:28,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 340 transitions. [2019-09-08 11:50:28,536 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 340 transitions. Word has length 64 [2019-09-08 11:50:28,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:28,537 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 340 transitions. [2019-09-08 11:50:28,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:50:28,537 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 340 transitions. [2019-09-08 11:50:28,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 11:50:28,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:28,540 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:28,540 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:28,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:28,541 INFO L82 PathProgramCache]: Analyzing trace with hash -477481019, now seen corresponding path program 1 times [2019-09-08 11:50:28,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:28,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:28,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:28,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:28,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:28,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:50:28,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:28,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:50:28,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:50:28,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:50:28,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:50:28,730 INFO L87 Difference]: Start difference. First operand 272 states and 340 transitions. Second operand 6 states. [2019-09-08 11:50:29,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:29,098 INFO L93 Difference]: Finished difference Result 580 states and 734 transitions. [2019-09-08 11:50:29,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:50:29,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-09-08 11:50:29,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:29,104 INFO L225 Difference]: With dead ends: 580 [2019-09-08 11:50:29,104 INFO L226 Difference]: Without dead ends: 367 [2019-09-08 11:50:29,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:50:29,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-09-08 11:50:29,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 327. [2019-09-08 11:50:29,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-09-08 11:50:29,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 420 transitions. [2019-09-08 11:50:29,127 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 420 transitions. Word has length 65 [2019-09-08 11:50:29,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:29,128 INFO L475 AbstractCegarLoop]: Abstraction has 327 states and 420 transitions. [2019-09-08 11:50:29,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:50:29,128 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 420 transitions. [2019-09-08 11:50:29,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 11:50:29,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:29,131 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:29,131 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:29,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:29,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1802107193, now seen corresponding path program 1 times [2019-09-08 11:50:29,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:29,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:29,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:29,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:29,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:29,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:50:29,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:29,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:50:29,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:50:29,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:50:29,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:50:29,280 INFO L87 Difference]: Start difference. First operand 327 states and 420 transitions. Second operand 5 states. [2019-09-08 11:50:29,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:29,503 INFO L93 Difference]: Finished difference Result 595 states and 780 transitions. [2019-09-08 11:50:29,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:50:29,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-09-08 11:50:29,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:29,506 INFO L225 Difference]: With dead ends: 595 [2019-09-08 11:50:29,507 INFO L226 Difference]: Without dead ends: 316 [2019-09-08 11:50:29,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:50:29,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-09-08 11:50:29,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2019-09-08 11:50:29,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-08 11:50:29,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 406 transitions. [2019-09-08 11:50:29,526 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 406 transitions. Word has length 66 [2019-09-08 11:50:29,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:29,527 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 406 transitions. [2019-09-08 11:50:29,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:50:29,527 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 406 transitions. [2019-09-08 11:50:29,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 11:50:29,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:29,529 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:29,529 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:29,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:29,530 INFO L82 PathProgramCache]: Analyzing trace with hash -350473883, now seen corresponding path program 1 times [2019-09-08 11:50:29,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:29,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:29,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:29,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:29,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:29,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:50:29,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:29,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 11:50:29,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 11:50:29,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 11:50:29,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:50:29,792 INFO L87 Difference]: Start difference. First operand 316 states and 406 transitions. Second operand 8 states. [2019-09-08 11:50:30,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:30,278 INFO L93 Difference]: Finished difference Result 702 states and 929 transitions. [2019-09-08 11:50:30,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:50:30,279 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-09-08 11:50:30,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:30,282 INFO L225 Difference]: With dead ends: 702 [2019-09-08 11:50:30,282 INFO L226 Difference]: Without dead ends: 511 [2019-09-08 11:50:30,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:50:30,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-08 11:50:30,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 316. [2019-09-08 11:50:30,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-08 11:50:30,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 405 transitions. [2019-09-08 11:50:30,306 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 405 transitions. Word has length 67 [2019-09-08 11:50:30,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:30,306 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 405 transitions. [2019-09-08 11:50:30,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 11:50:30,307 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 405 transitions. [2019-09-08 11:50:30,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 11:50:30,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:30,308 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:30,308 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:30,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:30,309 INFO L82 PathProgramCache]: Analyzing trace with hash 282133846, now seen corresponding path program 1 times [2019-09-08 11:50:30,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:30,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:30,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:30,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:30,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:30,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:50:30,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:30,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:50:30,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:50:30,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:50:30,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:50:30,489 INFO L87 Difference]: Start difference. First operand 316 states and 405 transitions. Second operand 9 states. [2019-09-08 11:50:31,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:31,626 INFO L93 Difference]: Finished difference Result 869 states and 1187 transitions. [2019-09-08 11:50:31,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:50:31,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-08 11:50:31,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:31,634 INFO L225 Difference]: With dead ends: 869 [2019-09-08 11:50:31,635 INFO L226 Difference]: Without dead ends: 726 [2019-09-08 11:50:31,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:50:31,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2019-09-08 11:50:31,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 316. [2019-09-08 11:50:31,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-08 11:50:31,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 404 transitions. [2019-09-08 11:50:31,670 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 404 transitions. Word has length 67 [2019-09-08 11:50:31,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:31,671 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 404 transitions. [2019-09-08 11:50:31,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:50:31,671 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 404 transitions. [2019-09-08 11:50:31,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 11:50:31,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:31,674 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:31,674 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:31,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:31,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1203066546, now seen corresponding path program 1 times [2019-09-08 11:50:31,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:31,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:31,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:31,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:31,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:31,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:50:31,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:31,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:50:31,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:50:31,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:50:31,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:50:31,882 INFO L87 Difference]: Start difference. First operand 316 states and 404 transitions. Second operand 9 states. [2019-09-08 11:50:32,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:32,948 INFO L93 Difference]: Finished difference Result 843 states and 1153 transitions. [2019-09-08 11:50:32,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:50:32,948 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-08 11:50:32,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:32,952 INFO L225 Difference]: With dead ends: 843 [2019-09-08 11:50:32,952 INFO L226 Difference]: Without dead ends: 726 [2019-09-08 11:50:32,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:50:32,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2019-09-08 11:50:32,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 316. [2019-09-08 11:50:32,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-08 11:50:32,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 403 transitions. [2019-09-08 11:50:32,978 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 403 transitions. Word has length 67 [2019-09-08 11:50:32,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:32,979 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 403 transitions. [2019-09-08 11:50:32,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:50:32,979 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 403 transitions. [2019-09-08 11:50:32,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 11:50:32,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:32,980 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:32,981 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:32,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:32,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1166947524, now seen corresponding path program 1 times [2019-09-08 11:50:32,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:32,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:32,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:32,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:32,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:33,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:50:33,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:33,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:50:33,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:50:33,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:50:33,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:50:33,122 INFO L87 Difference]: Start difference. First operand 316 states and 403 transitions. Second operand 9 states. [2019-09-08 11:50:34,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:34,308 INFO L93 Difference]: Finished difference Result 878 states and 1192 transitions. [2019-09-08 11:50:34,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:50:34,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-08 11:50:34,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:34,312 INFO L225 Difference]: With dead ends: 878 [2019-09-08 11:50:34,312 INFO L226 Difference]: Without dead ends: 726 [2019-09-08 11:50:34,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:50:34,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2019-09-08 11:50:34,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 316. [2019-09-08 11:50:34,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-08 11:50:34,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 402 transitions. [2019-09-08 11:50:34,341 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 402 transitions. Word has length 69 [2019-09-08 11:50:34,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:34,342 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 402 transitions. [2019-09-08 11:50:34,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:50:34,342 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 402 transitions. [2019-09-08 11:50:34,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 11:50:34,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:34,343 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:34,344 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:34,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:34,344 INFO L82 PathProgramCache]: Analyzing trace with hash 77892723, now seen corresponding path program 1 times [2019-09-08 11:50:34,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:34,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:34,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:34,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:34,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:34,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:50:34,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:34,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:50:34,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:50:34,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:50:34,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:50:34,482 INFO L87 Difference]: Start difference. First operand 316 states and 402 transitions. Second operand 9 states. [2019-09-08 11:50:35,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:35,499 INFO L93 Difference]: Finished difference Result 719 states and 964 transitions. [2019-09-08 11:50:35,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:50:35,500 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-08 11:50:35,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:35,504 INFO L225 Difference]: With dead ends: 719 [2019-09-08 11:50:35,504 INFO L226 Difference]: Without dead ends: 714 [2019-09-08 11:50:35,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:50:35,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-09-08 11:50:35,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 316. [2019-09-08 11:50:35,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-08 11:50:35,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 401 transitions. [2019-09-08 11:50:35,533 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 401 transitions. Word has length 69 [2019-09-08 11:50:35,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:35,533 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 401 transitions. [2019-09-08 11:50:35,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:50:35,534 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 401 transitions. [2019-09-08 11:50:35,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 11:50:35,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:35,535 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:35,535 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:35,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:35,536 INFO L82 PathProgramCache]: Analyzing trace with hash -307155438, now seen corresponding path program 1 times [2019-09-08 11:50:35,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:35,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:35,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:35,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:35,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:35,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:50:35,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:35,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:50:35,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:50:35,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:50:35,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:50:35,706 INFO L87 Difference]: Start difference. First operand 316 states and 401 transitions. Second operand 9 states. [2019-09-08 11:50:36,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:36,840 INFO L93 Difference]: Finished difference Result 743 states and 998 transitions. [2019-09-08 11:50:36,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:50:36,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-08 11:50:36,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:36,844 INFO L225 Difference]: With dead ends: 743 [2019-09-08 11:50:36,844 INFO L226 Difference]: Without dead ends: 726 [2019-09-08 11:50:36,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:50:36,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2019-09-08 11:50:36,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 316. [2019-09-08 11:50:36,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-08 11:50:36,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 400 transitions. [2019-09-08 11:50:36,874 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 400 transitions. Word has length 69 [2019-09-08 11:50:36,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:36,875 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 400 transitions. [2019-09-08 11:50:36,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:50:36,875 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 400 transitions. [2019-09-08 11:50:36,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 11:50:36,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:36,876 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:36,877 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:36,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:36,877 INFO L82 PathProgramCache]: Analyzing trace with hash -2116702936, now seen corresponding path program 1 times [2019-09-08 11:50:36,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:36,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:36,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:36,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:36,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:37,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:50:37,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:37,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:50:37,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:50:37,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:50:37,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:50:37,017 INFO L87 Difference]: Start difference. First operand 316 states and 400 transitions. Second operand 9 states. [2019-09-08 11:50:38,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:38,140 INFO L93 Difference]: Finished difference Result 848 states and 1154 transitions. [2019-09-08 11:50:38,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:50:38,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-08 11:50:38,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:38,145 INFO L225 Difference]: With dead ends: 848 [2019-09-08 11:50:38,145 INFO L226 Difference]: Without dead ends: 726 [2019-09-08 11:50:38,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:50:38,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2019-09-08 11:50:38,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 316. [2019-09-08 11:50:38,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-08 11:50:38,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 399 transitions. [2019-09-08 11:50:38,180 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 399 transitions. Word has length 69 [2019-09-08 11:50:38,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:38,180 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 399 transitions. [2019-09-08 11:50:38,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:50:38,181 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 399 transitions. [2019-09-08 11:50:38,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 11:50:38,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:38,182 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:38,182 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:38,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:38,183 INFO L82 PathProgramCache]: Analyzing trace with hash 249107848, now seen corresponding path program 1 times [2019-09-08 11:50:38,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:38,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:38,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:38,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:38,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:38,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:50:38,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:38,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:50:38,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:50:38,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:50:38,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:50:38,352 INFO L87 Difference]: Start difference. First operand 316 states and 399 transitions. Second operand 9 states. [2019-09-08 11:50:39,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:39,206 INFO L93 Difference]: Finished difference Result 824 states and 1118 transitions. [2019-09-08 11:50:39,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:50:39,206 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-08 11:50:39,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:39,212 INFO L225 Difference]: With dead ends: 824 [2019-09-08 11:50:39,212 INFO L226 Difference]: Without dead ends: 714 [2019-09-08 11:50:39,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:50:39,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-09-08 11:50:39,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 316. [2019-09-08 11:50:39,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-08 11:50:39,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 398 transitions. [2019-09-08 11:50:39,246 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 398 transitions. Word has length 69 [2019-09-08 11:50:39,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:39,246 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 398 transitions. [2019-09-08 11:50:39,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:50:39,247 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 398 transitions. [2019-09-08 11:50:39,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 11:50:39,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:39,248 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:39,248 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:39,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:39,249 INFO L82 PathProgramCache]: Analyzing trace with hash -913030277, now seen corresponding path program 1 times [2019-09-08 11:50:39,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:39,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:39,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:39,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:39,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:39,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:50:39,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:39,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:50:39,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:50:39,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:50:39,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:50:39,443 INFO L87 Difference]: Start difference. First operand 316 states and 398 transitions. Second operand 9 states. [2019-09-08 11:50:40,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:40,521 INFO L93 Difference]: Finished difference Result 719 states and 960 transitions. [2019-09-08 11:50:40,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:50:40,521 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-08 11:50:40,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:40,526 INFO L225 Difference]: With dead ends: 719 [2019-09-08 11:50:40,526 INFO L226 Difference]: Without dead ends: 714 [2019-09-08 11:50:40,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:50:40,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-09-08 11:50:40,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 316. [2019-09-08 11:50:40,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-08 11:50:40,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 397 transitions. [2019-09-08 11:50:40,560 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 397 transitions. Word has length 69 [2019-09-08 11:50:40,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:40,560 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 397 transitions. [2019-09-08 11:50:40,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:50:40,560 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 397 transitions. [2019-09-08 11:50:40,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 11:50:40,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:40,561 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:40,562 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:40,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:40,562 INFO L82 PathProgramCache]: Analyzing trace with hash 360843612, now seen corresponding path program 1 times [2019-09-08 11:50:40,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:40,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:40,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:40,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:40,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:40,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:50:40,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:40,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:50:40,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:50:40,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:50:40,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:50:40,699 INFO L87 Difference]: Start difference. First operand 316 states and 397 transitions. Second operand 9 states. [2019-09-08 11:50:41,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:41,612 INFO L93 Difference]: Finished difference Result 821 states and 1112 transitions. [2019-09-08 11:50:41,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:50:41,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2019-09-08 11:50:41,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:41,619 INFO L225 Difference]: With dead ends: 821 [2019-09-08 11:50:41,619 INFO L226 Difference]: Without dead ends: 714 [2019-09-08 11:50:41,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:50:41,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-09-08 11:50:41,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 316. [2019-09-08 11:50:41,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-08 11:50:41,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 396 transitions. [2019-09-08 11:50:41,653 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 396 transitions. Word has length 69 [2019-09-08 11:50:41,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:41,654 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 396 transitions. [2019-09-08 11:50:41,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:50:41,654 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 396 transitions. [2019-09-08 11:50:41,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:50:41,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:41,655 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:41,655 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:41,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:41,656 INFO L82 PathProgramCache]: Analyzing trace with hash -2098110889, now seen corresponding path program 1 times [2019-09-08 11:50:41,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:41,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:41,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:41,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:41,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:42,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:50:42,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:42,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 11:50:42,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 11:50:42,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 11:50:42,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-09-08 11:50:42,433 INFO L87 Difference]: Start difference. First operand 316 states and 396 transitions. Second operand 16 states. [2019-09-08 11:50:43,117 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-08 11:50:44,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:44,719 INFO L93 Difference]: Finished difference Result 860 states and 1123 transitions. [2019-09-08 11:50:44,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 11:50:44,724 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 71 [2019-09-08 11:50:44,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:44,728 INFO L225 Difference]: With dead ends: 860 [2019-09-08 11:50:44,728 INFO L226 Difference]: Without dead ends: 754 [2019-09-08 11:50:44,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2019-09-08 11:50:44,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-09-08 11:50:44,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 330. [2019-09-08 11:50:44,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-08 11:50:44,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 415 transitions. [2019-09-08 11:50:44,773 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 415 transitions. Word has length 71 [2019-09-08 11:50:44,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:44,774 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 415 transitions. [2019-09-08 11:50:44,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 11:50:44,774 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 415 transitions. [2019-09-08 11:50:44,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:50:44,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:44,775 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:44,776 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:44,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:44,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1752408440, now seen corresponding path program 1 times [2019-09-08 11:50:44,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:44,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:44,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:44,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:44,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:45,855 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-08 11:50:46,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:50:46,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:46,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 11:50:46,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 11:50:46,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 11:50:46,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:50:46,330 INFO L87 Difference]: Start difference. First operand 330 states and 415 transitions. Second operand 21 states. [2019-09-08 11:50:46,468 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-08 11:50:47,057 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 11:50:47,212 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-08 11:50:47,416 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-08 11:50:47,669 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-08 11:50:48,009 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2019-09-08 11:50:48,202 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-08 11:50:48,380 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-08 11:50:48,548 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-08 11:50:48,823 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-09-08 11:50:49,069 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-08 11:50:49,262 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 11:50:49,521 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 11:50:51,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:51,255 INFO L93 Difference]: Finished difference Result 655 states and 823 transitions. [2019-09-08 11:50:51,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 11:50:51,255 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 71 [2019-09-08 11:50:51,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:51,259 INFO L225 Difference]: With dead ends: 655 [2019-09-08 11:50:51,259 INFO L226 Difference]: Without dead ends: 649 [2019-09-08 11:50:51,260 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=346, Invalid=1060, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 11:50:51,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-09-08 11:50:51,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 330. [2019-09-08 11:50:51,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-08 11:50:51,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 414 transitions. [2019-09-08 11:50:51,308 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 414 transitions. Word has length 71 [2019-09-08 11:50:51,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:51,309 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 414 transitions. [2019-09-08 11:50:51,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 11:50:51,309 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 414 transitions. [2019-09-08 11:50:51,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:50:51,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:51,310 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:51,311 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:51,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:51,311 INFO L82 PathProgramCache]: Analyzing trace with hash 841585007, now seen corresponding path program 1 times [2019-09-08 11:50:51,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:51,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:51,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:51,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:51,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:52,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:50:52,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:52,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 11:50:52,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 11:50:52,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 11:50:52,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 11:50:52,005 INFO L87 Difference]: Start difference. First operand 330 states and 414 transitions. Second operand 17 states. [2019-09-08 11:50:52,584 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 11:50:52,725 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-08 11:50:53,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:53,883 INFO L93 Difference]: Finished difference Result 666 states and 868 transitions. [2019-09-08 11:50:53,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 11:50:53,883 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 71 [2019-09-08 11:50:53,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:53,885 INFO L225 Difference]: With dead ends: 666 [2019-09-08 11:50:53,886 INFO L226 Difference]: Without dead ends: 528 [2019-09-08 11:50:53,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 11:50:53,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-09-08 11:50:53,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 305. [2019-09-08 11:50:53,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-09-08 11:50:53,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 382 transitions. [2019-09-08 11:50:53,945 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 382 transitions. Word has length 71 [2019-09-08 11:50:53,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:53,946 INFO L475 AbstractCegarLoop]: Abstraction has 305 states and 382 transitions. [2019-09-08 11:50:53,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 11:50:53,946 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 382 transitions. [2019-09-08 11:50:53,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:50:53,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:53,947 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:53,948 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:53,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:53,949 INFO L82 PathProgramCache]: Analyzing trace with hash 176129943, now seen corresponding path program 1 times [2019-09-08 11:50:53,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:53,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:53,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:53,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:53,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:55,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:50:55,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:55,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 11:50:55,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 11:50:55,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 11:50:55,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:50:55,227 INFO L87 Difference]: Start difference. First operand 305 states and 382 transitions. Second operand 21 states. [2019-09-08 11:50:56,120 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-09-08 11:50:56,317 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-09-08 11:50:56,592 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-08 11:50:56,776 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-08 11:50:56,958 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-08 11:50:57,163 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-08 11:50:57,950 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-08 11:50:58,527 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-08 11:50:59,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:50:59,345 INFO L93 Difference]: Finished difference Result 743 states and 958 transitions. [2019-09-08 11:50:59,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 11:50:59,346 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 71 [2019-09-08 11:50:59,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:50:59,349 INFO L225 Difference]: With dead ends: 743 [2019-09-08 11:50:59,349 INFO L226 Difference]: Without dead ends: 634 [2019-09-08 11:50:59,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=276, Invalid=914, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 11:50:59,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-09-08 11:50:59,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 320. [2019-09-08 11:50:59,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-09-08 11:50:59,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 403 transitions. [2019-09-08 11:50:59,407 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 403 transitions. Word has length 71 [2019-09-08 11:50:59,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:50:59,408 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 403 transitions. [2019-09-08 11:50:59,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 11:50:59,408 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 403 transitions. [2019-09-08 11:50:59,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:50:59,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:50:59,409 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:50:59,410 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:50:59,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:50:59,410 INFO L82 PathProgramCache]: Analyzing trace with hash -2101080436, now seen corresponding path program 1 times [2019-09-08 11:50:59,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:50:59,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:50:59,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:59,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:50:59,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:50:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:50:59,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:50:59,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:50:59,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 11:50:59,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 11:50:59,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 11:50:59,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-08 11:50:59,948 INFO L87 Difference]: Start difference. First operand 320 states and 403 transitions. Second operand 14 states. [2019-09-08 11:51:01,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:01,609 INFO L93 Difference]: Finished difference Result 751 states and 1000 transitions. [2019-09-08 11:51:01,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 11:51:01,610 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2019-09-08 11:51:01,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:01,613 INFO L225 Difference]: With dead ends: 751 [2019-09-08 11:51:01,613 INFO L226 Difference]: Without dead ends: 580 [2019-09-08 11:51:01,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2019-09-08 11:51:01,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-08 11:51:01,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 293. [2019-09-08 11:51:01,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-09-08 11:51:01,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 369 transitions. [2019-09-08 11:51:01,664 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 369 transitions. Word has length 71 [2019-09-08 11:51:01,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:01,664 INFO L475 AbstractCegarLoop]: Abstraction has 293 states and 369 transitions. [2019-09-08 11:51:01,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 11:51:01,664 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 369 transitions. [2019-09-08 11:51:01,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:51:01,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:01,665 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:51:01,665 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:01,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:01,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1738970789, now seen corresponding path program 1 times [2019-09-08 11:51:01,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:01,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:01,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:01,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:01,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:01,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:51:01,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:01,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 11:51:01,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:51:01,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:51:01,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:51:01,984 INFO L87 Difference]: Start difference. First operand 293 states and 369 transitions. Second operand 11 states. [2019-09-08 11:51:03,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:03,166 INFO L93 Difference]: Finished difference Result 1322 states and 1866 transitions. [2019-09-08 11:51:03,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:51:03,166 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2019-09-08 11:51:03,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:03,172 INFO L225 Difference]: With dead ends: 1322 [2019-09-08 11:51:03,172 INFO L226 Difference]: Without dead ends: 1197 [2019-09-08 11:51:03,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-09-08 11:51:03,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2019-09-08 11:51:03,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 262. [2019-09-08 11:51:03,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-08 11:51:03,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 329 transitions. [2019-09-08 11:51:03,250 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 329 transitions. Word has length 72 [2019-09-08 11:51:03,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:03,250 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 329 transitions. [2019-09-08 11:51:03,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:51:03,251 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 329 transitions. [2019-09-08 11:51:03,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:51:03,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:03,254 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:51:03,254 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:03,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:03,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1749461620, now seen corresponding path program 1 times [2019-09-08 11:51:03,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:03,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:03,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:03,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:03,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:03,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:51:03,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:03,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 11:51:03,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 11:51:03,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 11:51:03,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-08 11:51:03,752 INFO L87 Difference]: Start difference. First operand 262 states and 329 transitions. Second operand 13 states. [2019-09-08 11:51:05,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:05,548 INFO L93 Difference]: Finished difference Result 1309 states and 1849 transitions. [2019-09-08 11:51:05,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 11:51:05,550 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2019-09-08 11:51:05,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:05,556 INFO L225 Difference]: With dead ends: 1309 [2019-09-08 11:51:05,557 INFO L226 Difference]: Without dead ends: 1287 [2019-09-08 11:51:05,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2019-09-08 11:51:05,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2019-09-08 11:51:05,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 240. [2019-09-08 11:51:05,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-08 11:51:05,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 305 transitions. [2019-09-08 11:51:05,623 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 305 transitions. Word has length 72 [2019-09-08 11:51:05,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:05,623 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 305 transitions. [2019-09-08 11:51:05,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 11:51:05,624 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 305 transitions. [2019-09-08 11:51:05,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:51:05,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:05,625 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:51:05,625 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:05,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:05,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1380903087, now seen corresponding path program 1 times [2019-09-08 11:51:05,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:05,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:05,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:05,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:05,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:05,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:51:05,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:05,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:51:05,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:51:05,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:51:05,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:51:05,748 INFO L87 Difference]: Start difference. First operand 240 states and 305 transitions. Second operand 9 states. [2019-09-08 11:51:06,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:06,764 INFO L93 Difference]: Finished difference Result 725 states and 1000 transitions. [2019-09-08 11:51:06,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:51:06,764 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-08 11:51:06,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:06,767 INFO L225 Difference]: With dead ends: 725 [2019-09-08 11:51:06,767 INFO L226 Difference]: Without dead ends: 595 [2019-09-08 11:51:06,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:51:06,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-09-08 11:51:06,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 240. [2019-09-08 11:51:06,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-08 11:51:06,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 304 transitions. [2019-09-08 11:51:06,816 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 304 transitions. Word has length 72 [2019-09-08 11:51:06,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:06,817 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 304 transitions. [2019-09-08 11:51:06,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:51:06,817 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 304 transitions. [2019-09-08 11:51:06,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:51:06,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:06,818 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:51:06,819 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:06,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:06,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1779169883, now seen corresponding path program 1 times [2019-09-08 11:51:06,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:06,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:06,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:06,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:06,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:07,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:51:07,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:07,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 11:51:07,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:51:07,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:51:07,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:51:07,112 INFO L87 Difference]: Start difference. First operand 240 states and 304 transitions. Second operand 11 states. [2019-09-08 11:51:07,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:07,969 INFO L93 Difference]: Finished difference Result 1235 states and 1763 transitions. [2019-09-08 11:51:07,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 11:51:07,969 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2019-09-08 11:51:07,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:07,975 INFO L225 Difference]: With dead ends: 1235 [2019-09-08 11:51:07,975 INFO L226 Difference]: Without dead ends: 1115 [2019-09-08 11:51:07,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:51:07,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2019-09-08 11:51:08,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 225. [2019-09-08 11:51:08,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-08 11:51:08,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 285 transitions. [2019-09-08 11:51:08,046 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 285 transitions. Word has length 72 [2019-09-08 11:51:08,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:08,046 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 285 transitions. [2019-09-08 11:51:08,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:51:08,046 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 285 transitions. [2019-09-08 11:51:08,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:51:08,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:08,048 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:51:08,048 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:08,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:08,048 INFO L82 PathProgramCache]: Analyzing trace with hash 949044476, now seen corresponding path program 1 times [2019-09-08 11:51:08,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:08,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:08,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:08,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:08,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:08,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:51:08,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:08,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:51:08,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:51:08,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:51:08,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:51:08,441 INFO L87 Difference]: Start difference. First operand 225 states and 285 transitions. Second operand 12 states. [2019-09-08 11:51:08,837 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-09-08 11:51:09,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:09,465 INFO L93 Difference]: Finished difference Result 491 states and 655 transitions. [2019-09-08 11:51:09,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:51:09,466 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2019-09-08 11:51:09,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:09,468 INFO L225 Difference]: With dead ends: 491 [2019-09-08 11:51:09,468 INFO L226 Difference]: Without dead ends: 382 [2019-09-08 11:51:09,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:51:09,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-09-08 11:51:09,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 221. [2019-09-08 11:51:09,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-08 11:51:09,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 280 transitions. [2019-09-08 11:51:09,522 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 280 transitions. Word has length 72 [2019-09-08 11:51:09,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:09,523 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 280 transitions. [2019-09-08 11:51:09,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:51:09,523 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 280 transitions. [2019-09-08 11:51:09,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:51:09,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:09,524 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:51:09,524 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:09,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:09,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1698523617, now seen corresponding path program 1 times [2019-09-08 11:51:09,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:09,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:09,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:09,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:09,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:09,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:51:09,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:09,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:51:09,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:51:09,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:51:09,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:51:09,678 INFO L87 Difference]: Start difference. First operand 221 states and 280 transitions. Second operand 9 states. [2019-09-08 11:51:10,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:10,317 INFO L93 Difference]: Finished difference Result 377 states and 489 transitions. [2019-09-08 11:51:10,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 11:51:10,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-08 11:51:10,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:10,319 INFO L225 Difference]: With dead ends: 377 [2019-09-08 11:51:10,319 INFO L226 Difference]: Without dead ends: 370 [2019-09-08 11:51:10,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-09-08 11:51:10,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-09-08 11:51:10,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 221. [2019-09-08 11:51:10,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-08 11:51:10,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 279 transitions. [2019-09-08 11:51:10,362 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 279 transitions. Word has length 73 [2019-09-08 11:51:10,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:10,363 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 279 transitions. [2019-09-08 11:51:10,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:51:10,363 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 279 transitions. [2019-09-08 11:51:10,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 11:51:10,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:10,364 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:51:10,364 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:10,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:10,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1821871537, now seen corresponding path program 1 times [2019-09-08 11:51:10,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:10,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:10,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:10,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:10,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:11,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:51:11,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:11,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 11:51:11,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 11:51:11,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 11:51:11,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:51:11,484 INFO L87 Difference]: Start difference. First operand 221 states and 279 transitions. Second operand 21 states. [2019-09-08 11:51:11,642 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-09-08 11:51:12,094 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-08 11:51:12,225 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-09-08 11:51:12,411 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-08 11:51:12,579 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 11:51:12,782 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-08 11:51:12,967 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-08 11:51:13,145 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-08 11:51:13,385 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-08 11:51:13,944 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-08 11:51:14,348 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-08 11:51:15,975 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-08 11:51:16,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:16,614 INFO L93 Difference]: Finished difference Result 1300 states and 1827 transitions. [2019-09-08 11:51:16,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 11:51:16,615 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 74 [2019-09-08 11:51:16,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:16,619 INFO L225 Difference]: With dead ends: 1300 [2019-09-08 11:51:16,619 INFO L226 Difference]: Without dead ends: 1294 [2019-09-08 11:51:16,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=329, Invalid=1311, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 11:51:16,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2019-09-08 11:51:16,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 238. [2019-09-08 11:51:16,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-09-08 11:51:16,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 300 transitions. [2019-09-08 11:51:16,675 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 300 transitions. Word has length 74 [2019-09-08 11:51:16,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:16,675 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 300 transitions. [2019-09-08 11:51:16,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 11:51:16,675 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 300 transitions. [2019-09-08 11:51:16,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 11:51:16,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:16,676 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 11:51:16,676 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:16,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:16,676 INFO L82 PathProgramCache]: Analyzing trace with hash -242218485, now seen corresponding path program 1 times [2019-09-08 11:51:16,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:16,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:16,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:16,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:16,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:17,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:51:17,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:17,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 11:51:17,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 11:51:17,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 11:51:17,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-09-08 11:51:17,363 INFO L87 Difference]: Start difference. First operand 238 states and 300 transitions. Second operand 16 states. [2019-09-08 11:51:18,008 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-08 11:51:19,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:19,705 INFO L93 Difference]: Finished difference Result 1023 states and 1424 transitions. [2019-09-08 11:51:19,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 11:51:19,705 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2019-09-08 11:51:19,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:19,709 INFO L225 Difference]: With dead ends: 1023 [2019-09-08 11:51:19,709 INFO L226 Difference]: Without dead ends: 1017 [2019-09-08 11:51:19,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2019-09-08 11:51:19,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2019-09-08 11:51:19,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 239. [2019-09-08 11:51:19,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-09-08 11:51:19,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 301 transitions. [2019-09-08 11:51:19,770 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 301 transitions. Word has length 75 [2019-09-08 11:51:19,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:19,770 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 301 transitions. [2019-09-08 11:51:19,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 11:51:19,770 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 301 transitions. [2019-09-08 11:51:19,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 11:51:19,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:19,771 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 11:51:19,771 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:19,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:19,772 INFO L82 PathProgramCache]: Analyzing trace with hash 322835229, now seen corresponding path program 1 times [2019-09-08 11:51:19,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:19,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:19,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:19,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:19,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:20,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:51:20,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:20,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:51:20,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:51:20,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:51:20,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:51:20,120 INFO L87 Difference]: Start difference. First operand 239 states and 301 transitions. Second operand 12 states. [2019-09-08 11:51:20,619 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-09-08 11:51:21,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:21,313 INFO L93 Difference]: Finished difference Result 606 states and 826 transitions. [2019-09-08 11:51:21,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 11:51:21,314 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2019-09-08 11:51:21,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:21,316 INFO L225 Difference]: With dead ends: 606 [2019-09-08 11:51:21,316 INFO L226 Difference]: Without dead ends: 600 [2019-09-08 11:51:21,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:51:21,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-09-08 11:51:21,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 215. [2019-09-08 11:51:21,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-09-08 11:51:21,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 273 transitions. [2019-09-08 11:51:21,370 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 273 transitions. Word has length 75 [2019-09-08 11:51:21,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:21,370 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 273 transitions. [2019-09-08 11:51:21,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:51:21,370 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 273 transitions. [2019-09-08 11:51:21,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 11:51:21,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:21,371 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 11:51:21,371 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:21,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:21,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1485666102, now seen corresponding path program 1 times [2019-09-08 11:51:21,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:21,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:21,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:21,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:21,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:22,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:51:22,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:22,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-08 11:51:22,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 11:51:22,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 11:51:22,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:51:22,771 INFO L87 Difference]: Start difference. First operand 215 states and 273 transitions. Second operand 23 states. [2019-09-08 11:51:23,796 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-08 11:51:24,023 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-08 11:51:24,186 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-08 11:51:24,356 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-09-08 11:51:24,516 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-08 11:51:24,668 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-08 11:51:27,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:27,978 INFO L93 Difference]: Finished difference Result 1067 states and 1490 transitions. [2019-09-08 11:51:27,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 11:51:27,978 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 75 [2019-09-08 11:51:27,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:27,983 INFO L225 Difference]: With dead ends: 1067 [2019-09-08 11:51:27,983 INFO L226 Difference]: Without dead ends: 1059 [2019-09-08 11:51:27,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=371, Invalid=1269, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 11:51:27,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2019-09-08 11:51:28,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 220. [2019-09-08 11:51:28,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-08 11:51:28,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 278 transitions. [2019-09-08 11:51:28,041 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 278 transitions. Word has length 75 [2019-09-08 11:51:28,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:28,041 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 278 transitions. [2019-09-08 11:51:28,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 11:51:28,042 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 278 transitions. [2019-09-08 11:51:28,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 11:51:28,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:28,042 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 11:51:28,043 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:28,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:28,043 INFO L82 PathProgramCache]: Analyzing trace with hash -333093647, now seen corresponding path program 1 times [2019-09-08 11:51:28,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:28,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:28,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:28,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:28,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:29,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:51:29,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:29,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 11:51:29,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 11:51:29,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 11:51:29,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-09-08 11:51:29,402 INFO L87 Difference]: Start difference. First operand 220 states and 278 transitions. Second operand 21 states. [2019-09-08 11:51:29,643 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 11:51:29,934 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-09-08 11:51:30,070 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-09-08 11:51:30,203 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 36 [2019-09-08 11:51:30,387 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-08 11:51:30,633 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-08 11:51:30,926 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-08 11:51:31,246 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 11:51:31,545 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 11:51:31,884 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-08 11:51:32,232 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-08 11:51:32,535 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 11:51:32,900 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-09-08 11:51:33,175 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 11:51:33,484 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-08 11:51:33,767 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-08 11:51:34,079 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-08 11:51:34,388 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-08 11:51:35,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:35,577 INFO L93 Difference]: Finished difference Result 551 states and 742 transitions. [2019-09-08 11:51:35,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 11:51:35,577 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2019-09-08 11:51:35,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:35,579 INFO L225 Difference]: With dead ends: 551 [2019-09-08 11:51:35,579 INFO L226 Difference]: Without dead ends: 536 [2019-09-08 11:51:35,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=351, Invalid=1209, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 11:51:35,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-09-08 11:51:35,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 214. [2019-09-08 11:51:35,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-09-08 11:51:35,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 270 transitions. [2019-09-08 11:51:35,636 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 270 transitions. Word has length 76 [2019-09-08 11:51:35,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:35,636 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 270 transitions. [2019-09-08 11:51:35,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 11:51:35,636 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 270 transitions. [2019-09-08 11:51:35,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 11:51:35,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:35,637 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 11:51:35,637 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:35,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:35,638 INFO L82 PathProgramCache]: Analyzing trace with hash 936148827, now seen corresponding path program 1 times [2019-09-08 11:51:35,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:35,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:35,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:35,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:35,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:36,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:51:36,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:36,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 11:51:36,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 11:51:36,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 11:51:36,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:51:36,176 INFO L87 Difference]: Start difference. First operand 214 states and 270 transitions. Second operand 15 states. [2019-09-08 11:51:37,077 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-09-08 11:51:37,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:37,548 INFO L93 Difference]: Finished difference Result 411 states and 547 transitions. [2019-09-08 11:51:37,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 11:51:37,548 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 76 [2019-09-08 11:51:37,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:37,550 INFO L225 Difference]: With dead ends: 411 [2019-09-08 11:51:37,550 INFO L226 Difference]: Without dead ends: 388 [2019-09-08 11:51:37,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=189, Invalid=513, Unknown=0, NotChecked=0, Total=702 [2019-09-08 11:51:37,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-09-08 11:51:37,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 191. [2019-09-08 11:51:37,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-08 11:51:37,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 247 transitions. [2019-09-08 11:51:37,604 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 247 transitions. Word has length 76 [2019-09-08 11:51:37,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:37,604 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 247 transitions. [2019-09-08 11:51:37,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 11:51:37,604 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 247 transitions. [2019-09-08 11:51:37,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 11:51:37,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:37,605 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:51:37,605 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:37,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:37,606 INFO L82 PathProgramCache]: Analyzing trace with hash -785407461, now seen corresponding path program 1 times [2019-09-08 11:51:37,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:37,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:37,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:37,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:37,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:37,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:51:37,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:37,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:51:37,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:51:37,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:51:37,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:51:37,675 INFO L87 Difference]: Start difference. First operand 191 states and 247 transitions. Second operand 3 states. [2019-09-08 11:51:37,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:37,847 INFO L93 Difference]: Finished difference Result 393 states and 543 transitions. [2019-09-08 11:51:37,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:51:37,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-08 11:51:37,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:37,849 INFO L225 Difference]: With dead ends: 393 [2019-09-08 11:51:37,849 INFO L226 Difference]: Without dead ends: 288 [2019-09-08 11:51:37,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-08 11:51:37,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-08 11:51:37,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 286. [2019-09-08 11:51:37,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-08 11:51:37,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 384 transitions. [2019-09-08 11:51:37,954 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 384 transitions. Word has length 97 [2019-09-08 11:51:37,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:37,954 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 384 transitions. [2019-09-08 11:51:37,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:51:37,955 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 384 transitions. [2019-09-08 11:51:37,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:51:37,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:37,955 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:51:37,956 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:37,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:37,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1930087174, now seen corresponding path program 1 times [2019-09-08 11:51:37,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:37,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:37,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:37,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:37,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:38,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:51:38,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:38,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:51:38,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:51:38,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:51:38,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:51:38,011 INFO L87 Difference]: Start difference. First operand 286 states and 384 transitions. Second operand 5 states. [2019-09-08 11:51:38,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:38,624 INFO L93 Difference]: Finished difference Result 1234 states and 1768 transitions. [2019-09-08 11:51:38,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:51:38,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 11:51:38,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:38,628 INFO L225 Difference]: With dead ends: 1234 [2019-09-08 11:51:38,628 INFO L226 Difference]: Without dead ends: 1034 [2019-09-08 11:51:38,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:51:38,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2019-09-08 11:51:38,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 500. [2019-09-08 11:51:38,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-08 11:51:38,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 692 transitions. [2019-09-08 11:51:38,824 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 692 transitions. Word has length 99 [2019-09-08 11:51:38,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:38,825 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 692 transitions. [2019-09-08 11:51:38,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:51:38,825 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 692 transitions. [2019-09-08 11:51:38,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:51:38,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:38,826 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:51:38,826 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:38,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:38,827 INFO L82 PathProgramCache]: Analyzing trace with hash -943241466, now seen corresponding path program 1 times [2019-09-08 11:51:38,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:38,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:38,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:38,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:38,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:38,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:51:38,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:38,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:51:38,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:51:38,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:51:38,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:51:38,894 INFO L87 Difference]: Start difference. First operand 500 states and 692 transitions. Second operand 5 states. [2019-09-08 11:51:39,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:39,898 INFO L93 Difference]: Finished difference Result 2140 states and 3048 transitions. [2019-09-08 11:51:39,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:51:39,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 11:51:39,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:39,904 INFO L225 Difference]: With dead ends: 2140 [2019-09-08 11:51:39,904 INFO L226 Difference]: Without dead ends: 1726 [2019-09-08 11:51:39,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:51:39,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-09-08 11:51:40,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 944. [2019-09-08 11:51:40,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2019-09-08 11:51:40,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1324 transitions. [2019-09-08 11:51:40,289 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1324 transitions. Word has length 99 [2019-09-08 11:51:40,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:40,289 INFO L475 AbstractCegarLoop]: Abstraction has 944 states and 1324 transitions. [2019-09-08 11:51:40,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:51:40,289 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1324 transitions. [2019-09-08 11:51:40,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:51:40,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:40,291 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:51:40,295 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:40,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:40,295 INFO L82 PathProgramCache]: Analyzing trace with hash 703943869, now seen corresponding path program 1 times [2019-09-08 11:51:40,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:40,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:40,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:40,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:40,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:40,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:51:40,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:40,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:51:40,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:51:40,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:51:40,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:51:40,366 INFO L87 Difference]: Start difference. First operand 944 states and 1324 transitions. Second operand 3 states. [2019-09-08 11:51:40,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:40,956 INFO L93 Difference]: Finished difference Result 2248 states and 3202 transitions. [2019-09-08 11:51:40,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:51:40,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 11:51:40,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:40,963 INFO L225 Difference]: With dead ends: 2248 [2019-09-08 11:51:40,963 INFO L226 Difference]: Without dead ends: 1390 [2019-09-08 11:51:40,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-08 11:51:40,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2019-09-08 11:51:41,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1388. [2019-09-08 11:51:41,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1388 states. [2019-09-08 11:51:41,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1952 transitions. [2019-09-08 11:51:41,535 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 1952 transitions. Word has length 99 [2019-09-08 11:51:41,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:41,536 INFO L475 AbstractCegarLoop]: Abstraction has 1388 states and 1952 transitions. [2019-09-08 11:51:41,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:51:41,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1952 transitions. [2019-09-08 11:51:41,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:51:41,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:41,537 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:51:41,537 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:41,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:41,538 INFO L82 PathProgramCache]: Analyzing trace with hash -35796452, now seen corresponding path program 1 times [2019-09-08 11:51:41,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:41,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:41,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:41,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:41,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:41,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:51:41,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:41,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:51:41,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:51:41,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:51:41,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:51:41,586 INFO L87 Difference]: Start difference. First operand 1388 states and 1952 transitions. Second operand 3 states. [2019-09-08 11:51:42,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:42,404 INFO L93 Difference]: Finished difference Result 3346 states and 4716 transitions. [2019-09-08 11:51:42,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:51:42,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 11:51:42,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:42,410 INFO L225 Difference]: With dead ends: 3346 [2019-09-08 11:51:42,411 INFO L226 Difference]: Without dead ends: 2044 [2019-09-08 11:51:42,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-08 11:51:42,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2019-09-08 11:51:43,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 2042. [2019-09-08 11:51:43,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2042 states. [2019-09-08 11:51:43,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 2830 transitions. [2019-09-08 11:51:43,253 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 2830 transitions. Word has length 99 [2019-09-08 11:51:43,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:43,254 INFO L475 AbstractCegarLoop]: Abstraction has 2042 states and 2830 transitions. [2019-09-08 11:51:43,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:51:43,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2830 transitions. [2019-09-08 11:51:43,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:51:43,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:43,256 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:51:43,256 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:43,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:43,256 INFO L82 PathProgramCache]: Analyzing trace with hash -2062661056, now seen corresponding path program 1 times [2019-09-08 11:51:43,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:43,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:43,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:43,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:43,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:43,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:51:43,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:43,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:51:43,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:51:43,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:51:43,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:51:43,328 INFO L87 Difference]: Start difference. First operand 2042 states and 2830 transitions. Second operand 5 states. [2019-09-08 11:51:46,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:46,286 INFO L93 Difference]: Finished difference Result 8542 states and 11894 transitions. [2019-09-08 11:51:46,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:51:46,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 11:51:46,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:46,299 INFO L225 Difference]: With dead ends: 8542 [2019-09-08 11:51:46,299 INFO L226 Difference]: Without dead ends: 6586 [2019-09-08 11:51:46,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:51:46,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6586 states. [2019-09-08 11:51:48,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6586 to 4140. [2019-09-08 11:51:48,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4140 states. [2019-09-08 11:51:48,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 5712 transitions. [2019-09-08 11:51:48,166 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 5712 transitions. Word has length 99 [2019-09-08 11:51:48,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:48,166 INFO L475 AbstractCegarLoop]: Abstraction has 4140 states and 5712 transitions. [2019-09-08 11:51:48,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:51:48,166 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 5712 transitions. [2019-09-08 11:51:48,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:51:48,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:48,168 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:51:48,168 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:48,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:48,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1021442252, now seen corresponding path program 1 times [2019-09-08 11:51:48,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:48,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:48,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:48,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:48,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:48,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:51:48,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:48,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:51:48,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:51:48,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:51:48,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:51:48,217 INFO L87 Difference]: Start difference. First operand 4140 states and 5712 transitions. Second operand 5 states. [2019-09-08 11:51:52,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:52,302 INFO L93 Difference]: Finished difference Result 12948 states and 17732 transitions. [2019-09-08 11:51:52,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:51:52,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 11:51:52,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:52,323 INFO L225 Difference]: With dead ends: 12948 [2019-09-08 11:51:52,323 INFO L226 Difference]: Without dead ends: 8894 [2019-09-08 11:51:52,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:51:52,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8894 states. [2019-09-08 11:51:54,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8894 to 5144. [2019-09-08 11:51:54,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5144 states. [2019-09-08 11:51:54,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5144 states to 5144 states and 6960 transitions. [2019-09-08 11:51:54,768 INFO L78 Accepts]: Start accepts. Automaton has 5144 states and 6960 transitions. Word has length 99 [2019-09-08 11:51:54,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:51:54,768 INFO L475 AbstractCegarLoop]: Abstraction has 5144 states and 6960 transitions. [2019-09-08 11:51:54,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:51:54,768 INFO L276 IsEmpty]: Start isEmpty. Operand 5144 states and 6960 transitions. [2019-09-08 11:51:54,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 11:51:54,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:51:54,770 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:51:54,770 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:51:54,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:51:54,770 INFO L82 PathProgramCache]: Analyzing trace with hash 288255902, now seen corresponding path program 1 times [2019-09-08 11:51:54,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:51:54,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:51:54,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:54,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:51:54,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:51:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:51:54,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:51:54,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:51:54,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:51:54,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:51:54,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:51:54,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:51:54,861 INFO L87 Difference]: Start difference. First operand 5144 states and 6960 transitions. Second operand 6 states. [2019-09-08 11:51:58,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:51:58,972 INFO L93 Difference]: Finished difference Result 8494 states and 11357 transitions. [2019-09-08 11:51:58,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 11:51:58,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-09-08 11:51:58,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:51:58,987 INFO L225 Difference]: With dead ends: 8494 [2019-09-08 11:51:58,987 INFO L226 Difference]: Without dead ends: 8492 [2019-09-08 11:51:58,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:51:58,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8492 states. [2019-09-08 11:52:01,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8492 to 5240. [2019-09-08 11:52:01,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5240 states. [2019-09-08 11:52:01,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5240 states to 5240 states and 7024 transitions. [2019-09-08 11:52:01,572 INFO L78 Accepts]: Start accepts. Automaton has 5240 states and 7024 transitions. Word has length 100 [2019-09-08 11:52:01,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:52:01,573 INFO L475 AbstractCegarLoop]: Abstraction has 5240 states and 7024 transitions. [2019-09-08 11:52:01,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:52:01,573 INFO L276 IsEmpty]: Start isEmpty. Operand 5240 states and 7024 transitions. [2019-09-08 11:52:01,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 11:52:01,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:52:01,574 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:52:01,575 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:52:01,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:52:01,575 INFO L82 PathProgramCache]: Analyzing trace with hash -693244254, now seen corresponding path program 1 times [2019-09-08 11:52:01,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:52:01,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:52:01,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:01,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:52:01,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:01,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:52:01,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:52:01,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:52:01,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:52:01,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:52:01,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:52:01,628 INFO L87 Difference]: Start difference. First operand 5240 states and 7024 transitions. Second operand 3 states. [2019-09-08 11:52:05,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:52:05,207 INFO L93 Difference]: Finished difference Result 12916 states and 17370 transitions. [2019-09-08 11:52:05,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:52:05,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-08 11:52:05,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:52:05,222 INFO L225 Difference]: With dead ends: 12916 [2019-09-08 11:52:05,222 INFO L226 Difference]: Without dead ends: 7762 [2019-09-08 11:52:05,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-08 11:52:05,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7762 states. [2019-09-08 11:52:07,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7762 to 5668. [2019-09-08 11:52:07,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5668 states. [2019-09-08 11:52:07,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5668 states to 5668 states and 7568 transitions. [2019-09-08 11:52:07,816 INFO L78 Accepts]: Start accepts. Automaton has 5668 states and 7568 transitions. Word has length 100 [2019-09-08 11:52:07,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:52:07,817 INFO L475 AbstractCegarLoop]: Abstraction has 5668 states and 7568 transitions. [2019-09-08 11:52:07,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:52:07,817 INFO L276 IsEmpty]: Start isEmpty. Operand 5668 states and 7568 transitions. [2019-09-08 11:52:07,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 11:52:07,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:52:07,818 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 11:52:07,818 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:52:07,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:52:07,818 INFO L82 PathProgramCache]: Analyzing trace with hash -212803225, now seen corresponding path program 1 times [2019-09-08 11:52:07,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:52:07,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:52:07,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:07,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:52:07,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:07,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:52:07,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:52:07,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:52:07,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:52:07,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:52:07,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:52:07,875 INFO L87 Difference]: Start difference. First operand 5668 states and 7568 transitions. Second operand 3 states. [2019-09-08 11:52:11,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:52:11,342 INFO L93 Difference]: Finished difference Result 12516 states and 16654 transitions. [2019-09-08 11:52:11,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:52:11,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-08 11:52:11,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:52:11,352 INFO L225 Difference]: With dead ends: 12516 [2019-09-08 11:52:11,352 INFO L226 Difference]: Without dead ends: 6934 [2019-09-08 11:52:11,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-08 11:52:11,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6934 states. [2019-09-08 11:52:13,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6934 to 5158. [2019-09-08 11:52:13,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5158 states. [2019-09-08 11:52:13,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5158 states to 5158 states and 6725 transitions. [2019-09-08 11:52:13,818 INFO L78 Accepts]: Start accepts. Automaton has 5158 states and 6725 transitions. Word has length 101 [2019-09-08 11:52:13,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:52:13,818 INFO L475 AbstractCegarLoop]: Abstraction has 5158 states and 6725 transitions. [2019-09-08 11:52:13,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:52:13,818 INFO L276 IsEmpty]: Start isEmpty. Operand 5158 states and 6725 transitions. [2019-09-08 11:52:13,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:52:13,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:52:13,821 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 11:52:13,821 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:52:13,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:52:13,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1682826315, now seen corresponding path program 1 times [2019-09-08 11:52:13,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:52:13,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:52:13,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:13,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:52:13,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:13,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:52:13,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:52:13,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:52:13,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:52:13,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:52:13,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:52:13,879 INFO L87 Difference]: Start difference. First operand 5158 states and 6725 transitions. Second operand 3 states. [2019-09-08 11:52:16,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:52:16,181 INFO L93 Difference]: Finished difference Result 10016 states and 13054 transitions. [2019-09-08 11:52:16,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:52:16,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-08 11:52:16,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:52:16,187 INFO L225 Difference]: With dead ends: 10016 [2019-09-08 11:52:16,188 INFO L226 Difference]: Without dead ends: 4944 [2019-09-08 11:52:16,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-08 11:52:16,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4944 states. [2019-09-08 11:52:18,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4944 to 4942. [2019-09-08 11:52:18,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4942 states. [2019-09-08 11:52:18,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4942 states to 4942 states and 6359 transitions. [2019-09-08 11:52:18,542 INFO L78 Accepts]: Start accepts. Automaton has 4942 states and 6359 transitions. Word has length 102 [2019-09-08 11:52:18,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:52:18,542 INFO L475 AbstractCegarLoop]: Abstraction has 4942 states and 6359 transitions. [2019-09-08 11:52:18,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:52:18,542 INFO L276 IsEmpty]: Start isEmpty. Operand 4942 states and 6359 transitions. [2019-09-08 11:52:18,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 11:52:18,543 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:52:18,543 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:52:18,544 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:52:18,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:52:18,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1305322077, now seen corresponding path program 1 times [2019-09-08 11:52:18,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:52:18,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:52:18,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:18,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:52:18,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:18,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:52:18,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:52:18,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:52:18,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:52:18,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:52:18,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:52:18,604 INFO L87 Difference]: Start difference. First operand 4942 states and 6359 transitions. Second operand 3 states. [2019-09-08 11:52:21,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:52:21,093 INFO L93 Difference]: Finished difference Result 10258 states and 13241 transitions. [2019-09-08 11:52:21,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:52:21,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-09-08 11:52:21,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:52:21,100 INFO L225 Difference]: With dead ends: 10258 [2019-09-08 11:52:21,100 INFO L226 Difference]: Without dead ends: 5402 [2019-09-08 11:52:21,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-08 11:52:21,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2019-09-08 11:52:23,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 5400. [2019-09-08 11:52:23,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5400 states. [2019-09-08 11:52:23,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5400 states to 5400 states and 6924 transitions. [2019-09-08 11:52:23,614 INFO L78 Accepts]: Start accepts. Automaton has 5400 states and 6924 transitions. Word has length 103 [2019-09-08 11:52:23,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:52:23,614 INFO L475 AbstractCegarLoop]: Abstraction has 5400 states and 6924 transitions. [2019-09-08 11:52:23,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:52:23,614 INFO L276 IsEmpty]: Start isEmpty. Operand 5400 states and 6924 transitions. [2019-09-08 11:52:23,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 11:52:23,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:52:23,617 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:52:23,617 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:52:23,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:52:23,617 INFO L82 PathProgramCache]: Analyzing trace with hash -297824867, now seen corresponding path program 1 times [2019-09-08 11:52:23,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:52:23,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:52:23,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:23,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:52:23,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:23,730 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:52:23,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:52:23,731 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:52:23,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:52:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:23,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 1187 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 11:52:23,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:52:24,085 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 11:52:24,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 11:52:24,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2019-09-08 11:52:24,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:52:24,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:52:24,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:52:24,094 INFO L87 Difference]: Start difference. First operand 5400 states and 6924 transitions. Second operand 10 states. [2019-09-08 11:52:48,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:52:48,531 INFO L93 Difference]: Finished difference Result 54550 states and 69851 transitions. [2019-09-08 11:52:48,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 11:52:48,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 129 [2019-09-08 11:52:48,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:52:48,639 INFO L225 Difference]: With dead ends: 54550 [2019-09-08 11:52:48,639 INFO L226 Difference]: Without dead ends: 49236 [2019-09-08 11:52:48,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-09-08 11:52:48,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49236 states. [2019-09-08 11:52:55,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49236 to 14156. [2019-09-08 11:52:55,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14156 states. [2019-09-08 11:52:55,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14156 states to 14156 states and 18118 transitions. [2019-09-08 11:52:55,980 INFO L78 Accepts]: Start accepts. Automaton has 14156 states and 18118 transitions. Word has length 129 [2019-09-08 11:52:55,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:52:55,981 INFO L475 AbstractCegarLoop]: Abstraction has 14156 states and 18118 transitions. [2019-09-08 11:52:55,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:52:55,981 INFO L276 IsEmpty]: Start isEmpty. Operand 14156 states and 18118 transitions. [2019-09-08 11:52:55,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 11:52:55,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:52:55,985 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:52:55,985 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:52:55,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:52:55,986 INFO L82 PathProgramCache]: Analyzing trace with hash 689020841, now seen corresponding path program 1 times [2019-09-08 11:52:55,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:52:55,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:52:55,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:55,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:52:55,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:52:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:52:56,123 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 11:52:56,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:52:56,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:52:56,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:52:56,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:52:56,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:52:56,125 INFO L87 Difference]: Start difference. First operand 14156 states and 18118 transitions. Second operand 6 states. [2019-09-08 11:53:11,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:53:11,202 INFO L93 Difference]: Finished difference Result 44072 states and 56386 transitions. [2019-09-08 11:53:11,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:53:11,203 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-09-08 11:53:11,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:53:11,248 INFO L225 Difference]: With dead ends: 44072 [2019-09-08 11:53:11,249 INFO L226 Difference]: Without dead ends: 30002 [2019-09-08 11:53:11,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:53:11,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30002 states. [2019-09-08 11:53:19,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30002 to 17600. [2019-09-08 11:53:19,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17600 states. [2019-09-08 11:53:19,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17600 states to 17600 states and 22480 transitions. [2019-09-08 11:53:19,734 INFO L78 Accepts]: Start accepts. Automaton has 17600 states and 22480 transitions. Word has length 129 [2019-09-08 11:53:19,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:53:19,735 INFO L475 AbstractCegarLoop]: Abstraction has 17600 states and 22480 transitions. [2019-09-08 11:53:19,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:53:19,735 INFO L276 IsEmpty]: Start isEmpty. Operand 17600 states and 22480 transitions. [2019-09-08 11:53:19,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 11:53:19,738 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:53:19,738 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:53:19,738 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:53:19,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:53:19,738 INFO L82 PathProgramCache]: Analyzing trace with hash 610820055, now seen corresponding path program 1 times [2019-09-08 11:53:19,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:53:19,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:53:19,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:53:19,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:53:19,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:53:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:53:19,854 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:53:19,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:53:19,854 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:53:19,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:53:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:53:20,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 1187 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 11:53:20,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:53:20,248 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 11:53:20,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 11:53:20,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2019-09-08 11:53:20,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:53:20,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:53:20,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:53:20,257 INFO L87 Difference]: Start difference. First operand 17600 states and 22480 transitions. Second operand 10 states. [2019-09-08 11:53:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:53:42,455 INFO L93 Difference]: Finished difference Result 58436 states and 74834 transitions. [2019-09-08 11:53:42,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:53:42,456 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 129 [2019-09-08 11:53:42,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:53:42,513 INFO L225 Difference]: With dead ends: 58436 [2019-09-08 11:53:42,514 INFO L226 Difference]: Without dead ends: 44366 [2019-09-08 11:53:42,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-09-08 11:53:42,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44366 states. [2019-09-08 11:53:56,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44366 to 25524. [2019-09-08 11:53:56,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25524 states. [2019-09-08 11:53:56,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25524 states to 25524 states and 32532 transitions. [2019-09-08 11:53:56,326 INFO L78 Accepts]: Start accepts. Automaton has 25524 states and 32532 transitions. Word has length 129 [2019-09-08 11:53:56,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:53:56,326 INFO L475 AbstractCegarLoop]: Abstraction has 25524 states and 32532 transitions. [2019-09-08 11:53:56,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:53:56,326 INFO L276 IsEmpty]: Start isEmpty. Operand 25524 states and 32532 transitions. [2019-09-08 11:53:56,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 11:53:56,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:53:56,329 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:53:56,329 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:53:56,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:53:56,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1632720289, now seen corresponding path program 1 times [2019-09-08 11:53:56,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:53:56,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:53:56,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:53:56,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:53:56,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:53:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:53:56,405 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 11:53:56,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:53:56,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:53:56,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:53:56,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:53:56,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:53:56,406 INFO L87 Difference]: Start difference. First operand 25524 states and 32532 transitions. Second operand 3 states. [2019-09-08 11:54:11,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:54:11,844 INFO L93 Difference]: Finished difference Result 56344 states and 71462 transitions. [2019-09-08 11:54:11,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:54:11,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-09-08 11:54:11,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:54:11,878 INFO L225 Difference]: With dead ends: 56344 [2019-09-08 11:54:11,878 INFO L226 Difference]: Without dead ends: 30906 [2019-09-08 11:54:11,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-08 11:54:11,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30906 states. [2019-09-08 11:54:27,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30906 to 29272. [2019-09-08 11:54:27,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29272 states. [2019-09-08 11:54:27,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29272 states to 29272 states and 36804 transitions. [2019-09-08 11:54:27,354 INFO L78 Accepts]: Start accepts. Automaton has 29272 states and 36804 transitions. Word has length 130 [2019-09-08 11:54:27,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:54:27,354 INFO L475 AbstractCegarLoop]: Abstraction has 29272 states and 36804 transitions. [2019-09-08 11:54:27,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:54:27,354 INFO L276 IsEmpty]: Start isEmpty. Operand 29272 states and 36804 transitions. [2019-09-08 11:54:27,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 11:54:27,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:54:27,357 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:54:27,357 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:54:27,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:54:27,357 INFO L82 PathProgramCache]: Analyzing trace with hash -2016651098, now seen corresponding path program 1 times [2019-09-08 11:54:27,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:54:27,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:54:27,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:54:27,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:54:27,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:54:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:54:27,459 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:54:27,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:54:27,460 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:54:27,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:54:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:54:27,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 11:54:27,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:54:27,808 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 11:54:27,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 11:54:27,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2019-09-08 11:54:27,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:54:27,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:54:27,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:54:27,824 INFO L87 Difference]: Start difference. First operand 29272 states and 36804 transitions. Second operand 10 states. [2019-09-08 11:55:07,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:55:07,876 INFO L93 Difference]: Finished difference Result 101958 states and 128579 transitions. [2019-09-08 11:55:07,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 11:55:07,877 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 130 [2019-09-08 11:55:07,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:55:07,962 INFO L225 Difference]: With dead ends: 101958 [2019-09-08 11:55:07,962 INFO L226 Difference]: Without dead ends: 76724 [2019-09-08 11:55:07,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-09-08 11:55:08,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76724 states. [2019-09-08 11:55:29,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76724 to 40728. [2019-09-08 11:55:29,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40728 states. [2019-09-08 11:55:29,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40728 states to 40728 states and 51164 transitions. [2019-09-08 11:55:29,072 INFO L78 Accepts]: Start accepts. Automaton has 40728 states and 51164 transitions. Word has length 130 [2019-09-08 11:55:29,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:55:29,072 INFO L475 AbstractCegarLoop]: Abstraction has 40728 states and 51164 transitions. [2019-09-08 11:55:29,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 11:55:29,072 INFO L276 IsEmpty]: Start isEmpty. Operand 40728 states and 51164 transitions. [2019-09-08 11:55:29,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 11:55:29,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:55:29,076 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:55:29,076 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:55:29,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:55:29,076 INFO L82 PathProgramCache]: Analyzing trace with hash 733064444, now seen corresponding path program 1 times [2019-09-08 11:55:29,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:55:29,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:55:29,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:29,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:55:29,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:55:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:55:29,201 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 11:55:29,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:55:29,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:55:29,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:55:29,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:55:29,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:55:29,202 INFO L87 Difference]: Start difference. First operand 40728 states and 51164 transitions. Second operand 9 states. [2019-09-08 11:56:12,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:12,190 INFO L93 Difference]: Finished difference Result 122038 states and 153338 transitions. [2019-09-08 11:56:12,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:56:12,191 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-09-08 11:56:12,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:12,276 INFO L225 Difference]: With dead ends: 122038 [2019-09-08 11:56:12,276 INFO L226 Difference]: Without dead ends: 81390 [2019-09-08 11:56:12,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:56:12,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81390 states. [2019-09-08 11:56:36,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81390 to 40728. [2019-09-08 11:56:36,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40728 states. [2019-09-08 11:56:36,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40728 states to 40728 states and 51163 transitions. [2019-09-08 11:56:36,334 INFO L78 Accepts]: Start accepts. Automaton has 40728 states and 51163 transitions. Word has length 131 [2019-09-08 11:56:36,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:56:36,334 INFO L475 AbstractCegarLoop]: Abstraction has 40728 states and 51163 transitions. [2019-09-08 11:56:36,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:56:36,334 INFO L276 IsEmpty]: Start isEmpty. Operand 40728 states and 51163 transitions. [2019-09-08 11:56:36,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 11:56:36,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:56:36,338 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:56:36,338 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:56:36,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:56:36,338 INFO L82 PathProgramCache]: Analyzing trace with hash 104610750, now seen corresponding path program 1 times [2019-09-08 11:56:36,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:56:36,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:56:36,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:36,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:56:36,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:56:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:56:36,404 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 11:56:36,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:56:36,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:56:36,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:56:36,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:56:36,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:56:36,406 INFO L87 Difference]: Start difference. First operand 40728 states and 51163 transitions. Second operand 4 states. [2019-09-08 11:56:57,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:56:57,770 INFO L93 Difference]: Finished difference Result 81391 states and 102257 transitions. [2019-09-08 11:56:57,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:56:57,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-09-08 11:56:57,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:56:57,812 INFO L225 Difference]: With dead ends: 81391 [2019-09-08 11:56:57,812 INFO L226 Difference]: Without dead ends: 40749 [2019-09-08 11:56:57,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:56:57,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40749 states. [2019-09-08 11:57:18,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40749 to 40721. [2019-09-08 11:57:18,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40721 states. [2019-09-08 11:57:19,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40721 states to 40721 states and 51156 transitions. [2019-09-08 11:57:19,005 INFO L78 Accepts]: Start accepts. Automaton has 40721 states and 51156 transitions. Word has length 133 [2019-09-08 11:57:19,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:57:19,006 INFO L475 AbstractCegarLoop]: Abstraction has 40721 states and 51156 transitions. [2019-09-08 11:57:19,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:57:19,006 INFO L276 IsEmpty]: Start isEmpty. Operand 40721 states and 51156 transitions. [2019-09-08 11:57:19,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 11:57:19,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:57:19,009 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:57:19,009 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:57:19,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:57:19,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1846733149, now seen corresponding path program 1 times [2019-09-08 11:57:19,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:57:19,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:57:19,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:19,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:19,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:57:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:19,314 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:57:19,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:57:19,315 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:57:19,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:57:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:57:19,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-08 11:57:19,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:57:19,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:57:19,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 11:57:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:57:20,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:57:20,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2019-09-08 11:57:20,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 11:57:20,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 11:57:20,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-09-08 11:57:20,296 INFO L87 Difference]: Start difference. First operand 40721 states and 51156 transitions. Second operand 20 states. [2019-09-08 11:57:20,489 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-08 11:57:21,334 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-08 11:57:21,582 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 11:57:21,839 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-09-08 11:57:22,039 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2019-09-08 11:57:22,721 WARN L188 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-09-08 11:57:23,094 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-08 11:57:23,595 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-08 11:57:24,035 WARN L188 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 11:57:24,195 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-08 11:57:24,330 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-08 11:57:24,791 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-08 11:57:25,011 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-08 11:57:25,302 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-09-08 11:57:25,560 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-08 11:57:25,933 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-08 11:57:26,204 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-08 11:57:26,372 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-08 11:57:26,750 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-08 11:57:27,142 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-08 11:57:27,329 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-09-08 11:57:27,725 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-08 11:57:27,969 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-09-08 11:57:28,414 WARN L188 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2019-09-08 11:57:28,566 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-09-08 11:57:28,894 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2019-09-08 11:57:29,260 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2019-09-08 11:57:29,792 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-08 11:57:30,083 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-09-08 11:57:30,311 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-08 11:57:30,587 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-08 11:57:31,076 WARN L188 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 83 [2019-09-08 11:57:31,337 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-09-08 11:57:31,720 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-08 11:57:31,971 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-09-08 11:57:32,313 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 11:57:32,992 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-09-08 11:57:33,222 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-08 11:57:33,686 WARN L188 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-08 11:57:33,977 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-08 11:57:34,217 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-09-08 11:57:34,498 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 11:57:34,902 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-08 11:57:35,418 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2019-09-08 11:57:35,970 WARN L188 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-09-08 11:57:36,338 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-08 11:57:36,624 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-08 11:57:36,977 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-08 11:57:37,274 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-09-08 11:57:37,515 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-08 11:57:37,794 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2019-09-08 11:57:38,209 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 83 [2019-09-08 11:57:38,533 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2019-09-08 11:57:38,963 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-08 11:57:39,415 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2019-09-08 11:57:39,721 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-09-08 11:57:39,952 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-08 11:57:40,405 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-09-08 11:57:40,780 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-09-08 11:57:41,252 WARN L188 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-08 11:57:41,547 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-09-08 11:57:42,063 WARN L188 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2019-09-08 11:57:42,713 WARN L188 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2019-09-08 11:57:43,625 WARN L188 SmtUtils]: Spent 845.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-09-08 11:57:44,193 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-09-08 11:57:44,367 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-08 11:57:44,571 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-08 11:57:45,145 WARN L188 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-08 11:57:45,494 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-08 11:57:45,790 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2019-09-08 11:57:46,111 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-08 11:57:46,332 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-09-08 11:57:46,662 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-08 11:57:46,924 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-08 11:57:47,279 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-09-08 11:57:49,492 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-08 11:57:49,925 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-09-08 11:57:50,208 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-09-08 11:57:50,467 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-08 11:57:50,751 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-08 11:57:51,328 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-08 11:57:51,699 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-08 11:57:52,126 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-08 11:57:52,469 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-08 11:57:52,924 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-08 11:57:53,393 WARN L188 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 11:57:53,703 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-09-08 11:57:53,956 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-09-08 11:57:54,199 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-08 11:57:54,595 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-08 11:57:54,846 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-08 11:57:55,067 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-08 11:57:55,392 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-08 11:57:55,872 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2019-09-08 11:57:56,300 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-08 11:57:56,756 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-08 11:57:57,046 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-09-08 11:57:57,410 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-08 11:57:57,941 WARN L188 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-09-08 11:57:58,414 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-08 11:57:58,710 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-08 11:57:59,301 WARN L188 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-08 11:58:00,278 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-09-08 11:58:00,610 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-08 11:58:09,327 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-08 11:58:10,490 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-08 11:58:10,840 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-08 11:58:11,288 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-08 11:58:11,796 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-09-08 11:58:12,300 WARN L188 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2019-09-08 11:58:12,624 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-08 11:58:12,835 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-08 11:58:13,049 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-08 11:58:13,273 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-08 11:58:13,939 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-08 11:58:14,207 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2019-09-08 11:58:14,544 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-08 11:58:14,836 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-09-08 11:58:15,048 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-08 11:58:15,330 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-09-08 11:58:15,812 WARN L188 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-08 11:58:16,151 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-08 11:58:16,408 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 11:58:16,773 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-08 11:58:17,142 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-08 11:58:17,536 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-09-08 11:58:17,875 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-08 11:58:18,077 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-09-08 11:58:18,707 WARN L188 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2019-09-08 11:58:19,028 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-08 11:58:19,658 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2019-09-08 11:58:20,073 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-08 11:58:20,394 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-09-08 11:58:20,576 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-09-08 11:58:21,109 WARN L188 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-08 11:58:22,889 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-09-08 11:58:23,257 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2019-09-08 11:58:23,840 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2019-09-08 11:58:24,118 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-08 11:58:24,463 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2019-09-08 11:58:24,802 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-08 11:58:25,164 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-09-08 11:58:25,452 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-08 11:58:25,702 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-08 11:58:26,286 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-08 11:58:26,641 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-09-08 11:58:26,942 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-09-08 11:58:27,322 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-08 11:58:27,709 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-09-08 11:58:27,944 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-08 11:58:28,225 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-09-08 11:58:28,590 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-08 11:58:29,083 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-08 11:58:29,377 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-09-08 11:58:29,697 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-08 11:58:29,961 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-08 11:58:30,303 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 75 [2019-09-08 11:58:30,658 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-09-08 11:58:30,937 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-09-08 11:58:31,349 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-08 11:58:32,505 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-08 11:58:32,890 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2019-09-08 11:58:33,499 WARN L188 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-08 11:58:34,353 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-08 11:58:34,578 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-08 11:58:34,844 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-08 11:58:35,409 WARN L188 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 86 [2019-09-08 11:58:35,803 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-09-08 11:58:36,193 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-09-08 11:58:36,563 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-08 11:58:36,766 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 11:58:37,519 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-08 11:58:38,394 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-08 11:58:39,133 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-08 11:58:39,471 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-09-08 11:58:39,763 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-08 11:58:39,983 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 11:58:40,331 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-08 11:58:41,263 WARN L188 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-09-08 11:58:42,370 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-09-08 11:58:42,785 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-09-08 11:58:43,115 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-08 11:58:43,952 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2019-09-08 11:58:44,830 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-09-08 11:58:45,218 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-09-08 11:58:45,503 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-09-08 11:58:46,137 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2019-09-08 11:58:46,465 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-09-08 11:58:46,860 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-09-08 11:58:47,639 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2019-09-08 11:58:48,391 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-09-08 11:58:48,986 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-08 11:58:49,295 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 74 [2019-09-08 11:58:49,874 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-08 11:58:50,832 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2019-09-08 11:59:00,003 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-08 11:59:00,300 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-08 11:59:16,795 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-09-08 11:59:19,263 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-09-08 12:02:23,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:02:23,791 INFO L93 Difference]: Finished difference Result 407333 states and 502077 transitions. [2019-09-08 12:02:23,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2019-09-08 12:02:23,792 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 133 [2019-09-08 12:02:23,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:02:24,263 INFO L225 Difference]: With dead ends: 407333 [2019-09-08 12:02:24,263 INFO L226 Difference]: Without dead ends: 366691 [2019-09-08 12:02:24,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19874 ImplicationChecksByTransitivity, 62.0s TimeCoverageRelationStatistics Valid=7058, Invalid=42448, Unknown=0, NotChecked=0, Total=49506 [2019-09-08 12:02:24,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366691 states.