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+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:45:55,626 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:45:55,629 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:45:55,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:45:55,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:45:55,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:45:55,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:45:55,667 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:45:55,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:45:55,672 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:45:55,675 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:45:55,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:45:55,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:45:55,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:45:55,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:45:55,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:45:55,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:45:55,689 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:45:55,691 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:45:55,696 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:45:55,700 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:45:55,704 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:45:55,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:45:55,706 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:45:55,709 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:45:55,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:45:55,709 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:45:55,711 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:45:55,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:45:55,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:45:55,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:45:55,713 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:45:55,714 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:45:55,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:45:55,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:45:55,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:45:55,716 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:45:55,717 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:45:55,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:45:55,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:45:55,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:45:55,719 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:55,734 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:45:55,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:45:55,735 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:45:55,735 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:45:55,736 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:45:55,736 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:45:55,736 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:45:55,736 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:45:55,736 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:45:55,737 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:45:55,737 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:45:55,737 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:45:55,737 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:45:55,737 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:45:55,738 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:45:55,738 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:45:55,738 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:45:55,738 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:45:55,739 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:45:55,739 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:45:55,739 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:45:55,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:45:55,739 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:45:55,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:45:55,740 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:45:55,740 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:45:55,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:45:55,740 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:45:55,740 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:45:56,025 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:45:56,044 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:45:56,048 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:45:56,050 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:45:56,051 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:45:56,051 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+lhb-reducer.c [2019-10-13 19:45:56,133 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9ec3a839/e6c6835d8ed14e06a6b594def5f3f266/FLAG1fbf5f549 [2019-10-13 19:45:56,706 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:45:56,707 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-13 19:45:56,725 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9ec3a839/e6c6835d8ed14e06a6b594def5f3f266/FLAG1fbf5f549 [2019-10-13 19:45:56,998 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9ec3a839/e6c6835d8ed14e06a6b594def5f3f266 [2019-10-13 19:45:57,010 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:45:57,012 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:45:57,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:45:57,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:45:57,018 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:45:57,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:45:56" (1/1) ... [2019-10-13 19:45:57,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4262f24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:57, skipping insertion in model container [2019-10-13 19:45:57,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:45:56" (1/1) ... [2019-10-13 19:45:57,033 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:45:57,103 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:45:57,592 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:45:57,608 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:45:57,744 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:45:57,763 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:45:57,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:57 WrapperNode [2019-10-13 19:45:57,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:45:57,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:45:57,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:45:57,765 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:45:57,775 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:57" (1/1) ... [2019-10-13 19:45:57,775 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:57" (1/1) ... [2019-10-13 19:45:57,797 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:57" (1/1) ... [2019-10-13 19:45:57,797 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:57" (1/1) ... [2019-10-13 19:45:57,834 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:57" (1/1) ... [2019-10-13 19:45:57,850 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:57" (1/1) ... [2019-10-13 19:45:57,855 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:57" (1/1) ... [2019-10-13 19:45:57,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:45:57,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:45:57,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:45:57,863 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:45:57,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:57" (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:57,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:45:57,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:45:57,939 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:45:57,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:45:57,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 19:45:57,940 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-13 19:45:57,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 19:45:57,941 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 19:45:57,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 19:45:57,941 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 19:45:57,941 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 19:45:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 19:45:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 19:45:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 19:45:57,943 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 19:45:57,944 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 19:45:57,946 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:45:57,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:45:57,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:45:59,327 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:45:59,329 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 19:45:59,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:45:59 BoogieIcfgContainer [2019-10-13 19:45:59,331 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:45:59,332 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:45:59,332 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:45:59,335 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:45:59,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:45:56" (1/3) ... [2019-10-13 19:45:59,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725a460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:45:59, skipping insertion in model container [2019-10-13 19:45:59,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:57" (2/3) ... [2019-10-13 19:45:59,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@725a460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:45:59, skipping insertion in model container [2019-10-13 19:45:59,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:45:59" (3/3) ... [2019-10-13 19:45:59,345 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-13 19:45:59,355 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:45:59,377 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-10-13 19:45:59,388 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-10-13 19:45:59,420 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:45:59,420 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:45:59,420 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:45:59,420 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:45:59,420 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:45:59,421 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:45:59,421 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:45:59,421 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:45:59,446 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states. [2019-10-13 19:45:59,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 19:45:59,457 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:59,458 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] [2019-10-13 19:45:59,460 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:59,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:59,464 INFO L82 PathProgramCache]: Analyzing trace with hash -907914047, now seen corresponding path program 1 times [2019-10-13 19:45:59,473 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:59,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534152297] [2019-10-13 19:45:59,474 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:59,474 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:59,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:00,514 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-13 19:46:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:00,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:46:00,583 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534152297] [2019-10-13 19:46:00,583 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:00,584 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:00,584 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590167011] [2019-10-13 19:46:00,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:46:00,591 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:00,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:46:00,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:00,607 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 5 states. [2019-10-13 19:46:02,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:02,866 INFO L93 Difference]: Finished difference Result 789 states and 1385 transitions. [2019-10-13 19:46:02,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:46:02,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-13 19:46:02,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:02,892 INFO L225 Difference]: With dead ends: 789 [2019-10-13 19:46:02,892 INFO L226 Difference]: Without dead ends: 519 [2019-10-13 19:46:02,898 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 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:46:02,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-10-13 19:46:02,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 496. [2019-10-13 19:46:02,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-10-13 19:46:02,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 722 transitions. [2019-10-13 19:46:02,989 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 722 transitions. Word has length 102 [2019-10-13 19:46:02,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:02,990 INFO L462 AbstractCegarLoop]: Abstraction has 496 states and 722 transitions. [2019-10-13 19:46:02,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:46:02,990 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 722 transitions. [2019-10-13 19:46:02,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-13 19:46:02,995 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:02,995 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] [2019-10-13 19:46:02,996 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:02,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:02,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1093362695, now seen corresponding path program 1 times [2019-10-13 19:46:02,997 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:02,997 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292452706] [2019-10-13 19:46:02,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:02,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:02,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:03,337 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-13 19:46:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:03,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:46:03,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292452706] [2019-10-13 19:46:03,363 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:03,363 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:46:03,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286337577] [2019-10-13 19:46:03,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:46:03,365 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:03,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:46:03,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:03,366 INFO L87 Difference]: Start difference. First operand 496 states and 722 transitions. Second operand 4 states. [2019-10-13 19:46:05,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:05,520 INFO L93 Difference]: Finished difference Result 1442 states and 2096 transitions. [2019-10-13 19:46:05,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:46:05,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-10-13 19:46:05,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:05,528 INFO L225 Difference]: With dead ends: 1442 [2019-10-13 19:46:05,528 INFO L226 Difference]: Without dead ends: 978 [2019-10-13 19:46:05,532 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:05,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-10-13 19:46:05,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 498. [2019-10-13 19:46:05,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-10-13 19:46:05,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 724 transitions. [2019-10-13 19:46:05,574 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 724 transitions. Word has length 103 [2019-10-13 19:46:05,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:05,574 INFO L462 AbstractCegarLoop]: Abstraction has 498 states and 724 transitions. [2019-10-13 19:46:05,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:46:05,575 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 724 transitions. [2019-10-13 19:46:05,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 19:46:05,578 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:05,578 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] [2019-10-13 19:46:05,578 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:05,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:05,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1521321784, now seen corresponding path program 1 times [2019-10-13 19:46:05,579 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:05,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429681815] [2019-10-13 19:46:05,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:05,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:05,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:05,954 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-13 19:46:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:06,053 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:06,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429681815] [2019-10-13 19:46:06,055 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:06,056 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:46:06,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3501765] [2019-10-13 19:46:06,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:46:06,066 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:06,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:46:06,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:06,067 INFO L87 Difference]: Start difference. First operand 498 states and 724 transitions. Second operand 4 states. [2019-10-13 19:46:07,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:07,537 INFO L93 Difference]: Finished difference Result 1029 states and 1554 transitions. [2019-10-13 19:46:07,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:46:07,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-10-13 19:46:07,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:07,544 INFO L225 Difference]: With dead ends: 1029 [2019-10-13 19:46:07,544 INFO L226 Difference]: Without dead ends: 662 [2019-10-13 19:46:07,545 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:07,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-10-13 19:46:07,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 646. [2019-10-13 19:46:07,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-10-13 19:46:07,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 968 transitions. [2019-10-13 19:46:07,581 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 968 transitions. Word has length 104 [2019-10-13 19:46:07,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:07,582 INFO L462 AbstractCegarLoop]: Abstraction has 646 states and 968 transitions. [2019-10-13 19:46:07,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:46:07,582 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 968 transitions. [2019-10-13 19:46:07,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 19:46:07,584 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:07,584 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] [2019-10-13 19:46:07,584 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:07,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:07,585 INFO L82 PathProgramCache]: Analyzing trace with hash 60289518, now seen corresponding path program 1 times [2019-10-13 19:46:07,585 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:07,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316681511] [2019-10-13 19:46:07,586 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:07,586 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:07,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:07,884 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-13 19:46:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:07,917 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,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316681511] [2019-10-13 19:46:07,918 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:07,918 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:46:07,918 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021255441] [2019-10-13 19:46:07,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:46:07,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:07,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:46:07,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:07,921 INFO L87 Difference]: Start difference. First operand 646 states and 968 transitions. Second operand 4 states. [2019-10-13 19:46:09,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:09,976 INFO L93 Difference]: Finished difference Result 1690 states and 2556 transitions. [2019-10-13 19:46:09,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:46:09,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-10-13 19:46:09,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:09,983 INFO L225 Difference]: With dead ends: 1690 [2019-10-13 19:46:09,983 INFO L226 Difference]: Without dead ends: 1241 [2019-10-13 19:46:09,985 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:09,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2019-10-13 19:46:10,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1220. [2019-10-13 19:46:10,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1220 states. [2019-10-13 19:46:10,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1820 transitions. [2019-10-13 19:46:10,040 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1820 transitions. Word has length 104 [2019-10-13 19:46:10,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:10,041 INFO L462 AbstractCegarLoop]: Abstraction has 1220 states and 1820 transitions. [2019-10-13 19:46:10,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:46:10,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1820 transitions. [2019-10-13 19:46:10,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 19:46:10,043 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:10,043 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] [2019-10-13 19:46:10,043 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:10,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:10,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1524807285, now seen corresponding path program 1 times [2019-10-13 19:46:10,044 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:10,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095252785] [2019-10-13 19:46:10,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:10,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:10,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:10,486 WARN L191 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-13 19:46:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:10,531 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:10,532 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095252785] [2019-10-13 19:46:10,532 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:10,533 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:10,533 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982716406] [2019-10-13 19:46:10,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:46:10,535 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:10,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:46:10,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:10,536 INFO L87 Difference]: Start difference. First operand 1220 states and 1820 transitions. Second operand 5 states. [2019-10-13 19:46:11,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:11,665 INFO L93 Difference]: Finished difference Result 1973 states and 2965 transitions. [2019-10-13 19:46:11,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:46:11,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-13 19:46:11,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:11,673 INFO L225 Difference]: With dead ends: 1973 [2019-10-13 19:46:11,673 INFO L226 Difference]: Without dead ends: 938 [2019-10-13 19:46:11,675 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:46:11,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2019-10-13 19:46:11,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 938. [2019-10-13 19:46:11,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2019-10-13 19:46:11,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1391 transitions. [2019-10-13 19:46:11,722 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1391 transitions. Word has length 104 [2019-10-13 19:46:11,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:11,722 INFO L462 AbstractCegarLoop]: Abstraction has 938 states and 1391 transitions. [2019-10-13 19:46:11,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:46:11,723 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1391 transitions. [2019-10-13 19:46:11,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 19:46:11,725 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:11,725 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:11,726 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:11,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:11,726 INFO L82 PathProgramCache]: Analyzing trace with hash 431033542, now seen corresponding path program 1 times [2019-10-13 19:46:11,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:11,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348495226] [2019-10-13 19:46:11,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:11,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:11,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:12,082 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-13 19:46:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:12,112 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:12,112 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348495226] [2019-10-13 19:46:12,113 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:12,114 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:46:12,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380498951] [2019-10-13 19:46:12,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:46:12,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:12,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:46:12,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:12,125 INFO L87 Difference]: Start difference. First operand 938 states and 1391 transitions. Second operand 4 states. [2019-10-13 19:46:13,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:13,608 INFO L93 Difference]: Finished difference Result 2034 states and 3133 transitions. [2019-10-13 19:46:13,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:46:13,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-13 19:46:13,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:13,617 INFO L225 Difference]: With dead ends: 2034 [2019-10-13 19:46:13,617 INFO L226 Difference]: Without dead ends: 1366 [2019-10-13 19:46:13,620 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,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2019-10-13 19:46:13,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1322. [2019-10-13 19:46:13,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2019-10-13 19:46:13,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 2014 transitions. [2019-10-13 19:46:13,681 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 2014 transitions. Word has length 106 [2019-10-13 19:46:13,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:13,682 INFO L462 AbstractCegarLoop]: Abstraction has 1322 states and 2014 transitions. [2019-10-13 19:46:13,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:46:13,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 2014 transitions. [2019-10-13 19:46:13,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 19:46:13,684 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:13,684 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,684 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:13,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:13,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1740408399, now seen corresponding path program 1 times [2019-10-13 19:46:13,685 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:13,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476394986] [2019-10-13 19:46:13,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:13,685 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:13,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:14,094 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-13 19:46:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:14,127 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,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476394986] [2019-10-13 19:46:14,128 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:14,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:14,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289734046] [2019-10-13 19:46:14,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:46:14,129 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:14,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:46:14,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:14,130 INFO L87 Difference]: Start difference. First operand 1322 states and 2014 transitions. Second operand 5 states. [2019-10-13 19:46:15,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:15,923 INFO L93 Difference]: Finished difference Result 3366 states and 5138 transitions. [2019-10-13 19:46:15,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:46:15,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-10-13 19:46:15,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:15,933 INFO L225 Difference]: With dead ends: 3366 [2019-10-13 19:46:15,934 INFO L226 Difference]: Without dead ends: 2067 [2019-10-13 19:46:15,937 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:15,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2019-10-13 19:46:16,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 2052. [2019-10-13 19:46:16,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2052 states. [2019-10-13 19:46:16,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 3114 transitions. [2019-10-13 19:46:16,035 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 3114 transitions. Word has length 107 [2019-10-13 19:46:16,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:16,036 INFO L462 AbstractCegarLoop]: Abstraction has 2052 states and 3114 transitions. [2019-10-13 19:46:16,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:46:16,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 3114 transitions. [2019-10-13 19:46:16,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-13 19:46:16,039 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:16,039 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:16,039 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:16,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:16,040 INFO L82 PathProgramCache]: Analyzing trace with hash -481916784, now seen corresponding path program 1 times [2019-10-13 19:46:16,041 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:16,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403199909] [2019-10-13 19:46:16,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:16,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:16,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:16,325 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-13 19:46:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:16,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:46:16,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403199909] [2019-10-13 19:46:16,360 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:16,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:46:16,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725986261] [2019-10-13 19:46:16,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:46:16,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:16,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:46:16,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:16,364 INFO L87 Difference]: Start difference. First operand 2052 states and 3114 transitions. Second operand 4 states. [2019-10-13 19:46:18,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:18,267 INFO L93 Difference]: Finished difference Result 5515 states and 8477 transitions. [2019-10-13 19:46:18,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:46:18,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-10-13 19:46:18,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:18,285 INFO L225 Difference]: With dead ends: 5515 [2019-10-13 19:46:18,285 INFO L226 Difference]: Without dead ends: 3822 [2019-10-13 19:46:18,289 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:18,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3822 states. [2019-10-13 19:46:18,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3822 to 3809. [2019-10-13 19:46:18,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3809 states. [2019-10-13 19:46:18,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3809 states to 3809 states and 5773 transitions. [2019-10-13 19:46:18,458 INFO L78 Accepts]: Start accepts. Automaton has 3809 states and 5773 transitions. Word has length 109 [2019-10-13 19:46:18,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:18,459 INFO L462 AbstractCegarLoop]: Abstraction has 3809 states and 5773 transitions. [2019-10-13 19:46:18,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:46:18,459 INFO L276 IsEmpty]: Start isEmpty. Operand 3809 states and 5773 transitions. [2019-10-13 19:46:18,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-13 19:46:18,462 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:18,462 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,463 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:18,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:18,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1064644563, now seen corresponding path program 1 times [2019-10-13 19:46:18,463 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:18,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242680331] [2019-10-13 19:46:18,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:18,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:18,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:18,779 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-13 19:46:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:18,812 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:18,812 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242680331] [2019-10-13 19:46:18,812 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:18,813 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:18,813 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551826993] [2019-10-13 19:46:18,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:46:18,813 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:18,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:46:18,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:18,817 INFO L87 Difference]: Start difference. First operand 3809 states and 5773 transitions. Second operand 5 states. [2019-10-13 19:46:19,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:19,911 INFO L93 Difference]: Finished difference Result 5943 states and 9044 transitions. [2019-10-13 19:46:19,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:46:19,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-10-13 19:46:19,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:19,921 INFO L225 Difference]: With dead ends: 5943 [2019-10-13 19:46:19,921 INFO L226 Difference]: Without dead ends: 3112 [2019-10-13 19:46:19,927 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:19,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3112 states. [2019-10-13 19:46:20,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3112 to 3112. [2019-10-13 19:46:20,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3112 states. [2019-10-13 19:46:20,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 4697 transitions. [2019-10-13 19:46:20,050 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 4697 transitions. Word has length 109 [2019-10-13 19:46:20,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:20,050 INFO L462 AbstractCegarLoop]: Abstraction has 3112 states and 4697 transitions. [2019-10-13 19:46:20,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:46:20,051 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 4697 transitions. [2019-10-13 19:46:20,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 19:46:20,053 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:20,053 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] [2019-10-13 19:46:20,054 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:20,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:20,054 INFO L82 PathProgramCache]: Analyzing trace with hash 894991708, now seen corresponding path program 1 times [2019-10-13 19:46:20,054 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:20,055 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941730536] [2019-10-13 19:46:20,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:20,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:20,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:20,321 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-13 19:46:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:20,349 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:20,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941730536] [2019-10-13 19:46:20,350 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:20,350 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:46:20,350 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839218015] [2019-10-13 19:46:20,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:46:20,353 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:20,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:46:20,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:20,353 INFO L87 Difference]: Start difference. First operand 3112 states and 4697 transitions. Second operand 4 states. [2019-10-13 19:46:21,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:21,794 INFO L93 Difference]: Finished difference Result 7812 states and 12106 transitions. [2019-10-13 19:46:21,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:46:21,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-10-13 19:46:21,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:21,813 INFO L225 Difference]: With dead ends: 7812 [2019-10-13 19:46:21,813 INFO L226 Difference]: Without dead ends: 5036 [2019-10-13 19:46:21,819 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:21,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5036 states. [2019-10-13 19:46:22,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5036 to 4830. [2019-10-13 19:46:22,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4830 states. [2019-10-13 19:46:22,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4830 states to 4830 states and 7460 transitions. [2019-10-13 19:46:22,031 INFO L78 Accepts]: Start accepts. Automaton has 4830 states and 7460 transitions. Word has length 111 [2019-10-13 19:46:22,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:22,031 INFO L462 AbstractCegarLoop]: Abstraction has 4830 states and 7460 transitions. [2019-10-13 19:46:22,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:46:22,032 INFO L276 IsEmpty]: Start isEmpty. Operand 4830 states and 7460 transitions. [2019-10-13 19:46:22,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-13 19:46:22,034 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:22,035 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,035 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:22,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:22,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1533697134, now seen corresponding path program 1 times [2019-10-13 19:46:22,035 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:22,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638828221] [2019-10-13 19:46:22,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:22,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:22,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:22,283 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-13 19:46:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:22,311 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:22,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638828221] [2019-10-13 19:46:22,311 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:22,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:46:22,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400550806] [2019-10-13 19:46:22,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:46:22,313 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:22,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:46:22,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:22,313 INFO L87 Difference]: Start difference. First operand 4830 states and 7460 transitions. Second operand 4 states. [2019-10-13 19:46:22,568 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-10-13 19:46:23,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:23,790 INFO L93 Difference]: Finished difference Result 13617 states and 21279 transitions. [2019-10-13 19:46:23,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:46:23,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-13 19:46:23,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:23,822 INFO L225 Difference]: With dead ends: 13617 [2019-10-13 19:46:23,823 INFO L226 Difference]: Without dead ends: 9347 [2019-10-13 19:46:23,830 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:46:23,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9347 states. [2019-10-13 19:46:24,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9347 to 9275. [2019-10-13 19:46:24,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9275 states. [2019-10-13 19:46:24,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9275 states to 9275 states and 14366 transitions. [2019-10-13 19:46:24,177 INFO L78 Accepts]: Start accepts. Automaton has 9275 states and 14366 transitions. Word has length 112 [2019-10-13 19:46:24,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:24,177 INFO L462 AbstractCegarLoop]: Abstraction has 9275 states and 14366 transitions. [2019-10-13 19:46:24,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:46:24,178 INFO L276 IsEmpty]: Start isEmpty. Operand 9275 states and 14366 transitions. [2019-10-13 19:46:24,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-13 19:46:24,181 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:24,182 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:24,182 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:24,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:24,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1051932183, now seen corresponding path program 1 times [2019-10-13 19:46:24,183 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:24,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887921060] [2019-10-13 19:46:24,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:24,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:24,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:24,486 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-13 19:46:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:24,521 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:24,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887921060] [2019-10-13 19:46:24,522 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:24,522 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:24,522 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239937154] [2019-10-13 19:46:24,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:46:24,523 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:24,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:46:24,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:24,523 INFO L87 Difference]: Start difference. First operand 9275 states and 14366 transitions. Second operand 5 states. [2019-10-13 19:46:26,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:26,570 INFO L93 Difference]: Finished difference Result 25948 states and 40113 transitions. [2019-10-13 19:46:26,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:46:26,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-10-13 19:46:26,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:26,606 INFO L225 Difference]: With dead ends: 25948 [2019-10-13 19:46:26,606 INFO L226 Difference]: Without dead ends: 16716 [2019-10-13 19:46:26,623 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:26,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16716 states. [2019-10-13 19:46:27,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16716 to 16644. [2019-10-13 19:46:27,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16644 states. [2019-10-13 19:46:27,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16644 states to 16644 states and 25497 transitions. [2019-10-13 19:46:27,283 INFO L78 Accepts]: Start accepts. Automaton has 16644 states and 25497 transitions. Word has length 112 [2019-10-13 19:46:27,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:27,284 INFO L462 AbstractCegarLoop]: Abstraction has 16644 states and 25497 transitions. [2019-10-13 19:46:27,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:46:27,284 INFO L276 IsEmpty]: Start isEmpty. Operand 16644 states and 25497 transitions. [2019-10-13 19:46:27,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-13 19:46:27,288 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:27,288 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] [2019-10-13 19:46:27,289 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:27,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:27,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1424445537, now seen corresponding path program 1 times [2019-10-13 19:46:27,289 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:27,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460606662] [2019-10-13 19:46:27,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:27,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:27,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:27,535 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-13 19:46:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:27,563 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,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460606662] [2019-10-13 19:46:27,564 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:27,564 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:46:27,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699996226] [2019-10-13 19:46:27,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:46:27,565 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:27,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:46:27,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:46:27,566 INFO L87 Difference]: Start difference. First operand 16644 states and 25497 transitions. Second operand 4 states. [2019-10-13 19:46:29,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:29,933 INFO L93 Difference]: Finished difference Result 49726 states and 76228 transitions. [2019-10-13 19:46:29,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:46:29,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-13 19:46:29,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:29,999 INFO L225 Difference]: With dead ends: 49726 [2019-10-13 19:46:29,999 INFO L226 Difference]: Without dead ends: 33194 [2019-10-13 19:46:30,026 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:30,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33194 states. [2019-10-13 19:46:30,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33194 to 16650. [2019-10-13 19:46:30,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16650 states. [2019-10-13 19:46:30,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16650 states to 16650 states and 25503 transitions. [2019-10-13 19:46:30,830 INFO L78 Accepts]: Start accepts. Automaton has 16650 states and 25503 transitions. Word has length 113 [2019-10-13 19:46:30,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:46:30,831 INFO L462 AbstractCegarLoop]: Abstraction has 16650 states and 25503 transitions. [2019-10-13 19:46:30,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:46:30,831 INFO L276 IsEmpty]: Start isEmpty. Operand 16650 states and 25503 transitions. [2019-10-13 19:46:30,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-13 19:46:30,836 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:46:30,836 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:30,837 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:46:30,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:46:30,837 INFO L82 PathProgramCache]: Analyzing trace with hash 274337368, now seen corresponding path program 1 times [2019-10-13 19:46:30,837 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:46:30,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132533883] [2019-10-13 19:46:30,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:30,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:46:30,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:46:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:31,162 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2019-10-13 19:46:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:46:31,184 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:31,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132533883] [2019-10-13 19:46:31,185 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:46:31,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:46:31,185 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159843416] [2019-10-13 19:46:31,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:46:31,185 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:46:31,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:46:31,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:46:31,186 INFO L87 Difference]: Start difference. First operand 16650 states and 25503 transitions. Second operand 5 states. [2019-10-13 19:46:32,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:46:32,698 INFO L93 Difference]: Finished difference Result 33186 states and 50861 transitions. [2019-10-13 19:46:32,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:46:32,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-10-13 19:46:32,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:46:32,735 INFO L225 Difference]: With dead ends: 33186 [2019-10-13 19:46:32,735 INFO L226 Difference]: Without dead ends: 16650 [2019-10-13 19:46:32,760 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:32,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16650 states.