java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:23:28,750 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:23:28,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:23:28,765 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:23:28,765 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:23:28,766 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:23:28,768 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:23:28,769 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:23:28,771 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:23:28,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:23:28,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:23:28,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:23:28,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:23:28,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:23:28,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:23:28,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:23:28,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:23:28,780 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:23:28,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:23:28,783 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:23:28,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:23:28,786 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:23:28,787 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:23:28,788 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:23:28,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:23:28,793 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:23:28,793 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:23:28,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:23:28,795 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:23:28,796 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:23:28,796 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:23:28,798 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:23:28,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:23:28,802 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:23:28,803 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:23:28,803 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:23:28,803 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:23:28,804 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:23:28,804 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:23:28,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:23:28,808 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:23:28,809 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 07:23:28,838 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:23:28,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:23:28,840 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:23:28,840 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:23:28,841 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:23:28,841 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:23:28,841 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:23:28,842 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:23:28,842 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:23:28,842 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:23:28,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:23:28,845 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:23:28,845 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:23:28,846 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:23:28,846 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:23:28,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:23:28,846 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:23:28,846 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:23:28,847 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:23:28,847 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:23:28,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:23:28,848 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:23:28,848 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:23:28,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:23:28,848 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:23:28,849 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:23:28,849 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:23:28,849 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:23:28,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:23:28,849 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:23:28,902 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:23:28,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:23:28,927 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:23:28,929 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:23:28,929 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:23:28,930 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 07:23:29,009 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e12a8d748/c198bf0c0433482b9d0f2b2441f9a95c/FLAG8463ab562 [2019-09-10 07:23:29,521 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:23:29,523 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 07:23:29,544 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e12a8d748/c198bf0c0433482b9d0f2b2441f9a95c/FLAG8463ab562 [2019-09-10 07:23:29,811 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e12a8d748/c198bf0c0433482b9d0f2b2441f9a95c [2019-09-10 07:23:29,821 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:23:29,822 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:23:29,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:23:29,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:23:29,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:23:29,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:23:29" (1/1) ... [2019-09-10 07:23:29,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60cd48a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:23:29, skipping insertion in model container [2019-09-10 07:23:29,831 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:23:29" (1/1) ... [2019-09-10 07:23:29,838 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:23:29,890 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:23:30,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:23:30,305 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:23:30,394 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:23:30,437 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:23:30,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:23:30 WrapperNode [2019-09-10 07:23:30,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:23:30,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:23:30,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:23:30,440 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:23:30,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:23:30" (1/1) ... [2019-09-10 07:23:30,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:23:30" (1/1) ... [2019-09-10 07:23:30,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:23:30" (1/1) ... [2019-09-10 07:23:30,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:23:30" (1/1) ... [2019-09-10 07:23:30,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:23:30" (1/1) ... [2019-09-10 07:23:30,526 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:23:30" (1/1) ... [2019-09-10 07:23:30,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:23:30" (1/1) ... [2019-09-10 07:23:30,540 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:23:30,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:23:30,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:23:30,548 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:23:30,549 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:23:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:23:30,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:23:30,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:23:30,612 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:23:30,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:23:30,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:23:30,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:23:30,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:23:30,613 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:23:30,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:23:30,613 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:23:30,613 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:23:30,613 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:23:30,614 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:23:30,614 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:23:30,614 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:23:30,614 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:23:30,614 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 07:23:30,614 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:23:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:23:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:23:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:23:30,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:23:31,585 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:23:31,585 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:23:31,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:23:31 BoogieIcfgContainer [2019-09-10 07:23:31,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:23:31,588 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:23:31,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:23:31,591 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:23:31,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:23:29" (1/3) ... [2019-09-10 07:23:31,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da85787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:23:31, skipping insertion in model container [2019-09-10 07:23:31,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:23:30" (2/3) ... [2019-09-10 07:23:31,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da85787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:23:31, skipping insertion in model container [2019-09-10 07:23:31,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:23:31" (3/3) ... [2019-09-10 07:23:31,595 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 07:23:31,605 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:23:31,614 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:23:31,632 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:23:31,660 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:23:31,660 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:23:31,661 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:23:31,661 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:23:31,661 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:23:31,661 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:23:31,662 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:23:31,662 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:23:31,684 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states. [2019-09-10 07:23:31,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 07:23:31,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:31,702 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:23:31,705 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:31,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:31,711 INFO L82 PathProgramCache]: Analyzing trace with hash -826086369, now seen corresponding path program 1 times [2019-09-10 07:23:31,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:31,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:31,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:31,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:31,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:32,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:23:32,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:32,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:23:32,257 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:32,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:23:32,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:23:32,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:32,283 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 3 states. [2019-09-10 07:23:32,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:32,363 INFO L93 Difference]: Finished difference Result 266 states and 429 transitions. [2019-09-10 07:23:32,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:23:32,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 07:23:32,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:32,382 INFO L225 Difference]: With dead ends: 266 [2019-09-10 07:23:32,382 INFO L226 Difference]: Without dead ends: 258 [2019-09-10 07:23:32,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:32,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-10 07:23:32,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-09-10 07:23:32,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-10 07:23:32,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 380 transitions. [2019-09-10 07:23:32,448 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 380 transitions. Word has length 77 [2019-09-10 07:23:32,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:32,448 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 380 transitions. [2019-09-10 07:23:32,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:23:32,449 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 380 transitions. [2019-09-10 07:23:32,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:23:32,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:32,452 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:23:32,453 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:32,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:32,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1869373593, now seen corresponding path program 1 times [2019-09-10 07:23:32,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:32,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:32,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:32,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:32,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:32,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:23:32,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:32,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:23:32,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:32,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:23:32,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:23:32,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:32,669 INFO L87 Difference]: Start difference. First operand 256 states and 380 transitions. Second operand 3 states. [2019-09-10 07:23:32,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:32,712 INFO L93 Difference]: Finished difference Result 432 states and 658 transitions. [2019-09-10 07:23:32,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:23:32,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 07:23:32,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:32,717 INFO L225 Difference]: With dead ends: 432 [2019-09-10 07:23:32,717 INFO L226 Difference]: Without dead ends: 432 [2019-09-10 07:23:32,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:32,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-09-10 07:23:32,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 430. [2019-09-10 07:23:32,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-10 07:23:32,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 657 transitions. [2019-09-10 07:23:32,751 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 657 transitions. Word has length 78 [2019-09-10 07:23:32,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:32,752 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 657 transitions. [2019-09-10 07:23:32,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:23:32,752 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 657 transitions. [2019-09-10 07:23:32,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:23:32,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:32,757 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:23:32,757 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:32,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:32,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1207389834, now seen corresponding path program 1 times [2019-09-10 07:23:32,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:32,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:32,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:32,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:32,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:32,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:23:32,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:32,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:23:32,870 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:32,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:23:32,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:23:32,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:32,876 INFO L87 Difference]: Start difference. First operand 430 states and 657 transitions. Second operand 3 states. [2019-09-10 07:23:32,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:32,916 INFO L93 Difference]: Finished difference Result 748 states and 1158 transitions. [2019-09-10 07:23:32,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:23:32,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 07:23:32,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:32,922 INFO L225 Difference]: With dead ends: 748 [2019-09-10 07:23:32,922 INFO L226 Difference]: Without dead ends: 748 [2019-09-10 07:23:32,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:32,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-09-10 07:23:32,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 746. [2019-09-10 07:23:32,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-09-10 07:23:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1157 transitions. [2019-09-10 07:23:32,962 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1157 transitions. Word has length 79 [2019-09-10 07:23:32,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:32,963 INFO L475 AbstractCegarLoop]: Abstraction has 746 states and 1157 transitions. [2019-09-10 07:23:32,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:23:32,963 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1157 transitions. [2019-09-10 07:23:32,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 07:23:32,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:32,967 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:23:32,967 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:32,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:32,968 INFO L82 PathProgramCache]: Analyzing trace with hash 856537934, now seen corresponding path program 1 times [2019-09-10 07:23:32,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:32,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:32,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:32,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:32,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:33,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:23:33,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:33,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:23:33,107 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:33,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:23:33,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:23:33,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:33,109 INFO L87 Difference]: Start difference. First operand 746 states and 1157 transitions. Second operand 3 states. [2019-09-10 07:23:33,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:33,145 INFO L93 Difference]: Finished difference Result 1316 states and 2050 transitions. [2019-09-10 07:23:33,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:23:33,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-10 07:23:33,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:33,154 INFO L225 Difference]: With dead ends: 1316 [2019-09-10 07:23:33,155 INFO L226 Difference]: Without dead ends: 1316 [2019-09-10 07:23:33,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:33,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2019-09-10 07:23:33,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1314. [2019-09-10 07:23:33,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-09-10 07:23:33,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 2049 transitions. [2019-09-10 07:23:33,222 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 2049 transitions. Word has length 80 [2019-09-10 07:23:33,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:33,224 INFO L475 AbstractCegarLoop]: Abstraction has 1314 states and 2049 transitions. [2019-09-10 07:23:33,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:23:33,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 2049 transitions. [2019-09-10 07:23:33,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:23:33,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:33,236 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:23:33,236 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:33,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:33,236 INFO L82 PathProgramCache]: Analyzing trace with hash -2050615543, now seen corresponding path program 1 times [2019-09-10 07:23:33,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:33,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:33,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:33,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:33,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:33,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:23:33,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:33,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:23:33,352 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:33,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:23:33,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:23:33,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:33,355 INFO L87 Difference]: Start difference. First operand 1314 states and 2049 transitions. Second operand 3 states. [2019-09-10 07:23:33,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:33,387 INFO L93 Difference]: Finished difference Result 2324 states and 3618 transitions. [2019-09-10 07:23:33,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:23:33,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 07:23:33,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:33,405 INFO L225 Difference]: With dead ends: 2324 [2019-09-10 07:23:33,406 INFO L226 Difference]: Without dead ends: 2324 [2019-09-10 07:23:33,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:33,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2324 states. [2019-09-10 07:23:33,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2324 to 2322. [2019-09-10 07:23:33,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2322 states. [2019-09-10 07:23:33,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 3617 transitions. [2019-09-10 07:23:33,482 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 3617 transitions. Word has length 81 [2019-09-10 07:23:33,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:33,484 INFO L475 AbstractCegarLoop]: Abstraction has 2322 states and 3617 transitions. [2019-09-10 07:23:33,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:23:33,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 3617 transitions. [2019-09-10 07:23:33,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:23:33,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:33,488 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:23:33,488 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:33,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:33,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1507278871, now seen corresponding path program 1 times [2019-09-10 07:23:33,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:33,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:33,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:33,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:33,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:33,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:23:33,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:33,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:23:33,821 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:33,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:23:33,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:23:33,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:23:33,823 INFO L87 Difference]: Start difference. First operand 2322 states and 3617 transitions. Second operand 8 states. [2019-09-10 07:23:34,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:34,185 INFO L93 Difference]: Finished difference Result 11852 states and 18390 transitions. [2019-09-10 07:23:34,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:23:34,186 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-09-10 07:23:34,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:34,246 INFO L225 Difference]: With dead ends: 11852 [2019-09-10 07:23:34,247 INFO L226 Difference]: Without dead ends: 11852 [2019-09-10 07:23:34,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:23:34,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11852 states. [2019-09-10 07:23:34,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11852 to 11842. [2019-09-10 07:23:34,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11842 states. [2019-09-10 07:23:34,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11842 states to 11842 states and 18385 transitions. [2019-09-10 07:23:34,649 INFO L78 Accepts]: Start accepts. Automaton has 11842 states and 18385 transitions. Word has length 82 [2019-09-10 07:23:34,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:34,650 INFO L475 AbstractCegarLoop]: Abstraction has 11842 states and 18385 transitions. [2019-09-10 07:23:34,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:23:34,650 INFO L276 IsEmpty]: Start isEmpty. Operand 11842 states and 18385 transitions. [2019-09-10 07:23:34,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:23:34,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:34,652 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:23:34,652 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:34,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:34,652 INFO L82 PathProgramCache]: Analyzing trace with hash 308811751, now seen corresponding path program 1 times [2019-09-10 07:23:34,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:34,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:34,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:34,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:34,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:34,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:23:34,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:34,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:23:34,826 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:34,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:23:34,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:23:34,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:34,827 INFO L87 Difference]: Start difference. First operand 11842 states and 18385 transitions. Second operand 3 states. [2019-09-10 07:23:34,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:34,950 INFO L93 Difference]: Finished difference Result 21140 states and 32498 transitions. [2019-09-10 07:23:34,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:23:34,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-10 07:23:34,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:35,051 INFO L225 Difference]: With dead ends: 21140 [2019-09-10 07:23:35,051 INFO L226 Difference]: Without dead ends: 21140 [2019-09-10 07:23:35,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:35,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21140 states. [2019-09-10 07:23:35,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21140 to 21138. [2019-09-10 07:23:35,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21138 states. [2019-09-10 07:23:35,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21138 states to 21138 states and 32497 transitions. [2019-09-10 07:23:35,622 INFO L78 Accepts]: Start accepts. Automaton has 21138 states and 32497 transitions. Word has length 84 [2019-09-10 07:23:35,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:35,623 INFO L475 AbstractCegarLoop]: Abstraction has 21138 states and 32497 transitions. [2019-09-10 07:23:35,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:23:35,623 INFO L276 IsEmpty]: Start isEmpty. Operand 21138 states and 32497 transitions. [2019-09-10 07:23:35,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:23:35,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:35,625 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:23:35,625 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:35,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:35,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1160585458, now seen corresponding path program 1 times [2019-09-10 07:23:35,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:35,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:35,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:35,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:35,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:35,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:23:35,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:35,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:23:35,761 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:35,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:23:35,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:23:35,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:23:35,763 INFO L87 Difference]: Start difference. First operand 21138 states and 32497 transitions. Second operand 6 states. [2019-09-10 07:23:37,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:37,040 INFO L93 Difference]: Finished difference Result 62198 states and 95155 transitions. [2019-09-10 07:23:37,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:23:37,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-09-10 07:23:37,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:37,183 INFO L225 Difference]: With dead ends: 62198 [2019-09-10 07:23:37,183 INFO L226 Difference]: Without dead ends: 62198 [2019-09-10 07:23:37,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:23:37,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62198 states. [2019-09-10 07:23:38,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62198 to 62194. [2019-09-10 07:23:38,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62194 states. [2019-09-10 07:23:38,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62194 states to 62194 states and 95153 transitions. [2019-09-10 07:23:38,316 INFO L78 Accepts]: Start accepts. Automaton has 62194 states and 95153 transitions. Word has length 84 [2019-09-10 07:23:38,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:38,316 INFO L475 AbstractCegarLoop]: Abstraction has 62194 states and 95153 transitions. [2019-09-10 07:23:38,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:23:38,316 INFO L276 IsEmpty]: Start isEmpty. Operand 62194 states and 95153 transitions. [2019-09-10 07:23:38,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:23:38,318 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:38,318 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:23:38,318 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:38,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:38,320 INFO L82 PathProgramCache]: Analyzing trace with hash 456919433, now seen corresponding path program 1 times [2019-09-10 07:23:38,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:38,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:38,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:38,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:38,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:38,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:23:38,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:38,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:23:38,533 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:38,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:23:38,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:23:38,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:23:38,536 INFO L87 Difference]: Start difference. First operand 62194 states and 95153 transitions. Second operand 8 states. [2019-09-10 07:23:40,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:40,664 INFO L93 Difference]: Finished difference Result 288190 states and 439287 transitions. [2019-09-10 07:23:40,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:23:40,664 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-09-10 07:23:40,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:41,679 INFO L225 Difference]: With dead ends: 288190 [2019-09-10 07:23:41,680 INFO L226 Difference]: Without dead ends: 288190 [2019-09-10 07:23:41,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:23:41,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288190 states. [2019-09-10 07:23:45,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288190 to 124338. [2019-09-10 07:23:45,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124338 states. [2019-09-10 07:23:45,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124338 states to 124338 states and 187953 transitions. [2019-09-10 07:23:45,685 INFO L78 Accepts]: Start accepts. Automaton has 124338 states and 187953 transitions. Word has length 84 [2019-09-10 07:23:45,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:45,686 INFO L475 AbstractCegarLoop]: Abstraction has 124338 states and 187953 transitions. [2019-09-10 07:23:45,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:23:45,686 INFO L276 IsEmpty]: Start isEmpty. Operand 124338 states and 187953 transitions. [2019-09-10 07:23:45,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:23:45,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:45,687 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:23:45,687 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:45,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:45,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1261067860, now seen corresponding path program 1 times [2019-09-10 07:23:45,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:45,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:45,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:45,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:45,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:45,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:23:45,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:45,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:23:45,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:45,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:23:45,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:23:45,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:23:45,803 INFO L87 Difference]: Start difference. First operand 124338 states and 187953 transitions. Second operand 5 states. [2019-09-10 07:23:48,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:48,323 INFO L93 Difference]: Finished difference Result 253234 states and 378161 transitions. [2019-09-10 07:23:48,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:23:48,324 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-10 07:23:48,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:48,756 INFO L225 Difference]: With dead ends: 253234 [2019-09-10 07:23:48,756 INFO L226 Difference]: Without dead ends: 253234 [2019-09-10 07:23:48,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:23:48,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253234 states. [2019-09-10 07:23:51,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253234 to 128946. [2019-09-10 07:23:51,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128946 states. [2019-09-10 07:23:51,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128946 states to 128946 states and 192561 transitions. [2019-09-10 07:23:51,753 INFO L78 Accepts]: Start accepts. Automaton has 128946 states and 192561 transitions. Word has length 85 [2019-09-10 07:23:51,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:51,754 INFO L475 AbstractCegarLoop]: Abstraction has 128946 states and 192561 transitions. [2019-09-10 07:23:51,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:23:51,754 INFO L276 IsEmpty]: Start isEmpty. Operand 128946 states and 192561 transitions. [2019-09-10 07:23:51,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:23:51,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:51,755 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:23:51,756 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:51,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:51,756 INFO L82 PathProgramCache]: Analyzing trace with hash 448017816, now seen corresponding path program 1 times [2019-09-10 07:23:51,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:51,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:51,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:51,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:51,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:51,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:23:51,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:51,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:23:51,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:51,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:23:51,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:23:51,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:51,842 INFO L87 Difference]: Start difference. First operand 128946 states and 192561 transitions. Second operand 3 states. [2019-09-10 07:23:52,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:23:52,435 INFO L93 Difference]: Finished difference Result 187910 states and 278260 transitions. [2019-09-10 07:23:52,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:23:52,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-10 07:23:52,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:23:52,777 INFO L225 Difference]: With dead ends: 187910 [2019-09-10 07:23:52,777 INFO L226 Difference]: Without dead ends: 187910 [2019-09-10 07:23:52,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:52,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187910 states. [2019-09-10 07:23:57,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187910 to 186852. [2019-09-10 07:23:57,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186852 states. [2019-09-10 07:23:57,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186852 states to 186852 states and 277203 transitions. [2019-09-10 07:23:57,870 INFO L78 Accepts]: Start accepts. Automaton has 186852 states and 277203 transitions. Word has length 86 [2019-09-10 07:23:57,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:57,870 INFO L475 AbstractCegarLoop]: Abstraction has 186852 states and 277203 transitions. [2019-09-10 07:23:57,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:23:57,870 INFO L276 IsEmpty]: Start isEmpty. Operand 186852 states and 277203 transitions. [2019-09-10 07:23:57,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 07:23:57,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:57,918 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:23:57,918 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:57,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:57,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1810123221, now seen corresponding path program 1 times [2019-09-10 07:23:57,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:57,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:57,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:57,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:57,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:58,042 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:23:58,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:23:58,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:23:58,044 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 117 with the following transitions: [2019-09-10 07:23:58,046 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [128], [149], [152], [155], [158], [163], [165], [168], [179], [181], [184], [195], [197], [200], [211], [213], [216], [227], [229], [232], [235], [237], [240], [241], [243], [252], [263], [265], [278], [286], [305], [316], [318], [331], [339], [358], [369], [371], [384], [392], [411], [422], [424], [437], [445], [464], [466], [469], [477], [480], [483], [486], [488], [490], [532], [545], [553], [598], [599], [603], [604], [605] [2019-09-10 07:23:58,091 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:23:58,091 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:23:58,276 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:23:58,627 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:23:58,630 INFO L272 AbstractInterpreter]: Visited 100 different actions 292 times. Merged at 49 different actions 162 times. Widened at 3 different actions 5 times. Performed 1088 root evaluator evaluations with a maximum evaluation depth of 7. Performed 1088 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 22 fixpoints after 7 different actions. Largest state had 166 variables. [2019-09-10 07:23:58,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:58,635 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:23:58,969 INFO L227 lantSequenceWeakener]: Weakened 78 states. On average, predicates are now at 81.39% of their original sizes. [2019-09-10 07:23:58,970 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:24:05,812 INFO L420 sIntCurrentIteration]: We unified 115 AI predicates to 115 [2019-09-10 07:24:05,813 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:24:05,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:24:05,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [57] imperfect sequences [7] total 62 [2019-09-10 07:24:05,814 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:24:05,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-10 07:24:05,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-10 07:24:05,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2818, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 07:24:05,817 INFO L87 Difference]: Start difference. First operand 186852 states and 277203 transitions. Second operand 57 states. [2019-09-10 07:25:56,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:56,747 INFO L93 Difference]: Finished difference Result 690993 states and 978624 transitions. [2019-09-10 07:25:56,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 568 states. [2019-09-10 07:25:56,747 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 116 [2019-09-10 07:25:56,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:58,506 INFO L225 Difference]: With dead ends: 690993 [2019-09-10 07:25:58,507 INFO L226 Difference]: Without dead ends: 690993 [2019-09-10 07:25:58,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 586 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156879 ImplicationChecksByTransitivity, 47.2s TimeCoverageRelationStatistics Valid=34113, Invalid=311043, Unknown=0, NotChecked=0, Total=345156 [2019-09-10 07:25:59,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690993 states. [2019-09-10 07:26:07,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690993 to 303400. [2019-09-10 07:26:07,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303400 states. [2019-09-10 07:26:16,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303400 states to 303400 states and 440969 transitions. [2019-09-10 07:26:16,142 INFO L78 Accepts]: Start accepts. Automaton has 303400 states and 440969 transitions. Word has length 116 [2019-09-10 07:26:16,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:16,143 INFO L475 AbstractCegarLoop]: Abstraction has 303400 states and 440969 transitions. [2019-09-10 07:26:16,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-10 07:26:16,143 INFO L276 IsEmpty]: Start isEmpty. Operand 303400 states and 440969 transitions. [2019-09-10 07:26:16,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 07:26:16,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:16,293 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:16,293 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:16,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:16,294 INFO L82 PathProgramCache]: Analyzing trace with hash 157454759, now seen corresponding path program 1 times [2019-09-10 07:26:16,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:16,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:16,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:16,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:16,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:16,392 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:16,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:16,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:26:16,392 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:16,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:26:16,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:26:16,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:16,394 INFO L87 Difference]: Start difference. First operand 303400 states and 440969 transitions. Second operand 3 states. [2019-09-10 07:26:17,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:17,702 INFO L93 Difference]: Finished difference Result 441056 states and 635350 transitions. [2019-09-10 07:26:17,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:26:17,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 07:26:17,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:18,560 INFO L225 Difference]: With dead ends: 441056 [2019-09-10 07:26:18,561 INFO L226 Difference]: Without dead ends: 441056 [2019-09-10 07:26:18,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:18,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441056 states. [2019-09-10 07:26:34,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441056 to 426089. [2019-09-10 07:26:34,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426089 states. [2019-09-10 07:26:35,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426089 states to 426089 states and 615063 transitions. [2019-09-10 07:26:35,826 INFO L78 Accepts]: Start accepts. Automaton has 426089 states and 615063 transitions. Word has length 116 [2019-09-10 07:26:35,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:35,827 INFO L475 AbstractCegarLoop]: Abstraction has 426089 states and 615063 transitions. [2019-09-10 07:26:35,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:26:35,827 INFO L276 IsEmpty]: Start isEmpty. Operand 426089 states and 615063 transitions. [2019-09-10 07:26:35,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 07:26:35,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:35,899 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:35,899 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:35,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:35,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1474073926, now seen corresponding path program 1 times [2019-09-10 07:26:35,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:35,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:35,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:35,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:35,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:35,984 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:35,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:35,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:26:35,985 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:35,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:26:35,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:26:35,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:35,987 INFO L87 Difference]: Start difference. First operand 426089 states and 615063 transitions. Second operand 3 states. [2019-09-10 07:26:39,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:39,278 INFO L93 Difference]: Finished difference Result 547749 states and 783016 transitions. [2019-09-10 07:26:39,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:26:39,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 07:26:39,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:40,062 INFO L225 Difference]: With dead ends: 547749 [2019-09-10 07:26:40,062 INFO L226 Difference]: Without dead ends: 547749 [2019-09-10 07:26:40,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:40,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547749 states. [2019-09-10 07:26:56,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547749 to 514955. [2019-09-10 07:26:56,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514955 states. [2019-09-10 07:26:58,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514955 states to 514955 states and 737307 transitions. [2019-09-10 07:26:58,772 INFO L78 Accepts]: Start accepts. Automaton has 514955 states and 737307 transitions. Word has length 116 [2019-09-10 07:26:58,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:58,773 INFO L475 AbstractCegarLoop]: Abstraction has 514955 states and 737307 transitions. [2019-09-10 07:26:58,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:26:58,773 INFO L276 IsEmpty]: Start isEmpty. Operand 514955 states and 737307 transitions. [2019-09-10 07:26:58,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 07:26:58,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:58,853 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:26:58,853 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:58,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:58,853 INFO L82 PathProgramCache]: Analyzing trace with hash 987238095, now seen corresponding path program 1 times [2019-09-10 07:26:58,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:58,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:58,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:58,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:58,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:58,925 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:58,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:58,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:26:58,925 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:58,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:26:58,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:26:58,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:58,927 INFO L87 Difference]: Start difference. First operand 514955 states and 737307 transitions. Second operand 3 states. [2019-09-10 07:27:00,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:27:00,276 INFO L93 Difference]: Finished difference Result 577868 states and 816997 transitions. [2019-09-10 07:27:00,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:27:00,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 07:27:00,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:27:03,104 INFO L225 Difference]: With dead ends: 577868 [2019-09-10 07:27:03,105 INFO L226 Difference]: Without dead ends: 531801 [2019-09-10 07:27:03,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:27:03,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531801 states. [2019-09-10 07:27:17,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531801 to 506246. [2019-09-10 07:27:17,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506246 states. [2019-09-10 07:27:18,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506246 states to 506246 states and 716615 transitions. [2019-09-10 07:27:18,136 INFO L78 Accepts]: Start accepts. Automaton has 506246 states and 716615 transitions. Word has length 116 [2019-09-10 07:27:18,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:27:18,136 INFO L475 AbstractCegarLoop]: Abstraction has 506246 states and 716615 transitions. [2019-09-10 07:27:18,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:27:18,136 INFO L276 IsEmpty]: Start isEmpty. Operand 506246 states and 716615 transitions. [2019-09-10 07:27:18,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 07:27:18,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:27:18,208 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:27:18,208 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:27:18,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:27:18,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1342442521, now seen corresponding path program 1 times [2019-09-10 07:27:18,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:27:18,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:18,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:27:18,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:18,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:27:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:27:18,286 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:27:18,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:27:18,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:27:18,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:27:18,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:27:18,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:27:18,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:27:18,288 INFO L87 Difference]: Start difference. First operand 506246 states and 716615 transitions. Second operand 3 states. [2019-09-10 07:27:26,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:27:26,285 INFO L93 Difference]: Finished difference Result 756217 states and 1062291 transitions. [2019-09-10 07:27:26,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:27:26,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 07:27:26,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:27:27,480 INFO L225 Difference]: With dead ends: 756217 [2019-09-10 07:27:27,480 INFO L226 Difference]: Without dead ends: 748520 [2019-09-10 07:27:27,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:27:29,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748520 states. [2019-09-10 07:27:40,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748520 to 736056. [2019-09-10 07:27:40,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736056 states. [2019-09-10 07:27:51,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736056 states to 736056 states and 1034749 transitions. [2019-09-10 07:27:51,815 INFO L78 Accepts]: Start accepts. Automaton has 736056 states and 1034749 transitions. Word has length 116 [2019-09-10 07:27:51,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:27:51,816 INFO L475 AbstractCegarLoop]: Abstraction has 736056 states and 1034749 transitions. [2019-09-10 07:27:51,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:27:51,816 INFO L276 IsEmpty]: Start isEmpty. Operand 736056 states and 1034749 transitions. [2019-09-10 07:27:51,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 07:27:51,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:27:51,891 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:27:51,891 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:27:51,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:27:51,892 INFO L82 PathProgramCache]: Analyzing trace with hash -448257870, now seen corresponding path program 1 times [2019-09-10 07:27:51,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:27:51,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:51,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:27:51,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:51,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:27:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:27:52,016 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:27:52,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:27:52,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:27:52,017 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 117 with the following transitions: [2019-09-10 07:27:52,017 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [128], [149], [152], [163], [165], [168], [171], [174], [179], [181], [184], [195], [197], [200], [211], [213], [216], [227], [229], [232], [235], [237], [240], [241], [243], [252], [263], [265], [278], [286], [305], [316], [318], [331], [339], [358], [369], [371], [384], [392], [411], [413], [416], [424], [427], [430], [433], [435], [437], [475], [477], [490], [498], [517], [532], [545], [553], [598], [599], [603], [604], [605] [2019-09-10 07:27:52,023 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:27:52,023 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:27:52,047 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:27:52,184 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:27:52,185 INFO L272 AbstractInterpreter]: Visited 100 different actions 332 times. Merged at 49 different actions 195 times. Widened at 6 different actions 11 times. Performed 1232 root evaluator evaluations with a maximum evaluation depth of 7. Performed 1232 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 23 fixpoints after 6 different actions. Largest state had 166 variables. [2019-09-10 07:27:52,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:27:52,186 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:27:52,387 INFO L227 lantSequenceWeakener]: Weakened 78 states. On average, predicates are now at 81.43% of their original sizes. [2019-09-10 07:27:52,388 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:27:58,500 INFO L420 sIntCurrentIteration]: We unified 115 AI predicates to 115 [2019-09-10 07:27:58,501 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:27:58,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:27:58,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [57] imperfect sequences [7] total 62 [2019-09-10 07:27:58,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:27:58,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-10 07:27:58,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-10 07:27:58,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=2824, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 07:27:58,503 INFO L87 Difference]: Start difference. First operand 736056 states and 1034749 transitions. Second operand 57 states. [2019-09-10 07:30:11,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:30:11,905 INFO L93 Difference]: Finished difference Result 1917426 states and 2640560 transitions. [2019-09-10 07:30:11,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 596 states. [2019-09-10 07:30:11,905 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 116 [2019-09-10 07:30:11,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:30:16,993 INFO L225 Difference]: With dead ends: 1917426 [2019-09-10 07:30:16,993 INFO L226 Difference]: Without dead ends: 1917426 [2019-09-10 07:30:17,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 614 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173250 ImplicationChecksByTransitivity, 54.5s TimeCoverageRelationStatistics Valid=34684, Invalid=344156, Unknown=0, NotChecked=0, Total=378840 [2019-09-10 07:30:18,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917426 states. [2019-09-10 07:31:00,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917426 to 918963. [2019-09-10 07:31:00,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918963 states. [2019-09-10 07:31:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918963 states to 918963 states and 1280992 transitions. [2019-09-10 07:31:04,451 INFO L78 Accepts]: Start accepts. Automaton has 918963 states and 1280992 transitions. Word has length 116 [2019-09-10 07:31:04,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:31:04,451 INFO L475 AbstractCegarLoop]: Abstraction has 918963 states and 1280992 transitions. [2019-09-10 07:31:04,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-10 07:31:04,452 INFO L276 IsEmpty]: Start isEmpty. Operand 918963 states and 1280992 transitions. [2019-09-10 07:31:04,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 07:31:04,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:31:04,541 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:31:04,541 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:31:04,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:04,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1316462549, now seen corresponding path program 1 times [2019-09-10 07:31:04,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:31:04,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:04,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:31:04,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:31:04,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:31:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:31:04,658 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:31:04,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:31:04,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:31:04,659 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 117 with the following transitions: [2019-09-10 07:31:04,660 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [128], [149], [152], [163], [165], [168], [179], [181], [184], [187], [190], [195], [197], [200], [211], [213], [216], [227], [229], [232], [235], [237], [240], [241], [243], [252], [263], [265], [278], [286], [305], [316], [318], [331], [339], [358], [360], [363], [371], [374], [377], [380], [382], [384], [422], [424], [437], [445], [464], [475], [477], [490], [498], [517], [532], [545], [553], [598], [599], [603], [604], [605] [2019-09-10 07:31:04,671 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:31:04,671 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:31:04,693 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:31:04,858 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:31:04,859 INFO L272 AbstractInterpreter]: Visited 100 different actions 364 times. Merged at 49 different actions 224 times. Widened at 11 different actions 19 times. Performed 1345 root evaluator evaluations with a maximum evaluation depth of 7. Performed 1345 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 24 fixpoints after 9 different actions. Largest state had 166 variables. [2019-09-10 07:31:04,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:31:04,860 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:31:05,118 INFO L227 lantSequenceWeakener]: Weakened 78 states. On average, predicates are now at 81.51% of their original sizes. [2019-09-10 07:31:05,120 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:31:18,327 INFO L420 sIntCurrentIteration]: We unified 115 AI predicates to 115 [2019-09-10 07:31:18,328 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:31:18,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:31:18,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [56] imperfect sequences [7] total 61 [2019-09-10 07:31:18,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:31:18,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-10 07:31:18,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-10 07:31:18,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=2714, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 07:31:18,329 INFO L87 Difference]: Start difference. First operand 918963 states and 1280992 transitions. Second operand 56 states. [2019-09-10 07:33:06,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:33:06,027 INFO L93 Difference]: Finished difference Result 1995863 states and 2743459 transitions. [2019-09-10 07:33:06,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 468 states. [2019-09-10 07:33:06,028 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 116 [2019-09-10 07:33:06,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:33:11,527 INFO L225 Difference]: With dead ends: 1995863 [2019-09-10 07:33:11,527 INFO L226 Difference]: Without dead ends: 1995863 [2019-09-10 07:33:11,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 487 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106316 ImplicationChecksByTransitivity, 48.2s TimeCoverageRelationStatistics Valid=22584, Invalid=216048, Unknown=0, NotChecked=0, Total=238632 [2019-09-10 07:33:12,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995863 states. [2019-09-10 07:34:02,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995863 to 986131. [2019-09-10 07:34:02,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986131 states. [2019-09-10 07:34:06,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986131 states to 986131 states and 1369849 transitions. [2019-09-10 07:34:06,717 INFO L78 Accepts]: Start accepts. Automaton has 986131 states and 1369849 transitions. Word has length 116 [2019-09-10 07:34:06,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:34:06,717 INFO L475 AbstractCegarLoop]: Abstraction has 986131 states and 1369849 transitions. [2019-09-10 07:34:06,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-10 07:34:06,717 INFO L276 IsEmpty]: Start isEmpty. Operand 986131 states and 1369849 transitions. [2019-09-10 07:34:06,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 07:34:06,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:34:06,808 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:34:06,809 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:34:06,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:06,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1396888186, now seen corresponding path program 1 times [2019-09-10 07:34:06,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:34:06,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:06,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:34:06,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:34:06,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:34:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:34:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:34:06,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:34:06,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:34:06,945 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 117 with the following transitions: [2019-09-10 07:34:06,946 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [128], [149], [152], [163], [165], [168], [179], [181], [184], [195], [197], [200], [203], [206], [211], [213], [216], [227], [229], [232], [235], [237], [240], [241], [243], [252], [263], [265], [278], [286], [305], [307], [310], [318], [321], [324], [327], [329], [331], [369], [371], [384], [392], [411], [422], [424], [437], [445], [464], [475], [477], [490], [498], [517], [532], [545], [553], [598], [599], [603], [604], [605] [2019-09-10 07:34:06,951 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:34:06,952 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:34:06,986 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:34:07,180 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:34:07,180 INFO L272 AbstractInterpreter]: Visited 100 different actions 354 times. Merged at 49 different actions 216 times. Widened at 10 different actions 17 times. Performed 1287 root evaluator evaluations with a maximum evaluation depth of 7. Performed 1287 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 22 fixpoints after 7 different actions. Largest state had 166 variables. [2019-09-10 07:34:07,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:34:07,181 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:34:07,333 INFO L227 lantSequenceWeakener]: Weakened 78 states. On average, predicates are now at 81.62% of their original sizes. [2019-09-10 07:34:07,334 INFO L418 sIntCurrentIteration]: Unifying AI predicates