java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:45:10,539 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:45:10,542 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:45:10,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:45:10,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:45:10,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:45:10,567 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:45:10,576 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:45:10,580 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:45:10,583 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:45:10,585 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:45:10,587 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:45:10,587 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:45:10,589 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:45:10,591 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:45:10,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:45:10,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:45:10,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:45:10,597 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:45:10,601 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:45:10,605 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:45:10,608 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:45:10,610 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:45:10,611 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:45:10,613 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:45:10,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:45:10,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:45:10,614 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:45:10,616 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:45:10,616 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:45:10,617 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:45:10,618 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:45:10,619 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:45:10,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:45:10,621 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:45:10,622 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:45:10,622 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:45:10,622 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:45:10,623 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:45:10,623 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:45:10,624 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:45:10,625 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 19:45:10,657 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:45:10,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:45:10,663 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:45:10,663 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:45:10,663 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:45:10,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:45:10,663 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:45:10,664 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:45:10,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:45:10,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:45:10,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:45:10,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:45:10,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:45:10,665 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:45:10,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:45:10,665 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:45:10,666 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:45:10,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:45:10,667 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:45:10,667 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:45:10,667 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:45:10,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:45:10,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:45:10,668 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:45:10,668 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:45:10,668 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:45:10,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:45:10,668 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:45:10,669 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:45:10,949 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:45:10,964 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:45:10,967 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:45:10,969 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:45:10,969 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:45:10,970 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 19:45:11,041 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4727e0e6/fb5b79360bf44d5da743de80942a323c/FLAGee10f511f [2019-10-13 19:45:11,558 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:45:11,561 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 19:45:11,588 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4727e0e6/fb5b79360bf44d5da743de80942a323c/FLAGee10f511f [2019-10-13 19:45:11,843 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4727e0e6/fb5b79360bf44d5da743de80942a323c [2019-10-13 19:45:11,853 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:45:11,854 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:45:11,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:45:11,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:45:11,859 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:45:11,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:45:11" (1/1) ... [2019-10-13 19:45:11,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28d3fd5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:11, skipping insertion in model container [2019-10-13 19:45:11,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:45:11" (1/1) ... [2019-10-13 19:45:11,870 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:45:11,931 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:45:12,458 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:45:12,470 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:45:12,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:45:12,646 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:45:12,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:12 WrapperNode [2019-10-13 19:45:12,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:45:12,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:45:12,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:45:12,647 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:45:12,657 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:12" (1/1) ... [2019-10-13 19:45:12,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:12" (1/1) ... [2019-10-13 19:45:12,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:12" (1/1) ... [2019-10-13 19:45:12,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:12" (1/1) ... [2019-10-13 19:45:12,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:12" (1/1) ... [2019-10-13 19:45:12,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:12" (1/1) ... [2019-10-13 19:45:12,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:12" (1/1) ... [2019-10-13 19:45:12,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:45:12,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:45:12,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:45:12,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:45:12,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:45:12,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:45:12,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:45:12,816 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:45:12,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:45:12,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 19:45:12,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 19:45:12,817 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 19:45:12,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 19:45:12,817 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 19:45:12,817 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 19:45:12,817 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 19:45:12,818 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 19:45:12,818 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 19:45:12,819 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 19:45:12,820 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 19:45:12,821 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:45:12,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:45:12,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:45:14,099 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:45:14,100 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 19:45:14,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:45:14 BoogieIcfgContainer [2019-10-13 19:45:14,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:45:14,103 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:45:14,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:45:14,107 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:45:14,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:45:11" (1/3) ... [2019-10-13 19:45:14,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8c555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:45:14, skipping insertion in model container [2019-10-13 19:45:14,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:12" (2/3) ... [2019-10-13 19:45:14,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8c555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:45:14, skipping insertion in model container [2019-10-13 19:45:14,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:45:14" (3/3) ... [2019-10-13 19:45:14,115 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 19:45:14,125 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:45:14,143 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:45:14,161 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:45:14,201 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:45:14,202 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:45:14,202 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:45:14,202 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:45:14,202 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:45:14,203 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:45:14,203 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:45:14,203 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:45:14,235 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states. [2019-10-13 19:45:14,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 19:45:14,251 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:14,252 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 19:45:14,254 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:14,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:14,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1545579630, now seen corresponding path program 1 times [2019-10-13 19:45:14,264 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:14,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898777659] [2019-10-13 19:45:14,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:14,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:14,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:15,184 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-13 19:45:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:15,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:45:15,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898777659] [2019-10-13 19:45:15,273 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:15,273 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:15,273 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650419021] [2019-10-13 19:45:15,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:15,279 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:15,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:15,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:15,298 INFO L87 Difference]: Start difference. First operand 299 states. Second operand 4 states. [2019-10-13 19:45:15,611 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-10-13 19:45:17,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:17,095 INFO L93 Difference]: Finished difference Result 569 states and 997 transitions. [2019-10-13 19:45:17,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:17,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-10-13 19:45:17,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:17,114 INFO L225 Difference]: With dead ends: 569 [2019-10-13 19:45:17,115 INFO L226 Difference]: Without dead ends: 465 [2019-10-13 19:45:17,119 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:17,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-10-13 19:45:17,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 463. [2019-10-13 19:45:17,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-10-13 19:45:17,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 686 transitions. [2019-10-13 19:45:17,199 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 686 transitions. Word has length 145 [2019-10-13 19:45:17,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:17,200 INFO L462 AbstractCegarLoop]: Abstraction has 463 states and 686 transitions. [2019-10-13 19:45:17,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:45:17,200 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 686 transitions. [2019-10-13 19:45:17,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 19:45:17,205 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:17,206 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 19:45:17,206 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:17,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:17,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1852792009, now seen corresponding path program 1 times [2019-10-13 19:45:17,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:17,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986797928] [2019-10-13 19:45:17,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:17,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:17,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:17,888 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-13 19:45:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:17,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:45:17,934 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986797928] [2019-10-13 19:45:17,934 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:17,934 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:45:17,934 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205969757] [2019-10-13 19:45:17,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:45:17,936 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:17,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:45:17,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:17,937 INFO L87 Difference]: Start difference. First operand 463 states and 686 transitions. Second operand 5 states. [2019-10-13 19:45:19,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:19,928 INFO L93 Difference]: Finished difference Result 1349 states and 1997 transitions. [2019-10-13 19:45:19,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:19,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-10-13 19:45:19,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:19,935 INFO L225 Difference]: With dead ends: 1349 [2019-10-13 19:45:19,935 INFO L226 Difference]: Without dead ends: 899 [2019-10-13 19:45:19,943 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:45:19,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-10-13 19:45:20,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 897. [2019-10-13 19:45:20,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2019-10-13 19:45:20,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1319 transitions. [2019-10-13 19:45:20,027 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1319 transitions. Word has length 145 [2019-10-13 19:45:20,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:20,028 INFO L462 AbstractCegarLoop]: Abstraction has 897 states and 1319 transitions. [2019-10-13 19:45:20,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:45:20,029 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1319 transitions. [2019-10-13 19:45:20,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-13 19:45:20,040 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:20,041 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 19:45:20,041 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:20,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:20,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1132437897, now seen corresponding path program 1 times [2019-10-13 19:45:20,042 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:20,042 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886406753] [2019-10-13 19:45:20,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:20,043 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:20,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:20,348 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-13 19:45:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:20,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:45:20,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886406753] [2019-10-13 19:45:20,381 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:20,383 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:20,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490476109] [2019-10-13 19:45:20,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:20,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:20,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:20,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:20,396 INFO L87 Difference]: Start difference. First operand 897 states and 1319 transitions. Second operand 4 states. [2019-10-13 19:45:22,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:22,738 INFO L93 Difference]: Finished difference Result 2645 states and 3887 transitions. [2019-10-13 19:45:22,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:45:22,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-10-13 19:45:22,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:22,748 INFO L225 Difference]: With dead ends: 2645 [2019-10-13 19:45:22,749 INFO L226 Difference]: Without dead ends: 1780 [2019-10-13 19:45:22,751 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:22,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2019-10-13 19:45:22,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 899. [2019-10-13 19:45:22,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2019-10-13 19:45:22,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1321 transitions. [2019-10-13 19:45:22,849 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1321 transitions. Word has length 146 [2019-10-13 19:45:22,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:22,849 INFO L462 AbstractCegarLoop]: Abstraction has 899 states and 1321 transitions. [2019-10-13 19:45:22,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:45:22,850 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1321 transitions. [2019-10-13 19:45:22,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 19:45:22,852 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:22,852 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 19:45:22,853 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:22,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:22,853 INFO L82 PathProgramCache]: Analyzing trace with hash 18878169, now seen corresponding path program 1 times [2019-10-13 19:45:22,853 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:22,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220274124] [2019-10-13 19:45:22,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:22,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:22,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:23,133 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-13 19:45:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:23,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:45:23,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220274124] [2019-10-13 19:45:23,177 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:23,177 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:23,177 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750406908] [2019-10-13 19:45:23,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:23,178 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:23,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:23,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:23,179 INFO L87 Difference]: Start difference. First operand 899 states and 1321 transitions. Second operand 4 states. [2019-10-13 19:45:25,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:25,195 INFO L93 Difference]: Finished difference Result 2451 states and 3620 transitions. [2019-10-13 19:45:25,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:45:25,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-10-13 19:45:25,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:25,214 INFO L225 Difference]: With dead ends: 2451 [2019-10-13 19:45:25,215 INFO L226 Difference]: Without dead ends: 1734 [2019-10-13 19:45:25,217 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:25,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-10-13 19:45:25,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1732. [2019-10-13 19:45:25,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1732 states. [2019-10-13 19:45:25,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2523 transitions. [2019-10-13 19:45:25,334 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2523 transitions. Word has length 147 [2019-10-13 19:45:25,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:25,335 INFO L462 AbstractCegarLoop]: Abstraction has 1732 states and 2523 transitions. [2019-10-13 19:45:25,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:45:25,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2523 transitions. [2019-10-13 19:45:25,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 19:45:25,341 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:25,341 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 19:45:25,342 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:25,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:25,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1632040732, now seen corresponding path program 1 times [2019-10-13 19:45:25,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:25,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713140123] [2019-10-13 19:45:25,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:25,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:25,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:25,950 WARN L191 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-13 19:45:25,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:26,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:45:26,004 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713140123] [2019-10-13 19:45:26,004 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:26,004 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:45:26,005 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752164195] [2019-10-13 19:45:26,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:45:26,006 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:26,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:45:26,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:26,006 INFO L87 Difference]: Start difference. First operand 1732 states and 2523 transitions. Second operand 5 states. [2019-10-13 19:45:27,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:27,104 INFO L93 Difference]: Finished difference Result 2881 states and 4212 transitions. [2019-10-13 19:45:27,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:27,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-13 19:45:27,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:27,111 INFO L225 Difference]: With dead ends: 2881 [2019-10-13 19:45:27,111 INFO L226 Difference]: Without dead ends: 1321 [2019-10-13 19:45:27,115 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:45:27,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2019-10-13 19:45:27,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1321. [2019-10-13 19:45:27,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1321 states. [2019-10-13 19:45:27,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1916 transitions. [2019-10-13 19:45:27,198 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1916 transitions. Word has length 147 [2019-10-13 19:45:27,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:27,199 INFO L462 AbstractCegarLoop]: Abstraction has 1321 states and 1916 transitions. [2019-10-13 19:45:27,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:45:27,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1916 transitions. [2019-10-13 19:45:27,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 19:45:27,203 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:27,203 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 19:45:27,203 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:27,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:27,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1705432715, now seen corresponding path program 1 times [2019-10-13 19:45:27,204 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:27,204 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605522373] [2019-10-13 19:45:27,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:27,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:27,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:27,588 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-13 19:45:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:27,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:45:27,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605522373] [2019-10-13 19:45:27,649 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:27,649 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 19:45:27,650 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878087109] [2019-10-13 19:45:27,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 19:45:27,653 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:27,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 19:45:27,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:45:27,657 INFO L87 Difference]: Start difference. First operand 1321 states and 1916 transitions. Second operand 9 states. [2019-10-13 19:45:27,917 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-10-13 19:45:29,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:29,697 INFO L93 Difference]: Finished difference Result 3867 states and 5900 transitions. [2019-10-13 19:45:29,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 19:45:29,700 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 150 [2019-10-13 19:45:29,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:29,713 INFO L225 Difference]: With dead ends: 3867 [2019-10-13 19:45:29,713 INFO L226 Difference]: Without dead ends: 2751 [2019-10-13 19:45:29,716 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2019-10-13 19:45:29,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2751 states. [2019-10-13 19:45:29,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2751 to 1652. [2019-10-13 19:45:29,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2019-10-13 19:45:29,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 2413 transitions. [2019-10-13 19:45:29,824 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 2413 transitions. Word has length 150 [2019-10-13 19:45:29,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:29,825 INFO L462 AbstractCegarLoop]: Abstraction has 1652 states and 2413 transitions. [2019-10-13 19:45:29,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 19:45:29,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2413 transitions. [2019-10-13 19:45:29,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 19:45:29,828 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:29,828 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 19:45:29,828 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:29,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:29,829 INFO L82 PathProgramCache]: Analyzing trace with hash -912214424, now seen corresponding path program 1 times [2019-10-13 19:45:29,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:29,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476720098] [2019-10-13 19:45:29,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:29,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:29,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:30,208 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-13 19:45:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:30,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:45:30,278 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476720098] [2019-10-13 19:45:30,278 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:30,279 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:45:30,279 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541413111] [2019-10-13 19:45:30,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:45:30,280 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:30,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:45:30,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:30,280 INFO L87 Difference]: Start difference. First operand 1652 states and 2413 transitions. Second operand 5 states. [2019-10-13 19:45:31,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:31,952 INFO L93 Difference]: Finished difference Result 4332 states and 6340 transitions. [2019-10-13 19:45:31,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:31,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-13 19:45:31,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:31,965 INFO L225 Difference]: With dead ends: 4332 [2019-10-13 19:45:31,965 INFO L226 Difference]: Without dead ends: 2703 [2019-10-13 19:45:31,969 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:45:31,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2019-10-13 19:45:32,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 2701. [2019-10-13 19:45:32,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2701 states. [2019-10-13 19:45:32,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3924 transitions. [2019-10-13 19:45:32,157 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 3924 transitions. Word has length 150 [2019-10-13 19:45:32,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:32,157 INFO L462 AbstractCegarLoop]: Abstraction has 2701 states and 3924 transitions. [2019-10-13 19:45:32,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:45:32,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3924 transitions. [2019-10-13 19:45:32,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-13 19:45:32,161 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:32,161 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 19:45:32,161 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:32,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:32,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1681251574, now seen corresponding path program 1 times [2019-10-13 19:45:32,162 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:32,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142940855] [2019-10-13 19:45:32,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:32,163 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:32,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:32,422 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-13 19:45:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:32,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:45:32,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142940855] [2019-10-13 19:45:32,474 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:32,474 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:32,475 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221655792] [2019-10-13 19:45:32,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:32,476 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:32,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:32,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:32,477 INFO L87 Difference]: Start difference. First operand 2701 states and 3924 transitions. Second operand 4 states. [2019-10-13 19:45:34,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:34,537 INFO L93 Difference]: Finished difference Result 7038 states and 10298 transitions. [2019-10-13 19:45:34,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:45:34,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-10-13 19:45:34,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:34,553 INFO L225 Difference]: With dead ends: 7038 [2019-10-13 19:45:34,553 INFO L226 Difference]: Without dead ends: 4666 [2019-10-13 19:45:34,558 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:34,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4666 states. [2019-10-13 19:45:34,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4666 to 4664. [2019-10-13 19:45:34,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4664 states. [2019-10-13 19:45:34,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 6720 transitions. [2019-10-13 19:45:34,825 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 6720 transitions. Word has length 152 [2019-10-13 19:45:34,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:34,826 INFO L462 AbstractCegarLoop]: Abstraction has 4664 states and 6720 transitions. [2019-10-13 19:45:34,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:45:34,826 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 6720 transitions. [2019-10-13 19:45:34,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-13 19:45:34,833 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:34,834 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 19:45:34,834 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:34,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:34,834 INFO L82 PathProgramCache]: Analyzing trace with hash -344412185, now seen corresponding path program 1 times [2019-10-13 19:45:34,835 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:34,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598934000] [2019-10-13 19:45:34,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:34,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:34,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:35,224 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-13 19:45:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:35,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:45:35,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598934000] [2019-10-13 19:45:35,261 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:35,261 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:45:35,261 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302539860] [2019-10-13 19:45:35,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:45:35,262 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:35,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:45:35,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:35,263 INFO L87 Difference]: Start difference. First operand 4664 states and 6720 transitions. Second operand 5 states. [2019-10-13 19:45:36,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:36,399 INFO L93 Difference]: Finished difference Result 7769 states and 11256 transitions. [2019-10-13 19:45:36,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:36,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2019-10-13 19:45:36,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:36,416 INFO L225 Difference]: With dead ends: 7769 [2019-10-13 19:45:36,416 INFO L226 Difference]: Without dead ends: 4098 [2019-10-13 19:45:36,423 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:45:36,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2019-10-13 19:45:36,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 4098. [2019-10-13 19:45:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-10-13 19:45:36,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 5895 transitions. [2019-10-13 19:45:36,687 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 5895 transitions. Word has length 152 [2019-10-13 19:45:36,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:36,687 INFO L462 AbstractCegarLoop]: Abstraction has 4098 states and 5895 transitions. [2019-10-13 19:45:36,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:45:36,688 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 5895 transitions. [2019-10-13 19:45:36,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-13 19:45:36,693 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:36,693 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 19:45:36,693 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:36,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:36,694 INFO L82 PathProgramCache]: Analyzing trace with hash 71132805, now seen corresponding path program 1 times [2019-10-13 19:45:36,694 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:36,694 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836085701] [2019-10-13 19:45:36,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:36,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:36,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:36,962 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-13 19:45:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:36,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:45:36,992 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836085701] [2019-10-13 19:45:36,992 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:36,992 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:36,992 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085604892] [2019-10-13 19:45:36,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:36,993 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:36,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:36,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:36,994 INFO L87 Difference]: Start difference. First operand 4098 states and 5895 transitions. Second operand 4 states. [2019-10-13 19:45:37,197 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-10-13 19:45:38,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:38,566 INFO L93 Difference]: Finished difference Result 10865 states and 15855 transitions. [2019-10-13 19:45:38,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:38,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-10-13 19:45:38,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:38,596 INFO L225 Difference]: With dead ends: 10865 [2019-10-13 19:45:38,596 INFO L226 Difference]: Without dead ends: 7902 [2019-10-13 19:45:38,602 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:38,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7902 states. [2019-10-13 19:45:38,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7902 to 7900. [2019-10-13 19:45:38,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7900 states. [2019-10-13 19:45:38,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 11351 transitions. [2019-10-13 19:45:38,909 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 11351 transitions. Word has length 155 [2019-10-13 19:45:38,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:38,910 INFO L462 AbstractCegarLoop]: Abstraction has 7900 states and 11351 transitions. [2019-10-13 19:45:38,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:45:38,910 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 11351 transitions. [2019-10-13 19:45:38,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-13 19:45:38,920 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:38,920 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 19:45:38,921 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:38,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:38,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1126763328, now seen corresponding path program 1 times [2019-10-13 19:45:38,921 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:38,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702189907] [2019-10-13 19:45:38,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:38,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:38,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:39,397 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-13 19:45:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:39,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:45:39,471 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702189907] [2019-10-13 19:45:39,472 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:39,472 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:45:39,472 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894167047] [2019-10-13 19:45:39,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:45:39,473 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:39,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:45:39,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:39,474 INFO L87 Difference]: Start difference. First operand 7900 states and 11351 transitions. Second operand 5 states. [2019-10-13 19:45:41,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:41,660 INFO L93 Difference]: Finished difference Result 23082 states and 33193 transitions. [2019-10-13 19:45:41,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:41,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2019-10-13 19:45:41,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:41,692 INFO L225 Difference]: With dead ends: 23082 [2019-10-13 19:45:41,692 INFO L226 Difference]: Without dead ends: 15225 [2019-10-13 19:45:41,706 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:45:41,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15225 states. [2019-10-13 19:45:42,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15225 to 15223. [2019-10-13 19:45:42,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15223 states. [2019-10-13 19:45:42,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15223 states to 15223 states and 21696 transitions. [2019-10-13 19:45:42,416 INFO L78 Accepts]: Start accepts. Automaton has 15223 states and 21696 transitions. Word has length 155 [2019-10-13 19:45:42,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:42,416 INFO L462 AbstractCegarLoop]: Abstraction has 15223 states and 21696 transitions. [2019-10-13 19:45:42,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:45:42,416 INFO L276 IsEmpty]: Start isEmpty. Operand 15223 states and 21696 transitions. [2019-10-13 19:45:42,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-13 19:45:42,432 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:42,432 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 19:45:42,432 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:42,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:42,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1208295678, now seen corresponding path program 1 times [2019-10-13 19:45:42,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:42,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045711708] [2019-10-13 19:45:42,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:42,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:42,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:42,667 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-13 19:45:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:42,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:45:42,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045711708] [2019-10-13 19:45:42,697 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:42,697 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:42,698 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428428196] [2019-10-13 19:45:42,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:42,698 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:42,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:42,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:42,699 INFO L87 Difference]: Start difference. First operand 15223 states and 21696 transitions. Second operand 4 states. [2019-10-13 19:45:44,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:44,955 INFO L93 Difference]: Finished difference Result 45469 states and 64831 transitions. [2019-10-13 19:45:44,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:45:44,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-10-13 19:45:44,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:45,014 INFO L225 Difference]: With dead ends: 45469 [2019-10-13 19:45:45,014 INFO L226 Difference]: Without dead ends: 30355 [2019-10-13 19:45:45,041 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:45,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30355 states. [2019-10-13 19:45:45,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30355 to 15229. [2019-10-13 19:45:45,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15229 states. [2019-10-13 19:45:45,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15229 states to 15229 states and 21702 transitions. [2019-10-13 19:45:45,964 INFO L78 Accepts]: Start accepts. Automaton has 15229 states and 21702 transitions. Word has length 156 [2019-10-13 19:45:45,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:45,964 INFO L462 AbstractCegarLoop]: Abstraction has 15229 states and 21702 transitions. [2019-10-13 19:45:45,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:45:45,964 INFO L276 IsEmpty]: Start isEmpty. Operand 15229 states and 21702 transitions. [2019-10-13 19:45:45,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-13 19:45:45,978 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:45,978 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 19:45:45,979 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:45,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:45,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1010309857, now seen corresponding path program 1 times [2019-10-13 19:45:45,980 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:45,980 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752579675] [2019-10-13 19:45:45,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:45,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:45,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:46,326 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-13 19:45:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:46,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:45:46,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752579675] [2019-10-13 19:45:46,362 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:46,363 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:45:46,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047072743] [2019-10-13 19:45:46,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:45:46,364 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:46,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:45:46,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:46,364 INFO L87 Difference]: Start difference. First operand 15229 states and 21702 transitions. Second operand 5 states.