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/pals_lcr.6.ufo.BOUNDED-12.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:35:53,544 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:35:53,547 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:35:53,566 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:35:53,566 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:35:53,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:35:53,570 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:35:53,583 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:35:53,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:35:53,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:35:53,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:35:53,591 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:35:53,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:35:53,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:35:53,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:35:53,598 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:35:53,601 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:35:53,602 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:35:53,606 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:35:53,608 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:35:53,613 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:35:53,616 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:35:53,619 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:35:53,620 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:35:53,622 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:35:53,622 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:35:53,623 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:35:53,626 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:35:53,628 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:35:53,629 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:35:53,629 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:35:53,631 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:35:53,632 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:35:53,633 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:35:53,635 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:35:53,635 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:35:53,636 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:35:53,636 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:35:53,636 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:35:53,637 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:35:53,638 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:35:53,639 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 04:35:53,664 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:35:53,665 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:35:53,666 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:35:53,666 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:35:53,666 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:35:53,667 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:35:53,667 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:35:53,667 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:35:53,667 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:35:53,667 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:35:53,670 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:35:53,670 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:35:53,670 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:35:53,671 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:35:53,671 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:35:53,671 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:35:53,671 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:35:53,672 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:35:53,672 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:35:53,672 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:35:53,672 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:35:53,672 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:35:53,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:35:53,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:35:53,673 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:35:53,673 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:35:53,673 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:35:53,674 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:35:53,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:35:53,674 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:35:53,728 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:35:53,743 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:35:53,748 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:35:53,750 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:35:53,751 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:35:53,752 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.6.ufo.BOUNDED-12.pals.c [2019-09-10 04:35:53,826 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c966aa15b/91f80dacad014c2a80437e9ee7ee82b3/FLAGfcfd098a9 [2019-09-10 04:35:54,294 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:35:54,295 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.6.ufo.BOUNDED-12.pals.c [2019-09-10 04:35:54,306 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c966aa15b/91f80dacad014c2a80437e9ee7ee82b3/FLAGfcfd098a9 [2019-09-10 04:35:54,669 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c966aa15b/91f80dacad014c2a80437e9ee7ee82b3 [2019-09-10 04:35:54,680 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:35:54,681 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:35:54,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:35:54,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:35:54,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:35:54,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:35:54" (1/1) ... [2019-09-10 04:35:54,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@788c9ce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:35:54, skipping insertion in model container [2019-09-10 04:35:54,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:35:54" (1/1) ... [2019-09-10 04:35:54,697 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:35:54,747 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:35:55,103 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:35:55,113 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:35:55,170 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:35:55,189 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:35:55,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:35:55 WrapperNode [2019-09-10 04:35:55,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:35:55,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:35:55,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:35:55,191 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:35:55,201 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:35:55" (1/1) ... [2019-09-10 04:35:55,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:35:55" (1/1) ... [2019-09-10 04:35:55,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:35:55" (1/1) ... [2019-09-10 04:35:55,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:35:55" (1/1) ... [2019-09-10 04:35:55,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:35:55" (1/1) ... [2019-09-10 04:35:55,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:35:55" (1/1) ... [2019-09-10 04:35:55,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:35:55" (1/1) ... [2019-09-10 04:35:55,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:35:55,249 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:35:55,249 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:35:55,249 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:35:55,250 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:35:55" (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 04:35:55,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:35:55,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:35:55,306 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:35:55,306 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:35:55,306 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:35:55,306 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:35:55,306 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-10 04:35:55,307 INFO L138 BoogieDeclarations]: Found implementation of procedure node6 [2019-09-10 04:35:55,307 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:35:55,307 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:35:55,307 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:35:55,307 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:35:55,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:35:55,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:35:55,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:35:55,308 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:35:55,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:35:55,308 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:35:55,308 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:35:55,308 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:35:55,309 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:35:55,309 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:35:55,309 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:35:55,309 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 04:35:55,309 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 04:35:55,309 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:35:55,310 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:35:55,310 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:35:55,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:35:55,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:35:56,011 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:35:56,012 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:35:56,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:35:56 BoogieIcfgContainer [2019-09-10 04:35:56,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:35:56,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:35:56,014 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:35:56,017 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:35:56,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:35:54" (1/3) ... [2019-09-10 04:35:56,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3b808a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:35:56, skipping insertion in model container [2019-09-10 04:35:56,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:35:55" (2/3) ... [2019-09-10 04:35:56,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c3b808a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:35:56, skipping insertion in model container [2019-09-10 04:35:56,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:35:56" (3/3) ... [2019-09-10 04:35:56,021 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c [2019-09-10 04:35:56,031 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:35:56,040 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:35:56,055 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:35:56,077 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:35:56,078 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:35:56,078 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:35:56,078 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:35:56,078 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:35:56,078 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:35:56,078 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:35:56,078 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:35:56,097 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2019-09-10 04:35:56,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 04:35:56,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:35:56,112 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] [2019-09-10 04:35:56,113 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:35:56,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:35:56,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1413295764, now seen corresponding path program 1 times [2019-09-10 04:35:56,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:35:56,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:56,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:35:56,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:56,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:35:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:35:56,569 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 04:35:56,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:35:56,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:35:56,573 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:35:56,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:35:56,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:35:56,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:35:56,596 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 5 states. [2019-09-10 04:35:56,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:35:56,745 INFO L93 Difference]: Finished difference Result 148 states and 222 transitions. [2019-09-10 04:35:56,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:35:56,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-10 04:35:56,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:35:56,761 INFO L225 Difference]: With dead ends: 148 [2019-09-10 04:35:56,761 INFO L226 Difference]: Without dead ends: 139 [2019-09-10 04:35:56,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 04:35:56,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-10 04:35:56,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-09-10 04:35:56,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-10 04:35:56,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 174 transitions. [2019-09-10 04:35:56,837 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 174 transitions. Word has length 68 [2019-09-10 04:35:56,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:35:56,838 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 174 transitions. [2019-09-10 04:35:56,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:35:56,838 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 174 transitions. [2019-09-10 04:35:56,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 04:35:56,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:35:56,843 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:35:56,843 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:35:56,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:35:56,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1130534395, now seen corresponding path program 1 times [2019-09-10 04:35:56,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:35:56,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:56,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:35:56,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:56,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:35:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:35:57,376 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 04:35:57,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:35:57,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 04:35:57,377 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:35:57,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 04:35:57,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 04:35:57,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 04:35:57,380 INFO L87 Difference]: Start difference. First operand 139 states and 174 transitions. Second operand 15 states. [2019-09-10 04:36:06,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:36:06,739 INFO L93 Difference]: Finished difference Result 1485 states and 2286 transitions. [2019-09-10 04:36:06,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-10 04:36:06,740 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 107 [2019-09-10 04:36:06,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:36:06,802 INFO L225 Difference]: With dead ends: 1485 [2019-09-10 04:36:06,803 INFO L226 Difference]: Without dead ends: 1485 [2019-09-10 04:36:06,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2177 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1247, Invalid=4759, Unknown=0, NotChecked=0, Total=6006 [2019-09-10 04:36:06,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2019-09-10 04:36:07,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1121. [2019-09-10 04:36:07,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1121 states. [2019-09-10 04:36:07,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1601 transitions. [2019-09-10 04:36:07,062 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1601 transitions. Word has length 107 [2019-09-10 04:36:07,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:36:07,066 INFO L475 AbstractCegarLoop]: Abstraction has 1121 states and 1601 transitions. [2019-09-10 04:36:07,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 04:36:07,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1601 transitions. [2019-09-10 04:36:07,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 04:36:07,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:36:07,088 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, 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 04:36:07,089 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:36:07,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:07,089 INFO L82 PathProgramCache]: Analyzing trace with hash -2055527989, now seen corresponding path program 1 times [2019-09-10 04:36:07,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:36:07,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:07,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:36:07,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:07,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:36:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:36:07,210 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 04:36:07,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:36:07,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 04:36:07,211 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:36:07,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 04:36:07,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 04:36:07,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 04:36:07,213 INFO L87 Difference]: Start difference. First operand 1121 states and 1601 transitions. Second operand 3 states. [2019-09-10 04:36:07,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:36:07,266 INFO L93 Difference]: Finished difference Result 2113 states and 3018 transitions. [2019-09-10 04:36:07,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 04:36:07,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-10 04:36:07,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:36:07,285 INFO L225 Difference]: With dead ends: 2113 [2019-09-10 04:36:07,285 INFO L226 Difference]: Without dead ends: 2113 [2019-09-10 04:36:07,286 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 04:36:07,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2019-09-10 04:36:07,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 2111. [2019-09-10 04:36:07,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2111 states. [2019-09-10 04:36:07,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 3017 transitions. [2019-09-10 04:36:07,398 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 3017 transitions. Word has length 109 [2019-09-10 04:36:07,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:36:07,399 INFO L475 AbstractCegarLoop]: Abstraction has 2111 states and 3017 transitions. [2019-09-10 04:36:07,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 04:36:07,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 3017 transitions. [2019-09-10 04:36:07,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 04:36:07,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:36:07,404 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, 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 04:36:07,404 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:36:07,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:07,405 INFO L82 PathProgramCache]: Analyzing trace with hash 951736851, now seen corresponding path program 1 times [2019-09-10 04:36:07,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:36:07,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:07,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:36:07,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:07,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:36:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:36:07,589 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 04:36:07,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:36:07,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:36:07,590 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:36:07,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:36:07,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:36:07,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:36:07,591 INFO L87 Difference]: Start difference. First operand 2111 states and 3017 transitions. Second operand 5 states. [2019-09-10 04:36:08,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:36:08,202 INFO L93 Difference]: Finished difference Result 3266 states and 4616 transitions. [2019-09-10 04:36:08,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:36:08,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-10 04:36:08,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:36:08,222 INFO L225 Difference]: With dead ends: 3266 [2019-09-10 04:36:08,222 INFO L226 Difference]: Without dead ends: 3266 [2019-09-10 04:36:08,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:36:08,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2019-09-10 04:36:08,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 3264. [2019-09-10 04:36:08,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3264 states. [2019-09-10 04:36:08,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3264 states to 3264 states and 4615 transitions. [2019-09-10 04:36:08,352 INFO L78 Accepts]: Start accepts. Automaton has 3264 states and 4615 transitions. Word has length 109 [2019-09-10 04:36:08,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:36:08,353 INFO L475 AbstractCegarLoop]: Abstraction has 3264 states and 4615 transitions. [2019-09-10 04:36:08,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:36:08,353 INFO L276 IsEmpty]: Start isEmpty. Operand 3264 states and 4615 transitions. [2019-09-10 04:36:08,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 04:36:08,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:36:08,356 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, 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 04:36:08,356 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:36:08,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:08,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1139243427, now seen corresponding path program 1 times [2019-09-10 04:36:08,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:36:08,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:08,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:36:08,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:08,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:36:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:36:08,525 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 04:36:08,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:36:08,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:36:08,526 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:36:08,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:36:08,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:36:08,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:36:08,528 INFO L87 Difference]: Start difference. First operand 3264 states and 4615 transitions. Second operand 5 states. [2019-09-10 04:36:09,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:36:09,106 INFO L93 Difference]: Finished difference Result 6251 states and 8779 transitions. [2019-09-10 04:36:09,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:36:09,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-10 04:36:09,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:36:09,140 INFO L225 Difference]: With dead ends: 6251 [2019-09-10 04:36:09,140 INFO L226 Difference]: Without dead ends: 6251 [2019-09-10 04:36:09,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:36:09,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6251 states. [2019-09-10 04:36:09,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6251 to 6249. [2019-09-10 04:36:09,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6249 states. [2019-09-10 04:36:09,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6249 states to 6249 states and 8778 transitions. [2019-09-10 04:36:09,347 INFO L78 Accepts]: Start accepts. Automaton has 6249 states and 8778 transitions. Word has length 109 [2019-09-10 04:36:09,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:36:09,349 INFO L475 AbstractCegarLoop]: Abstraction has 6249 states and 8778 transitions. [2019-09-10 04:36:09,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:36:09,349 INFO L276 IsEmpty]: Start isEmpty. Operand 6249 states and 8778 transitions. [2019-09-10 04:36:09,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 04:36:09,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:36:09,352 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, 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 04:36:09,352 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:36:09,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:09,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1804548435, now seen corresponding path program 1 times [2019-09-10 04:36:09,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:36:09,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:09,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:36:09,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:09,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:36:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:36:09,630 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 04:36:09,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:36:09,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:36:09,631 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:36:09,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:36:09,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:36:09,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:36:09,633 INFO L87 Difference]: Start difference. First operand 6249 states and 8778 transitions. Second operand 5 states. [2019-09-10 04:36:10,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:36:10,199 INFO L93 Difference]: Finished difference Result 11978 states and 16694 transitions. [2019-09-10 04:36:10,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:36:10,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-10 04:36:10,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:36:10,292 INFO L225 Difference]: With dead ends: 11978 [2019-09-10 04:36:10,292 INFO L226 Difference]: Without dead ends: 11978 [2019-09-10 04:36:10,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:36:10,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11978 states. [2019-09-10 04:36:10,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11978 to 11976. [2019-09-10 04:36:10,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11976 states. [2019-09-10 04:36:10,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11976 states to 11976 states and 16693 transitions. [2019-09-10 04:36:10,699 INFO L78 Accepts]: Start accepts. Automaton has 11976 states and 16693 transitions. Word has length 109 [2019-09-10 04:36:10,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:36:10,700 INFO L475 AbstractCegarLoop]: Abstraction has 11976 states and 16693 transitions. [2019-09-10 04:36:10,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:36:10,701 INFO L276 IsEmpty]: Start isEmpty. Operand 11976 states and 16693 transitions. [2019-09-10 04:36:10,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 04:36:10,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:36:10,704 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, 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 04:36:10,704 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:36:10,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:10,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1227473505, now seen corresponding path program 1 times [2019-09-10 04:36:10,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:36:10,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:10,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:36:10,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:10,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:36:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:36:10,871 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 04:36:10,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:36:10,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:36:10,871 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:36:10,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:36:10,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:36:10,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:36:10,873 INFO L87 Difference]: Start difference. First operand 11976 states and 16693 transitions. Second operand 5 states. [2019-09-10 04:36:11,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:36:11,514 INFO L93 Difference]: Finished difference Result 22928 states and 31690 transitions. [2019-09-10 04:36:11,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:36:11,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-10 04:36:11,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:36:11,626 INFO L225 Difference]: With dead ends: 22928 [2019-09-10 04:36:11,627 INFO L226 Difference]: Without dead ends: 22928 [2019-09-10 04:36:11,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:36:11,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22928 states. [2019-09-10 04:36:12,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22928 to 22926. [2019-09-10 04:36:12,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22926 states. [2019-09-10 04:36:12,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22926 states to 22926 states and 31689 transitions. [2019-09-10 04:36:12,186 INFO L78 Accepts]: Start accepts. Automaton has 22926 states and 31689 transitions. Word has length 109 [2019-09-10 04:36:12,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:36:12,186 INFO L475 AbstractCegarLoop]: Abstraction has 22926 states and 31689 transitions. [2019-09-10 04:36:12,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:36:12,186 INFO L276 IsEmpty]: Start isEmpty. Operand 22926 states and 31689 transitions. [2019-09-10 04:36:12,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 04:36:12,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:36:12,188 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, 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 04:36:12,188 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:36:12,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:12,189 INFO L82 PathProgramCache]: Analyzing trace with hash 20035349, now seen corresponding path program 1 times [2019-09-10 04:36:12,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:36:12,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:12,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:36:12,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:12,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:36:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:36:12,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:36:12,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:36:12,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:36:12,297 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:36:12,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:36:12,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:36:12,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:36:12,298 INFO L87 Difference]: Start difference. First operand 22926 states and 31689 transitions. Second operand 5 states. [2019-09-10 04:36:13,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:36:13,151 INFO L93 Difference]: Finished difference Result 43784 states and 59990 transitions. [2019-09-10 04:36:13,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:36:13,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-10 04:36:13,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:36:13,302 INFO L225 Difference]: With dead ends: 43784 [2019-09-10 04:36:13,302 INFO L226 Difference]: Without dead ends: 43784 [2019-09-10 04:36:13,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:36:13,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43784 states. [2019-09-10 04:36:14,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43784 to 43782. [2019-09-10 04:36:14,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43782 states. [2019-09-10 04:36:15,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43782 states to 43782 states and 59989 transitions. [2019-09-10 04:36:15,032 INFO L78 Accepts]: Start accepts. Automaton has 43782 states and 59989 transitions. Word has length 109 [2019-09-10 04:36:15,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:36:15,033 INFO L475 AbstractCegarLoop]: Abstraction has 43782 states and 59989 transitions. [2019-09-10 04:36:15,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:36:15,033 INFO L276 IsEmpty]: Start isEmpty. Operand 43782 states and 59989 transitions. [2019-09-10 04:36:15,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 04:36:15,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:36:15,034 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, 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 04:36:15,035 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:36:15,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:15,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1618192801, now seen corresponding path program 1 times [2019-09-10 04:36:15,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:36:15,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:15,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:36:15,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:15,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:36:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:36:15,132 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 04:36:15,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:36:15,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:36:15,133 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:36:15,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:36:15,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:36:15,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:36:15,134 INFO L87 Difference]: Start difference. First operand 43782 states and 59989 transitions. Second operand 5 states. [2019-09-10 04:36:15,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:36:15,973 INFO L93 Difference]: Finished difference Result 83336 states and 113158 transitions. [2019-09-10 04:36:15,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:36:15,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-10 04:36:15,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:36:16,241 INFO L225 Difference]: With dead ends: 83336 [2019-09-10 04:36:16,242 INFO L226 Difference]: Without dead ends: 83336 [2019-09-10 04:36:16,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:36:16,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83336 states. [2019-09-10 04:36:18,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83336 to 83334. [2019-09-10 04:36:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83334 states. [2019-09-10 04:36:18,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83334 states to 83334 states and 113157 transitions. [2019-09-10 04:36:18,892 INFO L78 Accepts]: Start accepts. Automaton has 83334 states and 113157 transitions. Word has length 109 [2019-09-10 04:36:18,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:36:18,892 INFO L475 AbstractCegarLoop]: Abstraction has 83334 states and 113157 transitions. [2019-09-10 04:36:18,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:36:18,892 INFO L276 IsEmpty]: Start isEmpty. Operand 83334 states and 113157 transitions. [2019-09-10 04:36:18,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 04:36:18,893 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:36:18,893 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, 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 04:36:18,894 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:36:18,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:18,894 INFO L82 PathProgramCache]: Analyzing trace with hash -422447531, now seen corresponding path program 1 times [2019-09-10 04:36:18,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:36:18,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:18,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:36:18,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:18,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:36:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:36:19,210 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 04:36:19,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:36:19,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 04:36:19,211 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:36:19,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 04:36:19,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 04:36:19,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 04:36:19,212 INFO L87 Difference]: Start difference. First operand 83334 states and 113157 transitions. Second operand 15 states. [2019-09-10 04:36:30,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:36:30,343 INFO L93 Difference]: Finished difference Result 139016 states and 218638 transitions. [2019-09-10 04:36:30,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-10 04:36:30,343 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 109 [2019-09-10 04:36:30,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:36:30,980 INFO L225 Difference]: With dead ends: 139016 [2019-09-10 04:36:30,980 INFO L226 Difference]: Without dead ends: 139016 [2019-09-10 04:36:30,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1250, Invalid=4450, Unknown=0, NotChecked=0, Total=5700 [2019-09-10 04:36:31,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139016 states. [2019-09-10 04:36:34,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139016 to 83718. [2019-09-10 04:36:34,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83718 states. [2019-09-10 04:36:34,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83718 states to 83718 states and 113157 transitions. [2019-09-10 04:36:34,640 INFO L78 Accepts]: Start accepts. Automaton has 83718 states and 113157 transitions. Word has length 109 [2019-09-10 04:36:34,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:36:34,640 INFO L475 AbstractCegarLoop]: Abstraction has 83718 states and 113157 transitions. [2019-09-10 04:36:34,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 04:36:34,640 INFO L276 IsEmpty]: Start isEmpty. Operand 83718 states and 113157 transitions. [2019-09-10 04:36:34,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 04:36:34,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:36:34,641 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, 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 04:36:34,642 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:36:34,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:34,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1388409668, now seen corresponding path program 1 times [2019-09-10 04:36:34,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:36:34,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:34,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:36:34,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:34,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:36:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:36:34,734 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 04:36:34,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:36:34,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:36:34,734 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:36:34,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:36:34,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:36:34,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:36:34,735 INFO L87 Difference]: Start difference. First operand 83718 states and 113157 transitions. Second operand 5 states. [2019-09-10 04:36:37,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:36:37,578 INFO L93 Difference]: Finished difference Result 159454 states and 216860 transitions. [2019-09-10 04:36:37,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:36:37,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-10 04:36:37,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:36:37,990 INFO L225 Difference]: With dead ends: 159454 [2019-09-10 04:36:37,990 INFO L226 Difference]: Without dead ends: 159454 [2019-09-10 04:36:37,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:36:38,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159454 states. [2019-09-10 04:36:39,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159454 to 109690. [2019-09-10 04:36:39,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109690 states. [2019-09-10 04:36:40,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109690 states to 109690 states and 148090 transitions. [2019-09-10 04:36:40,053 INFO L78 Accepts]: Start accepts. Automaton has 109690 states and 148090 transitions. Word has length 110 [2019-09-10 04:36:40,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:36:40,053 INFO L475 AbstractCegarLoop]: Abstraction has 109690 states and 148090 transitions. [2019-09-10 04:36:40,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:36:40,053 INFO L276 IsEmpty]: Start isEmpty. Operand 109690 states and 148090 transitions. [2019-09-10 04:36:40,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 04:36:40,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:36:40,054 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, 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 04:36:40,054 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:36:40,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:40,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1259132667, now seen corresponding path program 1 times [2019-09-10 04:36:40,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:36:40,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:40,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:36:40,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:40,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:36:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:36:40,539 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 04:36:40,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:36:40,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 04:36:40,539 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:36:40,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 04:36:40,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 04:36:40,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:36:40,541 INFO L87 Difference]: Start difference. First operand 109690 states and 148090 transitions. Second operand 8 states. [2019-09-10 04:36:41,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:36:41,038 INFO L93 Difference]: Finished difference Result 139138 states and 197176 transitions. [2019-09-10 04:36:41,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 04:36:41,038 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 110 [2019-09-10 04:36:41,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:36:41,511 INFO L225 Difference]: With dead ends: 139138 [2019-09-10 04:36:41,511 INFO L226 Difference]: Without dead ends: 139138 [2019-09-10 04:36:41,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:36:41,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139138 states. [2019-09-10 04:36:44,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139138 to 122938. [2019-09-10 04:36:44,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122938 states. [2019-09-10 04:36:44,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122938 states to 122938 states and 161562 transitions. [2019-09-10 04:36:44,966 INFO L78 Accepts]: Start accepts. Automaton has 122938 states and 161562 transitions. Word has length 110 [2019-09-10 04:36:44,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:36:44,967 INFO L475 AbstractCegarLoop]: Abstraction has 122938 states and 161562 transitions. [2019-09-10 04:36:44,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 04:36:44,967 INFO L276 IsEmpty]: Start isEmpty. Operand 122938 states and 161562 transitions. [2019-09-10 04:36:45,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-10 04:36:45,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:36:45,005 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:36:45,005 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:36:45,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:45,005 INFO L82 PathProgramCache]: Analyzing trace with hash 33206831, now seen corresponding path program 1 times [2019-09-10 04:36:45,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:36:45,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:45,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:36:45,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:45,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:36:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:36:45,350 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-10 04:36:45,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:36:45,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:36:45,353 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 170 with the following transitions: [2019-09-10 04:36:45,357 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], [241], [242], [243], [245], [254], [261], [263], [265], [271], [274], [279], [282], [286], [299], [301], [302], [303], [306], [322], [324], [326], [329], [333], [335], [336], [339], [355], [357], [359], [362], [366], [368], [369], [372], [388], [390], [392], [395], [399], [401], [402], [405], [421], [423], [425], [428], [432], [434], [435], [436], [437], [440], [456], [458], [460], [465], [467], [469], [470], [473], [475], [478], [480], [481], [484], [487], [492], [495], [502], [504], [507], [511], [513], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [529], [530], [531], [532], [533], [534], [535], [536], [537] [2019-09-10 04:36:45,451 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:36:45,452 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:36:45,679 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:36:51,088 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:36:51,096 INFO L272 AbstractInterpreter]: Visited 133 different actions 1803 times. Merged at 22 different actions 393 times. Widened at 1 different actions 3 times. Performed 21840 root evaluator evaluations with a maximum evaluation depth of 6. Performed 21840 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 89 fixpoints after 9 different actions. Largest state had 134 variables. [2019-09-10 04:36:51,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:51,102 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:36:51,705 INFO L227 lantSequenceWeakener]: Weakened 133 states. On average, predicates are now at 78.03% of their original sizes. [2019-09-10 04:36:51,705 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:36:58,918 INFO L420 sIntCurrentIteration]: We unified 168 AI predicates to 168 [2019-09-10 04:36:58,919 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:36:58,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:36:58,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [90] imperfect sequences [17] total 105 [2019-09-10 04:36:58,920 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:36:58,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-10 04:36:58,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-10 04:36:58,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=691, Invalid=7319, Unknown=0, NotChecked=0, Total=8010 [2019-09-10 04:36:58,925 INFO L87 Difference]: Start difference. First operand 122938 states and 161562 transitions. Second operand 90 states. [2019-09-10 04:39:00,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:39:00,302 INFO L93 Difference]: Finished difference Result 139611 states and 197074 transitions. [2019-09-10 04:39:00,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2019-09-10 04:39:00,302 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 169 [2019-09-10 04:39:00,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:39:00,964 INFO L225 Difference]: With dead ends: 139611 [2019-09-10 04:39:00,964 INFO L226 Difference]: Without dead ends: 139611 [2019-09-10 04:39:00,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29775 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=5957, Invalid=77853, Unknown=0, NotChecked=0, Total=83810 [2019-09-10 04:39:01,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139611 states. [2019-09-10 04:39:05,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139611 to 120334. [2019-09-10 04:39:05,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120334 states. [2019-09-10 04:39:05,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120334 states to 120334 states and 157477 transitions. [2019-09-10 04:39:05,240 INFO L78 Accepts]: Start accepts. Automaton has 120334 states and 157477 transitions. Word has length 169 [2019-09-10 04:39:05,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:39:05,240 INFO L475 AbstractCegarLoop]: Abstraction has 120334 states and 157477 transitions. [2019-09-10 04:39:05,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-10 04:39:05,240 INFO L276 IsEmpty]: Start isEmpty. Operand 120334 states and 157477 transitions. [2019-09-10 04:39:05,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-10 04:39:05,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:39:05,276 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:39:05,277 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:39:05,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:05,278 INFO L82 PathProgramCache]: Analyzing trace with hash 582829849, now seen corresponding path program 1 times [2019-09-10 04:39:05,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:39:05,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:05,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:05,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:05,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:39:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:05,597 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 26 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 04:39:05,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:39:05,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:39:05,597 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 170 with the following transitions: [2019-09-10 04:39:05,600 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], [241], [242], [243], [245], [254], [261], [263], [265], [271], [274], [279], [282], [286], [299], [301], [302], [303], [306], [322], [324], [326], [329], [333], [335], [336], [339], [355], [357], [359], [362], [366], [368], [369], [372], [375], [380], [383], [390], [392], [395], [399], [401], [402], [405], [421], [423], [425], [428], [432], [434], [435], [436], [437], [440], [456], [458], [460], [463], [467], [469], [470], [473], [475], [478], [480], [481], [484], [500], [502], [504], [507], [511], [513], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [529], [530], [531], [532], [533], [534], [535], [536], [537] [2019-09-10 04:39:05,612 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:39:05,613 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:39:05,632 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:39:08,231 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:39:08,232 INFO L272 AbstractInterpreter]: Visited 134 different actions 2196 times. Merged at 24 different actions 522 times. Widened at 1 different actions 3 times. Performed 26745 root evaluator evaluations with a maximum evaluation depth of 6. Performed 26745 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 134 fixpoints after 9 different actions. Largest state had 134 variables. [2019-09-10 04:39:08,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:08,232 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:39:08,540 INFO L227 lantSequenceWeakener]: Weakened 134 states. On average, predicates are now at 77.99% of their original sizes. [2019-09-10 04:39:08,540 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:39:17,335 INFO L420 sIntCurrentIteration]: We unified 168 AI predicates to 168 [2019-09-10 04:39:17,335 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:39:17,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:39:17,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [95] imperfect sequences [16] total 109 [2019-09-10 04:39:17,336 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:39:17,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-09-10 04:39:17,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-09-10 04:39:17,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=718, Invalid=8212, Unknown=0, NotChecked=0, Total=8930 [2019-09-10 04:39:17,338 INFO L87 Difference]: Start difference. First operand 120334 states and 157477 transitions. Second operand 95 states. [2019-09-10 04:47:57,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:47:57,070 INFO L93 Difference]: Finished difference Result 173496 states and 245443 transitions. [2019-09-10 04:47:57,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 548 states. [2019-09-10 04:47:57,070 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 169 [2019-09-10 04:47:57,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:47:57,636 INFO L225 Difference]: With dead ends: 173496 [2019-09-10 04:47:57,636 INFO L226 Difference]: Without dead ends: 173496 [2019-09-10 04:47:57,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 607 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153677 ImplicationChecksByTransitivity, 73.5s TimeCoverageRelationStatistics Valid=23859, Invalid=346413, Unknown=0, NotChecked=0, Total=370272 [2019-09-10 04:47:57,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173496 states. [2019-09-10 04:48:00,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173496 to 144971. [2019-09-10 04:48:00,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144971 states. [2019-09-10 04:48:00,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144971 states to 144971 states and 190023 transitions. [2019-09-10 04:48:00,763 INFO L78 Accepts]: Start accepts. Automaton has 144971 states and 190023 transitions. Word has length 169 [2019-09-10 04:48:00,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:48:00,764 INFO L475 AbstractCegarLoop]: Abstraction has 144971 states and 190023 transitions. [2019-09-10 04:48:00,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-09-10 04:48:00,764 INFO L276 IsEmpty]: Start isEmpty. Operand 144971 states and 190023 transitions. [2019-09-10 04:48:00,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-10 04:48:00,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:48:00,796 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:48:00,797 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:48:00,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:48:00,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1116932941, now seen corresponding path program 1 times [2019-09-10 04:48:00,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:48:00,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:48:00,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:48:00,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:48:00,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:48:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:48:01,135 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 04:48:01,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:48:01,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:48:01,136 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 170 with the following transitions: [2019-09-10 04:48:01,137 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], [241], [242], [243], [245], [254], [261], [263], [265], [271], [274], [279], [282], [286], [299], [301], [302], [303], [306], [322], [324], [326], [329], [333], [335], [336], [339], [342], [347], [350], [357], [359], [362], [366], [368], [369], [372], [388], [390], [392], [395], [399], [401], [402], [405], [421], [423], [425], [428], [432], [434], [435], [436], [437], [440], [456], [458], [460], [463], [467], [469], [470], [473], [475], [478], [480], [481], [484], [500], [502], [504], [507], [511], [513], [517], [518], [519], [520], [521], [522], [523], [524], [525], [526], [527], [528], [529], [530], [531], [532], [533], [534], [535], [536], [537] [2019-09-10 04:48:01,142 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:48:01,143 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:48:01,162 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:48:02,520 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:48:02,521 INFO L272 AbstractInterpreter]: Visited 134 different actions 2170 times. Merged at 24 different actions 517 times. Widened at 1 different actions 3 times. Performed 25921 root evaluator evaluations with a maximum evaluation depth of 6. Performed 25921 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 131 fixpoints after 9 different actions. Largest state had 134 variables. [2019-09-10 04:48:02,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:48:02,521 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:48:05,889 INFO L227 lantSequenceWeakener]: Weakened 134 states. On average, predicates are now at 77.95% of their original sizes. [2019-09-10 04:48:05,889 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:48:13,829 INFO L420 sIntCurrentIteration]: We unified 168 AI predicates to 168 [2019-09-10 04:48:13,829 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:48:13,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:48:13,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [93] imperfect sequences [16] total 107 [2019-09-10 04:48:13,830 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:48:13,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-10 04:48:13,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-10 04:48:13,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=680, Invalid=7876, Unknown=0, NotChecked=0, Total=8556 [2019-09-10 04:48:13,832 INFO L87 Difference]: Start difference. First operand 144971 states and 190023 transitions. Second operand 93 states.