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_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:46:00,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:46:00,496 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:46:00,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:46:00,514 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:46:00,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:46:00,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:46:00,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:46:00,521 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:46:00,522 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:46:00,523 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:46:00,524 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:46:00,524 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:46:00,525 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:46:00,526 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:46:00,527 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:46:00,528 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:46:00,529 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:46:00,531 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:46:00,533 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:46:00,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:46:00,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:46:00,537 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:46:00,538 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:46:00,540 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:46:00,540 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:46:00,541 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:46:00,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:46:00,542 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:46:00,543 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:46:00,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:46:00,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:46:00,545 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:46:00,546 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:46:00,547 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:46:00,547 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:46:00,548 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:46:00,548 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:46:00,549 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:46:00,550 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:46:00,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:46:00,552 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:46:00,581 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:46:00,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:46:00,583 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:46:00,583 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:46:00,583 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:46:00,583 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:46:00,584 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:46:00,584 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:46:00,584 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:46:00,584 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:46:00,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:46:00,585 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:46:00,585 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:46:00,585 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:46:00,585 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:46:00,585 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:46:00,586 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:46:00,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:46:00,586 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:46:00,586 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:46:00,586 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:46:00,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:46:00,587 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:46:00,587 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:46:00,587 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:46:00,587 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:46:00,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:46:00,588 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:46:00,588 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:46:00,883 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:46:00,901 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:46:00,904 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:46:00,906 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:46:00,906 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:46:00,908 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-13 19:46:00,985 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9b6d9cea/5b826fd0271a4b1a8bb675e553265928/FLAG834119154 [2019-10-13 19:46:01,508 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:46:01,509 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-13 19:46:01,522 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9b6d9cea/5b826fd0271a4b1a8bb675e553265928/FLAG834119154 [2019-10-13 19:46:01,733 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9b6d9cea/5b826fd0271a4b1a8bb675e553265928 [2019-10-13 19:46:01,744 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:46:01,746 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:46:01,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:46:01,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:46:01,750 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:46:01,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:46:01" (1/1) ... [2019-10-13 19:46:01,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@671e4bab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:01, skipping insertion in model container [2019-10-13 19:46:01,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:46:01" (1/1) ... [2019-10-13 19:46:01,764 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:46:01,841 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:46:02,321 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:46:02,344 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:46:02,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:46:02,487 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:46:02,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:02 WrapperNode [2019-10-13 19:46:02,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:46:02,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:46:02,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:46:02,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:46:02,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:02" (1/1) ... [2019-10-13 19:46:02,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:02" (1/1) ... [2019-10-13 19:46:02,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:02" (1/1) ... [2019-10-13 19:46:02,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:02" (1/1) ... [2019-10-13 19:46:02,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:02" (1/1) ... [2019-10-13 19:46:02,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:02" (1/1) ... [2019-10-13 19:46:02,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:02" (1/1) ... [2019-10-13 19:46:02,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:46:02,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:46:02,564 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:46:02,564 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:46:02,565 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:02" (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:46:02,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:46:02,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:46:02,642 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:46:02,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:46:02,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 19:46:02,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-13 19:46:02,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 19:46:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 19:46:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 19:46:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 19:46:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 19:46:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 19:46:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 19:46:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 19:46:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 19:46:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 19:46:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:46:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:46:02,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:46:03,995 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:46:03,996 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 19:46:03,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:46:03 BoogieIcfgContainer [2019-10-13 19:46:03,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:46:03,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:46:03,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:46:04,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:46:04,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:46:01" (1/3) ... [2019-10-13 19:46:04,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c0736ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:46:04, skipping insertion in model container [2019-10-13 19:46:04,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:46:02" (2/3) ... [2019-10-13 19:46:04,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c0736ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:46:04, skipping insertion in model container [2019-10-13 19:46:04,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:46:03" (3/3) ... [2019-10-13 19:46:04,006 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-13 19:46:04,016 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:46:04,026 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:46:04,038 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:46:04,067 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:46:04,068 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:46:04,068 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:46:04,068 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:46:04,068 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:46:04,069 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:46:04,069 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:46:04,069 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:46:04,096 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states. [2019-10-13 19:46:04,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 19:46:04,109 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:04,110 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] [2019-10-13 19:46:04,113 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:04,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:04,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1942738218, now seen corresponding path program 1 times [2019-10-13 19:46:04,129 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:04,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800212251] [2019-10-13 19:46:04,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:04,130 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:04,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:04,980 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-13 19:46:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:05,047 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:46:05,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800212251] [2019-10-13 19:46:05,049 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:05,050 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:46:05,050 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924673116] [2019-10-13 19:46:05,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:46:05,057 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:05,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:46:05,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:05,079 INFO L87 Difference]: Start difference. First operand 252 states. Second operand 4 states. [2019-10-13 19:46:05,457 WARN L191 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2019-10-13 19:46:06,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:06,715 INFO L93 Difference]: Finished difference Result 509 states and 869 transitions. [2019-10-13 19:46:06,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:46:06,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-10-13 19:46:06,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:06,735 INFO L225 Difference]: With dead ends: 509 [2019-10-13 19:46:06,736 INFO L226 Difference]: Without dead ends: 375 [2019-10-13 19:46:06,740 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:06,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-13 19:46:06,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2019-10-13 19:46:06,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-10-13 19:46:06,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 566 transitions. [2019-10-13 19:46:06,837 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 566 transitions. Word has length 105 [2019-10-13 19:46:06,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:06,838 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 566 transitions. [2019-10-13 19:46:06,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:46:06,838 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 566 transitions. [2019-10-13 19:46:06,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 19:46:06,847 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:06,847 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] [2019-10-13 19:46:06,847 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:06,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:06,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1562873963, now seen corresponding path program 1 times [2019-10-13 19:46:06,849 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:06,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769809463] [2019-10-13 19:46:06,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:06,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:06,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:07,470 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-13 19:46:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:07,514 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:46:07,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769809463] [2019-10-13 19:46:07,516 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:07,516 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:07,516 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245308072] [2019-10-13 19:46:07,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:46:07,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:07,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:46:07,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:07,525 INFO L87 Difference]: Start difference. First operand 373 states and 566 transitions. Second operand 5 states. [2019-10-13 19:46:09,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:09,022 INFO L93 Difference]: Finished difference Result 1077 states and 1633 transitions. [2019-10-13 19:46:09,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:46:09,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-13 19:46:09,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:09,035 INFO L225 Difference]: With dead ends: 1077 [2019-10-13 19:46:09,036 INFO L226 Difference]: Without dead ends: 717 [2019-10-13 19:46:09,043 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:46:09,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-10-13 19:46:09,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2019-10-13 19:46:09,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-10-13 19:46:09,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1076 transitions. [2019-10-13 19:46:09,129 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1076 transitions. Word has length 105 [2019-10-13 19:46:09,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:09,132 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 1076 transitions. [2019-10-13 19:46:09,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:46:09,133 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1076 transitions. [2019-10-13 19:46:09,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 19:46:09,135 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:09,136 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] [2019-10-13 19:46:09,136 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:09,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:09,136 INFO L82 PathProgramCache]: Analyzing trace with hash 878256033, now seen corresponding path program 1 times [2019-10-13 19:46:09,137 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:09,137 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499407477] [2019-10-13 19:46:09,137 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:09,137 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:09,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:09,410 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-13 19:46:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:09,434 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:46:09,435 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499407477] [2019-10-13 19:46:09,435 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:09,435 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:46:09,435 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473692751] [2019-10-13 19:46:09,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:46:09,436 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:09,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:46:09,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:09,437 INFO L87 Difference]: Start difference. First operand 715 states and 1076 transitions. Second operand 4 states. [2019-10-13 19:46:11,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:11,250 INFO L93 Difference]: Finished difference Result 2099 states and 3158 transitions. [2019-10-13 19:46:11,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:46:11,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-13 19:46:11,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:11,262 INFO L225 Difference]: With dead ends: 2099 [2019-10-13 19:46:11,262 INFO L226 Difference]: Without dead ends: 1416 [2019-10-13 19:46:11,264 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:46:11,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2019-10-13 19:46:11,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 717. [2019-10-13 19:46:11,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-10-13 19:46:11,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1078 transitions. [2019-10-13 19:46:11,329 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1078 transitions. Word has length 106 [2019-10-13 19:46:11,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:11,329 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 1078 transitions. [2019-10-13 19:46:11,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:46:11,329 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1078 transitions. [2019-10-13 19:46:11,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 19:46:11,332 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:11,332 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] [2019-10-13 19:46:11,332 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:11,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:11,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1289386322, now seen corresponding path program 1 times [2019-10-13 19:46:11,333 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:11,333 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836377188] [2019-10-13 19:46:11,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:11,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:11,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:11,692 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-13 19:46:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:11,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:46:11,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836377188] [2019-10-13 19:46:11,728 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:11,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:46:11,783 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392992215] [2019-10-13 19:46:11,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:46:11,784 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:11,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:46:11,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:11,785 INFO L87 Difference]: Start difference. First operand 717 states and 1078 transitions. Second operand 4 states. [2019-10-13 19:46:13,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:13,465 INFO L93 Difference]: Finished difference Result 1629 states and 2536 transitions. [2019-10-13 19:46:13,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:46:13,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-10-13 19:46:13,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:13,474 INFO L225 Difference]: With dead ends: 1629 [2019-10-13 19:46:13,474 INFO L226 Difference]: Without dead ends: 1043 [2019-10-13 19:46:13,477 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:46:13,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-10-13 19:46:13,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1013. [2019-10-13 19:46:13,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2019-10-13 19:46:13,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1569 transitions. [2019-10-13 19:46:13,571 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1569 transitions. Word has length 107 [2019-10-13 19:46:13,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:13,574 INFO L462 AbstractCegarLoop]: Abstraction has 1013 states and 1569 transitions. [2019-10-13 19:46:13,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:46:13,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1569 transitions. [2019-10-13 19:46:13,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 19:46:13,579 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:13,580 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] [2019-10-13 19:46:13,580 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:13,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:13,581 INFO L82 PathProgramCache]: Analyzing trace with hash 75181962, now seen corresponding path program 1 times [2019-10-13 19:46:13,581 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:13,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049755101] [2019-10-13 19:46:13,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:13,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:13,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:13,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:14,049 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-13 19:46:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:14,080 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:46:14,081 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049755101] [2019-10-13 19:46:14,081 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:14,081 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:14,081 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039242548] [2019-10-13 19:46:14,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:46:14,083 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:14,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:46:14,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:14,083 INFO L87 Difference]: Start difference. First operand 1013 states and 1569 transitions. Second operand 5 states. [2019-10-13 19:46:15,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:15,059 INFO L93 Difference]: Finished difference Result 2008 states and 3113 transitions. [2019-10-13 19:46:15,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:46:15,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-10-13 19:46:15,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:15,065 INFO L225 Difference]: With dead ends: 2008 [2019-10-13 19:46:15,065 INFO L226 Difference]: Without dead ends: 1013 [2019-10-13 19:46:15,067 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:46:15,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2019-10-13 19:46:15,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 1012. [2019-10-13 19:46:15,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2019-10-13 19:46:15,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1566 transitions. [2019-10-13 19:46:15,122 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1566 transitions. Word has length 107 [2019-10-13 19:46:15,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:15,122 INFO L462 AbstractCegarLoop]: Abstraction has 1012 states and 1566 transitions. [2019-10-13 19:46:15,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:46:15,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1566 transitions. [2019-10-13 19:46:15,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 19:46:15,124 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:15,124 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] [2019-10-13 19:46:15,125 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:15,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:15,125 INFO L82 PathProgramCache]: Analyzing trace with hash -610700672, now seen corresponding path program 1 times [2019-10-13 19:46:15,126 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:15,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898024258] [2019-10-13 19:46:15,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:15,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:15,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:15,420 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-13 19:46:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:15,481 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:46:15,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898024258] [2019-10-13 19:46:15,482 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:15,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:46:15,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081297917] [2019-10-13 19:46:15,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:46:15,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:15,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:46:15,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:15,484 INFO L87 Difference]: Start difference. First operand 1012 states and 1566 transitions. Second operand 4 states. [2019-10-13 19:46:17,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:17,367 INFO L93 Difference]: Finished difference Result 2765 states and 4312 transitions. [2019-10-13 19:46:17,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:46:17,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-10-13 19:46:17,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:17,378 INFO L225 Difference]: With dead ends: 2765 [2019-10-13 19:46:17,378 INFO L226 Difference]: Without dead ends: 1949 [2019-10-13 19:46:17,380 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:46:17,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949 states. [2019-10-13 19:46:17,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949 to 1947. [2019-10-13 19:46:17,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1947 states. [2019-10-13 19:46:17,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1947 states and 2988 transitions. [2019-10-13 19:46:17,470 INFO L78 Accepts]: Start accepts. Automaton has 1947 states and 2988 transitions. Word has length 107 [2019-10-13 19:46:17,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:17,471 INFO L462 AbstractCegarLoop]: Abstraction has 1947 states and 2988 transitions. [2019-10-13 19:46:17,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:46:17,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 2988 transitions. [2019-10-13 19:46:17,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 19:46:17,473 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:17,473 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] [2019-10-13 19:46:17,474 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:17,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:17,474 INFO L82 PathProgramCache]: Analyzing trace with hash 935860675, now seen corresponding path program 1 times [2019-10-13 19:46:17,474 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:17,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147251334] [2019-10-13 19:46:17,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:17,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:17,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:17,768 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-13 19:46:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:17,797 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:46:17,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147251334] [2019-10-13 19:46:17,798 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:17,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:17,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215144350] [2019-10-13 19:46:17,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:46:17,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:17,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:46:17,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:17,800 INFO L87 Difference]: Start difference. First operand 1947 states and 2988 transitions. Second operand 5 states. [2019-10-13 19:46:18,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:18,769 INFO L93 Difference]: Finished difference Result 3252 states and 5019 transitions. [2019-10-13 19:46:18,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:46:18,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-10-13 19:46:18,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:18,778 INFO L225 Difference]: With dead ends: 3252 [2019-10-13 19:46:18,778 INFO L226 Difference]: Without dead ends: 1489 [2019-10-13 19:46:18,783 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:46:18,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2019-10-13 19:46:18,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1489. [2019-10-13 19:46:18,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1489 states. [2019-10-13 19:46:18,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 2274 transitions. [2019-10-13 19:46:18,853 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 2274 transitions. Word has length 107 [2019-10-13 19:46:18,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:18,854 INFO L462 AbstractCegarLoop]: Abstraction has 1489 states and 2274 transitions. [2019-10-13 19:46:18,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:46:18,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 2274 transitions. [2019-10-13 19:46:18,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-13 19:46:18,857 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:18,857 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] [2019-10-13 19:46:18,857 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:18,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:18,858 INFO L82 PathProgramCache]: Analyzing trace with hash -967455086, now seen corresponding path program 1 times [2019-10-13 19:46:18,858 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:18,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003963714] [2019-10-13 19:46:18,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:18,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:18,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:19,135 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-13 19:46:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:19,173 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:46:19,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003963714] [2019-10-13 19:46:19,174 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:19,174 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:46:19,175 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746937975] [2019-10-13 19:46:19,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:46:19,176 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:19,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:46:19,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:19,178 INFO L87 Difference]: Start difference. First operand 1489 states and 2274 transitions. Second operand 4 states. [2019-10-13 19:46:20,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:20,602 INFO L93 Difference]: Finished difference Result 3562 states and 5609 transitions. [2019-10-13 19:46:20,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:46:20,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-10-13 19:46:20,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:20,615 INFO L225 Difference]: With dead ends: 3562 [2019-10-13 19:46:20,615 INFO L226 Difference]: Without dead ends: 2343 [2019-10-13 19:46:20,618 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:46:20,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2019-10-13 19:46:20,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2257. [2019-10-13 19:46:20,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2257 states. [2019-10-13 19:46:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3522 transitions. [2019-10-13 19:46:20,727 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3522 transitions. Word has length 109 [2019-10-13 19:46:20,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:20,728 INFO L462 AbstractCegarLoop]: Abstraction has 2257 states and 3522 transitions. [2019-10-13 19:46:20,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:46:20,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3522 transitions. [2019-10-13 19:46:20,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-13 19:46:20,731 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:20,731 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] [2019-10-13 19:46:20,731 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:20,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:20,732 INFO L82 PathProgramCache]: Analyzing trace with hash 195490705, now seen corresponding path program 1 times [2019-10-13 19:46:20,732 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:20,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433252709] [2019-10-13 19:46:20,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:20,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:20,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:21,105 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-13 19:46:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:21,140 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:46:21,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433252709] [2019-10-13 19:46:21,141 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:21,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:21,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739120422] [2019-10-13 19:46:21,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:46:21,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:21,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:46:21,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:21,148 INFO L87 Difference]: Start difference. First operand 2257 states and 3522 transitions. Second operand 5 states. [2019-10-13 19:46:22,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:22,755 INFO L93 Difference]: Finished difference Result 5820 states and 9101 transitions. [2019-10-13 19:46:22,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:46:22,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-10-13 19:46:22,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:22,773 INFO L225 Difference]: With dead ends: 5820 [2019-10-13 19:46:22,773 INFO L226 Difference]: Without dead ends: 3594 [2019-10-13 19:46:22,778 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:46:22,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2019-10-13 19:46:22,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3592. [2019-10-13 19:46:22,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3592 states. [2019-10-13 19:46:22,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 5576 transitions. [2019-10-13 19:46:22,939 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 5576 transitions. Word has length 110 [2019-10-13 19:46:22,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:22,940 INFO L462 AbstractCegarLoop]: Abstraction has 3592 states and 5576 transitions. [2019-10-13 19:46:22,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:46:22,940 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 5576 transitions. [2019-10-13 19:46:22,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-13 19:46:22,942 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:22,943 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] [2019-10-13 19:46:22,943 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:22,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:22,943 INFO L82 PathProgramCache]: Analyzing trace with hash -2099167218, now seen corresponding path program 1 times [2019-10-13 19:46:22,943 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:22,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908378962] [2019-10-13 19:46:22,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:22,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:22,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:23,201 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-13 19:46:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:23,274 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:46:23,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908378962] [2019-10-13 19:46:23,275 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:23,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:46:23,275 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681634848] [2019-10-13 19:46:23,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:46:23,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:23,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:46:23,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:23,276 INFO L87 Difference]: Start difference. First operand 3592 states and 5576 transitions. Second operand 4 states. [2019-10-13 19:46:24,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:24,594 INFO L93 Difference]: Finished difference Result 8748 states and 13683 transitions. [2019-10-13 19:46:24,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:46:24,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-13 19:46:24,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:24,627 INFO L225 Difference]: With dead ends: 8748 [2019-10-13 19:46:24,628 INFO L226 Difference]: Without dead ends: 5532 [2019-10-13 19:46:24,638 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:46:24,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5532 states. [2019-10-13 19:46:24,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5532 to 5530. [2019-10-13 19:46:24,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5530 states. [2019-10-13 19:46:24,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5530 states to 5530 states and 8515 transitions. [2019-10-13 19:46:24,981 INFO L78 Accepts]: Start accepts. Automaton has 5530 states and 8515 transitions. Word has length 112 [2019-10-13 19:46:24,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:24,982 INFO L462 AbstractCegarLoop]: Abstraction has 5530 states and 8515 transitions. [2019-10-13 19:46:24,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:46:24,982 INFO L276 IsEmpty]: Start isEmpty. Operand 5530 states and 8515 transitions. [2019-10-13 19:46:24,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-13 19:46:24,986 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:24,986 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] [2019-10-13 19:46:24,986 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:24,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:24,987 INFO L82 PathProgramCache]: Analyzing trace with hash -122679506, now seen corresponding path program 1 times [2019-10-13 19:46:24,987 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:24,987 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97712967] [2019-10-13 19:46:24,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:24,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:24,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:25,267 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-13 19:46:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:25,291 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:46:25,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97712967] [2019-10-13 19:46:25,291 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:25,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:46:25,292 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70432710] [2019-10-13 19:46:25,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:46:25,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:25,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:46:25,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:25,293 INFO L87 Difference]: Start difference. First operand 5530 states and 8515 transitions. Second operand 4 states. [2019-10-13 19:46:26,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:26,865 INFO L93 Difference]: Finished difference Result 14570 states and 22850 transitions. [2019-10-13 19:46:26,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:46:26,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-13 19:46:26,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:26,901 INFO L225 Difference]: With dead ends: 14570 [2019-10-13 19:46:26,901 INFO L226 Difference]: Without dead ends: 9376 [2019-10-13 19:46:26,913 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:46:26,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9376 states. [2019-10-13 19:46:27,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9376 to 8966. [2019-10-13 19:46:27,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8966 states. [2019-10-13 19:46:27,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8966 states to 8966 states and 14034 transitions. [2019-10-13 19:46:27,233 INFO L78 Accepts]: Start accepts. Automaton has 8966 states and 14034 transitions. Word has length 114 [2019-10-13 19:46:27,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:27,233 INFO L462 AbstractCegarLoop]: Abstraction has 8966 states and 14034 transitions. [2019-10-13 19:46:27,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:46:27,234 INFO L276 IsEmpty]: Start isEmpty. Operand 8966 states and 14034 transitions. [2019-10-13 19:46:27,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-13 19:46:27,237 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:27,237 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] [2019-10-13 19:46:27,238 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:27,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:27,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1346619386, now seen corresponding path program 1 times [2019-10-13 19:46:27,238 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:27,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526545789] [2019-10-13 19:46:27,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:27,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:27,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:27,487 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-13 19:46:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:27,573 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:46:27,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526545789] [2019-10-13 19:46:27,574 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:27,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:46:27,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073854479] [2019-10-13 19:46:27,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:46:27,576 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:27,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:46:27,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:27,576 INFO L87 Difference]: Start difference. First operand 8966 states and 14034 transitions. Second operand 4 states. [2019-10-13 19:46:27,797 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 171 [2019-10-13 19:46:29,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:29,290 INFO L93 Difference]: Finished difference Result 25623 states and 40462 transitions. [2019-10-13 19:46:29,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:46:29,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-10-13 19:46:29,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:29,335 INFO L225 Difference]: With dead ends: 25623 [2019-10-13 19:46:29,335 INFO L226 Difference]: Without dead ends: 17325 [2019-10-13 19:46:29,355 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:29,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17325 states. [2019-10-13 19:46:30,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17325 to 17323. [2019-10-13 19:46:30,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17323 states. [2019-10-13 19:46:30,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17323 states to 17323 states and 27148 transitions. [2019-10-13 19:46:30,127 INFO L78 Accepts]: Start accepts. Automaton has 17323 states and 27148 transitions. Word has length 115 [2019-10-13 19:46:30,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:30,128 INFO L462 AbstractCegarLoop]: Abstraction has 17323 states and 27148 transitions. [2019-10-13 19:46:30,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:46:30,128 INFO L276 IsEmpty]: Start isEmpty. Operand 17323 states and 27148 transitions. [2019-10-13 19:46:30,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-13 19:46:30,135 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:30,135 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] [2019-10-13 19:46:30,135 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:30,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:30,136 INFO L82 PathProgramCache]: Analyzing trace with hash 636430229, now seen corresponding path program 1 times [2019-10-13 19:46:30,136 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:30,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156415670] [2019-10-13 19:46:30,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:30,137 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:30,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:30,513 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-13 19:46:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:30,549 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:46:30,549 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156415670] [2019-10-13 19:46:30,549 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:30,549 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:30,550 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002401760] [2019-10-13 19:46:30,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:46:30,550 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:30,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:46:30,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:30,551 INFO L87 Difference]: Start difference. First operand 17323 states and 27148 transitions. Second operand 5 states. [2019-10-13 19:46:33,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:33,679 INFO L93 Difference]: Finished difference Result 48390 states and 75721 transitions. [2019-10-13 19:46:33,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:46:33,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2019-10-13 19:46:33,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:33,745 INFO L225 Difference]: With dead ends: 48390 [2019-10-13 19:46:33,745 INFO L226 Difference]: Without dead ends: 31110 [2019-10-13 19:46:33,777 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:46:33,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31110 states. [2019-10-13 19:46:34,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31110 to 31108. [2019-10-13 19:46:34,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31108 states. [2019-10-13 19:46:34,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31108 states to 31108 states and 48219 transitions. [2019-10-13 19:46:34,998 INFO L78 Accepts]: Start accepts. Automaton has 31108 states and 48219 transitions. Word has length 115 [2019-10-13 19:46:34,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:34,998 INFO L462 AbstractCegarLoop]: Abstraction has 31108 states and 48219 transitions. [2019-10-13 19:46:34,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:46:34,998 INFO L276 IsEmpty]: Start isEmpty. Operand 31108 states and 48219 transitions. [2019-10-13 19:46:35,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-13 19:46:35,005 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:35,005 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] [2019-10-13 19:46:35,006 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:35,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:35,006 INFO L82 PathProgramCache]: Analyzing trace with hash 2111377993, now seen corresponding path program 1 times [2019-10-13 19:46:35,006 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:35,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893834340] [2019-10-13 19:46:35,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:35,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:35,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:35,229 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-10-13 19:46:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:35,252 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:46:35,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893834340] [2019-10-13 19:46:35,253 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:35,253 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:46:35,253 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860897620] [2019-10-13 19:46:35,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:46:35,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:35,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:46:35,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:35,254 INFO L87 Difference]: Start difference. First operand 31108 states and 48219 transitions. Second operand 4 states.