java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:28:28,118 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:28:28,120 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:28:28,132 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:28:28,132 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:28:28,133 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:28:28,135 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:28:28,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:28:28,138 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:28:28,139 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:28:28,140 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:28:28,141 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:28:28,142 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:28:28,143 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:28:28,144 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:28:28,145 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:28:28,146 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:28:28,146 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:28:28,148 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:28:28,150 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:28:28,152 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:28:28,153 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:28:28,154 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:28:28,155 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:28:28,157 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:28:28,158 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:28:28,158 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:28:28,159 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:28:28,159 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:28:28,160 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:28:28,161 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:28:28,161 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:28:28,162 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:28:28,163 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:28:28,164 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:28:28,164 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:28:28,165 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:28:28,165 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:28:28,165 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:28:28,166 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:28:28,167 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:28:28,168 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 08:28:28,190 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:28:28,191 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:28:28,191 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:28:28,195 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:28:28,195 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:28:28,196 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:28:28,196 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:28:28,196 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:28:28,197 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:28:28,197 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:28:28,197 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:28:28,198 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:28:28,198 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:28:28,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:28:28,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:28:28,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:28:28,198 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:28:28,199 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:28:28,199 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:28:28,199 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:28:28,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:28:28,201 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:28:28,201 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:28:28,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:28:28,202 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:28:28,202 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:28:28,202 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:28:28,202 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:28:28,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:28:28,203 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:28:28,252 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:28:28,265 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:28:28,269 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:28:28,270 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:28:28,270 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:28:28,271 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2019-09-10 08:28:28,333 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d15ffc2c/87562bff3da849b29d920889344059fe/FLAG2ebd93ca6 [2019-09-10 08:28:28,853 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:28:28,854 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2019-09-10 08:28:28,870 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d15ffc2c/87562bff3da849b29d920889344059fe/FLAG2ebd93ca6 [2019-09-10 08:28:29,115 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d15ffc2c/87562bff3da849b29d920889344059fe [2019-09-10 08:28:29,124 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:28:29,125 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:28:29,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:28:29,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:28:29,130 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:28:29,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:28:29" (1/1) ... [2019-09-10 08:28:29,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cce25cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:28:29, skipping insertion in model container [2019-09-10 08:28:29,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:28:29" (1/1) ... [2019-09-10 08:28:29,144 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:28:29,198 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:28:29,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:28:29,612 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:28:29,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:28:29,737 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:28:29,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:28:29 WrapperNode [2019-09-10 08:28:29,738 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:28:29,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:28:29,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:28:29,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:28:29,754 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:28:29" (1/1) ... [2019-09-10 08:28:29,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:28:29" (1/1) ... [2019-09-10 08:28:29,782 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:28:29" (1/1) ... [2019-09-10 08:28:29,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:28:29" (1/1) ... [2019-09-10 08:28:29,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:28:29" (1/1) ... [2019-09-10 08:28:29,814 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:28:29" (1/1) ... [2019-09-10 08:28:29,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:28:29" (1/1) ... [2019-09-10 08:28:29,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:28:29,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:28:29,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:28:29,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:28:29,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:28:29" (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 08:28:29,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:28:29,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:28:29,878 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:28:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:28:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:28:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:28:29,878 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:28:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:28:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:28:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:28:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:28:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:28:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:28:29,879 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:28:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:28:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:28:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-10 08:28:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:28:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:28:29,880 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:28:29,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:28:29,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:28:30,664 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:28:30,664 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:28:30,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:28:30 BoogieIcfgContainer [2019-09-10 08:28:30,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:28:30,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:28:30,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:28:30,670 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:28:30,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:28:29" (1/3) ... [2019-09-10 08:28:30,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dcaee96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:28:30, skipping insertion in model container [2019-09-10 08:28:30,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:28:29" (2/3) ... [2019-09-10 08:28:30,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dcaee96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:28:30, skipping insertion in model container [2019-09-10 08:28:30,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:28:30" (3/3) ... [2019-09-10 08:28:30,674 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2019-09-10 08:28:30,684 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:28:30,693 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:28:30,711 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:28:30,740 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:28:30,740 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:28:30,740 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:28:30,740 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:28:30,741 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:28:30,741 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:28:30,741 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:28:30,741 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:28:30,763 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-09-10 08:28:30,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 08:28:30,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:30,781 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] [2019-09-10 08:28:30,783 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:30,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:30,789 INFO L82 PathProgramCache]: Analyzing trace with hash -342597549, now seen corresponding path program 1 times [2019-09-10 08:28:30,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:30,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:30,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:30,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:30,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:31,335 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 08:28:31,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:31,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:28:31,339 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:31,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:28:31,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:28:31,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:28:31,367 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2019-09-10 08:28:31,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:31,465 INFO L93 Difference]: Finished difference Result 217 states and 356 transitions. [2019-09-10 08:28:31,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:28:31,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-10 08:28:31,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:31,484 INFO L225 Difference]: With dead ends: 217 [2019-09-10 08:28:31,484 INFO L226 Difference]: Without dead ends: 209 [2019-09-10 08:28:31,486 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 08:28:31,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-10 08:28:31,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2019-09-10 08:28:31,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-09-10 08:28:31,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 296 transitions. [2019-09-10 08:28:31,540 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 296 transitions. Word has length 90 [2019-09-10 08:28:31,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:31,541 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 296 transitions. [2019-09-10 08:28:31,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:28:31,542 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 296 transitions. [2019-09-10 08:28:31,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 08:28:31,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:31,545 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] [2019-09-10 08:28:31,546 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:31,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:31,546 INFO L82 PathProgramCache]: Analyzing trace with hash 2032484070, now seen corresponding path program 1 times [2019-09-10 08:28:31,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:31,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:31,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:31,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:31,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:31,738 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 08:28:31,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:31,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:28:31,739 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:31,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:28:31,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:28:31,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:28:31,742 INFO L87 Difference]: Start difference. First operand 207 states and 296 transitions. Second operand 3 states. [2019-09-10 08:28:31,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:31,771 INFO L93 Difference]: Finished difference Result 341 states and 507 transitions. [2019-09-10 08:28:31,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:28:31,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-09-10 08:28:31,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:31,776 INFO L225 Difference]: With dead ends: 341 [2019-09-10 08:28:31,776 INFO L226 Difference]: Without dead ends: 341 [2019-09-10 08:28:31,777 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 08:28:31,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-09-10 08:28:31,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 339. [2019-09-10 08:28:31,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-09-10 08:28:31,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 506 transitions. [2019-09-10 08:28:31,802 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 506 transitions. Word has length 91 [2019-09-10 08:28:31,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:31,803 INFO L475 AbstractCegarLoop]: Abstraction has 339 states and 506 transitions. [2019-09-10 08:28:31,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:28:31,803 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 506 transitions. [2019-09-10 08:28:31,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 08:28:31,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:31,811 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] [2019-09-10 08:28:31,811 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:31,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:31,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1593427600, now seen corresponding path program 1 times [2019-09-10 08:28:31,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:31,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:31,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:31,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:31,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:31,962 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 08:28:31,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:31,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:28:31,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:31,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:28:31,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:28:31,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:28:31,970 INFO L87 Difference]: Start difference. First operand 339 states and 506 transitions. Second operand 3 states. [2019-09-10 08:28:31,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:31,993 INFO L93 Difference]: Finished difference Result 589 states and 899 transitions. [2019-09-10 08:28:31,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:28:31,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-09-10 08:28:31,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:31,997 INFO L225 Difference]: With dead ends: 589 [2019-09-10 08:28:31,997 INFO L226 Difference]: Without dead ends: 589 [2019-09-10 08:28:31,998 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 08:28:31,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-10 08:28:32,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 587. [2019-09-10 08:28:32,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-09-10 08:28:32,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 898 transitions. [2019-09-10 08:28:32,026 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 898 transitions. Word has length 92 [2019-09-10 08:28:32,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:32,027 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 898 transitions. [2019-09-10 08:28:32,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:28:32,027 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 898 transitions. [2019-09-10 08:28:32,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 08:28:32,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:32,029 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] [2019-09-10 08:28:32,029 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:32,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:32,029 INFO L82 PathProgramCache]: Analyzing trace with hash -304306673, now seen corresponding path program 1 times [2019-09-10 08:28:32,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:32,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:32,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:32,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:32,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:32,165 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 08:28:32,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:32,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:28:32,166 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:32,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:28:32,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:28:32,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:28:32,167 INFO L87 Difference]: Start difference. First operand 587 states and 898 transitions. Second operand 3 states. [2019-09-10 08:28:32,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:32,207 INFO L93 Difference]: Finished difference Result 1053 states and 1627 transitions. [2019-09-10 08:28:32,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:28:32,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-10 08:28:32,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:32,236 INFO L225 Difference]: With dead ends: 1053 [2019-09-10 08:28:32,237 INFO L226 Difference]: Without dead ends: 1053 [2019-09-10 08:28:32,237 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 08:28:32,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-09-10 08:28:32,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1051. [2019-09-10 08:28:32,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2019-09-10 08:28:32,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1626 transitions. [2019-09-10 08:28:32,289 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1626 transitions. Word has length 93 [2019-09-10 08:28:32,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:32,290 INFO L475 AbstractCegarLoop]: Abstraction has 1051 states and 1626 transitions. [2019-09-10 08:28:32,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:28:32,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1626 transitions. [2019-09-10 08:28:32,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 08:28:32,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:32,300 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] [2019-09-10 08:28:32,300 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:32,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:32,301 INFO L82 PathProgramCache]: Analyzing trace with hash 22614474, now seen corresponding path program 1 times [2019-09-10 08:28:32,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:32,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:32,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:32,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:32,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:32,427 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 08:28:32,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:32,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:28:32,427 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:32,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:28:32,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:28:32,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:28:32,430 INFO L87 Difference]: Start difference. First operand 1051 states and 1626 transitions. Second operand 3 states. [2019-09-10 08:28:32,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:32,466 INFO L93 Difference]: Finished difference Result 1917 states and 2971 transitions. [2019-09-10 08:28:32,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:28:32,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-10 08:28:32,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:32,477 INFO L225 Difference]: With dead ends: 1917 [2019-09-10 08:28:32,477 INFO L226 Difference]: Without dead ends: 1917 [2019-09-10 08:28:32,478 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 08:28:32,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2019-09-10 08:28:32,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1915. [2019-09-10 08:28:32,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1915 states. [2019-09-10 08:28:32,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 2970 transitions. [2019-09-10 08:28:32,524 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 2970 transitions. Word has length 94 [2019-09-10 08:28:32,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:32,526 INFO L475 AbstractCegarLoop]: Abstraction has 1915 states and 2970 transitions. [2019-09-10 08:28:32,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:28:32,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2970 transitions. [2019-09-10 08:28:32,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 08:28:32,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:32,530 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] [2019-09-10 08:28:32,530 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:32,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:32,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1677889525, now seen corresponding path program 1 times [2019-09-10 08:28:32,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:32,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:32,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:32,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:32,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:32,627 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 08:28:32,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:32,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:28:32,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:32,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:28:32,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:28:32,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:28:32,631 INFO L87 Difference]: Start difference. First operand 1915 states and 2970 transitions. Second operand 3 states. [2019-09-10 08:28:32,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:32,672 INFO L93 Difference]: Finished difference Result 3517 states and 5435 transitions. [2019-09-10 08:28:32,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:28:32,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-10 08:28:32,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:32,690 INFO L225 Difference]: With dead ends: 3517 [2019-09-10 08:28:32,691 INFO L226 Difference]: Without dead ends: 3517 [2019-09-10 08:28:32,692 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 08:28:32,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3517 states. [2019-09-10 08:28:32,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3517 to 3515. [2019-09-10 08:28:32,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3515 states. [2019-09-10 08:28:32,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3515 states to 3515 states and 5434 transitions. [2019-09-10 08:28:32,802 INFO L78 Accepts]: Start accepts. Automaton has 3515 states and 5434 transitions. Word has length 95 [2019-09-10 08:28:32,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:32,809 INFO L475 AbstractCegarLoop]: Abstraction has 3515 states and 5434 transitions. [2019-09-10 08:28:32,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:28:32,809 INFO L276 IsEmpty]: Start isEmpty. Operand 3515 states and 5434 transitions. [2019-09-10 08:28:32,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 08:28:32,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:32,816 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] [2019-09-10 08:28:32,817 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:32,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:32,817 INFO L82 PathProgramCache]: Analyzing trace with hash 2079777372, now seen corresponding path program 1 times [2019-09-10 08:28:32,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:32,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:32,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:32,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:32,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:32,996 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 08:28:32,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:32,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:28:32,997 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:32,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:28:32,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:28:32,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:28:32,999 INFO L87 Difference]: Start difference. First operand 3515 states and 5434 transitions. Second operand 3 states. [2019-09-10 08:28:33,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:33,056 INFO L93 Difference]: Finished difference Result 6461 states and 9915 transitions. [2019-09-10 08:28:33,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:28:33,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-09-10 08:28:33,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:33,087 INFO L225 Difference]: With dead ends: 6461 [2019-09-10 08:28:33,087 INFO L226 Difference]: Without dead ends: 6461 [2019-09-10 08:28:33,087 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 08:28:33,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6461 states. [2019-09-10 08:28:33,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6461 to 6459. [2019-09-10 08:28:33,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6459 states. [2019-09-10 08:28:33,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6459 states to 6459 states and 9914 transitions. [2019-09-10 08:28:33,228 INFO L78 Accepts]: Start accepts. Automaton has 6459 states and 9914 transitions. Word has length 96 [2019-09-10 08:28:33,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:33,228 INFO L475 AbstractCegarLoop]: Abstraction has 6459 states and 9914 transitions. [2019-09-10 08:28:33,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:28:33,229 INFO L276 IsEmpty]: Start isEmpty. Operand 6459 states and 9914 transitions. [2019-09-10 08:28:33,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:28:33,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:33,233 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] [2019-09-10 08:28:33,233 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:33,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:33,233 INFO L82 PathProgramCache]: Analyzing trace with hash -447256609, now seen corresponding path program 1 times [2019-09-10 08:28:33,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:33,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:33,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:33,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:33,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:33,375 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 08:28:33,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:33,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:28:33,376 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:33,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:28:33,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:28:33,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:28:33,378 INFO L87 Difference]: Start difference. First operand 6459 states and 9914 transitions. Second operand 5 states. [2019-09-10 08:28:33,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:33,584 INFO L93 Difference]: Finished difference Result 6459 states and 9850 transitions. [2019-09-10 08:28:33,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:28:33,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 08:28:33,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:33,615 INFO L225 Difference]: With dead ends: 6459 [2019-09-10 08:28:33,616 INFO L226 Difference]: Without dead ends: 6459 [2019-09-10 08:28:33,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:28:33,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6459 states. [2019-09-10 08:28:33,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6459 to 6459. [2019-09-10 08:28:33,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6459 states. [2019-09-10 08:28:33,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6459 states to 6459 states and 9850 transitions. [2019-09-10 08:28:33,838 INFO L78 Accepts]: Start accepts. Automaton has 6459 states and 9850 transitions. Word has length 97 [2019-09-10 08:28:33,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:33,838 INFO L475 AbstractCegarLoop]: Abstraction has 6459 states and 9850 transitions. [2019-09-10 08:28:33,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:28:33,839 INFO L276 IsEmpty]: Start isEmpty. Operand 6459 states and 9850 transitions. [2019-09-10 08:28:33,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:28:33,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:33,841 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] [2019-09-10 08:28:33,841 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:33,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:33,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1088141316, now seen corresponding path program 1 times [2019-09-10 08:28:33,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:33,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:33,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:33,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:33,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:33,957 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 08:28:33,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:33,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:28:33,958 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:33,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:28:33,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:28:33,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:28:33,959 INFO L87 Difference]: Start difference. First operand 6459 states and 9850 transitions. Second operand 5 states. [2019-09-10 08:28:34,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:34,114 INFO L93 Difference]: Finished difference Result 6459 states and 9786 transitions. [2019-09-10 08:28:34,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:28:34,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 08:28:34,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:34,167 INFO L225 Difference]: With dead ends: 6459 [2019-09-10 08:28:34,167 INFO L226 Difference]: Without dead ends: 6459 [2019-09-10 08:28:34,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:28:34,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6459 states. [2019-09-10 08:28:34,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6459 to 6459. [2019-09-10 08:28:34,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6459 states. [2019-09-10 08:28:34,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6459 states to 6459 states and 9786 transitions. [2019-09-10 08:28:34,288 INFO L78 Accepts]: Start accepts. Automaton has 6459 states and 9786 transitions. Word has length 97 [2019-09-10 08:28:34,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:34,288 INFO L475 AbstractCegarLoop]: Abstraction has 6459 states and 9786 transitions. [2019-09-10 08:28:34,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:28:34,289 INFO L276 IsEmpty]: Start isEmpty. Operand 6459 states and 9786 transitions. [2019-09-10 08:28:34,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:28:34,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:34,290 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] [2019-09-10 08:28:34,290 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:34,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:34,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1485495105, now seen corresponding path program 1 times [2019-09-10 08:28:34,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:34,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:34,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:34,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:34,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:34,427 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 08:28:34,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:34,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:28:34,428 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:34,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:28:34,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:28:34,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:28:34,431 INFO L87 Difference]: Start difference. First operand 6459 states and 9786 transitions. Second operand 5 states. [2019-09-10 08:28:34,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:34,603 INFO L93 Difference]: Finished difference Result 6459 states and 9722 transitions. [2019-09-10 08:28:34,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:28:34,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 08:28:34,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:34,622 INFO L225 Difference]: With dead ends: 6459 [2019-09-10 08:28:34,622 INFO L226 Difference]: Without dead ends: 6459 [2019-09-10 08:28:34,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:28:34,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6459 states. [2019-09-10 08:28:34,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6459 to 6459. [2019-09-10 08:28:34,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6459 states. [2019-09-10 08:28:34,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6459 states to 6459 states and 9722 transitions. [2019-09-10 08:28:34,773 INFO L78 Accepts]: Start accepts. Automaton has 6459 states and 9722 transitions. Word has length 97 [2019-09-10 08:28:34,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:34,773 INFO L475 AbstractCegarLoop]: Abstraction has 6459 states and 9722 transitions. [2019-09-10 08:28:34,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:28:34,773 INFO L276 IsEmpty]: Start isEmpty. Operand 6459 states and 9722 transitions. [2019-09-10 08:28:34,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:28:34,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:34,775 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] [2019-09-10 08:28:34,775 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:34,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:34,775 INFO L82 PathProgramCache]: Analyzing trace with hash -211627100, now seen corresponding path program 1 times [2019-09-10 08:28:34,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:34,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:34,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:34,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:34,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:34,874 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 08:28:34,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:34,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:28:34,875 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:34,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:28:34,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:28:34,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:28:34,876 INFO L87 Difference]: Start difference. First operand 6459 states and 9722 transitions. Second operand 5 states. [2019-09-10 08:28:35,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:35,021 INFO L93 Difference]: Finished difference Result 6459 states and 9658 transitions. [2019-09-10 08:28:35,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:28:35,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 08:28:35,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:35,036 INFO L225 Difference]: With dead ends: 6459 [2019-09-10 08:28:35,037 INFO L226 Difference]: Without dead ends: 6459 [2019-09-10 08:28:35,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:28:35,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6459 states. [2019-09-10 08:28:35,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6459 to 6459. [2019-09-10 08:28:35,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6459 states. [2019-09-10 08:28:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6459 states to 6459 states and 9658 transitions. [2019-09-10 08:28:35,135 INFO L78 Accepts]: Start accepts. Automaton has 6459 states and 9658 transitions. Word has length 97 [2019-09-10 08:28:35,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:35,136 INFO L475 AbstractCegarLoop]: Abstraction has 6459 states and 9658 transitions. [2019-09-10 08:28:35,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:28:35,136 INFO L276 IsEmpty]: Start isEmpty. Operand 6459 states and 9658 transitions. [2019-09-10 08:28:35,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:28:35,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:35,137 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] [2019-09-10 08:28:35,137 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:35,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:35,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1658656695, now seen corresponding path program 1 times [2019-09-10 08:28:35,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:35,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:35,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:35,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:35,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:35,249 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 08:28:35,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:35,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:28:35,249 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:35,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:28:35,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:28:35,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:28:35,251 INFO L87 Difference]: Start difference. First operand 6459 states and 9658 transitions. Second operand 5 states. [2019-09-10 08:28:35,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:35,421 INFO L93 Difference]: Finished difference Result 6459 states and 9594 transitions. [2019-09-10 08:28:35,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:28:35,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 08:28:35,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:35,444 INFO L225 Difference]: With dead ends: 6459 [2019-09-10 08:28:35,444 INFO L226 Difference]: Without dead ends: 6459 [2019-09-10 08:28:35,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:28:35,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6459 states. [2019-09-10 08:28:35,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6459 to 6459. [2019-09-10 08:28:35,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6459 states. [2019-09-10 08:28:35,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6459 states to 6459 states and 9594 transitions. [2019-09-10 08:28:35,639 INFO L78 Accepts]: Start accepts. Automaton has 6459 states and 9594 transitions. Word has length 97 [2019-09-10 08:28:35,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:35,640 INFO L475 AbstractCegarLoop]: Abstraction has 6459 states and 9594 transitions. [2019-09-10 08:28:35,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:28:35,640 INFO L276 IsEmpty]: Start isEmpty. Operand 6459 states and 9594 transitions. [2019-09-10 08:28:35,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:28:35,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:35,642 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] [2019-09-10 08:28:35,642 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:35,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:35,643 INFO L82 PathProgramCache]: Analyzing trace with hash -331271506, now seen corresponding path program 1 times [2019-09-10 08:28:35,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:35,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:35,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:35,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:35,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:35,893 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 08:28:35,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:35,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:35,894 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:35,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:35,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:35,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:35,896 INFO L87 Difference]: Start difference. First operand 6459 states and 9594 transitions. Second operand 9 states. [2019-09-10 08:28:36,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:36,623 INFO L93 Difference]: Finished difference Result 89685 states and 131783 transitions. [2019-09-10 08:28:36,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:28:36,623 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-10 08:28:36,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:36,874 INFO L225 Difference]: With dead ends: 89685 [2019-09-10 08:28:36,874 INFO L226 Difference]: Without dead ends: 89685 [2019-09-10 08:28:36,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:28:36,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89685 states. [2019-09-10 08:28:38,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89685 to 12859. [2019-09-10 08:28:38,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12859 states. [2019-09-10 08:28:38,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12859 states to 12859 states and 18874 transitions. [2019-09-10 08:28:38,524 INFO L78 Accepts]: Start accepts. Automaton has 12859 states and 18874 transitions. Word has length 97 [2019-09-10 08:28:38,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:38,525 INFO L475 AbstractCegarLoop]: Abstraction has 12859 states and 18874 transitions. [2019-09-10 08:28:38,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:38,525 INFO L276 IsEmpty]: Start isEmpty. Operand 12859 states and 18874 transitions. [2019-09-10 08:28:38,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:28:38,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:38,583 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] [2019-09-10 08:28:38,584 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:38,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:38,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1397477208, now seen corresponding path program 1 times [2019-09-10 08:28:38,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:38,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:38,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:38,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:38,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:38,993 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 08:28:38,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:38,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:38,994 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:38,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:38,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:38,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:38,995 INFO L87 Difference]: Start difference. First operand 12859 states and 18874 transitions. Second operand 9 states. [2019-09-10 08:28:39,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:39,370 INFO L93 Difference]: Finished difference Result 38465 states and 56381 transitions. [2019-09-10 08:28:39,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:28:39,370 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:28:39,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:39,492 INFO L225 Difference]: With dead ends: 38465 [2019-09-10 08:28:39,492 INFO L226 Difference]: Without dead ends: 38465 [2019-09-10 08:28:39,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:28:39,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38465 states. [2019-09-10 08:28:39,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38465 to 25659. [2019-09-10 08:28:39,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25659 states. [2019-09-10 08:28:40,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25659 states to 25659 states and 37562 transitions. [2019-09-10 08:28:40,038 INFO L78 Accepts]: Start accepts. Automaton has 25659 states and 37562 transitions. Word has length 99 [2019-09-10 08:28:40,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:40,163 INFO L475 AbstractCegarLoop]: Abstraction has 25659 states and 37562 transitions. [2019-09-10 08:28:40,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:40,163 INFO L276 IsEmpty]: Start isEmpty. Operand 25659 states and 37562 transitions. [2019-09-10 08:28:40,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:28:40,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:40,165 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] [2019-09-10 08:28:40,165 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:40,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:40,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1417526551, now seen corresponding path program 1 times [2019-09-10 08:28:40,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:40,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:40,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:40,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:40,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:40,268 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 08:28:40,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:40,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:28:40,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:40,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:28:40,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:28:40,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:28:40,271 INFO L87 Difference]: Start difference. First operand 25659 states and 37562 transitions. Second operand 3 states. [2019-09-10 08:28:40,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:40,402 INFO L93 Difference]: Finished difference Result 38079 states and 55165 transitions. [2019-09-10 08:28:40,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:28:40,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 08:28:40,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:40,494 INFO L225 Difference]: With dead ends: 38079 [2019-09-10 08:28:40,494 INFO L226 Difference]: Without dead ends: 38079 [2019-09-10 08:28:40,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 08:28:40,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38079 states. [2019-09-10 08:28:41,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38079 to 38077. [2019-09-10 08:28:41,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38077 states. [2019-09-10 08:28:41,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38077 states to 38077 states and 55164 transitions. [2019-09-10 08:28:41,106 INFO L78 Accepts]: Start accepts. Automaton has 38077 states and 55164 transitions. Word has length 99 [2019-09-10 08:28:41,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:41,106 INFO L475 AbstractCegarLoop]: Abstraction has 38077 states and 55164 transitions. [2019-09-10 08:28:41,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:28:41,106 INFO L276 IsEmpty]: Start isEmpty. Operand 38077 states and 55164 transitions. [2019-09-10 08:28:41,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:28:41,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:41,108 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] [2019-09-10 08:28:41,108 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:41,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:41,108 INFO L82 PathProgramCache]: Analyzing trace with hash -374029762, now seen corresponding path program 1 times [2019-09-10 08:28:41,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:41,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:41,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:41,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:41,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:41,975 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 08:28:41,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:41,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:28:41,978 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:41,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:28:41,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:28:41,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:28:41,979 INFO L87 Difference]: Start difference. First operand 38077 states and 55164 transitions. Second operand 5 states. [2019-09-10 08:28:42,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:42,209 INFO L93 Difference]: Finished difference Result 71611 states and 102734 transitions. [2019-09-10 08:28:42,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:28:42,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-09-10 08:28:42,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:42,314 INFO L225 Difference]: With dead ends: 71611 [2019-09-10 08:28:42,314 INFO L226 Difference]: Without dead ends: 71611 [2019-09-10 08:28:42,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:28:42,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71611 states. [2019-09-10 08:28:43,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71611 to 39229. [2019-09-10 08:28:43,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39229 states. [2019-09-10 08:28:43,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39229 states to 39229 states and 56252 transitions. [2019-09-10 08:28:43,121 INFO L78 Accepts]: Start accepts. Automaton has 39229 states and 56252 transitions. Word has length 100 [2019-09-10 08:28:43,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:43,121 INFO L475 AbstractCegarLoop]: Abstraction has 39229 states and 56252 transitions. [2019-09-10 08:28:43,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:28:43,121 INFO L276 IsEmpty]: Start isEmpty. Operand 39229 states and 56252 transitions. [2019-09-10 08:28:43,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:28:43,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:43,132 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:43,133 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:43,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:43,133 INFO L82 PathProgramCache]: Analyzing trace with hash 928377095, now seen corresponding path program 1 times [2019-09-10 08:28:43,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:43,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:43,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:43,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:43,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:43,470 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:28:43,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:43,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:43,471 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:43,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:43,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:43,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:43,474 INFO L87 Difference]: Start difference. First operand 39229 states and 56252 transitions. Second operand 9 states. [2019-09-10 08:28:44,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:44,263 INFO L93 Difference]: Finished difference Result 206987 states and 297411 transitions. [2019-09-10 08:28:44,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:28:44,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:28:44,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:44,670 INFO L225 Difference]: With dead ends: 206987 [2019-09-10 08:28:44,670 INFO L226 Difference]: Without dead ends: 206987 [2019-09-10 08:28:44,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:28:44,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206987 states. [2019-09-10 08:28:47,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206987 to 62333. [2019-09-10 08:28:47,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62333 states. [2019-09-10 08:28:47,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62333 states to 62333 states and 89148 transitions. [2019-09-10 08:28:47,883 INFO L78 Accepts]: Start accepts. Automaton has 62333 states and 89148 transitions. Word has length 134 [2019-09-10 08:28:47,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:47,883 INFO L475 AbstractCegarLoop]: Abstraction has 62333 states and 89148 transitions. [2019-09-10 08:28:47,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:47,883 INFO L276 IsEmpty]: Start isEmpty. Operand 62333 states and 89148 transitions. [2019-09-10 08:28:47,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:28:47,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:47,899 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:47,899 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:47,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:47,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1520560563, now seen corresponding path program 1 times [2019-09-10 08:28:47,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:47,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:47,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:47,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:47,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:48,307 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:28:48,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:28:48,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:28:48,308 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2019-09-10 08:28:48,311 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [157], [160], [168], [170], [173], [176], [181], [183], [186], [194], [196], [199], [207], [209], [212], [220], [222], [225], [233], [235], [238], [246], [248], [251], [258], [260], [263], [264], [266], [275], [278], [282], [291], [293], [296], [299], [301], [316], [318], [321], [324], [326], [341], [343], [346], [349], [351], [366], [368], [371], [374], [376], [391], [393], [396], [399], [401], [409], [412], [418], [421], [424], [426], [441], [443], [446], [449], [451], [512], [513], [517], [518], [519] [2019-09-10 08:28:48,365 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:28:48,366 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:28:48,571 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:28:49,794 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:28:49,797 INFO L272 AbstractInterpreter]: Visited 125 different actions 1202 times. Merged at 68 different actions 931 times. Widened at 30 different actions 165 times. Performed 4457 root evaluator evaluations with a maximum evaluation depth of 7. Performed 4457 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 124 fixpoints after 26 different actions. Largest state had 178 variables. [2019-09-10 08:28:49,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:49,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:28:49,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:28:49,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:28:49,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:49,837 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:28:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:49,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 08:28:50,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:28:50,244 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:28:50,244 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:28:50,377 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:28:50,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:28:50,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 9] total 17 [2019-09-10 08:28:50,392 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:50,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:50,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:50,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:28:50,394 INFO L87 Difference]: Start difference. First operand 62333 states and 89148 transitions. Second operand 9 states. [2019-09-10 08:28:52,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:52,499 INFO L93 Difference]: Finished difference Result 251979 states and 361347 transitions. [2019-09-10 08:28:52,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:28:52,499 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:28:52,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:53,282 INFO L225 Difference]: With dead ends: 251979 [2019-09-10 08:28:53,282 INFO L226 Difference]: Without dead ends: 251979 [2019-09-10 08:28:53,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 255 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:28:53,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251979 states. [2019-09-10 08:28:55,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251979 to 81981. [2019-09-10 08:28:55,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81981 states. [2019-09-10 08:28:56,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81981 states to 81981 states and 117244 transitions. [2019-09-10 08:28:56,004 INFO L78 Accepts]: Start accepts. Automaton has 81981 states and 117244 transitions. Word has length 134 [2019-09-10 08:28:56,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:28:56,005 INFO L475 AbstractCegarLoop]: Abstraction has 81981 states and 117244 transitions. [2019-09-10 08:28:56,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:28:56,005 INFO L276 IsEmpty]: Start isEmpty. Operand 81981 states and 117244 transitions. [2019-09-10 08:28:56,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:28:56,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:28:56,022 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:28:56,023 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:28:56,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:28:56,023 INFO L82 PathProgramCache]: Analyzing trace with hash -402225319, now seen corresponding path program 1 times [2019-09-10 08:28:56,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:28:56,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:56,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:28:56,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:28:56,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:28:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:28:56,288 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:28:56,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:28:56,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:28:56,289 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:28:56,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:28:56,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:28:56,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:28:56,290 INFO L87 Difference]: Start difference. First operand 81981 states and 117244 transitions. Second operand 9 states. [2019-09-10 08:28:58,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:28:58,888 INFO L93 Difference]: Finished difference Result 173387 states and 248003 transitions. [2019-09-10 08:28:58,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:28:58,888 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:28:58,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:28:59,305 INFO L225 Difference]: With dead ends: 173387 [2019-09-10 08:28:59,306 INFO L226 Difference]: Without dead ends: 173387 [2019-09-10 08:28:59,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:28:59,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173387 states. [2019-09-10 08:29:00,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173387 to 101501. [2019-09-10 08:29:00,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101501 states. [2019-09-10 08:29:00,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101501 states to 101501 states and 144956 transitions. [2019-09-10 08:29:00,973 INFO L78 Accepts]: Start accepts. Automaton has 101501 states and 144956 transitions. Word has length 134 [2019-09-10 08:29:00,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:00,973 INFO L475 AbstractCegarLoop]: Abstraction has 101501 states and 144956 transitions. [2019-09-10 08:29:00,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:00,974 INFO L276 IsEmpty]: Start isEmpty. Operand 101501 states and 144956 transitions. [2019-09-10 08:29:00,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:29:00,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:00,988 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:00,989 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:00,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:00,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1882658405, now seen corresponding path program 1 times [2019-09-10 08:29:00,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:00,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:00,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:00,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:00,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:01,223 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 08:29:01,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:01,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:01,224 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:01,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:01,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:01,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:01,225 INFO L87 Difference]: Start difference. First operand 101501 states and 144956 transitions. Second operand 9 states. [2019-09-10 08:29:02,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:02,250 INFO L93 Difference]: Finished difference Result 192907 states and 275715 transitions. [2019-09-10 08:29:02,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:29:02,251 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:29:02,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:02,566 INFO L225 Difference]: With dead ends: 192907 [2019-09-10 08:29:02,566 INFO L226 Difference]: Without dead ends: 192907 [2019-09-10 08:29:02,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:29:02,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192907 states. [2019-09-10 08:29:04,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192907 to 121021. [2019-09-10 08:29:04,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121021 states. [2019-09-10 08:29:04,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121021 states to 121021 states and 172668 transitions. [2019-09-10 08:29:04,866 INFO L78 Accepts]: Start accepts. Automaton has 121021 states and 172668 transitions. Word has length 134 [2019-09-10 08:29:04,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:04,867 INFO L475 AbstractCegarLoop]: Abstraction has 121021 states and 172668 transitions. [2019-09-10 08:29:04,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:04,867 INFO L276 IsEmpty]: Start isEmpty. Operand 121021 states and 172668 transitions. [2019-09-10 08:29:04,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:29:04,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:04,883 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:04,883 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:04,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:04,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1906403627, now seen corresponding path program 1 times [2019-09-10 08:29:04,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:04,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:04,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:04,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:04,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:07,427 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 08:29:07,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:07,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:07,428 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:07,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:07,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:07,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:07,430 INFO L87 Difference]: Start difference. First operand 121021 states and 172668 transitions. Second operand 9 states. [2019-09-10 08:29:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:08,364 INFO L93 Difference]: Finished difference Result 212427 states and 303427 transitions. [2019-09-10 08:29:08,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:29:08,365 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:29:08,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:08,665 INFO L225 Difference]: With dead ends: 212427 [2019-09-10 08:29:08,666 INFO L226 Difference]: Without dead ends: 212427 [2019-09-10 08:29:08,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:29:08,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212427 states. [2019-09-10 08:29:10,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212427 to 140541. [2019-09-10 08:29:10,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140541 states. [2019-09-10 08:29:10,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140541 states to 140541 states and 200380 transitions. [2019-09-10 08:29:10,839 INFO L78 Accepts]: Start accepts. Automaton has 140541 states and 200380 transitions. Word has length 134 [2019-09-10 08:29:10,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:10,839 INFO L475 AbstractCegarLoop]: Abstraction has 140541 states and 200380 transitions. [2019-09-10 08:29:10,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:10,840 INFO L276 IsEmpty]: Start isEmpty. Operand 140541 states and 200380 transitions. [2019-09-10 08:29:10,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:29:10,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:10,851 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:10,852 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:10,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:10,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1510132511, now seen corresponding path program 1 times [2019-09-10 08:29:10,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:10,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:10,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:10,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:10,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:10,985 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:10,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:29:10,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:29:10,986 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2019-09-10 08:29:10,987 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [157], [160], [168], [170], [173], [181], [183], [186], [194], [196], [199], [207], [209], [212], [215], [220], [222], [225], [233], [235], [238], [246], [248], [251], [258], [260], [263], [264], [266], [275], [278], [282], [291], [293], [296], [299], [301], [316], [318], [321], [324], [326], [334], [337], [343], [346], [349], [351], [366], [368], [371], [374], [376], [391], [393], [396], [399], [401], [416], [418], [421], [424], [426], [441], [443], [446], [449], [451], [512], [513], [517], [518], [519] [2019-09-10 08:29:10,992 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:29:10,992 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:29:11,031 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:29:11,861 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:29:11,862 INFO L272 AbstractInterpreter]: Visited 125 different actions 1206 times. Merged at 68 different actions 935 times. Widened at 30 different actions 157 times. Performed 4569 root evaluator evaluations with a maximum evaluation depth of 7. Performed 4569 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 123 fixpoints after 25 different actions. Largest state had 178 variables. [2019-09-10 08:29:11,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:11,862 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:29:11,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:29:11,863 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:29:11,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:11,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:29:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:12,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 08:29:12,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:29:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:29:12,224 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:29:12,727 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:29:12,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:29:12,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 9] total 17 [2019-09-10 08:29:12,735 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:12,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:12,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:12,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:29:12,736 INFO L87 Difference]: Start difference. First operand 140541 states and 200380 transitions. Second operand 9 states. [2019-09-10 08:29:13,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:13,374 INFO L93 Difference]: Finished difference Result 231947 states and 331139 transitions. [2019-09-10 08:29:13,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:29:13,374 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:29:13,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:13,681 INFO L225 Difference]: With dead ends: 231947 [2019-09-10 08:29:13,681 INFO L226 Difference]: Without dead ends: 231947 [2019-09-10 08:29:13,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 255 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:29:13,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231947 states. [2019-09-10 08:29:18,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231947 to 160061. [2019-09-10 08:29:18,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160061 states. [2019-09-10 08:29:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160061 states to 160061 states and 228092 transitions. [2019-09-10 08:29:18,528 INFO L78 Accepts]: Start accepts. Automaton has 160061 states and 228092 transitions. Word has length 134 [2019-09-10 08:29:18,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:18,528 INFO L475 AbstractCegarLoop]: Abstraction has 160061 states and 228092 transitions. [2019-09-10 08:29:18,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:18,529 INFO L276 IsEmpty]: Start isEmpty. Operand 160061 states and 228092 transitions. [2019-09-10 08:29:18,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:29:18,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:18,541 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:18,541 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:18,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:18,542 INFO L82 PathProgramCache]: Analyzing trace with hash -2090579181, now seen corresponding path program 1 times [2019-09-10 08:29:18,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:18,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:18,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:18,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:18,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:18,765 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:29:18,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:29:18,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:29:18,766 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:29:18,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:29:18,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:29:18,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:29:18,771 INFO L87 Difference]: Start difference. First operand 160061 states and 228092 transitions. Second operand 9 states. [2019-09-10 08:29:19,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:19,590 INFO L93 Difference]: Finished difference Result 251467 states and 358851 transitions. [2019-09-10 08:29:19,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:29:19,590 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:29:19,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:19,948 INFO L225 Difference]: With dead ends: 251467 [2019-09-10 08:29:19,948 INFO L226 Difference]: Without dead ends: 251467 [2019-09-10 08:29:19,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:29:20,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251467 states. [2019-09-10 08:29:22,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251467 to 179581. [2019-09-10 08:29:22,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179581 states. [2019-09-10 08:29:27,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179581 states to 179581 states and 255804 transitions. [2019-09-10 08:29:27,386 INFO L78 Accepts]: Start accepts. Automaton has 179581 states and 255804 transitions. Word has length 134 [2019-09-10 08:29:27,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:29:27,387 INFO L475 AbstractCegarLoop]: Abstraction has 179581 states and 255804 transitions. [2019-09-10 08:29:27,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:29:27,387 INFO L276 IsEmpty]: Start isEmpty. Operand 179581 states and 255804 transitions. [2019-09-10 08:29:27,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:29:27,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:29:27,401 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:29:27,402 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:29:27,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:27,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1251322482, now seen corresponding path program 1 times [2019-09-10 08:29:27,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:29:27,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:27,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:27,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:29:27,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:29:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:27,530 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:29:27,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:29:27,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:29:27,531 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 136 with the following transitions: [2019-09-10 08:29:27,532 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [157], [160], [168], [170], [173], [181], [183], [186], [194], [196], [199], [207], [209], [212], [220], [222], [225], [233], [235], [238], [246], [248], [251], [254], [258], [260], [263], [264], [266], [268], [273], [275], [278], [291], [293], [296], [299], [301], [316], [318], [321], [324], [326], [341], [343], [346], [349], [351], [366], [368], [371], [374], [376], [391], [393], [396], [399], [401], [416], [418], [421], [424], [426], [441], [443], [446], [449], [451], [512], [513], [517], [518], [519] [2019-09-10 08:29:27,536 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:29:27,536 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:29:27,570 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:29:28,415 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:29:28,416 INFO L272 AbstractInterpreter]: Visited 125 different actions 1328 times. Merged at 68 different actions 1025 times. Widened at 33 different actions 193 times. Performed 4938 root evaluator evaluations with a maximum evaluation depth of 9. Performed 4938 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 156 fixpoints after 33 different actions. Largest state had 178 variables. [2019-09-10 08:29:28,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:29:28,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:29:28,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:29:28,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:29:28,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:29:28,434 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:29:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:29:28,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 08:29:28,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:29:28,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:29:28,995 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:28,995 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:29:29,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:29:29,395 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:29:29,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:29:29,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10, 10] total 20 [2019-09-10 08:29:29,405 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:29:29,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:29:29,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:29:29,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:29:29,414 INFO L87 Difference]: Start difference. First operand 179581 states and 255804 transitions. Second operand 12 states. [2019-09-10 08:29:39,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:29:39,273 INFO L93 Difference]: Finished difference Result 1534839 states and 2145433 transitions. [2019-09-10 08:29:39,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-10 08:29:39,274 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 135 [2019-09-10 08:29:39,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:29:50,117 INFO L225 Difference]: With dead ends: 1534839 [2019-09-10 08:29:50,118 INFO L226 Difference]: Without dead ends: 1534839 [2019-09-10 08:29:50,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1994 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1433, Invalid=4887, Unknown=0, NotChecked=0, Total=6320 [2019-09-10 08:29:50,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534839 states. [2019-09-10 08:30:01,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534839 to 695101. [2019-09-10 08:30:01,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695101 states. [2019-09-10 08:30:14,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695101 states to 695101 states and 977020 transitions. [2019-09-10 08:30:14,891 INFO L78 Accepts]: Start accepts. Automaton has 695101 states and 977020 transitions. Word has length 135 [2019-09-10 08:30:14,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:30:14,891 INFO L475 AbstractCegarLoop]: Abstraction has 695101 states and 977020 transitions. [2019-09-10 08:30:14,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:30:14,891 INFO L276 IsEmpty]: Start isEmpty. Operand 695101 states and 977020 transitions. [2019-09-10 08:30:14,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:30:14,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:30:14,915 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:30:14,916 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:30:14,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:14,916 INFO L82 PathProgramCache]: Analyzing trace with hash 9628056, now seen corresponding path program 1 times [2019-09-10 08:30:14,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:30:14,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:14,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:14,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:30:14,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:30:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:15,223 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:15,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:30:15,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:30:15,224 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 137 with the following transitions: [2019-09-10 08:30:15,224 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [157], [160], [163], [168], [170], [173], [181], [183], [186], [194], [196], [199], [207], [209], [212], [220], [222], [225], [233], [235], [238], [241], [246], [248], [251], [258], [260], [263], [264], [266], [275], [278], [282], [284], [287], [293], [296], [299], [301], [316], [318], [321], [324], [326], [341], [343], [346], [349], [351], [366], [368], [371], [374], [376], [391], [393], [396], [399], [401], [416], [418], [421], [424], [426], [434], [437], [443], [446], [449], [451], [512], [513], [517], [518], [519] [2019-09-10 08:30:15,228 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:30:15,228 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:30:15,259 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:30:16,186 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:30:16,187 INFO L272 AbstractInterpreter]: Visited 127 different actions 1297 times. Merged at 70 different actions 1019 times. Widened at 29 different actions 183 times. Performed 4666 root evaluator evaluations with a maximum evaluation depth of 7. Performed 4666 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 134 fixpoints after 27 different actions. Largest state had 178 variables. [2019-09-10 08:30:16,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:30:16,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:30:16,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:30:16,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:30:16,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:30:16,210 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:30:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:30:16,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 1009 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 08:30:16,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:30:16,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:30:16,710 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:16,711 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:30:16,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:30:16,982 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:30:16,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:30:16,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2019-09-10 08:30:16,990 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:30:16,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:30:16,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:30:16,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:30:16,991 INFO L87 Difference]: Start difference. First operand 695101 states and 977020 transitions. Second operand 17 states. [2019-09-10 08:30:21,078 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-09-10 08:30:23,427 WARN L188 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-09-10 08:31:00,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:31:00,633 INFO L93 Difference]: Finished difference Result 3808811 states and 5289287 transitions. [2019-09-10 08:31:00,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-10 08:31:00,633 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 136 [2019-09-10 08:31:00,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:31:06,980 INFO L225 Difference]: With dead ends: 3808811 [2019-09-10 08:31:06,981 INFO L226 Difference]: Without dead ends: 3808811 [2019-09-10 08:31:06,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 260 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=878, Invalid=2428, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 08:31:08,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3808811 states. [2019-09-10 08:32:08,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3808811 to 1510525. [2019-09-10 08:32:08,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1510525 states.