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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:29:16,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:29:16,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:29:16,785 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:29:16,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:29:16,786 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:29:16,787 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:29:16,789 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:29:16,791 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:29:16,792 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:29:16,793 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:29:16,794 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:29:16,794 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:29:16,795 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:29:16,796 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:29:16,797 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:29:16,798 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:29:16,799 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:29:16,801 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:29:16,803 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:29:16,804 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:29:16,805 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:29:16,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:29:16,807 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:29:16,813 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:29:16,813 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:29:16,814 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:29:16,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:29:16,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:29:16,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:29:16,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:29:16,817 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:29:16,820 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:29:16,821 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:29:16,822 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:29:16,822 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:29:16,826 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:29:16,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:29:16,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:29:16,828 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:29:16,829 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:29:16,830 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 07:29:16,857 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:29:16,857 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:29:16,858 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:29:16,859 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:29:16,859 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:29:16,860 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:29:16,860 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:29:16,860 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:29:16,860 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:29:16,860 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:29:16,863 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:29:16,863 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:29:16,863 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:29:16,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:29:16,864 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:29:16,864 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:29:16,864 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:29:16,864 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:29:16,865 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:29:16,865 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:29:16,865 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:29:16,865 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:29:16,866 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:29:16,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:29:16,866 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:29:16,866 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:29:16,867 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:29:16,867 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:29:16,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:29:16,867 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:29:16,908 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:29:16,923 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:29:16,928 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:29:16,929 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:29:16,930 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:29:16,931 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 07:29:17,006 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf3cd8ceb/7980964a728048c59ffc318bae67a2dd/FLAGaecc78131 [2019-09-10 07:29:17,544 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:29:17,545 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 07:29:17,556 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf3cd8ceb/7980964a728048c59ffc318bae67a2dd/FLAGaecc78131 [2019-09-10 07:29:17,818 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf3cd8ceb/7980964a728048c59ffc318bae67a2dd [2019-09-10 07:29:17,827 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:29:17,829 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:29:17,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:29:17,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:29:17,834 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:29:17,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:29:17" (1/1) ... [2019-09-10 07:29:17,840 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c774b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:29:17, skipping insertion in model container [2019-09-10 07:29:17,841 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:29:17" (1/1) ... [2019-09-10 07:29:17,848 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:29:17,909 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:29:18,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:29:18,466 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:29:18,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:29:18,814 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:29:18,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:29:18 WrapperNode [2019-09-10 07:29:18,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:29:18,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:29:18,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:29:18,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:29:18,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:29:18" (1/1) ... [2019-09-10 07:29:18,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:29:18" (1/1) ... [2019-09-10 07:29:18,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:29:18" (1/1) ... [2019-09-10 07:29:18,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:29:18" (1/1) ... [2019-09-10 07:29:18,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:29:18" (1/1) ... [2019-09-10 07:29:18,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:29:18" (1/1) ... [2019-09-10 07:29:18,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:29:18" (1/1) ... [2019-09-10 07:29:18,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:29:18,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:29:18,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:29:18,899 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:29:18,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:29:18" (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-10 07:29:18,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:29:18,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:29:18,990 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:29:18,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:29:18,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:29:18,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:29:18,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:29:18,991 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:29:18,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:29:18,992 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:29:18,992 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:29:18,993 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:29:18,993 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:29:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:29:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:29:18,996 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:29:18,996 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:29:18,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:29:18,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:29:20,450 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:29:20,450 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:29:20,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:29:20 BoogieIcfgContainer [2019-09-10 07:29:20,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:29:20,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:29:20,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:29:20,457 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:29:20,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:29:17" (1/3) ... [2019-09-10 07:29:20,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64089a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:29:20, skipping insertion in model container [2019-09-10 07:29:20,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:29:18" (2/3) ... [2019-09-10 07:29:20,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64089a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:29:20, skipping insertion in model container [2019-09-10 07:29:20,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:29:20" (3/3) ... [2019-09-10 07:29:20,466 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-10 07:29:20,474 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:29:20,487 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-09-10 07:29:20,502 INFO L252 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-09-10 07:29:20,524 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:29:20,525 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:29:20,525 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:29:20,525 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:29:20,525 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:29:20,525 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:29:20,525 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:29:20,525 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:29:20,549 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states. [2019-09-10 07:29:20,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-10 07:29:20,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:20,568 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] [2019-09-10 07:29:20,570 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:20,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:20,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1982608136, now seen corresponding path program 1 times [2019-09-10 07:29:20,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:20,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:20,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:20,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:20,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:20,997 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-10 07:29:20,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:20,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:29:21,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:21,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:29:21,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:29:21,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:29:21,027 INFO L87 Difference]: Start difference. First operand 271 states. Second operand 5 states. [2019-09-10 07:29:21,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:21,543 INFO L93 Difference]: Finished difference Result 247 states and 407 transitions. [2019-09-10 07:29:21,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:29:21,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-09-10 07:29:21,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:21,559 INFO L225 Difference]: With dead ends: 247 [2019-09-10 07:29:21,559 INFO L226 Difference]: Without dead ends: 235 [2019-09-10 07:29:21,561 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-10 07:29:21,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-09-10 07:29:21,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2019-09-10 07:29:21,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-09-10 07:29:21,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 292 transitions. [2019-09-10 07:29:21,625 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 292 transitions. Word has length 51 [2019-09-10 07:29:21,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:21,626 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 292 transitions. [2019-09-10 07:29:21,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:29:21,626 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 292 transitions. [2019-09-10 07:29:21,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-10 07:29:21,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:21,630 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] [2019-09-10 07:29:21,631 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:21,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:21,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1667829799, now seen corresponding path program 1 times [2019-09-10 07:29:21,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:21,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:21,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:21,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:21,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:21,810 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-10 07:29:21,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:21,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:29:21,811 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:21,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:29:21,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:29:21,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:29:21,816 INFO L87 Difference]: Start difference. First operand 235 states and 292 transitions. Second operand 5 states. [2019-09-10 07:29:22,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:22,056 INFO L93 Difference]: Finished difference Result 181 states and 223 transitions. [2019-09-10 07:29:22,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:29:22,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-09-10 07:29:22,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:22,059 INFO L225 Difference]: With dead ends: 181 [2019-09-10 07:29:22,059 INFO L226 Difference]: Without dead ends: 181 [2019-09-10 07:29:22,060 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-10 07:29:22,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-10 07:29:22,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-09-10 07:29:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-10 07:29:22,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 223 transitions. [2019-09-10 07:29:22,071 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 223 transitions. Word has length 51 [2019-09-10 07:29:22,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:22,072 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 223 transitions. [2019-09-10 07:29:22,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:29:22,072 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 223 transitions. [2019-09-10 07:29:22,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-10 07:29:22,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:22,074 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] [2019-09-10 07:29:22,075 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:22,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:22,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1063133710, now seen corresponding path program 1 times [2019-09-10 07:29:22,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:22,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:22,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:22,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:22,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:22,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-10 07:29:22,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:22,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:29:22,176 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:22,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:29:22,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:29:22,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:29:22,178 INFO L87 Difference]: Start difference. First operand 181 states and 223 transitions. Second operand 5 states. [2019-09-10 07:29:22,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:22,421 INFO L93 Difference]: Finished difference Result 243 states and 308 transitions. [2019-09-10 07:29:22,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:29:22,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-09-10 07:29:22,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:22,425 INFO L225 Difference]: With dead ends: 243 [2019-09-10 07:29:22,426 INFO L226 Difference]: Without dead ends: 243 [2019-09-10 07:29:22,427 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-10 07:29:22,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-09-10 07:29:22,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 219. [2019-09-10 07:29:22,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-10 07:29:22,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 285 transitions. [2019-09-10 07:29:22,457 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 285 transitions. Word has length 51 [2019-09-10 07:29:22,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:22,458 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 285 transitions. [2019-09-10 07:29:22,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:29:22,458 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 285 transitions. [2019-09-10 07:29:22,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 07:29:22,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:22,462 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] [2019-09-10 07:29:22,462 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:22,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:22,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1591584928, now seen corresponding path program 1 times [2019-09-10 07:29:22,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:22,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:22,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:22,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:22,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:22,699 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-10 07:29:22,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:22,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:29:22,700 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:22,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:29:22,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:29:22,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:29:22,701 INFO L87 Difference]: Start difference. First operand 219 states and 285 transitions. Second operand 8 states. [2019-09-10 07:29:23,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:23,037 INFO L93 Difference]: Finished difference Result 339 states and 445 transitions. [2019-09-10 07:29:23,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:29:23,038 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-09-10 07:29:23,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:23,040 INFO L225 Difference]: With dead ends: 339 [2019-09-10 07:29:23,041 INFO L226 Difference]: Without dead ends: 339 [2019-09-10 07:29:23,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:29:23,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-09-10 07:29:23,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 219. [2019-09-10 07:29:23,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-10 07:29:23,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 284 transitions. [2019-09-10 07:29:23,053 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 284 transitions. Word has length 52 [2019-09-10 07:29:23,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:23,054 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 284 transitions. [2019-09-10 07:29:23,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:29:23,054 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 284 transitions. [2019-09-10 07:29:23,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 07:29:23,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:23,056 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] [2019-09-10 07:29:23,056 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:23,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:23,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1153830128, now seen corresponding path program 1 times [2019-09-10 07:29:23,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:23,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:23,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:23,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:23,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:23,296 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-10 07:29:23,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:23,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:29:23,297 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:23,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:29:23,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:29:23,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:29:23,300 INFO L87 Difference]: Start difference. First operand 219 states and 284 transitions. Second operand 9 states. [2019-09-10 07:29:24,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:24,066 INFO L93 Difference]: Finished difference Result 529 states and 732 transitions. [2019-09-10 07:29:24,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:29:24,067 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-09-10 07:29:24,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:24,070 INFO L225 Difference]: With dead ends: 529 [2019-09-10 07:29:24,070 INFO L226 Difference]: Without dead ends: 529 [2019-09-10 07:29:24,071 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-10 07:29:24,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-09-10 07:29:24,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 219. [2019-09-10 07:29:24,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-10 07:29:24,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 283 transitions. [2019-09-10 07:29:24,082 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 283 transitions. Word has length 52 [2019-09-10 07:29:24,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:24,083 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 283 transitions. [2019-09-10 07:29:24,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:29:24,083 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 283 transitions. [2019-09-10 07:29:24,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 07:29:24,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:24,084 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] [2019-09-10 07:29:24,085 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:24,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:24,085 INFO L82 PathProgramCache]: Analyzing trace with hash 709117384, now seen corresponding path program 1 times [2019-09-10 07:29:24,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:24,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:24,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:24,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:24,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:24,225 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-10 07:29:24,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:24,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:29:24,226 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:24,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:29:24,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:29:24,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:29:24,229 INFO L87 Difference]: Start difference. First operand 219 states and 283 transitions. Second operand 9 states. [2019-09-10 07:29:25,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:25,025 INFO L93 Difference]: Finished difference Result 441 states and 613 transitions. [2019-09-10 07:29:25,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 07:29:25,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-09-10 07:29:25,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:25,031 INFO L225 Difference]: With dead ends: 441 [2019-09-10 07:29:25,031 INFO L226 Difference]: Without dead ends: 441 [2019-09-10 07:29:25,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-10 07:29:25,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-09-10 07:29:25,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 219. [2019-09-10 07:29:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-10 07:29:25,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 282 transitions. [2019-09-10 07:29:25,041 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 282 transitions. Word has length 52 [2019-09-10 07:29:25,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:25,041 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 282 transitions. [2019-09-10 07:29:25,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:29:25,041 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 282 transitions. [2019-09-10 07:29:25,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 07:29:25,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:25,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] [2019-09-10 07:29:25,043 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:25,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:25,043 INFO L82 PathProgramCache]: Analyzing trace with hash -547853405, now seen corresponding path program 1 times [2019-09-10 07:29:25,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:25,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:25,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:25,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:25,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:25,785 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-10 07:29:25,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:25,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 07:29:25,786 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:25,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 07:29:25,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 07:29:25,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:29:25,787 INFO L87 Difference]: Start difference. First operand 219 states and 282 transitions. Second operand 15 states. [2019-09-10 07:29:26,371 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 07:29:26,509 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 07:29:27,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:27,209 INFO L93 Difference]: Finished difference Result 343 states and 467 transitions. [2019-09-10 07:29:27,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:29:27,211 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-09-10 07:29:27,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:27,214 INFO L225 Difference]: With dead ends: 343 [2019-09-10 07:29:27,215 INFO L226 Difference]: Without dead ends: 343 [2019-09-10 07:29:27,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-09-10 07:29:27,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-09-10 07:29:27,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 208. [2019-09-10 07:29:27,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-10 07:29:27,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 268 transitions. [2019-09-10 07:29:27,222 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 268 transitions. Word has length 54 [2019-09-10 07:29:27,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:27,223 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 268 transitions. [2019-09-10 07:29:27,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 07:29:27,223 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 268 transitions. [2019-09-10 07:29:27,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 07:29:27,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:27,224 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] [2019-09-10 07:29:27,224 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:27,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:27,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1033756485, now seen corresponding path program 1 times [2019-09-10 07:29:27,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:27,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:27,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:27,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:27,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:27,947 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-10 07:29:27,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:27,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 07:29:27,948 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:27,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 07:29:27,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 07:29:27,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-10 07:29:27,949 INFO L87 Difference]: Start difference. First operand 208 states and 268 transitions. Second operand 16 states. [2019-09-10 07:29:28,486 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-10 07:29:29,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:29,427 INFO L93 Difference]: Finished difference Result 359 states and 466 transitions. [2019-09-10 07:29:29,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 07:29:29,430 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2019-09-10 07:29:29,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:29,432 INFO L225 Difference]: With dead ends: 359 [2019-09-10 07:29:29,432 INFO L226 Difference]: Without dead ends: 359 [2019-09-10 07:29:29,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2019-09-10 07:29:29,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-09-10 07:29:29,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 212. [2019-09-10 07:29:29,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-10 07:29:29,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 274 transitions. [2019-09-10 07:29:29,441 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 274 transitions. Word has length 54 [2019-09-10 07:29:29,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:29,443 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 274 transitions. [2019-09-10 07:29:29,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 07:29:29,443 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 274 transitions. [2019-09-10 07:29:29,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 07:29:29,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:29,444 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] [2019-09-10 07:29:29,444 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:29,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:29,445 INFO L82 PathProgramCache]: Analyzing trace with hash 372095971, now seen corresponding path program 1 times [2019-09-10 07:29:29,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:29,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:29,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:29,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:29,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:30,087 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-10 07:29:30,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:30,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:29:30,088 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:30,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:29:30,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:29:30,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:29:30,090 INFO L87 Difference]: Start difference. First operand 212 states and 274 transitions. Second operand 12 states. [2019-09-10 07:29:30,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:30,868 INFO L93 Difference]: Finished difference Result 416 states and 569 transitions. [2019-09-10 07:29:30,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 07:29:30,869 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-09-10 07:29:30,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:30,873 INFO L225 Difference]: With dead ends: 416 [2019-09-10 07:29:30,873 INFO L226 Difference]: Without dead ends: 416 [2019-09-10 07:29:30,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:29:30,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-09-10 07:29:30,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 208. [2019-09-10 07:29:30,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-10 07:29:30,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 269 transitions. [2019-09-10 07:29:30,881 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 269 transitions. Word has length 55 [2019-09-10 07:29:30,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:30,881 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 269 transitions. [2019-09-10 07:29:30,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:29:30,881 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 269 transitions. [2019-09-10 07:29:30,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 07:29:30,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:30,882 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] [2019-09-10 07:29:30,883 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:30,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:30,883 INFO L82 PathProgramCache]: Analyzing trace with hash -27651357, now seen corresponding path program 1 times [2019-09-10 07:29:30,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:30,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:30,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:30,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:30,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:31,526 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-10 07:29:31,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:31,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 07:29:31,526 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:31,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 07:29:31,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 07:29:31,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:29:31,528 INFO L87 Difference]: Start difference. First operand 208 states and 269 transitions. Second operand 14 states. [2019-09-10 07:29:32,009 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-09-10 07:29:32,167 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-09-10 07:29:32,314 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-09-10 07:29:32,478 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-09-10 07:29:33,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:33,044 INFO L93 Difference]: Finished difference Result 405 states and 555 transitions. [2019-09-10 07:29:33,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:29:33,045 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2019-09-10 07:29:33,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:33,047 INFO L225 Difference]: With dead ends: 405 [2019-09-10 07:29:33,047 INFO L226 Difference]: Without dead ends: 405 [2019-09-10 07:29:33,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:29:33,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-09-10 07:29:33,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 200. [2019-09-10 07:29:33,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-10 07:29:33,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 258 transitions. [2019-09-10 07:29:33,056 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 258 transitions. Word has length 55 [2019-09-10 07:29:33,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:33,057 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 258 transitions. [2019-09-10 07:29:33,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 07:29:33,057 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 258 transitions. [2019-09-10 07:29:33,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 07:29:33,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:33,058 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] [2019-09-10 07:29:33,058 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:33,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:33,059 INFO L82 PathProgramCache]: Analyzing trace with hash 320614258, now seen corresponding path program 1 times [2019-09-10 07:29:33,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:33,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:33,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:33,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:33,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:33,203 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-10 07:29:33,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:33,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:29:33,204 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:33,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:29:33,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:29:33,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:29:33,205 INFO L87 Difference]: Start difference. First operand 200 states and 258 transitions. Second operand 9 states. [2019-09-10 07:29:33,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:33,718 INFO L93 Difference]: Finished difference Result 247 states and 325 transitions. [2019-09-10 07:29:33,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:29:33,719 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-09-10 07:29:33,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:33,720 INFO L225 Difference]: With dead ends: 247 [2019-09-10 07:29:33,721 INFO L226 Difference]: Without dead ends: 247 [2019-09-10 07:29:33,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:29:33,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-09-10 07:29:33,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 200. [2019-09-10 07:29:33,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-10 07:29:33,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 256 transitions. [2019-09-10 07:29:33,729 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 256 transitions. Word has length 55 [2019-09-10 07:29:33,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:33,729 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 256 transitions. [2019-09-10 07:29:33,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:29:33,729 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 256 transitions. [2019-09-10 07:29:33,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 07:29:33,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:33,737 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] [2019-09-10 07:29:33,737 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:33,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:33,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1777208038, now seen corresponding path program 1 times [2019-09-10 07:29:33,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:33,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:33,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:33,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:33,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:33,856 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-10 07:29:33,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:33,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:29:33,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:33,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:29:33,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:29:33,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:29:33,859 INFO L87 Difference]: Start difference. First operand 200 states and 256 transitions. Second operand 9 states. [2019-09-10 07:29:34,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:34,377 INFO L93 Difference]: Finished difference Result 320 states and 424 transitions. [2019-09-10 07:29:34,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 07:29:34,381 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-09-10 07:29:34,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:34,383 INFO L225 Difference]: With dead ends: 320 [2019-09-10 07:29:34,383 INFO L226 Difference]: Without dead ends: 320 [2019-09-10 07:29:34,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:29:34,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-10 07:29:34,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 200. [2019-09-10 07:29:34,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-10 07:29:34,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 255 transitions. [2019-09-10 07:29:34,389 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 255 transitions. Word has length 55 [2019-09-10 07:29:34,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:34,389 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 255 transitions. [2019-09-10 07:29:34,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:29:34,390 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 255 transitions. [2019-09-10 07:29:34,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 07:29:34,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:34,391 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] [2019-09-10 07:29:34,391 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:34,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:34,391 INFO L82 PathProgramCache]: Analyzing trace with hash 570385884, now seen corresponding path program 1 times [2019-09-10 07:29:34,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:34,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:34,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:34,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:34,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:34,496 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-10 07:29:34,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:34,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:29:34,497 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:34,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:29:34,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:29:34,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:29:34,498 INFO L87 Difference]: Start difference. First operand 200 states and 255 transitions. Second operand 9 states. [2019-09-10 07:29:34,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:34,977 INFO L93 Difference]: Finished difference Result 320 states and 423 transitions. [2019-09-10 07:29:34,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 07:29:34,980 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-09-10 07:29:34,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:34,981 INFO L225 Difference]: With dead ends: 320 [2019-09-10 07:29:34,981 INFO L226 Difference]: Without dead ends: 320 [2019-09-10 07:29:34,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:29:34,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-10 07:29:34,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 200. [2019-09-10 07:29:34,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-10 07:29:34,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 254 transitions. [2019-09-10 07:29:34,988 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 254 transitions. Word has length 56 [2019-09-10 07:29:34,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:34,988 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 254 transitions. [2019-09-10 07:29:34,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:29:34,989 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 254 transitions. [2019-09-10 07:29:34,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 07:29:34,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:34,990 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] [2019-09-10 07:29:34,990 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:34,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:34,990 INFO L82 PathProgramCache]: Analyzing trace with hash 474332301, now seen corresponding path program 1 times [2019-09-10 07:29:34,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:34,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:34,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:34,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:34,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:35,340 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-10 07:29:35,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:35,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 07:29:35,341 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:35,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:29:35,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:29:35,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:29:35,342 INFO L87 Difference]: Start difference. First operand 200 states and 254 transitions. Second operand 12 states. [2019-09-10 07:29:36,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:36,273 INFO L93 Difference]: Finished difference Result 500 states and 689 transitions. [2019-09-10 07:29:36,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:29:36,273 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-09-10 07:29:36,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:36,276 INFO L225 Difference]: With dead ends: 500 [2019-09-10 07:29:36,276 INFO L226 Difference]: Without dead ends: 500 [2019-09-10 07:29:36,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:29:36,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-09-10 07:29:36,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 194. [2019-09-10 07:29:36,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-10 07:29:36,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 247 transitions. [2019-09-10 07:29:36,283 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 247 transitions. Word has length 57 [2019-09-10 07:29:36,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:36,284 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 247 transitions. [2019-09-10 07:29:36,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:29:36,284 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 247 transitions. [2019-09-10 07:29:36,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-10 07:29:36,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:36,285 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] [2019-09-10 07:29:36,285 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:36,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:36,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1201954827, now seen corresponding path program 1 times [2019-09-10 07:29:36,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:36,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:36,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:36,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:36,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:36,685 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-10 07:29:36,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:36,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 07:29:36,686 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:36,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:29:36,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:29:36,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:29:36,687 INFO L87 Difference]: Start difference. First operand 194 states and 247 transitions. Second operand 18 states. [2019-09-10 07:29:36,844 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-10 07:29:38,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:38,279 INFO L93 Difference]: Finished difference Result 312 states and 411 transitions. [2019-09-10 07:29:38,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 07:29:38,281 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2019-09-10 07:29:38,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:38,282 INFO L225 Difference]: With dead ends: 312 [2019-09-10 07:29:38,283 INFO L226 Difference]: Without dead ends: 312 [2019-09-10 07:29:38,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=239, Invalid=951, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 07:29:38,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-09-10 07:29:38,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 194. [2019-09-10 07:29:38,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-10 07:29:38,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 246 transitions. [2019-09-10 07:29:38,289 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 246 transitions. Word has length 57 [2019-09-10 07:29:38,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:38,289 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 246 transitions. [2019-09-10 07:29:38,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:29:38,290 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 246 transitions. [2019-09-10 07:29:38,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 07:29:38,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:38,290 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] [2019-09-10 07:29:38,291 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:38,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:38,291 INFO L82 PathProgramCache]: Analyzing trace with hash 2038592951, now seen corresponding path program 1 times [2019-09-10 07:29:38,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:38,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:38,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:38,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:38,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:38,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:29:38,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:38,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 07:29:38,506 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:38,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 07:29:38,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 07:29:38,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-10 07:29:38,507 INFO L87 Difference]: Start difference. First operand 194 states and 246 transitions. Second operand 10 states. [2019-09-10 07:29:38,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:38,932 INFO L93 Difference]: Finished difference Result 442 states and 625 transitions. [2019-09-10 07:29:38,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 07:29:38,933 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-09-10 07:29:38,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:38,935 INFO L225 Difference]: With dead ends: 442 [2019-09-10 07:29:38,935 INFO L226 Difference]: Without dead ends: 442 [2019-09-10 07:29:38,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-10 07:29:38,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-09-10 07:29:38,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 176. [2019-09-10 07:29:38,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-10 07:29:38,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 227 transitions. [2019-09-10 07:29:38,942 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 227 transitions. Word has length 58 [2019-09-10 07:29:38,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:38,943 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 227 transitions. [2019-09-10 07:29:38,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 07:29:38,943 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 227 transitions. [2019-09-10 07:29:38,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 07:29:38,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:38,944 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] [2019-09-10 07:29:38,944 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:38,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:38,945 INFO L82 PathProgramCache]: Analyzing trace with hash 467030080, now seen corresponding path program 1 times [2019-09-10 07:29:38,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:38,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:38,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:38,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:38,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:39,293 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 22 [2019-09-10 07:29:39,582 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-10 07:29:39,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:39,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 07:29:39,583 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:39,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 07:29:39,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 07:29:39,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:29:39,584 INFO L87 Difference]: Start difference. First operand 176 states and 227 transitions. Second operand 13 states. [2019-09-10 07:29:40,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:40,323 INFO L93 Difference]: Finished difference Result 358 states and 501 transitions. [2019-09-10 07:29:40,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 07:29:40,323 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 58 [2019-09-10 07:29:40,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:40,325 INFO L225 Difference]: With dead ends: 358 [2019-09-10 07:29:40,325 INFO L226 Difference]: Without dead ends: 358 [2019-09-10 07:29:40,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-09-10 07:29:40,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-09-10 07:29:40,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 164. [2019-09-10 07:29:40,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-10 07:29:40,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 215 transitions. [2019-09-10 07:29:40,335 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 215 transitions. Word has length 58 [2019-09-10 07:29:40,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:40,335 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 215 transitions. [2019-09-10 07:29:40,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 07:29:40,336 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 215 transitions. [2019-09-10 07:29:40,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 07:29:40,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:40,337 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-10 07:29:40,337 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:40,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:40,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1716811533, now seen corresponding path program 1 times [2019-09-10 07:29:40,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:40,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:40,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:40,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:40,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:40,392 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-10 07:29:40,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:40,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:29:40,392 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:40,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:29:40,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:29:40,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:29:40,393 INFO L87 Difference]: Start difference. First operand 164 states and 215 transitions. Second operand 3 states. [2019-09-10 07:29:40,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:40,419 INFO L93 Difference]: Finished difference Result 240 states and 325 transitions. [2019-09-10 07:29:40,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:29:40,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-10 07:29:40,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:40,421 INFO L225 Difference]: With dead ends: 240 [2019-09-10 07:29:40,421 INFO L226 Difference]: Without dead ends: 240 [2019-09-10 07:29:40,422 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-10 07:29:40,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-09-10 07:29:40,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2019-09-10 07:29:40,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-09-10 07:29:40,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 324 transitions. [2019-09-10 07:29:40,429 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 324 transitions. Word has length 75 [2019-09-10 07:29:40,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:40,429 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 324 transitions. [2019-09-10 07:29:40,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:29:40,429 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 324 transitions. [2019-09-10 07:29:40,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:29:40,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:40,431 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] [2019-09-10 07:29:40,432 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:40,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:40,432 INFO L82 PathProgramCache]: Analyzing trace with hash -102634, now seen corresponding path program 1 times [2019-09-10 07:29:40,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:40,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:40,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:40,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:40,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:40,517 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-10 07:29:40,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:40,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:29:40,518 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:40,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:29:40,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:29:40,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:29:40,520 INFO L87 Difference]: Start difference. First operand 238 states and 324 transitions. Second operand 7 states. [2019-09-10 07:29:40,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:40,862 INFO L93 Difference]: Finished difference Result 736 states and 1043 transitions. [2019-09-10 07:29:40,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:29:40,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2019-09-10 07:29:40,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:40,866 INFO L225 Difference]: With dead ends: 736 [2019-09-10 07:29:40,866 INFO L226 Difference]: Without dead ends: 736 [2019-09-10 07:29:40,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:29:40,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-09-10 07:29:40,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 434. [2019-09-10 07:29:40,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-09-10 07:29:40,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 616 transitions. [2019-09-10 07:29:40,880 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 616 transitions. Word has length 77 [2019-09-10 07:29:40,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:40,880 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 616 transitions. [2019-09-10 07:29:40,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:29:40,880 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 616 transitions. [2019-09-10 07:29:40,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:29:40,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:40,882 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] [2019-09-10 07:29:40,883 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:40,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:40,883 INFO L82 PathProgramCache]: Analyzing trace with hash -85584643, now seen corresponding path program 1 times [2019-09-10 07:29:40,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:40,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:40,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:40,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:40,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:40,932 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-10 07:29:40,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:40,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:29:40,932 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:40,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:29:40,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:29:40,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:29:40,933 INFO L87 Difference]: Start difference. First operand 434 states and 616 transitions. Second operand 3 states. [2019-09-10 07:29:40,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:40,961 INFO L93 Difference]: Finished difference Result 748 states and 1057 transitions. [2019-09-10 07:29:40,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:29:40,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 07:29:40,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:40,965 INFO L225 Difference]: With dead ends: 748 [2019-09-10 07:29:40,965 INFO L226 Difference]: Without dead ends: 748 [2019-09-10 07:29:40,966 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-10 07:29:40,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-09-10 07:29:40,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 738. [2019-09-10 07:29:40,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-09-10 07:29:40,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1048 transitions. [2019-09-10 07:29:40,980 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1048 transitions. Word has length 77 [2019-09-10 07:29:40,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:40,981 INFO L475 AbstractCegarLoop]: Abstraction has 738 states and 1048 transitions. [2019-09-10 07:29:40,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:29:40,981 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1048 transitions. [2019-09-10 07:29:40,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:29:40,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:40,983 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] [2019-09-10 07:29:40,983 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:40,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:40,983 INFO L82 PathProgramCache]: Analyzing trace with hash -19091131, now seen corresponding path program 1 times [2019-09-10 07:29:40,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:40,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:40,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:40,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:40,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:41,038 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-10 07:29:41,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:41,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:29:41,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:41,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:29:41,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:29:41,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:29:41,040 INFO L87 Difference]: Start difference. First operand 738 states and 1048 transitions. Second operand 3 states. [2019-09-10 07:29:41,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:41,070 INFO L93 Difference]: Finished difference Result 1076 states and 1533 transitions. [2019-09-10 07:29:41,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:29:41,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 07:29:41,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:41,075 INFO L225 Difference]: With dead ends: 1076 [2019-09-10 07:29:41,075 INFO L226 Difference]: Without dead ends: 1076 [2019-09-10 07:29:41,075 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-10 07:29:41,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2019-09-10 07:29:41,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1074. [2019-09-10 07:29:41,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1074 states. [2019-09-10 07:29:41,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1532 transitions. [2019-09-10 07:29:41,098 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1532 transitions. Word has length 77 [2019-09-10 07:29:41,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:41,098 INFO L475 AbstractCegarLoop]: Abstraction has 1074 states and 1532 transitions. [2019-09-10 07:29:41,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:29:41,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1532 transitions. [2019-09-10 07:29:41,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:29:41,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:41,100 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] [2019-09-10 07:29:41,101 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:41,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:41,101 INFO L82 PathProgramCache]: Analyzing trace with hash 614575382, now seen corresponding path program 1 times [2019-09-10 07:29:41,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:41,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:41,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:41,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:41,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:41,215 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-10 07:29:41,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:41,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:29:41,216 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:41,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:29:41,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:29:41,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:29:41,218 INFO L87 Difference]: Start difference. First operand 1074 states and 1532 transitions. Second operand 7 states. [2019-09-10 07:29:41,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:41,790 INFO L93 Difference]: Finished difference Result 2944 states and 4178 transitions. [2019-09-10 07:29:41,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:29:41,791 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2019-09-10 07:29:41,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:41,807 INFO L225 Difference]: With dead ends: 2944 [2019-09-10 07:29:41,808 INFO L226 Difference]: Without dead ends: 2944 [2019-09-10 07:29:41,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:29:41,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2019-09-10 07:29:41,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 1854. [2019-09-10 07:29:41,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1854 states. [2019-09-10 07:29:41,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2666 transitions. [2019-09-10 07:29:41,872 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2666 transitions. Word has length 77 [2019-09-10 07:29:41,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:41,872 INFO L475 AbstractCegarLoop]: Abstraction has 1854 states and 2666 transitions. [2019-09-10 07:29:41,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:29:41,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2666 transitions. [2019-09-10 07:29:41,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:29:41,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:41,875 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] [2019-09-10 07:29:41,876 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:41,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:41,876 INFO L82 PathProgramCache]: Analyzing trace with hash -983370934, now seen corresponding path program 1 times [2019-09-10 07:29:41,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:41,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:41,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:41,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:41,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:41,956 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-10 07:29:41,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:41,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:29:41,956 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:41,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:29:41,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:29:41,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:29:41,957 INFO L87 Difference]: Start difference. First operand 1854 states and 2666 transitions. Second operand 6 states. [2019-09-10 07:29:42,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:42,034 INFO L93 Difference]: Finished difference Result 3316 states and 4669 transitions. [2019-09-10 07:29:42,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 07:29:42,036 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-09-10 07:29:42,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:42,051 INFO L225 Difference]: With dead ends: 3316 [2019-09-10 07:29:42,051 INFO L226 Difference]: Without dead ends: 3316 [2019-09-10 07:29:42,053 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-10 07:29:42,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3316 states. [2019-09-10 07:29:42,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3316 to 1902. [2019-09-10 07:29:42,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1902 states. [2019-09-10 07:29:42,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 2706 transitions. [2019-09-10 07:29:42,108 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 2706 transitions. Word has length 78 [2019-09-10 07:29:42,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:42,108 INFO L475 AbstractCegarLoop]: Abstraction has 1902 states and 2706 transitions. [2019-09-10 07:29:42,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:29:42,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2706 transitions. [2019-09-10 07:29:42,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:29:42,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:42,110 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] [2019-09-10 07:29:42,111 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:42,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:42,111 INFO L82 PathProgramCache]: Analyzing trace with hash 2117428995, now seen corresponding path program 1 times [2019-09-10 07:29:42,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:42,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:42,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:42,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:42,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:42,194 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-10 07:29:42,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:42,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:29:42,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:42,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:29:42,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:29:42,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:29:42,198 INFO L87 Difference]: Start difference. First operand 1902 states and 2706 transitions. Second operand 7 states. [2019-09-10 07:29:42,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:42,480 INFO L93 Difference]: Finished difference Result 4104 states and 5743 transitions. [2019-09-10 07:29:42,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 07:29:42,481 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 78 [2019-09-10 07:29:42,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:42,502 INFO L225 Difference]: With dead ends: 4104 [2019-09-10 07:29:42,502 INFO L226 Difference]: Without dead ends: 4104 [2019-09-10 07:29:42,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 07:29:42,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4104 states. [2019-09-10 07:29:42,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4104 to 2438. [2019-09-10 07:29:42,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2438 states. [2019-09-10 07:29:42,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2438 states to 2438 states and 3430 transitions. [2019-09-10 07:29:42,603 INFO L78 Accepts]: Start accepts. Automaton has 2438 states and 3430 transitions. Word has length 78 [2019-09-10 07:29:42,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:42,603 INFO L475 AbstractCegarLoop]: Abstraction has 2438 states and 3430 transitions. [2019-09-10 07:29:42,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:29:42,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2438 states and 3430 transitions. [2019-09-10 07:29:42,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:29:42,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:42,607 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] [2019-09-10 07:29:42,607 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:42,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:42,608 INFO L82 PathProgramCache]: Analyzing trace with hash 694564540, now seen corresponding path program 1 times [2019-09-10 07:29:42,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:42,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:42,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:42,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:42,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:42,683 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-10 07:29:42,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:42,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:29:42,683 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:42,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:29:42,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:29:42,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:29:42,684 INFO L87 Difference]: Start difference. First operand 2438 states and 3430 transitions. Second operand 3 states. [2019-09-10 07:29:42,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:42,709 INFO L93 Difference]: Finished difference Result 3448 states and 4785 transitions. [2019-09-10 07:29:42,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:29:42,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 07:29:42,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:42,725 INFO L225 Difference]: With dead ends: 3448 [2019-09-10 07:29:42,725 INFO L226 Difference]: Without dead ends: 3448 [2019-09-10 07:29:42,725 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-10 07:29:42,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3448 states. [2019-09-10 07:29:42,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3448 to 2476. [2019-09-10 07:29:42,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2476 states. [2019-09-10 07:29:42,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3457 transitions. [2019-09-10 07:29:42,804 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3457 transitions. Word has length 79 [2019-09-10 07:29:42,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:42,804 INFO L475 AbstractCegarLoop]: Abstraction has 2476 states and 3457 transitions. [2019-09-10 07:29:42,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:29:42,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3457 transitions. [2019-09-10 07:29:42,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 07:29:42,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:42,806 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] [2019-09-10 07:29:42,806 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:42,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:42,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1702117812, now seen corresponding path program 1 times [2019-09-10 07:29:42,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:42,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:42,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:42,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:42,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:42,864 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-10 07:29:42,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:42,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:29:42,865 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:42,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:29:42,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:29:42,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:29:42,866 INFO L87 Difference]: Start difference. First operand 2476 states and 3457 transitions. Second operand 3 states. [2019-09-10 07:29:42,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:42,889 INFO L93 Difference]: Finished difference Result 2902 states and 3959 transitions. [2019-09-10 07:29:42,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:29:42,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-10 07:29:42,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:42,919 INFO L225 Difference]: With dead ends: 2902 [2019-09-10 07:29:42,919 INFO L226 Difference]: Without dead ends: 2902 [2019-09-10 07:29:42,920 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-10 07:29:42,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2019-09-10 07:29:42,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 2270. [2019-09-10 07:29:42,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2270 states. [2019-09-10 07:29:42,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 3102 transitions. [2019-09-10 07:29:42,981 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 3102 transitions. Word has length 80 [2019-09-10 07:29:42,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:42,981 INFO L475 AbstractCegarLoop]: Abstraction has 2270 states and 3102 transitions. [2019-09-10 07:29:42,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:29:42,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 3102 transitions. [2019-09-10 07:29:42,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:29:42,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:42,983 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] [2019-09-10 07:29:42,983 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:42,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:42,983 INFO L82 PathProgramCache]: Analyzing trace with hash -68913520, now seen corresponding path program 1 times [2019-09-10 07:29:42,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:42,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:42,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:42,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:42,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:43,042 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-10 07:29:43,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:43,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:29:43,042 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:43,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:29:43,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:29:43,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:29:43,043 INFO L87 Difference]: Start difference. First operand 2270 states and 3102 transitions. Second operand 3 states. [2019-09-10 07:29:43,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:43,069 INFO L93 Difference]: Finished difference Result 2558 states and 3461 transitions. [2019-09-10 07:29:43,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:29:43,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 07:29:43,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:43,075 INFO L225 Difference]: With dead ends: 2558 [2019-09-10 07:29:43,075 INFO L226 Difference]: Without dead ends: 2558 [2019-09-10 07:29:43,075 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-10 07:29:43,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2019-09-10 07:29:43,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 2476. [2019-09-10 07:29:43,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2476 states. [2019-09-10 07:29:43,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3350 transitions. [2019-09-10 07:29:43,119 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3350 transitions. Word has length 81 [2019-09-10 07:29:43,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:43,119 INFO L475 AbstractCegarLoop]: Abstraction has 2476 states and 3350 transitions. [2019-09-10 07:29:43,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:29:43,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3350 transitions. [2019-09-10 07:29:43,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:29:43,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:43,122 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] [2019-09-10 07:29:43,123 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:43,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:43,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1536851179, now seen corresponding path program 1 times [2019-09-10 07:29:43,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:43,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:43,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:43,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:43,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:43,250 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 07:29:43,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:43,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:29:43,251 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:43,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:29:43,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:29:43,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:29:43,252 INFO L87 Difference]: Start difference. First operand 2476 states and 3350 transitions. Second operand 5 states. [2019-09-10 07:29:43,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:43,331 INFO L93 Difference]: Finished difference Result 7470 states and 10091 transitions. [2019-09-10 07:29:43,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:29:43,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-09-10 07:29:43,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:43,349 INFO L225 Difference]: With dead ends: 7470 [2019-09-10 07:29:43,349 INFO L226 Difference]: Without dead ends: 7470 [2019-09-10 07:29:43,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:29:43,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7470 states. [2019-09-10 07:29:43,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7470 to 4208. [2019-09-10 07:29:43,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4208 states. [2019-09-10 07:29:43,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4208 states to 4208 states and 5686 transitions. [2019-09-10 07:29:43,440 INFO L78 Accepts]: Start accepts. Automaton has 4208 states and 5686 transitions. Word has length 100 [2019-09-10 07:29:43,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:43,440 INFO L475 AbstractCegarLoop]: Abstraction has 4208 states and 5686 transitions. [2019-09-10 07:29:43,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:29:43,441 INFO L276 IsEmpty]: Start isEmpty. Operand 4208 states and 5686 transitions. [2019-09-10 07:29:43,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:29:43,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:43,443 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] [2019-09-10 07:29:43,444 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:43,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:43,444 INFO L82 PathProgramCache]: Analyzing trace with hash -2143438101, now seen corresponding path program 1 times [2019-09-10 07:29:43,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:43,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:43,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:43,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:43,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:43,529 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 07:29:43,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:43,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:29:43,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:43,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:29:43,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:29:43,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:29:43,532 INFO L87 Difference]: Start difference. First operand 4208 states and 5686 transitions. Second operand 5 states. [2019-09-10 07:29:43,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:43,630 INFO L93 Difference]: Finished difference Result 9274 states and 12529 transitions. [2019-09-10 07:29:43,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:29:43,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-09-10 07:29:43,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:43,653 INFO L225 Difference]: With dead ends: 9274 [2019-09-10 07:29:43,653 INFO L226 Difference]: Without dead ends: 9274 [2019-09-10 07:29:43,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:29:43,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9274 states. [2019-09-10 07:29:43,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9274 to 6766. [2019-09-10 07:29:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6766 states. [2019-09-10 07:29:43,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6766 states to 6766 states and 9126 transitions. [2019-09-10 07:29:43,789 INFO L78 Accepts]: Start accepts. Automaton has 6766 states and 9126 transitions. Word has length 100 [2019-09-10 07:29:43,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:43,790 INFO L475 AbstractCegarLoop]: Abstraction has 6766 states and 9126 transitions. [2019-09-10 07:29:43,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:29:43,790 INFO L276 IsEmpty]: Start isEmpty. Operand 6766 states and 9126 transitions. [2019-09-10 07:29:43,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-10 07:29:43,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:43,793 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:29:43,794 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:43,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:43,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1776610354, now seen corresponding path program 1 times [2019-09-10 07:29:43,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:43,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:43,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:43,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:43,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:43,892 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:29:43,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:43,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:29:43,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:43,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:29:43,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:29:43,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:29:43,894 INFO L87 Difference]: Start difference. First operand 6766 states and 9126 transitions. Second operand 5 states. [2019-09-10 07:29:43,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:43,976 INFO L93 Difference]: Finished difference Result 8604 states and 11602 transitions. [2019-09-10 07:29:43,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:29:43,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-10 07:29:43,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:43,997 INFO L225 Difference]: With dead ends: 8604 [2019-09-10 07:29:43,997 INFO L226 Difference]: Without dead ends: 8604 [2019-09-10 07:29:43,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:29:44,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8604 states. [2019-09-10 07:29:44,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8604 to 7672. [2019-09-10 07:29:44,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7672 states. [2019-09-10 07:29:44,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7672 states to 7672 states and 10358 transitions. [2019-09-10 07:29:44,125 INFO L78 Accepts]: Start accepts. Automaton has 7672 states and 10358 transitions. Word has length 101 [2019-09-10 07:29:44,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:44,125 INFO L475 AbstractCegarLoop]: Abstraction has 7672 states and 10358 transitions. [2019-09-10 07:29:44,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:29:44,126 INFO L276 IsEmpty]: Start isEmpty. Operand 7672 states and 10358 transitions. [2019-09-10 07:29:44,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:29:44,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:44,132 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] [2019-09-10 07:29:44,132 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:44,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:44,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1162299485, now seen corresponding path program 1 times [2019-09-10 07:29:44,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:44,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:44,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:44,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:44,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:29:44,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:29:44,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:29:44,356 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 103 with the following transitions: [2019-09-10 07:29:44,357 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [111], [150], [153], [154], [156], [176], [216], [219], [222], [225], [265], [613], [616], [650], [804], [807], [811], [814], [817], [821], [823], [852], [855], [870], [872], [874], [877], [880], [885], [888], [894], [896], [899], [904], [907], [911], [921], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:29:44,397 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:29:44,398 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:29:44,499 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:29:44,873 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:29:44,876 INFO L272 AbstractInterpreter]: Visited 90 different actions 301 times. Merged at 34 different actions 188 times. Widened at 9 different actions 19 times. Performed 1089 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1089 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 18 fixpoints after 7 different actions. Largest state had 134 variables. [2019-09-10 07:29:44,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:44,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:29:44,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:29:44,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-10 07:29:44,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:44,966 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:29:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:45,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 07:29:45,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:29:45,162 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:29:45,162 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:29:45,200 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:29:45,210 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:29:45,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 13 [2019-09-10 07:29:45,211 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:45,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:29:45,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:29:45,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:29:45,213 INFO L87 Difference]: Start difference. First operand 7672 states and 10358 transitions. Second operand 3 states. [2019-09-10 07:29:45,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:45,251 INFO L93 Difference]: Finished difference Result 6888 states and 8989 transitions. [2019-09-10 07:29:45,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:29:45,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 07:29:45,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:45,266 INFO L225 Difference]: With dead ends: 6888 [2019-09-10 07:29:45,266 INFO L226 Difference]: Without dead ends: 6888 [2019-09-10 07:29:45,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:29:45,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6888 states. [2019-09-10 07:29:45,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6888 to 6886. [2019-09-10 07:29:45,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6886 states. [2019-09-10 07:29:45,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6886 states to 6886 states and 8988 transitions. [2019-09-10 07:29:45,410 INFO L78 Accepts]: Start accepts. Automaton has 6886 states and 8988 transitions. Word has length 102 [2019-09-10 07:29:45,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:45,411 INFO L475 AbstractCegarLoop]: Abstraction has 6886 states and 8988 transitions. [2019-09-10 07:29:45,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:29:45,411 INFO L276 IsEmpty]: Start isEmpty. Operand 6886 states and 8988 transitions. [2019-09-10 07:29:45,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 07:29:45,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:45,415 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:29:45,416 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:45,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:45,417 INFO L82 PathProgramCache]: Analyzing trace with hash 238429009, now seen corresponding path program 1 times [2019-09-10 07:29:45,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:45,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:45,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:45,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:45,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:45,671 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 07:29:45,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:29:45,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 07:29:45,672 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:29:45,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 07:29:45,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 07:29:45,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 07:29:45,673 INFO L87 Difference]: Start difference. First operand 6886 states and 8988 transitions. Second operand 9 states. [2019-09-10 07:29:46,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:29:46,184 INFO L93 Difference]: Finished difference Result 14030 states and 18227 transitions. [2019-09-10 07:29:46,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 07:29:46,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 07:29:46,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:29:46,210 INFO L225 Difference]: With dead ends: 14030 [2019-09-10 07:29:46,211 INFO L226 Difference]: Without dead ends: 14030 [2019-09-10 07:29:46,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-09-10 07:29:46,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14030 states. [2019-09-10 07:29:46,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14030 to 6886. [2019-09-10 07:29:46,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6886 states. [2019-09-10 07:29:46,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6886 states to 6886 states and 8986 transitions. [2019-09-10 07:29:46,381 INFO L78 Accepts]: Start accepts. Automaton has 6886 states and 8986 transitions. Word has length 102 [2019-09-10 07:29:46,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:29:46,381 INFO L475 AbstractCegarLoop]: Abstraction has 6886 states and 8986 transitions. [2019-09-10 07:29:46,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 07:29:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand 6886 states and 8986 transitions. [2019-09-10 07:29:46,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 07:29:46,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:29:46,384 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:29:46,384 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:29:46,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:46,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1663300300, now seen corresponding path program 1 times [2019-09-10 07:29:46,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:29:46,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:46,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:46,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:29:46,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:29:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:46,692 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:29:46,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:29:46,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:29:46,693 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 105 with the following transitions: [2019-09-10 07:29:46,694 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [111], [150], [153], [154], [156], [176], [216], [219], [222], [225], [265], [613], [616], [619], [622], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [848], [850], [852], [855], [870], [872], [874], [877], [892], [894], [896], [899], [902], [904], [907], [911], [913], [918], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:29:46,699 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:29:46,699 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:29:46,745 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:29:47,448 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:29:47,448 INFO L272 AbstractInterpreter]: Visited 97 different actions 497 times. Merged at 38 different actions 343 times. Widened at 16 different actions 54 times. Performed 1644 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1644 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 60 fixpoints after 16 different actions. Largest state had 134 variables. [2019-09-10 07:29:47,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:29:47,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:29:47,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:29:47,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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) [2019-09-10 07:29:47,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:29:47,468 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:29:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:29:47,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-10 07:29:47,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:29:47,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:29:48,269 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:29:48,269 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:29:48,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:29:49,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:29:49,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:29:49,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:29:49,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:29:50,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:29:50,813 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:29:50,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:29:50,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2019-09-10 07:29:50,818 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:29:50,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 07:29:50,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 07:29:50,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2019-09-10 07:29:50,819 INFO L87 Difference]: Start difference. First operand 6886 states and 8986 transitions. Second operand 21 states. [2019-09-10 07:29:51,036 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-10 07:29:53,554 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 07:29:54,551 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:29:54,869 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:29:55,086 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 07:29:55,274 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 07:29:55,635 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 07:29:55,943 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 07:29:56,291 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:29:57,111 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-10 07:29:57,906 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 07:29:58,139 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:29:58,321 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:29:58,970 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 07:29:59,276 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 07:29:59,870 WARN L188 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-10 07:30:00,148 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 07:30:00,416 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 07:30:00,689 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 07:30:00,980 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-10 07:30:01,507 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 07:30:01,884 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 07:30:02,128 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-09-10 07:30:03,389 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 07:30:03,724 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 07:30:04,090 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:30:05,278 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 07:30:06,113 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 07:30:06,540 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2019-09-10 07:30:07,012 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 07:30:07,267 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-09-10 07:30:07,754 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 07:30:08,654 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-09-10 07:30:09,554 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-10 07:30:09,990 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-10 07:30:10,359 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 07:30:10,656 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 07:30:11,602 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 07:30:12,028 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-10 07:30:12,486 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-10 07:30:12,869 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 07:30:13,333 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 07:30:13,721 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:30:14,036 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-09-10 07:30:14,540 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 07:30:14,970 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 75 [2019-09-10 07:30:15,335 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-09-10 07:30:15,617 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-09-10 07:30:15,965 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 07:30:16,254 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-10 07:30:16,515 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 07:30:16,737 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 07:30:17,085 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 07:30:17,802 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 07:30:18,093 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 07:30:19,660 WARN L188 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-09-10 07:30:20,021 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 07:30:20,314 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-10 07:30:20,689 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-10 07:30:21,233 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 07:30:21,421 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 07:30:22,367 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-10 07:30:22,890 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 07:30:23,284 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-09-10 07:30:23,622 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-09-10 07:30:24,126 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 07:30:24,438 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-09-10 07:30:24,808 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 07:30:25,073 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 07:30:25,895 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-09-10 07:30:26,452 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-09-10 07:30:26,977 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-10 07:30:27,448 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-09-10 07:30:27,778 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:30:28,180 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-10 07:30:28,600 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2019-09-10 07:30:28,942 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 07:30:29,251 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-09-10 07:30:29,703 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 07:30:29,890 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-09-10 07:30:30,301 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 07:30:30,702 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-10 07:30:31,006 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 07:30:31,326 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-09-10 07:30:31,814 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 71 [2019-09-10 07:30:32,364 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 07:30:32,682 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-09-10 07:30:33,042 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 07:30:33,438 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 07:30:33,743 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-09-10 07:30:34,168 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 75 [2019-09-10 07:30:34,449 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-09-10 07:30:34,769 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 07:30:34,977 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 07:30:35,452 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 07:30:35,854 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-09-10 07:30:36,477 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 07:30:36,721 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-09-10 07:30:37,063 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 07:30:37,320 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-09-10 07:30:37,550 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 07:30:37,798 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 07:30:37,996 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-10 07:30:38,215 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-09-10 07:30:42,360 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 07:30:42,893 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 07:30:43,181 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:30:43,641 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 07:30:44,521 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 07:30:45,504 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 07:30:45,824 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:30:46,402 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-09-10 07:30:46,661 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:30:47,063 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 07:30:47,397 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:30:47,656 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 07:30:48,037 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:30:48,497 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 07:30:49,520 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 07:30:50,112 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:30:50,712 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 07:30:51,138 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 07:30:51,542 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 07:30:51,835 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:30:52,323 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 07:30:52,797 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-09-10 07:30:53,176 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-09-10 07:30:53,463 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:30:53,798 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 07:30:54,193 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 07:30:54,957 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 74 [2019-09-10 07:30:55,665 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-10 07:30:56,064 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 07:30:56,513 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 07:30:57,102 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-09-10 07:30:57,769 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-09-10 07:30:58,045 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-09-10 07:30:58,653 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-10 07:30:59,176 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2019-09-10 07:30:59,609 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-10 07:30:59,830 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 07:31:00,228 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-10 07:31:00,588 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-10 07:31:01,297 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-09-10 07:31:01,780 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-10 07:31:02,265 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 75 [2019-09-10 07:31:02,978 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 07:31:03,211 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 07:31:03,722 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 07:31:04,155 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 07:31:04,464 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 07:31:05,048 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2019-09-10 07:31:05,531 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 07:31:06,100 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-09-10 07:31:06,568 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 07:31:06,927 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-09-10 07:31:07,447 WARN L188 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2019-09-10 07:31:07,896 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 07:31:08,418 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-09-10 07:31:09,039 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-09-10 07:31:09,474 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-09-10 07:31:10,100 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-09-10 07:31:11,671 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2019-09-10 07:31:11,871 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 07:31:12,254 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-09-10 07:31:12,479 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-09-10 07:31:12,757 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 58 [2019-09-10 07:31:12,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:31:12,828 INFO L93 Difference]: Finished difference Result 106204 states and 134712 transitions. [2019-09-10 07:31:12,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2019-09-10 07:31:12,828 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 104 [2019-09-10 07:31:12,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:31:13,092 INFO L225 Difference]: With dead ends: 106204 [2019-09-10 07:31:13,093 INFO L226 Difference]: Without dead ends: 106204 [2019-09-10 07:31:13,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 161 SyntacticMatches, 29 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15622 ImplicationChecksByTransitivity, 58.4s TimeCoverageRelationStatistics Valid=7670, Invalid=36220, Unknown=0, NotChecked=0, Total=43890 [2019-09-10 07:31:13,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106204 states. [2019-09-10 07:31:14,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106204 to 35134. [2019-09-10 07:31:14,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35134 states. [2019-09-10 07:31:14,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35134 states to 35134 states and 45588 transitions. [2019-09-10 07:31:14,092 INFO L78 Accepts]: Start accepts. Automaton has 35134 states and 45588 transitions. Word has length 104 [2019-09-10 07:31:14,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:31:14,092 INFO L475 AbstractCegarLoop]: Abstraction has 35134 states and 45588 transitions. [2019-09-10 07:31:14,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 07:31:14,093 INFO L276 IsEmpty]: Start isEmpty. Operand 35134 states and 45588 transitions. [2019-09-10 07:31:14,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 07:31:14,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:31:14,103 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:31:14,103 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:31:14,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:14,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1587740804, now seen corresponding path program 1 times [2019-09-10 07:31:14,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:31:14,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:14,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:14,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:14,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:31:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:14,980 WARN L188 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 18 [2019-09-10 07:31:15,040 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:15,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:31:15,040 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:31:15,041 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 106 with the following transitions: [2019-09-10 07:31:15,043 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [111], [150], [153], [154], [156], [176], [216], [219], [222], [225], [265], [613], [616], [619], [622], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [836], [841], [844], [850], [852], [855], [870], [872], [874], [877], [880], [885], [888], [894], [896], [899], [904], [907], [911], [924], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:31:15,052 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:31:15,052 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:31:15,083 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:31:15,352 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:31:15,353 INFO L272 AbstractInterpreter]: Visited 99 different actions 408 times. Merged at 41 different actions 274 times. Widened at 11 different actions 34 times. Performed 1410 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1410 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 29 fixpoints after 8 different actions. Largest state had 134 variables. [2019-09-10 07:31:15,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:15,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:31:15,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:31:15,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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) [2019-09-10 07:31:15,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:15,380 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:31:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:15,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-10 07:31:15,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:31:15,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:15,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:15,930 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:15,930 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:31:16,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:16,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:17,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:17,826 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 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-10 07:31:17,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:31:17,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2019-09-10 07:31:17,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:31:17,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 07:31:17,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 07:31:17,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2019-09-10 07:31:17,842 INFO L87 Difference]: Start difference. First operand 35134 states and 45588 transitions. Second operand 18 states. [2019-09-10 07:31:18,397 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-10 07:31:18,655 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2019-09-10 07:31:19,106 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-09-10 07:31:19,508 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2019-09-10 07:31:19,843 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-10 07:31:20,276 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-10 07:31:20,468 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 07:31:20,647 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 07:31:20,950 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 07:31:21,179 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 07:31:21,432 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-09-10 07:31:21,606 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 07:31:22,284 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-09-10 07:31:22,458 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2019-09-10 07:31:22,682 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-09-10 07:31:23,048 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2019-09-10 07:31:23,933 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-10 07:31:24,200 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-09-10 07:31:24,446 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2019-09-10 07:31:24,639 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-09-10 07:31:24,962 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-09-10 07:31:25,369 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 07:31:25,557 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 07:31:25,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:31:25,751 INFO L93 Difference]: Finished difference Result 107072 states and 136973 transitions. [2019-09-10 07:31:25,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 07:31:25,751 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 105 [2019-09-10 07:31:25,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:31:26,000 INFO L225 Difference]: With dead ends: 107072 [2019-09-10 07:31:26,000 INFO L226 Difference]: Without dead ends: 107072 [2019-09-10 07:31:26,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 174 SyntacticMatches, 25 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1004 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=713, Invalid=2479, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 07:31:26,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107072 states. [2019-09-10 07:31:26,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107072 to 60322. [2019-09-10 07:31:26,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60322 states. [2019-09-10 07:31:27,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60322 states to 60322 states and 77952 transitions. [2019-09-10 07:31:27,005 INFO L78 Accepts]: Start accepts. Automaton has 60322 states and 77952 transitions. Word has length 105 [2019-09-10 07:31:27,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:31:27,005 INFO L475 AbstractCegarLoop]: Abstraction has 60322 states and 77952 transitions. [2019-09-10 07:31:27,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 07:31:27,005 INFO L276 IsEmpty]: Start isEmpty. Operand 60322 states and 77952 transitions. [2019-09-10 07:31:27,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 07:31:27,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:31:27,017 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:31:27,017 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:31:27,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:27,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1674308692, now seen corresponding path program 1 times [2019-09-10 07:31:27,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:31:27,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:27,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:27,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:27,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:31:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:27,351 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:27,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:31:27,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:31:27,352 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 107 with the following transitions: [2019-09-10 07:31:27,353 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [55], [58], [61], [65], [68], [71], [75], [78], [81], [84], [88], [91], [94], [98], [101], [105], [108], [113], [150], [153], [154], [156], [174], [176], [216], [219], [222], [225], [265], [613], [616], [619], [622], [648], [804], [807], [811], [814], [817], [821], [823], [826], [831], [833], [836], [841], [844], [850], [852], [855], [870], [872], [874], [877], [880], [885], [888], [894], [896], [899], [904], [907], [911], [924], [926], [928], [931], [934], [942], [944], [947], [950], [958], [960], [963], [966], [974], [1003], [1004], [1008], [1009], [1010] [2019-09-10 07:31:27,358 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:31:27,358 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:31:27,375 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:31:27,659 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:31:27,660 INFO L272 AbstractInterpreter]: Visited 100 different actions 383 times. Merged at 41 different actions 250 times. Widened at 11 different actions 26 times. Performed 1332 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1332 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 27 fixpoints after 11 different actions. Largest state had 134 variables. [2019-09-10 07:31:27,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:27,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:31:27,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:31:27,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-10 07:31:27,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:27,684 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:31:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:27,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-10 07:31:27,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:31:28,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:28,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:28,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:28,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:28,457 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2019-09-10 07:31:28,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:28,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:29,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:29,659 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:29,659 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:31:30,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:30,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:30,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:31,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:31,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:31,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:31,675 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-09-10 07:31:31,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:31:31,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:31,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 07:31:33,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 07:31:33,770 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 07:31:33,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:31:33,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20, 18] total 48 [2019-09-10 07:31:33,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:31:33,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-10 07:31:33,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-10 07:31:33,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2099, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 07:31:33,789 INFO L87 Difference]: Start difference. First operand 60322 states and 77952 transitions. Second operand 32 states. [2019-09-10 07:31:40,144 WARN L188 SmtUtils]: Spent 6.24 s on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-10 07:31:41,563 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-09-10 07:31:41,814 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-09-10 07:31:42,113 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2019-09-10 07:31:48,722 WARN L188 SmtUtils]: Spent 6.36 s on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 07:31:51,122 WARN L188 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2019-09-10 07:31:53,878 WARN L188 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2019-09-10 07:31:56,699 WARN L188 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-09-10 07:31:59,646 WARN L188 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-09-10 07:32:00,324 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-10 07:32:01,165 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 07:32:03,523 WARN L188 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-09-10 07:32:06,467 WARN L188 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-09-10 07:32:10,913 WARN L188 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-10 07:32:13,561 WARN L188 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:32:19,797 WARN L188 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 07:32:20,747 WARN L188 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-09-10 07:32:25,736 WARN L188 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 07:32:34,180 WARN L188 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-10 07:32:49,023 WARN L188 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-10 07:32:56,161 WARN L188 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-10 07:33:03,647 WARN L188 SmtUtils]: Spent 963.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-09-10 07:33:06,426 WARN L188 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-09-10 07:33:16,298 WARN L188 SmtUtils]: Spent 6.32 s on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-10 07:33:32,151 WARN L188 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-09-10 07:33:34,840 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 07:33:37,407 WARN L188 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-09-10 07:33:39,027 WARN L188 SmtUtils]: Spent 900.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-10 07:33:49,667 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-10 07:34:02,266 WARN L188 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-09-10 07:34:13,723 WARN L188 SmtUtils]: Spent 4.17 s on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:34:22,591 WARN L188 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 07:34:26,015 WARN L188 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-10 07:34:38,750 WARN L188 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 07:34:46,309 WARN L188 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 07:34:54,564 WARN L188 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 07:34:55,104 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 07:34:57,541 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-09-10 07:35:02,428 WARN L188 SmtUtils]: Spent 4.27 s on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-09-10 07:35:02,921 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-10 07:35:09,271 WARN L188 SmtUtils]: Spent 4.36 s on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-09-10 07:35:23,752 WARN L188 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-09-10 07:35:30,403 WARN L188 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 07:35:38,718 WARN L188 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 07:35:45,126 WARN L188 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-09-10 07:35:47,740 WARN L188 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-09-10 07:35:49,529 WARN L188 SmtUtils]: Spent 967.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-10 07:36:07,336 WARN L188 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 07:36:08,361 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 07:36:19,296 WARN L188 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 07:36:25,709 WARN L188 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-09-10 07:36:31,889 WARN L188 SmtUtils]: Spent 4.93 s on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2019-09-10 07:36:34,560 WARN L188 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-10 07:36:41,670 WARN L188 SmtUtils]: Spent 3.00 s on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2019-09-10 07:36:55,317 WARN L188 SmtUtils]: Spent 10.32 s on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-09-10 07:37:05,017 WARN L188 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-09-10 07:37:13,907 WARN L188 SmtUtils]: Spent 4.31 s on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-10 07:37:16,434 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 07:37:21,461 WARN L188 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 07:37:26,784 WARN L188 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-09-10 07:37:33,585 WARN L188 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-10 07:37:54,321 WARN L188 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-10 07:38:09,032 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-09-10 07:38:24,417 WARN L188 SmtUtils]: Spent 8.87 s on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-09-10 07:38:30,229 WARN L188 SmtUtils]: Spent 5.42 s on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-09-10 07:38:36,142 WARN L188 SmtUtils]: Spent 3.67 s on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-09-10 07:38:36,719 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 07:38:55,226 WARN L188 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-10 07:39:03,651 WARN L188 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 07:39:14,264 WARN L188 SmtUtils]: Spent 6.17 s on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-10 07:39:16,872 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-10 07:39:22,931 WARN L188 SmtUtils]: Spent 3.56 s on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2019-09-10 07:39:26,216 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-09-10 07:39:35,475 WARN L188 SmtUtils]: Spent 4.51 s on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-09-10 07:39:40,846 WARN L188 SmtUtils]: Spent 4.78 s on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-09-10 07:39:49,509 WARN L188 SmtUtils]: Spent 8.35 s on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-10 07:40:03,099 WARN L188 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-09-10 07:40:07,361 WARN L188 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:40:13,666 WARN L188 SmtUtils]: Spent 6.12 s on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-10 07:40:16,844 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-09-10 07:40:20,406 WARN L188 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2019-09-10 07:40:26,497 WARN L188 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-09-10 07:40:37,147 WARN L188 SmtUtils]: Spent 4.39 s on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-09-10 07:40:42,969 WARN L188 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-09-10 07:40:46,341 WARN L188 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 77 [2019-09-10 07:40:50,062 WARN L188 SmtUtils]: Spent 3.20 s on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-09-10 07:40:52,638 WARN L188 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-10 07:40:58,204 WARN L188 SmtUtils]: Spent 3.40 s on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2019-09-10 07:41:04,884 WARN L188 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 07:41:13,141 WARN L188 SmtUtils]: Spent 4.24 s on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-10 07:41:24,371 WARN L188 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:41:37,823 WARN L188 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-09-10 07:41:46,175 WARN L188 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 49 [2019-09-10 07:41:52,695 WARN L188 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 07:42:13,189 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-09-10 07:42:19,711 WARN L188 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-09-10 07:42:22,048 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-09-10 07:42:24,698 WARN L188 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-09-10 07:42:25,091 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-09-10 07:42:34,240 WARN L188 SmtUtils]: Spent 8.33 s on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-10 07:42:37,897 WARN L188 SmtUtils]: Spent 2.58 s on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-10 07:42:47,562 WARN L188 SmtUtils]: Spent 7.31 s on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2019-09-10 07:42:48,851 WARN L188 SmtUtils]: Spent 983.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-09-10 07:42:56,961 WARN L188 SmtUtils]: Spent 3.64 s on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-09-10 07:43:21,071 WARN L188 SmtUtils]: Spent 4.14 s on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 07:43:23,389 WARN L188 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 07:43:23,787 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-09-10 07:43:26,000 WARN L188 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 54 DAG size of output: 52