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.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:10:28,312 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:10:28,315 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:10:28,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:10:28,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:10:28,335 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:10:28,337 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:10:28,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:10:28,352 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:10:28,353 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:10:28,356 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:10:28,358 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:10:28,358 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:10:28,362 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:10:28,363 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:10:28,364 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:10:28,365 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:10:28,368 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:10:28,370 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:10:28,374 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:10:28,377 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:10:28,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:10:28,382 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:10:28,383 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:10:28,385 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:10:28,385 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:10:28,386 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:10:28,388 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:10:28,389 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:10:28,390 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:10:28,390 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:10:28,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:10:28,393 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:10:28,394 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:10:28,397 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:10:28,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:10:28,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:10:28,398 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:10:28,398 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:10:28,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:10:28,400 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:10:28,401 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:10:28,422 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:10:28,422 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:10:28,423 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:10:28,423 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:10:28,424 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:10:28,424 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:10:28,424 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:10:28,425 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:10:28,425 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:10:28,425 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:10:28,427 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:10:28,427 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:10:28,427 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:10:28,428 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:10:28,428 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:10:28,428 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:10:28,428 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:10:28,429 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:10:28,429 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:10:28,429 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:10:28,429 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:10:28,429 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:10:28,430 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:10:28,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:10:28,430 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:10:28,431 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:10:28,431 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:10:28,431 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:10:28,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:10:28,431 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:10:28,482 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:10:28,498 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:10:28,501 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:10:28,503 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:10:28,503 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:10:28,504 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c [2019-09-10 08:10:28,566 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd651a421/184d2591159544228f1f858fd1d49387/FLAGbfa81e3d6 [2019-09-10 08:10:29,226 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:10:29,227 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c [2019-09-10 08:10:29,260 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd651a421/184d2591159544228f1f858fd1d49387/FLAGbfa81e3d6 [2019-09-10 08:10:29,327 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd651a421/184d2591159544228f1f858fd1d49387 [2019-09-10 08:10:29,338 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:10:29,340 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:10:29,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:10:29,341 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:10:29,345 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:10:29,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:10:29" (1/1) ... [2019-09-10 08:10:29,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@293ccab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:10:29, skipping insertion in model container [2019-09-10 08:10:29,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:10:29" (1/1) ... [2019-09-10 08:10:29,357 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:10:29,535 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:10:31,016 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:10:31,033 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:10:31,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:10:31,620 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:10:31,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:10:31 WrapperNode [2019-09-10 08:10:31,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:10:31,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:10:31,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:10:31,623 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:10:31,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:10:31" (1/1) ... [2019-09-10 08:10:31,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:10:31" (1/1) ... [2019-09-10 08:10:31,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:10:31" (1/1) ... [2019-09-10 08:10:31,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:10:31" (1/1) ... [2019-09-10 08:10:31,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:10:31" (1/1) ... [2019-09-10 08:10:31,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:10:31" (1/1) ... [2019-09-10 08:10:31,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:10:31" (1/1) ... [2019-09-10 08:10:31,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:10:31,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:10:31,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:10:31,922 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:10:31,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:10:31" (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:10:31,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:10:31,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:10:31,991 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:10:31,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:10:31,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:10:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:10:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:10:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:10:31,993 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:10:31,994 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:10:31,994 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:10:31,995 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:10:31,996 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:10:31,997 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:10:31,998 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:10:31,999 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:10:32,000 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:10:32,000 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:10:32,000 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:10:32,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:10:32,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:10:35,673 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:10:35,673 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:10:35,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:10:35 BoogieIcfgContainer [2019-09-10 08:10:35,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:10:35,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:10:35,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:10:35,680 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:10:35,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:10:29" (1/3) ... [2019-09-10 08:10:35,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6fee49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:10:35, skipping insertion in model container [2019-09-10 08:10:35,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:10:31" (2/3) ... [2019-09-10 08:10:35,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6fee49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:10:35, skipping insertion in model container [2019-09-10 08:10:35,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:10:35" (3/3) ... [2019-09-10 08:10:35,687 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c [2019-09-10 08:10:35,697 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:10:35,724 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. [2019-09-10 08:10:35,743 INFO L252 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2019-09-10 08:10:35,770 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:10:35,771 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:10:35,771 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:10:35,771 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:10:35,771 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:10:35,771 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:10:35,771 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:10:35,772 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:10:35,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states. [2019-09-10 08:10:35,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 08:10:35,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:35,856 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:10:35,858 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:35,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:35,864 INFO L82 PathProgramCache]: Analyzing trace with hash -2055427449, now seen corresponding path program 1 times [2019-09-10 08:10:35,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:35,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:35,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:35,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:35,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:36,522 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:10:36,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:36,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:10:36,524 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:36,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:10:36,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:10:36,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:10:36,547 INFO L87 Difference]: Start difference. First operand 1136 states. Second operand 5 states. [2019-09-10 08:10:37,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:37,906 INFO L93 Difference]: Finished difference Result 1239 states and 2091 transitions. [2019-09-10 08:10:37,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:10:37,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-10 08:10:37,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:37,931 INFO L225 Difference]: With dead ends: 1239 [2019-09-10 08:10:37,932 INFO L226 Difference]: Without dead ends: 1227 [2019-09-10 08:10:37,933 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:10:37,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2019-09-10 08:10:38,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1147. [2019-09-10 08:10:38,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1147 states. [2019-09-10 08:10:38,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1534 transitions. [2019-09-10 08:10:38,043 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1534 transitions. Word has length 90 [2019-09-10 08:10:38,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:38,044 INFO L475 AbstractCegarLoop]: Abstraction has 1147 states and 1534 transitions. [2019-09-10 08:10:38,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:10:38,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1534 transitions. [2019-09-10 08:10:38,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 08:10:38,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:38,050 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:10:38,051 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:38,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:38,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1438447416, now seen corresponding path program 1 times [2019-09-10 08:10:38,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:38,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:38,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:38,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:38,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:38,250 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:10:38,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:38,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:10:38,251 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:38,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:10:38,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:10:38,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:10:38,254 INFO L87 Difference]: Start difference. First operand 1147 states and 1534 transitions. Second operand 5 states. [2019-09-10 08:10:38,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:38,830 INFO L93 Difference]: Finished difference Result 1022 states and 1391 transitions. [2019-09-10 08:10:38,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:10:38,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-10 08:10:38,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:38,838 INFO L225 Difference]: With dead ends: 1022 [2019-09-10 08:10:38,838 INFO L226 Difference]: Without dead ends: 1022 [2019-09-10 08:10:38,839 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:10:38,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2019-09-10 08:10:38,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1022. [2019-09-10 08:10:38,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1022 states. [2019-09-10 08:10:38,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1391 transitions. [2019-09-10 08:10:38,869 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1391 transitions. Word has length 91 [2019-09-10 08:10:38,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:38,870 INFO L475 AbstractCegarLoop]: Abstraction has 1022 states and 1391 transitions. [2019-09-10 08:10:38,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:10:38,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1391 transitions. [2019-09-10 08:10:38,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 08:10:38,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:38,875 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:10:38,876 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:38,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:38,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1744743141, now seen corresponding path program 1 times [2019-09-10 08:10:38,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:38,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:38,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:38,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:38,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:39,077 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:10:39,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:39,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:10:39,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:39,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:10:39,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:10:39,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:10:39,079 INFO L87 Difference]: Start difference. First operand 1022 states and 1391 transitions. Second operand 5 states. [2019-09-10 08:10:39,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:39,625 INFO L93 Difference]: Finished difference Result 964 states and 1323 transitions. [2019-09-10 08:10:39,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:10:39,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-10 08:10:39,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:39,637 INFO L225 Difference]: With dead ends: 964 [2019-09-10 08:10:39,638 INFO L226 Difference]: Without dead ends: 964 [2019-09-10 08:10:39,638 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:10:39,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2019-09-10 08:10:39,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 964. [2019-09-10 08:10:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2019-09-10 08:10:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1323 transitions. [2019-09-10 08:10:39,662 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1323 transitions. Word has length 92 [2019-09-10 08:10:39,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:39,662 INFO L475 AbstractCegarLoop]: Abstraction has 964 states and 1323 transitions. [2019-09-10 08:10:39,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:10:39,663 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1323 transitions. [2019-09-10 08:10:39,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 08:10:39,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:39,669 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:10:39,670 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:39,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:39,670 INFO L82 PathProgramCache]: Analyzing trace with hash 986983178, now seen corresponding path program 1 times [2019-09-10 08:10:39,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:39,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:39,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:39,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:39,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:39,880 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:10:39,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:39,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:10:39,882 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:39,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:10:39,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:10:39,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:10:39,883 INFO L87 Difference]: Start difference. First operand 964 states and 1323 transitions. Second operand 5 states. [2019-09-10 08:10:40,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:40,681 INFO L93 Difference]: Finished difference Result 938 states and 1291 transitions. [2019-09-10 08:10:40,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:10:40,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-10 08:10:40,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:40,686 INFO L225 Difference]: With dead ends: 938 [2019-09-10 08:10:40,687 INFO L226 Difference]: Without dead ends: 938 [2019-09-10 08:10:40,687 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:10:40,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2019-09-10 08:10:40,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 938. [2019-09-10 08:10:40,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2019-09-10 08:10:40,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1291 transitions. [2019-09-10 08:10:40,714 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1291 transitions. Word has length 93 [2019-09-10 08:10:40,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:40,714 INFO L475 AbstractCegarLoop]: Abstraction has 938 states and 1291 transitions. [2019-09-10 08:10:40,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:10:40,715 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1291 transitions. [2019-09-10 08:10:40,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 08:10:40,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:40,719 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:10:40,720 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:40,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:40,720 INFO L82 PathProgramCache]: Analyzing trace with hash 925768771, now seen corresponding path program 1 times [2019-09-10 08:10:40,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:40,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:40,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:40,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:40,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:40,857 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:10:40,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:40,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:10:40,858 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:40,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:10:40,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:10:40,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:10:40,862 INFO L87 Difference]: Start difference. First operand 938 states and 1291 transitions. Second operand 5 states. [2019-09-10 08:10:41,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:41,374 INFO L93 Difference]: Finished difference Result 919 states and 1268 transitions. [2019-09-10 08:10:41,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:10:41,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-09-10 08:10:41,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:41,379 INFO L225 Difference]: With dead ends: 919 [2019-09-10 08:10:41,379 INFO L226 Difference]: Without dead ends: 919 [2019-09-10 08:10:41,380 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:10:41,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-09-10 08:10:41,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 919. [2019-09-10 08:10:41,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2019-09-10 08:10:41,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1268 transitions. [2019-09-10 08:10:41,402 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1268 transitions. Word has length 94 [2019-09-10 08:10:41,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:41,403 INFO L475 AbstractCegarLoop]: Abstraction has 919 states and 1268 transitions. [2019-09-10 08:10:41,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:10:41,403 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1268 transitions. [2019-09-10 08:10:41,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 08:10:41,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:41,406 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:10:41,406 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:41,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:41,407 INFO L82 PathProgramCache]: Analyzing trace with hash 2129638404, now seen corresponding path program 1 times [2019-09-10 08:10:41,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:41,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:41,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:41,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:41,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:41,541 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:10:41,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:41,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:10:41,542 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:41,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:10:41,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:10:41,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:10:41,543 INFO L87 Difference]: Start difference. First operand 919 states and 1268 transitions. Second operand 5 states. [2019-09-10 08:10:42,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:42,234 INFO L93 Difference]: Finished difference Result 914 states and 1260 transitions. [2019-09-10 08:10:42,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:10:42,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-10 08:10:42,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:42,239 INFO L225 Difference]: With dead ends: 914 [2019-09-10 08:10:42,239 INFO L226 Difference]: Without dead ends: 914 [2019-09-10 08:10:42,239 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:10:42,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-09-10 08:10:42,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 914. [2019-09-10 08:10:42,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:10:42,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1260 transitions. [2019-09-10 08:10:42,259 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1260 transitions. Word has length 95 [2019-09-10 08:10:42,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:42,260 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1260 transitions. [2019-09-10 08:10:42,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:10:42,260 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1260 transitions. [2019-09-10 08:10:42,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 08:10:42,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:42,263 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:10:42,264 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:42,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:42,264 INFO L82 PathProgramCache]: Analyzing trace with hash -631577471, now seen corresponding path program 1 times [2019-09-10 08:10:42,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:42,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:42,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:42,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:42,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:42,518 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:10:42,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:42,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:10:42,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:42,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:10:42,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:10:42,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:10:42,520 INFO L87 Difference]: Start difference. First operand 914 states and 1260 transitions. Second operand 8 states. [2019-09-10 08:10:43,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:43,842 INFO L93 Difference]: Finished difference Result 1243 states and 1654 transitions. [2019-09-10 08:10:43,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:10:43,843 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-09-10 08:10:43,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:43,850 INFO L225 Difference]: With dead ends: 1243 [2019-09-10 08:10:43,851 INFO L226 Difference]: Without dead ends: 1243 [2019-09-10 08:10:43,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:10:43,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2019-09-10 08:10:43,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 914. [2019-09-10 08:10:43,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:10:43,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1259 transitions. [2019-09-10 08:10:43,874 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1259 transitions. Word has length 96 [2019-09-10 08:10:43,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:43,875 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1259 transitions. [2019-09-10 08:10:43,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:10:43,875 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1259 transitions. [2019-09-10 08:10:43,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 08:10:43,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:43,878 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:10:43,878 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:43,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:43,879 INFO L82 PathProgramCache]: Analyzing trace with hash -938716295, now seen corresponding path program 1 times [2019-09-10 08:10:43,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:43,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:43,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:43,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:43,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:44,229 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:10:44,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:44,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:10:44,230 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:44,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:10:44,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:10:44,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:10:44,232 INFO L87 Difference]: Start difference. First operand 914 states and 1259 transitions. Second operand 9 states. [2019-09-10 08:10:46,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:46,481 INFO L93 Difference]: Finished difference Result 1296 states and 1819 transitions. [2019-09-10 08:10:46,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:10:46,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 08:10:46,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:46,492 INFO L225 Difference]: With dead ends: 1296 [2019-09-10 08:10:46,492 INFO L226 Difference]: Without dead ends: 1296 [2019-09-10 08:10:46,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:10:46,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2019-09-10 08:10:46,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 914. [2019-09-10 08:10:46,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:10:46,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1258 transitions. [2019-09-10 08:10:46,517 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1258 transitions. Word has length 96 [2019-09-10 08:10:46,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:46,518 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1258 transitions. [2019-09-10 08:10:46,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:10:46,518 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1258 transitions. [2019-09-10 08:10:46,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 08:10:46,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:46,521 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:10:46,521 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:46,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:46,522 INFO L82 PathProgramCache]: Analyzing trace with hash 727798889, now seen corresponding path program 1 times [2019-09-10 08:10:46,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:46,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:46,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:46,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:46,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:46,752 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:10:46,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:46,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:10:46,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:46,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:10:46,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:10:46,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:10:46,754 INFO L87 Difference]: Start difference. First operand 914 states and 1258 transitions. Second operand 9 states. [2019-09-10 08:10:49,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:49,130 INFO L93 Difference]: Finished difference Result 1742 states and 2437 transitions. [2019-09-10 08:10:49,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:10:49,131 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 08:10:49,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:49,140 INFO L225 Difference]: With dead ends: 1742 [2019-09-10 08:10:49,140 INFO L226 Difference]: Without dead ends: 1742 [2019-09-10 08:10:49,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:10:49,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2019-09-10 08:10:49,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 914. [2019-09-10 08:10:49,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:10:49,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1257 transitions. [2019-09-10 08:10:49,164 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1257 transitions. Word has length 96 [2019-09-10 08:10:49,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:49,165 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1257 transitions. [2019-09-10 08:10:49,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:10:49,165 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1257 transitions. [2019-09-10 08:10:49,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:10:49,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:49,167 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] [2019-09-10 08:10:49,168 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:49,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:49,169 INFO L82 PathProgramCache]: Analyzing trace with hash 215751310, now seen corresponding path program 1 times [2019-09-10 08:10:49,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:49,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:49,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:49,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:49,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:49,373 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:10:49,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:49,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:10:49,374 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:49,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:10:49,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:10:49,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:10:49,380 INFO L87 Difference]: Start difference. First operand 914 states and 1257 transitions. Second operand 9 states. [2019-09-10 08:10:51,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:51,272 INFO L93 Difference]: Finished difference Result 1690 states and 2346 transitions. [2019-09-10 08:10:51,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:10:51,277 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:10:51,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:51,284 INFO L225 Difference]: With dead ends: 1690 [2019-09-10 08:10:51,286 INFO L226 Difference]: Without dead ends: 1690 [2019-09-10 08:10:51,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:10:51,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-10 08:10:51,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-10 08:10:51,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:10:51,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1255 transitions. [2019-09-10 08:10:51,307 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1255 transitions. Word has length 98 [2019-09-10 08:10:51,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:51,308 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1255 transitions. [2019-09-10 08:10:51,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:10:51,308 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1255 transitions. [2019-09-10 08:10:51,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:10:51,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:51,311 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] [2019-09-10 08:10:51,311 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:51,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:51,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1134267655, now seen corresponding path program 1 times [2019-09-10 08:10:51,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:51,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:51,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:51,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:51,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:51,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:10:51,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:51,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:10:51,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:51,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:10:51,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:10:51,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:10:51,534 INFO L87 Difference]: Start difference. First operand 914 states and 1255 transitions. Second operand 9 states. [2019-09-10 08:10:53,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:53,548 INFO L93 Difference]: Finished difference Result 1742 states and 2433 transitions. [2019-09-10 08:10:53,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:10:53,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:10:53,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:53,556 INFO L225 Difference]: With dead ends: 1742 [2019-09-10 08:10:53,556 INFO L226 Difference]: Without dead ends: 1742 [2019-09-10 08:10:53,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:10:53,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2019-09-10 08:10:53,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 914. [2019-09-10 08:10:53,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:10:53,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1253 transitions. [2019-09-10 08:10:53,579 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1253 transitions. Word has length 98 [2019-09-10 08:10:53,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:53,579 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1253 transitions. [2019-09-10 08:10:53,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:10:53,579 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1253 transitions. [2019-09-10 08:10:53,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:10:53,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:53,582 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] [2019-09-10 08:10:53,582 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:53,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:53,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1180953076, now seen corresponding path program 1 times [2019-09-10 08:10:53,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:53,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:53,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:53,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:53,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:53,779 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:10:53,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:53,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:10:53,780 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:53,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:10:53,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:10:53,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:10:53,781 INFO L87 Difference]: Start difference. First operand 914 states and 1253 transitions. Second operand 9 states. [2019-09-10 08:10:56,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:56,089 INFO L93 Difference]: Finished difference Result 1714 states and 2382 transitions. [2019-09-10 08:10:56,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:10:56,089 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:10:56,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:56,098 INFO L225 Difference]: With dead ends: 1714 [2019-09-10 08:10:56,098 INFO L226 Difference]: Without dead ends: 1714 [2019-09-10 08:10:56,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:10:56,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2019-09-10 08:10:56,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 914. [2019-09-10 08:10:56,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:10:56,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1251 transitions. [2019-09-10 08:10:56,118 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1251 transitions. Word has length 98 [2019-09-10 08:10:56,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:56,119 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1251 transitions. [2019-09-10 08:10:56,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:10:56,119 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1251 transitions. [2019-09-10 08:10:56,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:10:56,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:56,121 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] [2019-09-10 08:10:56,122 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:56,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:56,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1576132324, now seen corresponding path program 1 times [2019-09-10 08:10:56,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:56,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:56,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:56,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:56,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:56,364 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:10:56,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:56,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:10:56,365 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:56,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:10:56,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:10:56,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:10:56,367 INFO L87 Difference]: Start difference. First operand 914 states and 1251 transitions. Second operand 9 states. [2019-09-10 08:10:58,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:58,409 INFO L93 Difference]: Finished difference Result 1296 states and 1810 transitions. [2019-09-10 08:10:58,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:10:58,409 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:10:58,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:10:58,414 INFO L225 Difference]: With dead ends: 1296 [2019-09-10 08:10:58,414 INFO L226 Difference]: Without dead ends: 1296 [2019-09-10 08:10:58,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:10:58,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2019-09-10 08:10:58,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 914. [2019-09-10 08:10:58,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:10:58,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1249 transitions. [2019-09-10 08:10:58,433 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1249 transitions. Word has length 98 [2019-09-10 08:10:58,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:10:58,433 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1249 transitions. [2019-09-10 08:10:58,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:10:58,433 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1249 transitions. [2019-09-10 08:10:58,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:10:58,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:10:58,436 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] [2019-09-10 08:10:58,436 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:10:58,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:10:58,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1300093119, now seen corresponding path program 1 times [2019-09-10 08:10:58,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:10:58,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:58,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:10:58,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:10:58,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:10:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:10:58,609 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:10:58,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:10:58,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:10:58,610 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:10:58,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:10:58,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:10:58,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:10:58,611 INFO L87 Difference]: Start difference. First operand 914 states and 1249 transitions. Second operand 9 states. [2019-09-10 08:11:00,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:00,940 INFO L93 Difference]: Finished difference Result 1714 states and 2379 transitions. [2019-09-10 08:11:00,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:11:00,941 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:11:00,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:00,948 INFO L225 Difference]: With dead ends: 1714 [2019-09-10 08:11:00,948 INFO L226 Difference]: Without dead ends: 1714 [2019-09-10 08:11:00,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:11:00,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2019-09-10 08:11:00,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 914. [2019-09-10 08:11:00,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:11:00,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1248 transitions. [2019-09-10 08:11:00,969 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1248 transitions. Word has length 98 [2019-09-10 08:11:00,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:00,969 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1248 transitions. [2019-09-10 08:11:00,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:11:00,969 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1248 transitions. [2019-09-10 08:11:00,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:11:00,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:00,972 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] [2019-09-10 08:11:00,972 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:00,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:00,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1810473432, now seen corresponding path program 1 times [2019-09-10 08:11:00,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:00,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:00,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:00,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:00,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:01,180 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:11:01,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:01,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:11:01,181 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:01,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:11:01,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:11:01,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:11:01,182 INFO L87 Difference]: Start difference. First operand 914 states and 1248 transitions. Second operand 9 states. [2019-09-10 08:11:03,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:03,034 INFO L93 Difference]: Finished difference Result 1690 states and 2338 transitions. [2019-09-10 08:11:03,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:11:03,035 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:11:03,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:03,042 INFO L225 Difference]: With dead ends: 1690 [2019-09-10 08:11:03,042 INFO L226 Difference]: Without dead ends: 1690 [2019-09-10 08:11:03,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:11:03,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-10 08:11:03,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-10 08:11:03,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:11:03,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1247 transitions. [2019-09-10 08:11:03,062 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1247 transitions. Word has length 98 [2019-09-10 08:11:03,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:03,062 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1247 transitions. [2019-09-10 08:11:03,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:11:03,062 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1247 transitions. [2019-09-10 08:11:03,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:11:03,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:03,064 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] [2019-09-10 08:11:03,065 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:03,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:03,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1939924177, now seen corresponding path program 1 times [2019-09-10 08:11:03,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:03,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:03,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:03,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:03,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:03,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:11:03,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:03,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:11:03,252 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:03,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:11:03,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:11:03,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:11:03,253 INFO L87 Difference]: Start difference. First operand 914 states and 1247 transitions. Second operand 9 states. [2019-09-10 08:11:05,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:05,013 INFO L93 Difference]: Finished difference Result 1690 states and 2336 transitions. [2019-09-10 08:11:05,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:11:05,013 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:11:05,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:05,021 INFO L225 Difference]: With dead ends: 1690 [2019-09-10 08:11:05,021 INFO L226 Difference]: Without dead ends: 1690 [2019-09-10 08:11:05,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:11:05,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-10 08:11:05,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-10 08:11:05,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:11:05,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1246 transitions. [2019-09-10 08:11:05,038 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1246 transitions. Word has length 98 [2019-09-10 08:11:05,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:05,039 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1246 transitions. [2019-09-10 08:11:05,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:11:05,039 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1246 transitions. [2019-09-10 08:11:05,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:11:05,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:05,041 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] [2019-09-10 08:11:05,042 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:05,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:05,042 INFO L82 PathProgramCache]: Analyzing trace with hash 425886607, now seen corresponding path program 1 times [2019-09-10 08:11:05,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:05,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:05,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:05,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:05,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:05,212 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:11:05,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:05,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:11:05,213 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:05,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:11:05,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:11:05,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:11:05,214 INFO L87 Difference]: Start difference. First operand 914 states and 1246 transitions. Second operand 9 states. [2019-09-10 08:11:07,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:07,740 INFO L93 Difference]: Finished difference Result 1742 states and 2421 transitions. [2019-09-10 08:11:07,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:11:07,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:11:07,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:07,746 INFO L225 Difference]: With dead ends: 1742 [2019-09-10 08:11:07,746 INFO L226 Difference]: Without dead ends: 1742 [2019-09-10 08:11:07,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:11:07,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2019-09-10 08:11:07,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 914. [2019-09-10 08:11:07,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:11:07,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1245 transitions. [2019-09-10 08:11:07,763 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1245 transitions. Word has length 98 [2019-09-10 08:11:07,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:07,764 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1245 transitions. [2019-09-10 08:11:07,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:11:07,764 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1245 transitions. [2019-09-10 08:11:07,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:11:07,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:07,766 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] [2019-09-10 08:11:07,767 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:07,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:07,767 INFO L82 PathProgramCache]: Analyzing trace with hash -341357961, now seen corresponding path program 1 times [2019-09-10 08:11:07,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:07,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:07,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:07,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:07,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:07,935 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:11:07,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:07,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:11:07,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:07,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:11:07,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:11:07,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:11:07,937 INFO L87 Difference]: Start difference. First operand 914 states and 1245 transitions. Second operand 9 states. [2019-09-10 08:11:10,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:10,106 INFO L93 Difference]: Finished difference Result 1690 states and 2333 transitions. [2019-09-10 08:11:10,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:11:10,107 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:11:10,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:10,114 INFO L225 Difference]: With dead ends: 1690 [2019-09-10 08:11:10,115 INFO L226 Difference]: Without dead ends: 1690 [2019-09-10 08:11:10,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:11:10,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-10 08:11:10,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-10 08:11:10,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:11:10,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1244 transitions. [2019-09-10 08:11:10,133 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1244 transitions. Word has length 98 [2019-09-10 08:11:10,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:10,133 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1244 transitions. [2019-09-10 08:11:10,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:11:10,134 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1244 transitions. [2019-09-10 08:11:10,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:11:10,136 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:10,136 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] [2019-09-10 08:11:10,137 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:10,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:10,137 INFO L82 PathProgramCache]: Analyzing trace with hash -976253424, now seen corresponding path program 1 times [2019-09-10 08:11:10,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:10,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:10,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:10,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:10,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:10,306 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:11:10,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:10,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:11:10,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:10,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:11:10,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:11:10,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:11:10,308 INFO L87 Difference]: Start difference. First operand 914 states and 1244 transitions. Second operand 9 states. [2019-09-10 08:11:12,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:12,727 INFO L93 Difference]: Finished difference Result 1714 states and 2371 transitions. [2019-09-10 08:11:12,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:11:12,727 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:11:12,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:12,733 INFO L225 Difference]: With dead ends: 1714 [2019-09-10 08:11:12,733 INFO L226 Difference]: Without dead ends: 1714 [2019-09-10 08:11:12,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:11:12,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2019-09-10 08:11:12,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 914. [2019-09-10 08:11:12,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:11:12,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1243 transitions. [2019-09-10 08:11:12,750 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1243 transitions. Word has length 98 [2019-09-10 08:11:12,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:12,751 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1243 transitions. [2019-09-10 08:11:12,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:11:12,751 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1243 transitions. [2019-09-10 08:11:12,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:11:12,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:12,754 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:11:12,754 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:12,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:12,754 INFO L82 PathProgramCache]: Analyzing trace with hash 130488343, now seen corresponding path program 1 times [2019-09-10 08:11:12,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:12,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:12,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:12,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:12,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:13,051 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:11:13,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:13,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:11:13,052 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:13,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:11:13,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:11:13,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:11:13,053 INFO L87 Difference]: Start difference. First operand 914 states and 1243 transitions. Second operand 9 states. [2019-09-10 08:11:14,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:14,960 INFO L93 Difference]: Finished difference Result 1690 states and 2330 transitions. [2019-09-10 08:11:14,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:11:14,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:11:14,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:14,965 INFO L225 Difference]: With dead ends: 1690 [2019-09-10 08:11:14,966 INFO L226 Difference]: Without dead ends: 1690 [2019-09-10 08:11:14,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:11:14,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-10 08:11:14,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-10 08:11:14,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:11:14,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1241 transitions. [2019-09-10 08:11:14,981 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1241 transitions. Word has length 100 [2019-09-10 08:11:14,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:14,982 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1241 transitions. [2019-09-10 08:11:14,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:11:14,982 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1241 transitions. [2019-09-10 08:11:14,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:11:14,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:14,984 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:11:14,985 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:14,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:14,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1037598, now seen corresponding path program 1 times [2019-09-10 08:11:14,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:14,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:14,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:14,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:14,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:15,153 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:11:15,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:15,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:11:15,153 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:15,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:11:15,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:11:15,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:11:15,155 INFO L87 Difference]: Start difference. First operand 914 states and 1241 transitions. Second operand 9 states. [2019-09-10 08:11:17,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:17,557 INFO L93 Difference]: Finished difference Result 1714 states and 2367 transitions. [2019-09-10 08:11:17,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:11:17,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:11:17,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:17,562 INFO L225 Difference]: With dead ends: 1714 [2019-09-10 08:11:17,562 INFO L226 Difference]: Without dead ends: 1714 [2019-09-10 08:11:17,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:11:17,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2019-09-10 08:11:17,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 914. [2019-09-10 08:11:17,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:11:17,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1239 transitions. [2019-09-10 08:11:17,573 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1239 transitions. Word has length 100 [2019-09-10 08:11:17,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:17,573 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1239 transitions. [2019-09-10 08:11:17,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:11:17,574 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1239 transitions. [2019-09-10 08:11:17,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:11:17,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:17,576 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:11:17,577 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:17,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:17,577 INFO L82 PathProgramCache]: Analyzing trace with hash -597494101, now seen corresponding path program 1 times [2019-09-10 08:11:17,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:17,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:17,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:17,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:17,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:17,737 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:11:17,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:17,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:11:17,737 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:17,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:11:17,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:11:17,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:11:17,738 INFO L87 Difference]: Start difference. First operand 914 states and 1239 transitions. Second operand 9 states. [2019-09-10 08:11:20,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:20,132 INFO L93 Difference]: Finished difference Result 1742 states and 2407 transitions. [2019-09-10 08:11:20,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:11:20,137 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:11:20,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:20,140 INFO L225 Difference]: With dead ends: 1742 [2019-09-10 08:11:20,140 INFO L226 Difference]: Without dead ends: 1742 [2019-09-10 08:11:20,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:11:20,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2019-09-10 08:11:20,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 914. [2019-09-10 08:11:20,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:11:20,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1237 transitions. [2019-09-10 08:11:20,153 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1237 transitions. Word has length 100 [2019-09-10 08:11:20,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:20,153 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1237 transitions. [2019-09-10 08:11:20,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:11:20,154 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1237 transitions. [2019-09-10 08:11:20,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:11:20,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:20,156 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:11:20,156 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:20,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:20,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1634882529, now seen corresponding path program 1 times [2019-09-10 08:11:20,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:20,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:20,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:20,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:20,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:20,355 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:11:20,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:20,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:11:20,356 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:20,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:11:20,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:11:20,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:11:20,357 INFO L87 Difference]: Start difference. First operand 914 states and 1237 transitions. Second operand 9 states. [2019-09-10 08:11:22,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:22,223 INFO L93 Difference]: Finished difference Result 1642 states and 2240 transitions. [2019-09-10 08:11:22,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:11:22,223 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:11:22,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:22,228 INFO L225 Difference]: With dead ends: 1642 [2019-09-10 08:11:22,228 INFO L226 Difference]: Without dead ends: 1642 [2019-09-10 08:11:22,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:11:22,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-10 08:11:22,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-10 08:11:22,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:11:22,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1235 transitions. [2019-09-10 08:11:22,242 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1235 transitions. Word has length 100 [2019-09-10 08:11:22,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:22,242 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1235 transitions. [2019-09-10 08:11:22,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:11:22,243 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1235 transitions. [2019-09-10 08:11:22,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:11:22,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:22,244 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:11:22,245 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:22,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:22,245 INFO L82 PathProgramCache]: Analyzing trace with hash 2100423903, now seen corresponding path program 1 times [2019-09-10 08:11:22,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:22,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:22,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:22,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:22,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:22,447 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:11:22,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:22,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:11:22,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:22,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:11:22,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:11:22,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:11:22,448 INFO L87 Difference]: Start difference. First operand 914 states and 1235 transitions. Second operand 9 states. [2019-09-10 08:11:24,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:24,424 INFO L93 Difference]: Finished difference Result 1690 states and 2320 transitions. [2019-09-10 08:11:24,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:11:24,424 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:11:24,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:24,428 INFO L225 Difference]: With dead ends: 1690 [2019-09-10 08:11:24,429 INFO L226 Difference]: Without dead ends: 1690 [2019-09-10 08:11:24,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:11:24,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-10 08:11:24,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-10 08:11:24,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:11:24,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1233 transitions. [2019-09-10 08:11:24,444 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1233 transitions. Word has length 100 [2019-09-10 08:11:24,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:24,444 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1233 transitions. [2019-09-10 08:11:24,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:11:24,444 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1233 transitions. [2019-09-10 08:11:24,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:11:24,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:24,446 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:11:24,446 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:24,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:24,447 INFO L82 PathProgramCache]: Analyzing trace with hash -2035564676, now seen corresponding path program 1 times [2019-09-10 08:11:24,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:24,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:24,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:24,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:24,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:24,647 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:11:24,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:24,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:11:24,648 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:24,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:11:24,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:11:24,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:11:24,649 INFO L87 Difference]: Start difference. First operand 914 states and 1233 transitions. Second operand 9 states. [2019-09-10 08:11:27,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:27,239 INFO L93 Difference]: Finished difference Result 1714 states and 2357 transitions. [2019-09-10 08:11:27,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:11:27,240 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:11:27,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:27,244 INFO L225 Difference]: With dead ends: 1714 [2019-09-10 08:11:27,244 INFO L226 Difference]: Without dead ends: 1714 [2019-09-10 08:11:27,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:11:27,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2019-09-10 08:11:27,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 914. [2019-09-10 08:11:27,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:11:27,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1231 transitions. [2019-09-10 08:11:27,259 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1231 transitions. Word has length 100 [2019-09-10 08:11:27,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:27,259 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1231 transitions. [2019-09-10 08:11:27,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:11:27,260 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1231 transitions. [2019-09-10 08:11:27,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:11:27,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:27,261 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:11:27,262 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:27,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:27,262 INFO L82 PathProgramCache]: Analyzing trace with hash 232149422, now seen corresponding path program 1 times [2019-09-10 08:11:27,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:27,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:27,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:27,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:27,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:27,442 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:11:27,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:27,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:11:27,443 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:27,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:11:27,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:11:27,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:11:27,444 INFO L87 Difference]: Start difference. First operand 914 states and 1231 transitions. Second operand 9 states. [2019-09-10 08:11:29,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:29,897 INFO L93 Difference]: Finished difference Result 1714 states and 2355 transitions. [2019-09-10 08:11:29,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:11:29,897 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:11:29,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:29,902 INFO L225 Difference]: With dead ends: 1714 [2019-09-10 08:11:29,902 INFO L226 Difference]: Without dead ends: 1714 [2019-09-10 08:11:29,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:11:29,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2019-09-10 08:11:29,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 914. [2019-09-10 08:11:29,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:11:29,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1230 transitions. [2019-09-10 08:11:29,919 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1230 transitions. Word has length 100 [2019-09-10 08:11:29,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:29,919 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1230 transitions. [2019-09-10 08:11:29,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:11:29,920 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1230 transitions. [2019-09-10 08:11:29,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:11:29,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:29,921 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:11:29,922 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:29,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:29,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1574304686, now seen corresponding path program 1 times [2019-09-10 08:11:29,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:29,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:29,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:29,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:29,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:30,079 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:11:30,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:30,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:11:30,080 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:30,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:11:30,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:11:30,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:11:30,081 INFO L87 Difference]: Start difference. First operand 914 states and 1230 transitions. Second operand 9 states. [2019-09-10 08:11:31,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:31,941 INFO L93 Difference]: Finished difference Result 1690 states and 2316 transitions. [2019-09-10 08:11:31,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:11:31,942 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:11:31,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:31,946 INFO L225 Difference]: With dead ends: 1690 [2019-09-10 08:11:31,946 INFO L226 Difference]: Without dead ends: 1690 [2019-09-10 08:11:31,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:11:31,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-10 08:11:31,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-10 08:11:31,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:11:31,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1229 transitions. [2019-09-10 08:11:31,961 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1229 transitions. Word has length 100 [2019-09-10 08:11:31,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:31,961 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1229 transitions. [2019-09-10 08:11:31,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:11:31,962 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1229 transitions. [2019-09-10 08:11:31,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:11:31,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:31,963 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:11:31,964 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:31,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:31,964 INFO L82 PathProgramCache]: Analyzing trace with hash 622153299, now seen corresponding path program 1 times [2019-09-10 08:11:31,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:31,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:31,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:31,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:31,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:32,129 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:11:32,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:32,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:11:32,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:32,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:11:32,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:11:32,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:11:32,130 INFO L87 Difference]: Start difference. First operand 914 states and 1229 transitions. Second operand 9 states. [2019-09-10 08:11:34,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:34,191 INFO L93 Difference]: Finished difference Result 1690 states and 2314 transitions. [2019-09-10 08:11:34,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:11:34,191 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:11:34,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:34,195 INFO L225 Difference]: With dead ends: 1690 [2019-09-10 08:11:34,195 INFO L226 Difference]: Without dead ends: 1690 [2019-09-10 08:11:34,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:11:34,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-10 08:11:34,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-10 08:11:34,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:11:34,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1228 transitions. [2019-09-10 08:11:34,226 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1228 transitions. Word has length 100 [2019-09-10 08:11:34,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:34,227 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1228 transitions. [2019-09-10 08:11:34,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:11:34,227 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1228 transitions. [2019-09-10 08:11:34,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:11:34,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:34,228 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:11:34,229 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:34,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:34,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1503778103, now seen corresponding path program 1 times [2019-09-10 08:11:34,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:34,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:34,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:34,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:34,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:34,402 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:11:34,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:34,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:11:34,402 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:34,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:11:34,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:11:34,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:11:34,404 INFO L87 Difference]: Start difference. First operand 914 states and 1228 transitions. Second operand 9 states. [2019-09-10 08:11:36,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:36,581 INFO L93 Difference]: Finished difference Result 1714 states and 2352 transitions. [2019-09-10 08:11:36,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:11:36,581 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:11:36,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:36,584 INFO L225 Difference]: With dead ends: 1714 [2019-09-10 08:11:36,584 INFO L226 Difference]: Without dead ends: 1714 [2019-09-10 08:11:36,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:11:36,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2019-09-10 08:11:36,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 914. [2019-09-10 08:11:36,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:11:36,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1227 transitions. [2019-09-10 08:11:36,601 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1227 transitions. Word has length 100 [2019-09-10 08:11:36,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:36,601 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1227 transitions. [2019-09-10 08:11:36,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:11:36,601 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1227 transitions. [2019-09-10 08:11:36,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:11:36,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:36,603 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:11:36,606 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:36,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:36,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1753298871, now seen corresponding path program 1 times [2019-09-10 08:11:36,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:36,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:36,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:36,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:36,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:36,756 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:11:36,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:36,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:11:36,756 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:36,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:11:36,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:11:36,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:11:36,757 INFO L87 Difference]: Start difference. First operand 914 states and 1227 transitions. Second operand 9 states. [2019-09-10 08:11:39,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:39,091 INFO L93 Difference]: Finished difference Result 1690 states and 2312 transitions. [2019-09-10 08:11:39,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:11:39,092 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:11:39,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:39,094 INFO L225 Difference]: With dead ends: 1690 [2019-09-10 08:11:39,094 INFO L226 Difference]: Without dead ends: 1690 [2019-09-10 08:11:39,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:11:39,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-10 08:11:39,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-10 08:11:39,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:11:39,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1226 transitions. [2019-09-10 08:11:39,108 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1226 transitions. Word has length 100 [2019-09-10 08:11:39,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:39,108 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1226 transitions. [2019-09-10 08:11:39,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:11:39,108 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1226 transitions. [2019-09-10 08:11:39,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:11:39,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:39,110 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:11:39,110 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:39,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:39,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1248314787, now seen corresponding path program 1 times [2019-09-10 08:11:39,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:39,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:39,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:39,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:39,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:39,269 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:11:39,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:39,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:11:39,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:39,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:11:39,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:11:39,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:11:39,270 INFO L87 Difference]: Start difference. First operand 914 states and 1226 transitions. Second operand 9 states. [2019-09-10 08:11:41,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:41,643 INFO L93 Difference]: Finished difference Result 1690 states and 2310 transitions. [2019-09-10 08:11:41,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:11:41,644 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:11:41,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:41,646 INFO L225 Difference]: With dead ends: 1690 [2019-09-10 08:11:41,646 INFO L226 Difference]: Without dead ends: 1690 [2019-09-10 08:11:41,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:11:41,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-10 08:11:41,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-10 08:11:41,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:11:41,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1225 transitions. [2019-09-10 08:11:41,659 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1225 transitions. Word has length 100 [2019-09-10 08:11:41,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:41,659 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1225 transitions. [2019-09-10 08:11:41,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:11:41,660 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1225 transitions. [2019-09-10 08:11:41,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:11:41,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:41,661 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:11:41,661 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:41,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:41,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1807326229, now seen corresponding path program 1 times [2019-09-10 08:11:41,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:41,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:41,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:41,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:41,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:41,862 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:11:41,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:41,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:11:41,863 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:41,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:11:41,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:11:41,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:11:41,866 INFO L87 Difference]: Start difference. First operand 914 states and 1225 transitions. Second operand 9 states. [2019-09-10 08:11:43,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:43,766 INFO L93 Difference]: Finished difference Result 1642 states and 2228 transitions. [2019-09-10 08:11:43,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:11:43,767 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:11:43,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:43,769 INFO L225 Difference]: With dead ends: 1642 [2019-09-10 08:11:43,769 INFO L226 Difference]: Without dead ends: 1642 [2019-09-10 08:11:43,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:11:43,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-10 08:11:43,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-10 08:11:43,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:11:43,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1224 transitions. [2019-09-10 08:11:43,781 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1224 transitions. Word has length 100 [2019-09-10 08:11:43,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:43,782 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1224 transitions. [2019-09-10 08:11:43,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:11:43,782 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1224 transitions. [2019-09-10 08:11:43,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:11:43,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:43,784 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:43,784 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:43,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:43,784 INFO L82 PathProgramCache]: Analyzing trace with hash -347748653, now seen corresponding path program 1 times [2019-09-10 08:11:43,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:43,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:43,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:43,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:43,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:43,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:11:43,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:43,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:11:43,978 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:43,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:11:43,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:11:43,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:11:43,982 INFO L87 Difference]: Start difference. First operand 914 states and 1224 transitions. Second operand 9 states. [2019-09-10 08:11:46,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:46,274 INFO L93 Difference]: Finished difference Result 1714 states and 2343 transitions. [2019-09-10 08:11:46,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:11:46,275 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:11:46,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:46,278 INFO L225 Difference]: With dead ends: 1714 [2019-09-10 08:11:46,278 INFO L226 Difference]: Without dead ends: 1714 [2019-09-10 08:11:46,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:11:46,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2019-09-10 08:11:46,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 914. [2019-09-10 08:11:46,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:11:46,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1222 transitions. [2019-09-10 08:11:46,290 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1222 transitions. Word has length 102 [2019-09-10 08:11:46,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:46,290 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1222 transitions. [2019-09-10 08:11:46,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:11:46,290 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1222 transitions. [2019-09-10 08:11:46,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:11:46,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:46,292 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:46,292 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:46,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:46,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1867430125, now seen corresponding path program 1 times [2019-09-10 08:11:46,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:46,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:46,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:46,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:46,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:46,455 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:11:46,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:46,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:11:46,455 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:46,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:11:46,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:11:46,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:11:46,457 INFO L87 Difference]: Start difference. First operand 914 states and 1222 transitions. Second operand 9 states. [2019-09-10 08:11:48,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:48,647 INFO L93 Difference]: Finished difference Result 1642 states and 2224 transitions. [2019-09-10 08:11:48,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:11:48,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:11:48,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:48,651 INFO L225 Difference]: With dead ends: 1642 [2019-09-10 08:11:48,651 INFO L226 Difference]: Without dead ends: 1642 [2019-09-10 08:11:48,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:11:48,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-10 08:11:48,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-10 08:11:48,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:11:48,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1220 transitions. [2019-09-10 08:11:48,662 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1220 transitions. Word has length 102 [2019-09-10 08:11:48,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:48,662 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1220 transitions. [2019-09-10 08:11:48,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:11:48,662 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1220 transitions. [2019-09-10 08:11:48,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:11:48,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:48,664 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:48,664 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:48,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:48,664 INFO L82 PathProgramCache]: Analyzing trace with hash -498380659, now seen corresponding path program 1 times [2019-09-10 08:11:48,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:48,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:48,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:48,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:48,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:48,835 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:11:48,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:48,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:11:48,836 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:48,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:11:48,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:11:48,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:11:48,837 INFO L87 Difference]: Start difference. First operand 914 states and 1220 transitions. Second operand 9 states. [2019-09-10 08:11:51,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:51,348 INFO L93 Difference]: Finished difference Result 1690 states and 2303 transitions. [2019-09-10 08:11:51,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:11:51,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:11:51,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:51,351 INFO L225 Difference]: With dead ends: 1690 [2019-09-10 08:11:51,351 INFO L226 Difference]: Without dead ends: 1690 [2019-09-10 08:11:51,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:11:51,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-10 08:11:51,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-10 08:11:51,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:11:51,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1218 transitions. [2019-09-10 08:11:51,364 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1218 transitions. Word has length 102 [2019-09-10 08:11:51,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:51,364 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1218 transitions. [2019-09-10 08:11:51,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:11:51,364 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1218 transitions. [2019-09-10 08:11:51,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:11:51,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:51,365 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:51,365 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:51,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:51,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1161693327, now seen corresponding path program 1 times [2019-09-10 08:11:51,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:51,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:51,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:51,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:51,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:51,536 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:11:51,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:51,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:11:51,536 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:51,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:11:51,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:11:51,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:11:51,538 INFO L87 Difference]: Start difference. First operand 914 states and 1218 transitions. Second operand 9 states. [2019-09-10 08:11:53,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:53,519 INFO L93 Difference]: Finished difference Result 1690 states and 2299 transitions. [2019-09-10 08:11:53,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:11:53,519 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:11:53,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:53,521 INFO L225 Difference]: With dead ends: 1690 [2019-09-10 08:11:53,522 INFO L226 Difference]: Without dead ends: 1690 [2019-09-10 08:11:53,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:11:53,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-10 08:11:53,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-10 08:11:53,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:11:53,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1216 transitions. [2019-09-10 08:11:53,532 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1216 transitions. Word has length 102 [2019-09-10 08:11:53,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:53,532 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1216 transitions. [2019-09-10 08:11:53,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:11:53,532 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1216 transitions. [2019-09-10 08:11:53,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:11:53,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:53,534 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:53,534 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:53,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:53,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1204117457, now seen corresponding path program 1 times [2019-09-10 08:11:53,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:53,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:53,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:53,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:53,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:53,681 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:11:53,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:53,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:11:53,682 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:53,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:11:53,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:11:53,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:11:53,682 INFO L87 Difference]: Start difference. First operand 914 states and 1216 transitions. Second operand 9 states. [2019-09-10 08:11:56,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:56,021 INFO L93 Difference]: Finished difference Result 1642 states and 2218 transitions. [2019-09-10 08:11:56,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:11:56,021 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:11:56,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:56,024 INFO L225 Difference]: With dead ends: 1642 [2019-09-10 08:11:56,024 INFO L226 Difference]: Without dead ends: 1642 [2019-09-10 08:11:56,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:11:56,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-10 08:11:56,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-10 08:11:56,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:11:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1214 transitions. [2019-09-10 08:11:56,035 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1214 transitions. Word has length 102 [2019-09-10 08:11:56,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:56,035 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1214 transitions. [2019-09-10 08:11:56,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:11:56,036 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1214 transitions. [2019-09-10 08:11:56,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:11:56,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:56,037 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:56,038 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:56,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:56,038 INFO L82 PathProgramCache]: Analyzing trace with hash 42902853, now seen corresponding path program 1 times [2019-09-10 08:11:56,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:56,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:56,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:56,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:56,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:56,204 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:11:56,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:56,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:11:56,205 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:56,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:11:56,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:11:56,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:11:56,206 INFO L87 Difference]: Start difference. First operand 914 states and 1214 transitions. Second operand 9 states. [2019-09-10 08:11:58,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:11:58,489 INFO L93 Difference]: Finished difference Result 1642 states and 2214 transitions. [2019-09-10 08:11:58,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:11:58,490 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:11:58,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:58,492 INFO L225 Difference]: With dead ends: 1642 [2019-09-10 08:11:58,493 INFO L226 Difference]: Without dead ends: 1642 [2019-09-10 08:11:58,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:11:58,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-10 08:11:58,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-10 08:11:58,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:11:58,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1212 transitions. [2019-09-10 08:11:58,502 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1212 transitions. Word has length 102 [2019-09-10 08:11:58,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:58,503 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1212 transitions. [2019-09-10 08:11:58,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:11:58,503 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1212 transitions. [2019-09-10 08:11:58,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:11:58,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:58,504 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:11:58,504 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:58,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:58,504 INFO L82 PathProgramCache]: Analyzing trace with hash -2126723695, now seen corresponding path program 1 times [2019-09-10 08:11:58,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:58,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:58,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:58,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:58,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:58,663 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:11:58,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:11:58,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:11:58,664 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:11:58,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:11:58,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:11:58,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:11:58,664 INFO L87 Difference]: Start difference. First operand 914 states and 1212 transitions. Second operand 9 states. [2019-09-10 08:12:00,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:00,880 INFO L93 Difference]: Finished difference Result 1642 states and 2212 transitions. [2019-09-10 08:12:00,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:00,881 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:12:00,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:00,883 INFO L225 Difference]: With dead ends: 1642 [2019-09-10 08:12:00,883 INFO L226 Difference]: Without dead ends: 1642 [2019-09-10 08:12:00,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:12:00,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-10 08:12:00,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-10 08:12:00,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:12:00,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1210 transitions. [2019-09-10 08:12:00,893 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1210 transitions. Word has length 102 [2019-09-10 08:12:00,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:00,893 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1210 transitions. [2019-09-10 08:12:00,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:00,893 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1210 transitions. [2019-09-10 08:12:00,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:12:00,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:00,895 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:00,895 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:00,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:00,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1199777118, now seen corresponding path program 1 times [2019-09-10 08:12:00,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:00,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:00,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:00,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:00,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:01,049 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:12:01,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:01,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:01,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:01,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:01,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:01,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:01,050 INFO L87 Difference]: Start difference. First operand 914 states and 1210 transitions. Second operand 9 states. [2019-09-10 08:12:02,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:02,956 INFO L93 Difference]: Finished difference Result 1642 states and 2210 transitions. [2019-09-10 08:12:02,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:02,956 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:12:02,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:02,959 INFO L225 Difference]: With dead ends: 1642 [2019-09-10 08:12:02,959 INFO L226 Difference]: Without dead ends: 1642 [2019-09-10 08:12:02,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:12:02,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-10 08:12:02,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-10 08:12:02,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:12:02,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1208 transitions. [2019-09-10 08:12:02,973 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1208 transitions. Word has length 102 [2019-09-10 08:12:02,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:02,973 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1208 transitions. [2019-09-10 08:12:02,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:02,973 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1208 transitions. [2019-09-10 08:12:02,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:12:02,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:02,975 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:02,975 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:02,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:02,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1851680593, now seen corresponding path program 1 times [2019-09-10 08:12:02,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:02,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:02,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:02,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:02,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:03,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:03,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:03,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:03,127 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:03,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:03,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:03,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:03,128 INFO L87 Difference]: Start difference. First operand 914 states and 1208 transitions. Second operand 9 states. [2019-09-10 08:12:05,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:05,526 INFO L93 Difference]: Finished difference Result 1690 states and 2287 transitions. [2019-09-10 08:12:05,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:05,526 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:12:05,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:05,528 INFO L225 Difference]: With dead ends: 1690 [2019-09-10 08:12:05,528 INFO L226 Difference]: Without dead ends: 1690 [2019-09-10 08:12:05,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:12:05,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-10 08:12:05,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-10 08:12:05,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:12:05,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1206 transitions. [2019-09-10 08:12:05,538 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1206 transitions. Word has length 102 [2019-09-10 08:12:05,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:05,539 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1206 transitions. [2019-09-10 08:12:05,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:05,539 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1206 transitions. [2019-09-10 08:12:05,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:12:05,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:05,540 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:05,540 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:05,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:05,541 INFO L82 PathProgramCache]: Analyzing trace with hash -239523668, now seen corresponding path program 1 times [2019-09-10 08:12:05,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:05,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:05,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:05,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:05,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:05,681 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:12:05,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:05,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:05,682 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:05,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:05,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:05,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:05,682 INFO L87 Difference]: Start difference. First operand 914 states and 1206 transitions. Second operand 9 states. [2019-09-10 08:12:07,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:07,980 INFO L93 Difference]: Finished difference Result 1642 states and 2204 transitions. [2019-09-10 08:12:07,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:07,980 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:12:07,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:07,983 INFO L225 Difference]: With dead ends: 1642 [2019-09-10 08:12:07,983 INFO L226 Difference]: Without dead ends: 1642 [2019-09-10 08:12:07,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:12:07,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-10 08:12:07,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-10 08:12:07,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:12:07,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1204 transitions. [2019-09-10 08:12:07,996 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1204 transitions. Word has length 102 [2019-09-10 08:12:07,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:07,996 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1204 transitions. [2019-09-10 08:12:07,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:07,996 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1204 transitions. [2019-09-10 08:12:07,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:12:07,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:07,998 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:07,998 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:07,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:07,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1033951035, now seen corresponding path program 1 times [2019-09-10 08:12:07,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:07,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:08,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:08,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:08,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:08,177 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:12:08,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:08,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:08,178 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:08,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:08,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:08,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:08,179 INFO L87 Difference]: Start difference. First operand 914 states and 1204 transitions. Second operand 9 states. [2019-09-10 08:12:10,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:10,444 INFO L93 Difference]: Finished difference Result 1642 states and 2202 transitions. [2019-09-10 08:12:10,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:10,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:12:10,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:10,447 INFO L225 Difference]: With dead ends: 1642 [2019-09-10 08:12:10,447 INFO L226 Difference]: Without dead ends: 1642 [2019-09-10 08:12:10,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:12:10,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-10 08:12:10,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-10 08:12:10,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:12:10,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1202 transitions. [2019-09-10 08:12:10,461 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1202 transitions. Word has length 102 [2019-09-10 08:12:10,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:10,462 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1202 transitions. [2019-09-10 08:12:10,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:10,462 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1202 transitions. [2019-09-10 08:12:10,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:12:10,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:10,464 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:10,464 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:10,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:10,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1606100660, now seen corresponding path program 1 times [2019-09-10 08:12:10,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:10,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:10,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:10,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:10,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:10,615 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:12:10,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:10,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:10,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:10,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:10,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:10,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:10,617 INFO L87 Difference]: Start difference. First operand 914 states and 1202 transitions. Second operand 9 states. [2019-09-10 08:12:12,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:12,798 INFO L93 Difference]: Finished difference Result 1642 states and 2200 transitions. [2019-09-10 08:12:12,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:12,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:12:12,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:12,801 INFO L225 Difference]: With dead ends: 1642 [2019-09-10 08:12:12,802 INFO L226 Difference]: Without dead ends: 1642 [2019-09-10 08:12:12,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:12:12,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-10 08:12:12,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-10 08:12:12,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:12:12,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1200 transitions. [2019-09-10 08:12:12,813 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1200 transitions. Word has length 102 [2019-09-10 08:12:12,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:12,813 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1200 transitions. [2019-09-10 08:12:12,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:12,813 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1200 transitions. [2019-09-10 08:12:12,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:12:12,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:12,814 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:12,814 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:12,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:12,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1991148821, now seen corresponding path program 1 times [2019-09-10 08:12:12,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:12,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:12,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:12,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:12,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:12,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:12:12,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:12,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:12,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:12,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:12,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:12,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:12,964 INFO L87 Difference]: Start difference. First operand 914 states and 1200 transitions. Second operand 9 states. [2019-09-10 08:12:15,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:15,345 INFO L93 Difference]: Finished difference Result 1690 states and 2271 transitions. [2019-09-10 08:12:15,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:15,346 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:12:15,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:15,347 INFO L225 Difference]: With dead ends: 1690 [2019-09-10 08:12:15,348 INFO L226 Difference]: Without dead ends: 1690 [2019-09-10 08:12:15,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:12:15,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-10 08:12:15,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-10 08:12:15,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:12:15,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1198 transitions. [2019-09-10 08:12:15,357 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1198 transitions. Word has length 102 [2019-09-10 08:12:15,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:15,358 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1198 transitions. [2019-09-10 08:12:15,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:15,358 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1198 transitions. [2019-09-10 08:12:15,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:12:15,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:15,359 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:15,359 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:15,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:15,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1791700802, now seen corresponding path program 1 times [2019-09-10 08:12:15,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:15,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:15,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:15,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:15,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:15,517 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:12:15,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:15,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:15,517 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:15,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:15,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:15,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:15,518 INFO L87 Difference]: Start difference. First operand 914 states and 1198 transitions. Second operand 9 states. [2019-09-10 08:12:17,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:17,831 INFO L93 Difference]: Finished difference Result 1642 states and 2194 transitions. [2019-09-10 08:12:17,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:17,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:12:17,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:17,835 INFO L225 Difference]: With dead ends: 1642 [2019-09-10 08:12:17,835 INFO L226 Difference]: Without dead ends: 1642 [2019-09-10 08:12:17,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:12:17,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-10 08:12:17,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-10 08:12:17,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:12:17,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1196 transitions. [2019-09-10 08:12:17,849 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1196 transitions. Word has length 102 [2019-09-10 08:12:17,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:17,849 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1196 transitions. [2019-09-10 08:12:17,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:17,850 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1196 transitions. [2019-09-10 08:12:17,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:12:17,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:17,851 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:17,851 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:17,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:17,852 INFO L82 PathProgramCache]: Analyzing trace with hash -518117862, now seen corresponding path program 1 times [2019-09-10 08:12:17,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:17,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:17,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:17,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:17,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:18,009 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:12:18,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:18,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:18,010 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:18,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:18,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:18,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:18,011 INFO L87 Difference]: Start difference. First operand 914 states and 1196 transitions. Second operand 9 states. [2019-09-10 08:12:20,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:20,205 INFO L93 Difference]: Finished difference Result 1642 states and 2192 transitions. [2019-09-10 08:12:20,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:20,206 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:12:20,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:20,208 INFO L225 Difference]: With dead ends: 1642 [2019-09-10 08:12:20,208 INFO L226 Difference]: Without dead ends: 1642 [2019-09-10 08:12:20,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:12:20,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-10 08:12:20,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-10 08:12:20,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:12:20,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1194 transitions. [2019-09-10 08:12:20,236 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1194 transitions. Word has length 102 [2019-09-10 08:12:20,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:20,236 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1194 transitions. [2019-09-10 08:12:20,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:20,236 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1194 transitions. [2019-09-10 08:12:20,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:12:20,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:20,237 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:20,237 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:20,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:20,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1542160895, now seen corresponding path program 1 times [2019-09-10 08:12:20,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:20,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:20,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:20,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:20,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:20,381 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:12:20,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:20,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:20,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:20,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:20,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:20,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:20,382 INFO L87 Difference]: Start difference. First operand 914 states and 1194 transitions. Second operand 9 states. [2019-09-10 08:12:22,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:22,673 INFO L93 Difference]: Finished difference Result 1642 states and 2191 transitions. [2019-09-10 08:12:22,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:22,674 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:12:22,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:22,676 INFO L225 Difference]: With dead ends: 1642 [2019-09-10 08:12:22,676 INFO L226 Difference]: Without dead ends: 1642 [2019-09-10 08:12:22,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:12:22,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-10 08:12:22,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-10 08:12:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:12:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1193 transitions. [2019-09-10 08:12:22,686 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1193 transitions. Word has length 102 [2019-09-10 08:12:22,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:22,686 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1193 transitions. [2019-09-10 08:12:22,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1193 transitions. [2019-09-10 08:12:22,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:12:22,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:22,688 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:22,688 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:22,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:22,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1591591797, now seen corresponding path program 1 times [2019-09-10 08:12:22,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:22,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:22,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:22,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:22,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:22,833 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:12:22,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:22,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:22,834 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:22,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:22,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:22,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:22,835 INFO L87 Difference]: Start difference. First operand 914 states and 1193 transitions. Second operand 9 states. [2019-09-10 08:12:25,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:25,114 INFO L93 Difference]: Finished difference Result 1642 states and 2189 transitions. [2019-09-10 08:12:25,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:25,114 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:12:25,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:25,117 INFO L225 Difference]: With dead ends: 1642 [2019-09-10 08:12:25,117 INFO L226 Difference]: Without dead ends: 1642 [2019-09-10 08:12:25,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:12:25,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-10 08:12:25,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-10 08:12:25,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:12:25,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1192 transitions. [2019-09-10 08:12:25,127 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1192 transitions. Word has length 102 [2019-09-10 08:12:25,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:25,127 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1192 transitions. [2019-09-10 08:12:25,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:25,128 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1192 transitions. [2019-09-10 08:12:25,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:12:25,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:25,129 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:25,129 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:25,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:25,129 INFO L82 PathProgramCache]: Analyzing trace with hash -578717935, now seen corresponding path program 1 times [2019-09-10 08:12:25,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:25,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:25,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:25,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:25,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:25,285 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:12:25,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:25,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:25,286 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:25,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:25,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:25,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:25,291 INFO L87 Difference]: Start difference. First operand 914 states and 1192 transitions. Second operand 9 states. [2019-09-10 08:12:27,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:27,812 INFO L93 Difference]: Finished difference Result 1642 states and 2188 transitions. [2019-09-10 08:12:27,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:27,813 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:12:27,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:27,815 INFO L225 Difference]: With dead ends: 1642 [2019-09-10 08:12:27,815 INFO L226 Difference]: Without dead ends: 1642 [2019-09-10 08:12:27,816 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:12:27,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-10 08:12:27,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-10 08:12:27,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:12:27,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1191 transitions. [2019-09-10 08:12:27,829 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1191 transitions. Word has length 102 [2019-09-10 08:12:27,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:27,829 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1191 transitions. [2019-09-10 08:12:27,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:27,829 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1191 transitions. [2019-09-10 08:12:27,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:12:27,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:27,831 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:27,831 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:27,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:27,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1766002162, now seen corresponding path program 1 times [2019-09-10 08:12:27,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:27,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:27,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:27,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:27,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:27,966 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:12:27,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:27,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:27,966 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:27,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:27,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:27,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:27,967 INFO L87 Difference]: Start difference. First operand 914 states and 1191 transitions. Second operand 9 states. [2019-09-10 08:12:30,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:30,312 INFO L93 Difference]: Finished difference Result 1642 states and 2186 transitions. [2019-09-10 08:12:30,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:30,312 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:12:30,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:30,315 INFO L225 Difference]: With dead ends: 1642 [2019-09-10 08:12:30,315 INFO L226 Difference]: Without dead ends: 1642 [2019-09-10 08:12:30,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:12:30,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-10 08:12:30,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-10 08:12:30,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:12:30,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1190 transitions. [2019-09-10 08:12:30,327 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1190 transitions. Word has length 102 [2019-09-10 08:12:30,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:30,327 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1190 transitions. [2019-09-10 08:12:30,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:30,327 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1190 transitions. [2019-09-10 08:12:30,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:12:30,329 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:30,329 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:30,329 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:30,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:30,330 INFO L82 PathProgramCache]: Analyzing trace with hash 86548545, now seen corresponding path program 1 times [2019-09-10 08:12:30,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:30,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:30,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:30,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:30,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:30,458 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:12:30,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:30,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:30,458 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:30,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:30,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:30,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:30,459 INFO L87 Difference]: Start difference. First operand 914 states and 1190 transitions. Second operand 9 states. [2019-09-10 08:12:32,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:32,712 INFO L93 Difference]: Finished difference Result 1642 states and 2184 transitions. [2019-09-10 08:12:32,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:32,712 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:12:32,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:32,714 INFO L225 Difference]: With dead ends: 1642 [2019-09-10 08:12:32,715 INFO L226 Difference]: Without dead ends: 1642 [2019-09-10 08:12:32,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:12:32,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-10 08:12:32,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-10 08:12:32,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:12:32,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1189 transitions. [2019-09-10 08:12:32,725 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1189 transitions. Word has length 102 [2019-09-10 08:12:32,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:32,725 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1189 transitions. [2019-09-10 08:12:32,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:32,725 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1189 transitions. [2019-09-10 08:12:32,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:12:32,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:32,727 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:32,727 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:32,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:32,727 INFO L82 PathProgramCache]: Analyzing trace with hash -2083870417, now seen corresponding path program 1 times [2019-09-10 08:12:32,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:32,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:32,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:32,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:32,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:32,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:12:32,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:32,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:32,874 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:32,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:32,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:32,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:32,875 INFO L87 Difference]: Start difference. First operand 914 states and 1189 transitions. Second operand 9 states. [2019-09-10 08:12:35,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:35,164 INFO L93 Difference]: Finished difference Result 1642 states and 2183 transitions. [2019-09-10 08:12:35,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:35,164 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:12:35,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:35,166 INFO L225 Difference]: With dead ends: 1642 [2019-09-10 08:12:35,167 INFO L226 Difference]: Without dead ends: 1642 [2019-09-10 08:12:35,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:12:35,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-10 08:12:35,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-10 08:12:35,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:12:35,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1188 transitions. [2019-09-10 08:12:35,177 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1188 transitions. Word has length 102 [2019-09-10 08:12:35,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:35,177 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1188 transitions. [2019-09-10 08:12:35,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:35,177 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1188 transitions. [2019-09-10 08:12:35,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:12:35,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:35,178 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:35,178 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:35,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:35,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1805478129, now seen corresponding path program 1 times [2019-09-10 08:12:35,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:35,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:35,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:35,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:35,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:35,347 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:12:35,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:35,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:35,348 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:35,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:35,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:35,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:35,349 INFO L87 Difference]: Start difference. First operand 914 states and 1188 transitions. Second operand 9 states. [2019-09-10 08:12:37,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:37,727 INFO L93 Difference]: Finished difference Result 1642 states and 2181 transitions. [2019-09-10 08:12:37,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:37,727 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:12:37,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:37,730 INFO L225 Difference]: With dead ends: 1642 [2019-09-10 08:12:37,730 INFO L226 Difference]: Without dead ends: 1642 [2019-09-10 08:12:37,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:12:37,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-10 08:12:37,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-10 08:12:37,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:12:37,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1187 transitions. [2019-09-10 08:12:37,741 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1187 transitions. Word has length 102 [2019-09-10 08:12:37,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:37,741 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1187 transitions. [2019-09-10 08:12:37,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:37,741 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1187 transitions. [2019-09-10 08:12:37,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:12:37,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:37,743 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:37,743 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:37,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:37,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1564380239, now seen corresponding path program 1 times [2019-09-10 08:12:37,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:37,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:37,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:37,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:37,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:37,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:37,888 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:12:37,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:37,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:37,888 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:37,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:37,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:37,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:37,889 INFO L87 Difference]: Start difference. First operand 914 states and 1187 transitions. Second operand 9 states. [2019-09-10 08:12:39,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:39,944 INFO L93 Difference]: Finished difference Result 1642 states and 2179 transitions. [2019-09-10 08:12:39,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:39,946 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:12:39,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:39,947 INFO L225 Difference]: With dead ends: 1642 [2019-09-10 08:12:39,947 INFO L226 Difference]: Without dead ends: 1642 [2019-09-10 08:12:39,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:12:39,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-10 08:12:39,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-10 08:12:39,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:12:39,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1186 transitions. [2019-09-10 08:12:39,957 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1186 transitions. Word has length 102 [2019-09-10 08:12:39,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:39,958 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1186 transitions. [2019-09-10 08:12:39,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:39,958 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1186 transitions. [2019-09-10 08:12:39,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:12:39,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:39,959 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:39,960 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:39,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:39,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1861566370, now seen corresponding path program 1 times [2019-09-10 08:12:39,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:39,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:39,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:39,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:39,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:40,081 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:12:40,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:40,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:40,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:40,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:40,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:40,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:40,082 INFO L87 Difference]: Start difference. First operand 914 states and 1186 transitions. Second operand 9 states. [2019-09-10 08:12:42,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:42,251 INFO L93 Difference]: Finished difference Result 1642 states and 2178 transitions. [2019-09-10 08:12:42,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:42,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:12:42,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:42,254 INFO L225 Difference]: With dead ends: 1642 [2019-09-10 08:12:42,255 INFO L226 Difference]: Without dead ends: 1642 [2019-09-10 08:12:42,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:12:42,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-10 08:12:42,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-10 08:12:42,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:12:42,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1185 transitions. [2019-09-10 08:12:42,265 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1185 transitions. Word has length 102 [2019-09-10 08:12:42,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:42,265 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1185 transitions. [2019-09-10 08:12:42,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:42,266 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1185 transitions. [2019-09-10 08:12:42,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:12:42,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:42,267 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:42,267 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:42,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:42,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1799751695, now seen corresponding path program 1 times [2019-09-10 08:12:42,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:42,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:42,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:42,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:42,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:42,387 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:12:42,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:42,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:42,387 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:42,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:42,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:42,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:42,388 INFO L87 Difference]: Start difference. First operand 914 states and 1185 transitions. Second operand 9 states. [2019-09-10 08:12:44,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:44,513 INFO L93 Difference]: Finished difference Result 1642 states and 2177 transitions. [2019-09-10 08:12:44,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:44,514 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:12:44,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:44,516 INFO L225 Difference]: With dead ends: 1642 [2019-09-10 08:12:44,516 INFO L226 Difference]: Without dead ends: 1642 [2019-09-10 08:12:44,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:12:44,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-10 08:12:44,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-10 08:12:44,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:12:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1184 transitions. [2019-09-10 08:12:44,526 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1184 transitions. Word has length 102 [2019-09-10 08:12:44,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:44,526 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1184 transitions. [2019-09-10 08:12:44,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:44,526 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1184 transitions. [2019-09-10 08:12:44,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:12:44,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:44,527 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:44,528 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:44,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:44,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1222390320, now seen corresponding path program 1 times [2019-09-10 08:12:44,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:44,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:44,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:44,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:44,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:44,675 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:12:44,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:44,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:44,676 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:44,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:44,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:44,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:44,676 INFO L87 Difference]: Start difference. First operand 914 states and 1184 transitions. Second operand 9 states. [2019-09-10 08:12:46,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:46,911 INFO L93 Difference]: Finished difference Result 1642 states and 2175 transitions. [2019-09-10 08:12:46,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:46,912 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:12:46,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:46,914 INFO L225 Difference]: With dead ends: 1642 [2019-09-10 08:12:46,914 INFO L226 Difference]: Without dead ends: 1642 [2019-09-10 08:12:46,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:12:46,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-10 08:12:46,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-10 08:12:46,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:12:46,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1183 transitions. [2019-09-10 08:12:46,924 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1183 transitions. Word has length 102 [2019-09-10 08:12:46,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:46,924 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1183 transitions. [2019-09-10 08:12:46,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:46,925 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1183 transitions. [2019-09-10 08:12:46,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:12:46,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:46,926 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:46,926 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:46,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:46,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1905574170, now seen corresponding path program 1 times [2019-09-10 08:12:46,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:46,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:46,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:46,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:46,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:47,049 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:12:47,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:47,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:47,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:47,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:47,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:47,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:47,050 INFO L87 Difference]: Start difference. First operand 914 states and 1183 transitions. Second operand 9 states. [2019-09-10 08:12:49,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:49,197 INFO L93 Difference]: Finished difference Result 1642 states and 2174 transitions. [2019-09-10 08:12:49,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:49,198 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:12:49,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:49,200 INFO L225 Difference]: With dead ends: 1642 [2019-09-10 08:12:49,200 INFO L226 Difference]: Without dead ends: 1642 [2019-09-10 08:12:49,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:12:49,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-10 08:12:49,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-10 08:12:49,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:12:49,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1182 transitions. [2019-09-10 08:12:49,211 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1182 transitions. Word has length 102 [2019-09-10 08:12:49,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:49,212 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1182 transitions. [2019-09-10 08:12:49,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:49,212 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1182 transitions. [2019-09-10 08:12:49,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:12:49,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:49,213 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:49,214 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:49,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:49,214 INFO L82 PathProgramCache]: Analyzing trace with hash -982022137, now seen corresponding path program 1 times [2019-09-10 08:12:49,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:49,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:49,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:49,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:49,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:49,330 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:12:49,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:49,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:49,330 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:49,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:49,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:49,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:49,331 INFO L87 Difference]: Start difference. First operand 914 states and 1182 transitions. Second operand 9 states. [2019-09-10 08:12:51,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:51,512 INFO L93 Difference]: Finished difference Result 1690 states and 2247 transitions. [2019-09-10 08:12:51,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:51,513 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:12:51,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:51,515 INFO L225 Difference]: With dead ends: 1690 [2019-09-10 08:12:51,515 INFO L226 Difference]: Without dead ends: 1690 [2019-09-10 08:12:51,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:12:51,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-09-10 08:12:51,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 914. [2019-09-10 08:12:51,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:12:51,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1181 transitions. [2019-09-10 08:12:51,525 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1181 transitions. Word has length 102 [2019-09-10 08:12:51,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:51,525 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1181 transitions. [2019-09-10 08:12:51,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:51,525 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1181 transitions. [2019-09-10 08:12:51,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:12:51,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:51,526 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:51,526 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:51,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:51,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1000695491, now seen corresponding path program 1 times [2019-09-10 08:12:51,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:51,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:51,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:51,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:51,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:51,641 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:12:51,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:51,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:12:51,642 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:51,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:12:51,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:12:51,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:12:51,642 INFO L87 Difference]: Start difference. First operand 914 states and 1181 transitions. Second operand 9 states. [2019-09-10 08:12:53,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:53,473 INFO L93 Difference]: Finished difference Result 1642 states and 2172 transitions. [2019-09-10 08:12:53,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:12:53,473 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:12:53,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:53,476 INFO L225 Difference]: With dead ends: 1642 [2019-09-10 08:12:53,476 INFO L226 Difference]: Without dead ends: 1642 [2019-09-10 08:12:53,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:12:53,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2019-09-10 08:12:53,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 914. [2019-09-10 08:12:53,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:12:53,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1180 transitions. [2019-09-10 08:12:53,488 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1180 transitions. Word has length 103 [2019-09-10 08:12:53,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:12:53,488 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1180 transitions. [2019-09-10 08:12:53,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:12:53,489 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1180 transitions. [2019-09-10 08:12:53,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:12:53,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:12:53,490 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:12:53,490 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:12:53,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:12:53,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1973611710, now seen corresponding path program 1 times [2019-09-10 08:12:53,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:12:53,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:53,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:12:53,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:12:53,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:12:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:12:54,588 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 08:12:54,741 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 08:12:54,907 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 08:12:55,059 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 08:12:56,538 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:12:56,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:12:56,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-10 08:12:56,539 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:12:56,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 08:12:56,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 08:12:56,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=867, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:12:56,540 INFO L87 Difference]: Start difference. First operand 914 states and 1180 transitions. Second operand 31 states. [2019-09-10 08:12:56,765 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 46 [2019-09-10 08:12:57,977 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-09-10 08:12:58,168 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2019-09-10 08:12:58,711 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 48 [2019-09-10 08:12:59,057 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 55 [2019-09-10 08:12:59,414 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 64 [2019-09-10 08:12:59,853 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 73 [2019-09-10 08:13:00,389 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 100 [2019-09-10 08:13:00,719 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 75 [2019-09-10 08:13:01,060 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 75 [2019-09-10 08:13:01,253 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 08:13:14,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:14,694 INFO L93 Difference]: Finished difference Result 1242 states and 1603 transitions. [2019-09-10 08:13:14,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 08:13:14,694 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 104 [2019-09-10 08:13:14,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:14,696 INFO L225 Difference]: With dead ends: 1242 [2019-09-10 08:13:14,696 INFO L226 Difference]: Without dead ends: 1242 [2019-09-10 08:13:14,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=445, Invalid=2417, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 08:13:14,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2019-09-10 08:13:14,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 934. [2019-09-10 08:13:14,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 934 states. [2019-09-10 08:13:14,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1207 transitions. [2019-09-10 08:13:14,705 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1207 transitions. Word has length 104 [2019-09-10 08:13:14,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:14,705 INFO L475 AbstractCegarLoop]: Abstraction has 934 states and 1207 transitions. [2019-09-10 08:13:14,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 08:13:14,705 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1207 transitions. [2019-09-10 08:13:14,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:13:14,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:14,707 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:14,707 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:14,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:14,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1671531983, now seen corresponding path program 1 times [2019-09-10 08:13:14,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:14,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:14,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:14,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:14,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:15,796 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 08:13:16,126 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 08:13:16,352 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-10 08:13:16,525 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-09-10 08:13:17,672 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:13:17,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:17,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-10 08:13:17,673 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:17,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 08:13:17,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 08:13:17,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=854, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:13:17,674 INFO L87 Difference]: Start difference. First operand 934 states and 1207 transitions. Second operand 31 states. [2019-09-10 08:13:17,871 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2019-09-10 08:13:19,426 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 46 [2019-09-10 08:13:19,782 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 75 [2019-09-10 08:13:20,148 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 94 [2019-09-10 08:13:20,697 WARN L188 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 114 [2019-09-10 08:13:21,555 WARN L188 SmtUtils]: Spent 749.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 138 [2019-09-10 08:13:21,851 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2019-09-10 08:13:22,125 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2019-09-10 08:13:22,320 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 08:13:40,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:40,737 INFO L93 Difference]: Finished difference Result 2279 states and 3010 transitions. [2019-09-10 08:13:40,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 08:13:40,737 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 104 [2019-09-10 08:13:40,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:40,740 INFO L225 Difference]: With dead ends: 2279 [2019-09-10 08:13:40,740 INFO L226 Difference]: Without dead ends: 2279 [2019-09-10 08:13:40,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=519, Invalid=3141, Unknown=0, NotChecked=0, Total=3660 [2019-09-10 08:13:40,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2019-09-10 08:13:40,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 943. [2019-09-10 08:13:40,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2019-09-10 08:13:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1219 transitions. [2019-09-10 08:13:40,755 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1219 transitions. Word has length 104 [2019-09-10 08:13:40,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:40,755 INFO L475 AbstractCegarLoop]: Abstraction has 943 states and 1219 transitions. [2019-09-10 08:13:40,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 08:13:40,756 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1219 transitions. [2019-09-10 08:13:40,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:13:40,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:40,757 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:40,758 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:40,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:40,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1056682376, now seen corresponding path program 1 times [2019-09-10 08:13:40,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:40,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:40,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:40,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:40,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:41,629 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:13:41,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:41,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:13:41,630 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:41,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:13:41,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:13:41,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:13:41,632 INFO L87 Difference]: Start difference. First operand 943 states and 1219 transitions. Second operand 17 states. [2019-09-10 08:13:42,235 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 08:13:45,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:45,513 INFO L93 Difference]: Finished difference Result 1848 states and 2444 transitions. [2019-09-10 08:13:45,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:13:45,513 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-10 08:13:45,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:45,516 INFO L225 Difference]: With dead ends: 1848 [2019-09-10 08:13:45,516 INFO L226 Difference]: Without dead ends: 1848 [2019-09-10 08:13:45,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:13:45,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2019-09-10 08:13:45,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 914. [2019-09-10 08:13:45,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-09-10 08:13:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1178 transitions. [2019-09-10 08:13:45,527 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1178 transitions. Word has length 104 [2019-09-10 08:13:45,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:45,527 INFO L475 AbstractCegarLoop]: Abstraction has 914 states and 1178 transitions. [2019-09-10 08:13:45,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:13:45,528 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1178 transitions. [2019-09-10 08:13:45,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:13:45,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:45,529 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:45,530 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:45,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:45,530 INFO L82 PathProgramCache]: Analyzing trace with hash -731627508, now seen corresponding path program 1 times [2019-09-10 08:13:45,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:45,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:45,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:45,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:45,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:46,745 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:13:46,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:46,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:13:46,746 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:46,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:13:46,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:13:46,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:13:46,746 INFO L87 Difference]: Start difference. First operand 914 states and 1178 transitions. Second operand 22 states. [2019-09-10 08:13:47,796 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 08:13:48,038 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-09-10 08:13:48,392 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-10 08:13:48,536 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 08:13:53,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:53,512 INFO L93 Difference]: Finished difference Result 1823 states and 2383 transitions. [2019-09-10 08:13:53,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:13:53,513 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 104 [2019-09-10 08:13:53,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:53,515 INFO L225 Difference]: With dead ends: 1823 [2019-09-10 08:13:53,515 INFO L226 Difference]: Without dead ends: 1823 [2019-09-10 08:13:53,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:13:53,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2019-09-10 08:13:53,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 926. [2019-09-10 08:13:53,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-09-10 08:13:53,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1190 transitions. [2019-09-10 08:13:53,526 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1190 transitions. Word has length 104 [2019-09-10 08:13:53,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:53,527 INFO L475 AbstractCegarLoop]: Abstraction has 926 states and 1190 transitions. [2019-09-10 08:13:53,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:13:53,527 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1190 transitions. [2019-09-10 08:13:53,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:13:53,528 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:53,528 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:53,529 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:53,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:53,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1599389865, now seen corresponding path program 1 times [2019-09-10 08:13:53,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:53,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:53,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:53,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:53,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:54,302 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:13:54,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:54,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:13:54,303 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:54,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:13:54,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:13:54,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:13:54,303 INFO L87 Difference]: Start difference. First operand 926 states and 1190 transitions. Second operand 17 states. [2019-09-10 08:13:54,870 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 08:13:57,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:57,555 INFO L93 Difference]: Finished difference Result 1803 states and 2381 transitions. [2019-09-10 08:13:57,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:13:57,556 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-10 08:13:57,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:13:57,558 INFO L225 Difference]: With dead ends: 1803 [2019-09-10 08:13:57,558 INFO L226 Difference]: Without dead ends: 1803 [2019-09-10 08:13:57,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:13:57,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2019-09-10 08:13:57,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 912. [2019-09-10 08:13:57,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2019-09-10 08:13:57,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1168 transitions. [2019-09-10 08:13:57,568 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1168 transitions. Word has length 104 [2019-09-10 08:13:57,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:57,569 INFO L475 AbstractCegarLoop]: Abstraction has 912 states and 1168 transitions. [2019-09-10 08:13:57,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:13:57,569 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1168 transitions. [2019-09-10 08:13:57,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:13:57,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:57,571 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:13:57,571 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:57,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:57,571 INFO L82 PathProgramCache]: Analyzing trace with hash -356139567, now seen corresponding path program 1 times [2019-09-10 08:13:57,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:57,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:57,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:57,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:57,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:58,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:58,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:13:58,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:13:58,297 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:13:58,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:13:58,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:13:58,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:13:58,298 INFO L87 Difference]: Start difference. First operand 912 states and 1168 transitions. Second operand 17 states. [2019-09-10 08:13:58,897 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-09-10 08:14:01,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:01,878 INFO L93 Difference]: Finished difference Result 1791 states and 2361 transitions. [2019-09-10 08:14:01,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:14:01,878 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-10 08:14:01,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:01,881 INFO L225 Difference]: With dead ends: 1791 [2019-09-10 08:14:01,881 INFO L226 Difference]: Without dead ends: 1791 [2019-09-10 08:14:01,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:14:01,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2019-09-10 08:14:01,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 900. [2019-09-10 08:14:01,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-09-10 08:14:01,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1148 transitions. [2019-09-10 08:14:01,893 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1148 transitions. Word has length 104 [2019-09-10 08:14:01,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:01,893 INFO L475 AbstractCegarLoop]: Abstraction has 900 states and 1148 transitions. [2019-09-10 08:14:01,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:14:01,893 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1148 transitions. [2019-09-10 08:14:01,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:14:01,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:01,894 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:01,894 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:01,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:01,895 INFO L82 PathProgramCache]: Analyzing trace with hash 2101815838, now seen corresponding path program 1 times [2019-09-10 08:14:01,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:01,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:01,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:01,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:01,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:02,729 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:14:02,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:02,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:14:02,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:02,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:14:02,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:14:02,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:14:02,730 INFO L87 Difference]: Start difference. First operand 900 states and 1148 transitions. Second operand 16 states. [2019-09-10 08:14:03,421 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 08:14:03,569 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:14:03,711 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:14:03,888 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:14:04,050 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 08:14:07,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:07,546 INFO L93 Difference]: Finished difference Result 1354 states and 1702 transitions. [2019-09-10 08:14:07,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:14:07,546 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2019-09-10 08:14:07,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:07,548 INFO L225 Difference]: With dead ends: 1354 [2019-09-10 08:14:07,549 INFO L226 Difference]: Without dead ends: 1354 [2019-09-10 08:14:07,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:14:07,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-09-10 08:14:07,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 899. [2019-09-10 08:14:07,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2019-09-10 08:14:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1146 transitions. [2019-09-10 08:14:07,559 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1146 transitions. Word has length 104 [2019-09-10 08:14:07,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:07,559 INFO L475 AbstractCegarLoop]: Abstraction has 899 states and 1146 transitions. [2019-09-10 08:14:07,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:14:07,560 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1146 transitions. [2019-09-10 08:14:07,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:14:07,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:07,561 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:07,561 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:07,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:07,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1657957713, now seen corresponding path program 1 times [2019-09-10 08:14:07,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:07,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:07,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:07,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:07,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:08,737 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 08:14:09,027 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 08:14:10,178 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:14:10,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:10,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-10 08:14:10,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:10,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 08:14:10,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 08:14:10,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:14:10,179 INFO L87 Difference]: Start difference. First operand 899 states and 1146 transitions. Second operand 31 states. [2019-09-10 08:14:10,383 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 08:14:11,478 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 08:14:11,643 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-10 08:14:11,941 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-09-10 08:14:12,415 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 80 [2019-09-10 08:14:12,797 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2019-09-10 08:14:13,232 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2019-09-10 08:14:13,856 WARN L188 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 120 [2019-09-10 08:14:14,142 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2019-09-10 08:14:14,418 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2019-09-10 08:14:14,795 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-09-10 08:14:15,375 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-09-10 08:14:15,756 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-09-10 08:14:16,156 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 08:14:16,530 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 08:14:17,189 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2019-09-10 08:14:27,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:27,348 INFO L93 Difference]: Finished difference Result 1933 states and 2455 transitions. [2019-09-10 08:14:27,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 08:14:27,348 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 104 [2019-09-10 08:14:27,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:27,350 INFO L225 Difference]: With dead ends: 1933 [2019-09-10 08:14:27,350 INFO L226 Difference]: Without dead ends: 1933 [2019-09-10 08:14:27,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=644, Invalid=2436, Unknown=0, NotChecked=0, Total=3080 [2019-09-10 08:14:27,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2019-09-10 08:14:27,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 909. [2019-09-10 08:14:27,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-09-10 08:14:27,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1157 transitions. [2019-09-10 08:14:27,360 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1157 transitions. Word has length 104 [2019-09-10 08:14:27,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:27,361 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1157 transitions. [2019-09-10 08:14:27,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 08:14:27,361 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1157 transitions. [2019-09-10 08:14:27,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:14:27,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:27,362 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:27,362 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:27,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:27,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1837373011, now seen corresponding path program 1 times [2019-09-10 08:14:27,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:27,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:27,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:27,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:27,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:28,103 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:14:28,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:28,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:14:28,103 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:28,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:14:28,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:14:28,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:14:28,104 INFO L87 Difference]: Start difference. First operand 909 states and 1157 transitions. Second operand 17 states. [2019-09-10 08:14:28,751 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:14:31,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:31,030 INFO L93 Difference]: Finished difference Result 1817 states and 2393 transitions. [2019-09-10 08:14:31,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:14:31,031 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-10 08:14:31,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:31,033 INFO L225 Difference]: With dead ends: 1817 [2019-09-10 08:14:31,033 INFO L226 Difference]: Without dead ends: 1817 [2019-09-10 08:14:31,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:14:31,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2019-09-10 08:14:31,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 873. [2019-09-10 08:14:31,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2019-09-10 08:14:31,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1112 transitions. [2019-09-10 08:14:31,043 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1112 transitions. Word has length 104 [2019-09-10 08:14:31,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:31,043 INFO L475 AbstractCegarLoop]: Abstraction has 873 states and 1112 transitions. [2019-09-10 08:14:31,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:14:31,043 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1112 transitions. [2019-09-10 08:14:31,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:14:31,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:31,044 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:31,045 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:31,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:31,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1726632168, now seen corresponding path program 1 times [2019-09-10 08:14:31,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:31,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:31,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:31,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:31,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:31,793 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:14:31,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:31,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:14:31,794 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:31,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:14:31,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:14:31,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:14:31,795 INFO L87 Difference]: Start difference. First operand 873 states and 1112 transitions. Second operand 16 states. [2019-09-10 08:14:32,440 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 08:14:32,569 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 08:14:35,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:35,840 INFO L93 Difference]: Finished difference Result 1346 states and 1688 transitions. [2019-09-10 08:14:35,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:14:35,840 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2019-09-10 08:14:35,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:35,842 INFO L225 Difference]: With dead ends: 1346 [2019-09-10 08:14:35,842 INFO L226 Difference]: Without dead ends: 1346 [2019-09-10 08:14:35,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:14:35,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2019-09-10 08:14:35,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 879. [2019-09-10 08:14:35,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2019-09-10 08:14:35,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1120 transitions. [2019-09-10 08:14:35,851 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1120 transitions. Word has length 104 [2019-09-10 08:14:35,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:35,851 INFO L475 AbstractCegarLoop]: Abstraction has 879 states and 1120 transitions. [2019-09-10 08:14:35,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:14:35,851 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1120 transitions. [2019-09-10 08:14:35,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:14:35,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:35,852 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:35,852 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:35,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:35,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1213486746, now seen corresponding path program 1 times [2019-09-10 08:14:35,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:35,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:35,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:35,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:35,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:36,575 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:14:36,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:36,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:14:36,575 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:36,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:14:36,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:14:36,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:14:36,576 INFO L87 Difference]: Start difference. First operand 879 states and 1120 transitions. Second operand 16 states. [2019-09-10 08:14:37,245 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 08:14:37,374 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 08:14:37,508 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 08:14:37,644 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-10 08:14:40,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:40,745 INFO L93 Difference]: Finished difference Result 1321 states and 1665 transitions. [2019-09-10 08:14:40,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:14:40,745 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2019-09-10 08:14:40,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:40,747 INFO L225 Difference]: With dead ends: 1321 [2019-09-10 08:14:40,747 INFO L226 Difference]: Without dead ends: 1321 [2019-09-10 08:14:40,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:14:40,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2019-09-10 08:14:40,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 878. [2019-09-10 08:14:40,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2019-09-10 08:14:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1118 transitions. [2019-09-10 08:14:40,755 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1118 transitions. Word has length 104 [2019-09-10 08:14:40,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:40,756 INFO L475 AbstractCegarLoop]: Abstraction has 878 states and 1118 transitions. [2019-09-10 08:14:40,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:14:40,756 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1118 transitions. [2019-09-10 08:14:40,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:14:40,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:40,757 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:40,757 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:40,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:40,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1657511695, now seen corresponding path program 1 times [2019-09-10 08:14:40,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:40,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:40,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:40,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:40,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:42,022 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:14:42,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:42,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:14:42,023 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:42,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:14:42,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:14:42,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:14:42,023 INFO L87 Difference]: Start difference. First operand 878 states and 1118 transitions. Second operand 22 states. [2019-09-10 08:14:43,006 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2019-09-10 08:14:43,262 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-10 08:14:43,552 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-10 08:14:43,717 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 08:14:46,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:14:46,191 INFO L93 Difference]: Finished difference Result 1338 states and 1738 transitions. [2019-09-10 08:14:46,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:14:46,192 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 104 [2019-09-10 08:14:46,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:46,194 INFO L225 Difference]: With dead ends: 1338 [2019-09-10 08:14:46,194 INFO L226 Difference]: Without dead ends: 1338 [2019-09-10 08:14:46,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=204, Invalid=788, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:14:46,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2019-09-10 08:14:46,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 890. [2019-09-10 08:14:46,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-09-10 08:14:46,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1130 transitions. [2019-09-10 08:14:46,203 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1130 transitions. Word has length 104 [2019-09-10 08:14:46,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:14:46,203 INFO L475 AbstractCegarLoop]: Abstraction has 890 states and 1130 transitions. [2019-09-10 08:14:46,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:14:46,203 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1130 transitions. [2019-09-10 08:14:46,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:14:46,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:14:46,205 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:14:46,205 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:14:46,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:14:46,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1499785276, now seen corresponding path program 1 times [2019-09-10 08:14:46,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:14:46,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:46,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:14:46,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:14:46,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:14:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:14:46,601 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-09-10 08:14:47,324 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-09-10 08:14:47,494 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-09-10 08:14:47,642 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-10 08:14:48,752 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:14:48,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:14:48,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-09-10 08:14:48,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:14:48,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 08:14:48,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 08:14:48,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:14:48,753 INFO L87 Difference]: Start difference. First operand 890 states and 1130 transitions. Second operand 30 states. [2019-09-10 08:14:48,960 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2019-09-10 08:14:50,095 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 35 [2019-09-10 08:14:50,372 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 50 [2019-09-10 08:14:50,827 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 73 [2019-09-10 08:14:51,208 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 87 [2019-09-10 08:14:51,688 WARN L188 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 101 [2019-09-10 08:14:52,299 WARN L188 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 114 [2019-09-10 08:14:52,621 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 78 [2019-09-10 08:14:52,921 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 78 [2019-09-10 08:14:53,215 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 73 [2019-09-10 08:14:53,462 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 67 [2019-09-10 08:14:53,732 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 67 [2019-09-10 08:14:54,135 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 60 [2019-09-10 08:15:04,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:04,475 INFO L93 Difference]: Finished difference Result 1476 states and 1910 transitions. [2019-09-10 08:15:04,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 08:15:04,476 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 104 [2019-09-10 08:15:04,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:04,477 INFO L225 Difference]: With dead ends: 1476 [2019-09-10 08:15:04,478 INFO L226 Difference]: Without dead ends: 1476 [2019-09-10 08:15:04,478 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=550, Invalid=2000, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 08:15:04,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2019-09-10 08:15:04,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 906. [2019-09-10 08:15:04,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-09-10 08:15:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1148 transitions. [2019-09-10 08:15:04,486 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1148 transitions. Word has length 104 [2019-09-10 08:15:04,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:04,487 INFO L475 AbstractCegarLoop]: Abstraction has 906 states and 1148 transitions. [2019-09-10 08:15:04,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 08:15:04,487 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1148 transitions. [2019-09-10 08:15:04,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:15:04,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:04,488 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:04,488 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:04,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:04,488 INFO L82 PathProgramCache]: Analyzing trace with hash -464164647, now seen corresponding path program 1 times [2019-09-10 08:15:04,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:04,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:04,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:04,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:04,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:05,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:05,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:05,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 08:15:05,582 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:05,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:15:05,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:15:05,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:15:05,583 INFO L87 Difference]: Start difference. First operand 906 states and 1148 transitions. Second operand 20 states. [2019-09-10 08:15:06,496 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2019-09-10 08:15:06,734 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2019-09-10 08:15:06,919 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 08:15:07,105 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-09-10 08:15:07,277 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-10 08:15:10,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:10,784 INFO L93 Difference]: Finished difference Result 1318 states and 1712 transitions. [2019-09-10 08:15:10,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:15:10,784 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 104 [2019-09-10 08:15:10,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:10,786 INFO L225 Difference]: With dead ends: 1318 [2019-09-10 08:15:10,786 INFO L226 Difference]: Without dead ends: 1318 [2019-09-10 08:15:10,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=298, Invalid=892, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:15:10,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2019-09-10 08:15:10,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 896. [2019-09-10 08:15:10,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-09-10 08:15:10,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1136 transitions. [2019-09-10 08:15:10,795 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1136 transitions. Word has length 104 [2019-09-10 08:15:10,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:10,795 INFO L475 AbstractCegarLoop]: Abstraction has 896 states and 1136 transitions. [2019-09-10 08:15:10,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:15:10,795 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1136 transitions. [2019-09-10 08:15:10,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:15:10,796 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:10,796 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:10,796 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:10,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:10,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1008248256, now seen corresponding path program 1 times [2019-09-10 08:15:10,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:10,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:10,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:10,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:10,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:11,526 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:15:11,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:11,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:15:11,526 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:11,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:15:11,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:15:11,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:15:11,527 INFO L87 Difference]: Start difference. First operand 896 states and 1136 transitions. Second operand 17 states. [2019-09-10 08:15:12,142 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 08:15:15,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:15,757 INFO L93 Difference]: Finished difference Result 1669 states and 2191 transitions. [2019-09-10 08:15:15,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:15:15,758 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-10 08:15:15,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:15,760 INFO L225 Difference]: With dead ends: 1669 [2019-09-10 08:15:15,760 INFO L226 Difference]: Without dead ends: 1669 [2019-09-10 08:15:15,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:15:15,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2019-09-10 08:15:15,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 896. [2019-09-10 08:15:15,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-09-10 08:15:15,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1134 transitions. [2019-09-10 08:15:15,770 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1134 transitions. Word has length 104 [2019-09-10 08:15:15,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:15,770 INFO L475 AbstractCegarLoop]: Abstraction has 896 states and 1134 transitions. [2019-09-10 08:15:15,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:15:15,770 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1134 transitions. [2019-09-10 08:15:15,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:15:15,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:15,771 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:15,771 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:15,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:15,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1599888547, now seen corresponding path program 1 times [2019-09-10 08:15:15,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:15,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:15,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:15,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:15,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:17,583 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:15:17,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:17,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-09-10 08:15:17,583 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:17,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 08:15:17,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 08:15:17,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:15:17,584 INFO L87 Difference]: Start difference. First operand 896 states and 1134 transitions. Second operand 27 states. [2019-09-10 08:15:17,732 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 08:15:18,668 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:15:19,210 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-10 08:15:19,519 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2019-09-10 08:15:19,889 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-09-10 08:15:20,493 WARN L188 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-09-10 08:15:20,704 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 08:15:21,013 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 08:15:21,265 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-10 08:15:21,561 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 08:15:21,846 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 08:15:22,301 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:15:29,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:29,399 INFO L93 Difference]: Finished difference Result 1691 states and 2184 transitions. [2019-09-10 08:15:29,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 08:15:29,400 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 104 [2019-09-10 08:15:29,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:29,402 INFO L225 Difference]: With dead ends: 1691 [2019-09-10 08:15:29,402 INFO L226 Difference]: Without dead ends: 1691 [2019-09-10 08:15:29,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=433, Invalid=1547, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 08:15:29,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2019-09-10 08:15:29,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 907. [2019-09-10 08:15:29,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-09-10 08:15:29,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1146 transitions. [2019-09-10 08:15:29,412 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1146 transitions. Word has length 104 [2019-09-10 08:15:29,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:29,412 INFO L475 AbstractCegarLoop]: Abstraction has 907 states and 1146 transitions. [2019-09-10 08:15:29,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 08:15:29,412 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1146 transitions. [2019-09-10 08:15:29,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:15:29,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:29,414 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:29,414 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:29,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:29,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1392964829, now seen corresponding path program 1 times [2019-09-10 08:15:29,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:29,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:29,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:29,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:29,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:30,101 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:15:30,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:30,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:15:30,102 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:30,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:15:30,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:15:30,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:15:30,103 INFO L87 Difference]: Start difference. First operand 907 states and 1146 transitions. Second operand 17 states. [2019-09-10 08:15:30,765 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 08:15:35,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:35,082 INFO L93 Difference]: Finished difference Result 1678 states and 2196 transitions. [2019-09-10 08:15:35,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:15:35,082 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-10 08:15:35,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:35,084 INFO L225 Difference]: With dead ends: 1678 [2019-09-10 08:15:35,084 INFO L226 Difference]: Without dead ends: 1678 [2019-09-10 08:15:35,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:15:35,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2019-09-10 08:15:35,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 907. [2019-09-10 08:15:35,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-09-10 08:15:35,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1144 transitions. [2019-09-10 08:15:35,092 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1144 transitions. Word has length 104 [2019-09-10 08:15:35,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:35,093 INFO L475 AbstractCegarLoop]: Abstraction has 907 states and 1144 transitions. [2019-09-10 08:15:35,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:15:35,093 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1144 transitions. [2019-09-10 08:15:35,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:15:35,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:35,094 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:35,094 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:35,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:35,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1748743276, now seen corresponding path program 1 times [2019-09-10 08:15:35,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:35,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:35,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:35,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:35,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:35,808 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-09-10 08:15:37,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:37,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:37,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-09-10 08:15:37,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:37,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 08:15:37,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 08:15:37,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:15:37,107 INFO L87 Difference]: Start difference. First operand 907 states and 1144 transitions. Second operand 27 states. [2019-09-10 08:15:38,119 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-09-10 08:15:38,609 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2019-09-10 08:15:38,918 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2019-09-10 08:15:39,286 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 83 [2019-09-10 08:15:39,708 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2019-09-10 08:15:39,910 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-10 08:15:40,186 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-09-10 08:15:40,417 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-09-10 08:15:40,614 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-10 08:15:40,833 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-10 08:15:41,146 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-10 08:15:45,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:45,443 INFO L93 Difference]: Finished difference Result 1310 states and 1691 transitions. [2019-09-10 08:15:45,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 08:15:45,444 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 104 [2019-09-10 08:15:45,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:45,446 INFO L225 Difference]: With dead ends: 1310 [2019-09-10 08:15:45,446 INFO L226 Difference]: Without dead ends: 1310 [2019-09-10 08:15:45,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=433, Invalid=1547, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 08:15:45,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2019-09-10 08:15:45,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 918. [2019-09-10 08:15:45,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2019-09-10 08:15:45,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1156 transitions. [2019-09-10 08:15:45,456 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1156 transitions. Word has length 104 [2019-09-10 08:15:45,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:45,457 INFO L475 AbstractCegarLoop]: Abstraction has 918 states and 1156 transitions. [2019-09-10 08:15:45,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 08:15:45,457 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1156 transitions. [2019-09-10 08:15:45,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:15:45,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:45,459 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:45,459 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:45,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:45,459 INFO L82 PathProgramCache]: Analyzing trace with hash 88268615, now seen corresponding path program 1 times [2019-09-10 08:15:45,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:45,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:45,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:45,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:45,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:46,466 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:15:46,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:46,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:15:46,467 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:46,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:15:46,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:15:46,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:15:46,467 INFO L87 Difference]: Start difference. First operand 918 states and 1156 transitions. Second operand 17 states. [2019-09-10 08:15:47,045 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:15:48,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:48,410 INFO L93 Difference]: Finished difference Result 1217 states and 1595 transitions. [2019-09-10 08:15:48,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:15:48,410 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-10 08:15:48,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:48,412 INFO L225 Difference]: With dead ends: 1217 [2019-09-10 08:15:48,412 INFO L226 Difference]: Without dead ends: 1217 [2019-09-10 08:15:48,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:15:48,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2019-09-10 08:15:48,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 854. [2019-09-10 08:15:48,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2019-09-10 08:15:48,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1076 transitions. [2019-09-10 08:15:48,420 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1076 transitions. Word has length 104 [2019-09-10 08:15:48,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:48,420 INFO L475 AbstractCegarLoop]: Abstraction has 854 states and 1076 transitions. [2019-09-10 08:15:48,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:15:48,420 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1076 transitions. [2019-09-10 08:15:48,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:15:48,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:48,421 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:48,422 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:48,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:48,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1710464, now seen corresponding path program 1 times [2019-09-10 08:15:48,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:48,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:48,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:48,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:48,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:48,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:48,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:48,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:48,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:48,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:48,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:48,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:48,540 INFO L87 Difference]: Start difference. First operand 854 states and 1076 transitions. Second operand 9 states. [2019-09-10 08:15:50,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:50,376 INFO L93 Difference]: Finished difference Result 1502 states and 1967 transitions. [2019-09-10 08:15:50,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:50,377 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:15:50,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:50,379 INFO L225 Difference]: With dead ends: 1502 [2019-09-10 08:15:50,379 INFO L226 Difference]: Without dead ends: 1502 [2019-09-10 08:15:50,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:15:50,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2019-09-10 08:15:50,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 854. [2019-09-10 08:15:50,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2019-09-10 08:15:50,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1073 transitions. [2019-09-10 08:15:50,389 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1073 transitions. Word has length 105 [2019-09-10 08:15:50,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:50,389 INFO L475 AbstractCegarLoop]: Abstraction has 854 states and 1073 transitions. [2019-09-10 08:15:50,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:50,389 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1073 transitions. [2019-09-10 08:15:50,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:15:50,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:50,390 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:50,391 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:50,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:50,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1026369323, now seen corresponding path program 1 times [2019-09-10 08:15:50,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:50,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:50,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:50,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:50,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:50,533 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:15:50,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:50,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:15:50,534 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:50,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:15:50,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:15:50,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:15:50,535 INFO L87 Difference]: Start difference. First operand 854 states and 1073 transitions. Second operand 9 states. [2019-09-10 08:15:52,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:52,162 INFO L93 Difference]: Finished difference Result 1536 states and 2011 transitions. [2019-09-10 08:15:52,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:52,163 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:15:52,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:52,165 INFO L225 Difference]: With dead ends: 1536 [2019-09-10 08:15:52,165 INFO L226 Difference]: Without dead ends: 1536 [2019-09-10 08:15:52,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:15:52,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2019-09-10 08:15:52,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 854. [2019-09-10 08:15:52,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 854 states. [2019-09-10 08:15:52,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1070 transitions. [2019-09-10 08:15:52,174 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1070 transitions. Word has length 105 [2019-09-10 08:15:52,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:52,174 INFO L475 AbstractCegarLoop]: Abstraction has 854 states and 1070 transitions. [2019-09-10 08:15:52,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:15:52,174 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1070 transitions. [2019-09-10 08:15:52,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:15:52,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:52,176 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:52,176 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:52,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:52,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1566388671, now seen corresponding path program 1 times [2019-09-10 08:15:52,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:52,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:52,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:52,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:52,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:52,595 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:15:52,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:52,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:15:52,595 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:52,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:15:52,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:15:52,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:15:52,596 INFO L87 Difference]: Start difference. First operand 854 states and 1070 transitions. Second operand 12 states. [2019-09-10 08:15:53,045 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-10 08:15:53,186 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-10 08:15:54,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:54,016 INFO L93 Difference]: Finished difference Result 1886 states and 2518 transitions. [2019-09-10 08:15:54,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:15:54,016 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2019-09-10 08:15:54,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:54,019 INFO L225 Difference]: With dead ends: 1886 [2019-09-10 08:15:54,019 INFO L226 Difference]: Without dead ends: 1886 [2019-09-10 08:15:54,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:15:54,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2019-09-10 08:15:54,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 820. [2019-09-10 08:15:54,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2019-09-10 08:15:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1028 transitions. [2019-09-10 08:15:54,029 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1028 transitions. Word has length 105 [2019-09-10 08:15:54,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:54,029 INFO L475 AbstractCegarLoop]: Abstraction has 820 states and 1028 transitions. [2019-09-10 08:15:54,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:15:54,030 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1028 transitions. [2019-09-10 08:15:54,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:15:54,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:54,031 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:54,031 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:54,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:54,032 INFO L82 PathProgramCache]: Analyzing trace with hash 426480591, now seen corresponding path program 1 times [2019-09-10 08:15:54,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:54,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:54,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:54,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:54,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:54,420 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:15:54,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:54,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:15:54,420 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:54,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:15:54,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:15:54,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:15:54,421 INFO L87 Difference]: Start difference. First operand 820 states and 1028 transitions. Second operand 11 states. [2019-09-10 08:15:55,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:55,804 INFO L93 Difference]: Finished difference Result 2250 states and 3073 transitions. [2019-09-10 08:15:55,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:15:55,804 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2019-09-10 08:15:55,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:55,807 INFO L225 Difference]: With dead ends: 2250 [2019-09-10 08:15:55,807 INFO L226 Difference]: Without dead ends: 2250 [2019-09-10 08:15:55,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:15:55,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2019-09-10 08:15:55,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 778. [2019-09-10 08:15:55,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2019-09-10 08:15:55,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 975 transitions. [2019-09-10 08:15:55,816 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 975 transitions. Word has length 105 [2019-09-10 08:15:55,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:55,816 INFO L475 AbstractCegarLoop]: Abstraction has 778 states and 975 transitions. [2019-09-10 08:15:55,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:15:55,816 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 975 transitions. [2019-09-10 08:15:55,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:15:55,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:55,817 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:55,818 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:55,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:55,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1169420094, now seen corresponding path program 1 times [2019-09-10 08:15:55,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:55,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:55,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:55,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:55,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:56,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:56,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:56,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:15:56,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:56,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:15:56,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:15:56,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:15:56,133 INFO L87 Difference]: Start difference. First operand 778 states and 975 transitions. Second operand 11 states. [2019-09-10 08:15:57,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:57,405 INFO L93 Difference]: Finished difference Result 1274 states and 1637 transitions. [2019-09-10 08:15:57,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:15:57,406 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2019-09-10 08:15:57,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:57,408 INFO L225 Difference]: With dead ends: 1274 [2019-09-10 08:15:57,408 INFO L226 Difference]: Without dead ends: 1274 [2019-09-10 08:15:57,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:15:57,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2019-09-10 08:15:57,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 760. [2019-09-10 08:15:57,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-09-10 08:15:57,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 952 transitions. [2019-09-10 08:15:57,416 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 952 transitions. Word has length 105 [2019-09-10 08:15:57,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:57,417 INFO L475 AbstractCegarLoop]: Abstraction has 760 states and 952 transitions. [2019-09-10 08:15:57,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:15:57,417 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 952 transitions. [2019-09-10 08:15:57,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:15:57,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:57,418 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:57,418 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:57,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:57,419 INFO L82 PathProgramCache]: Analyzing trace with hash 556450702, now seen corresponding path program 1 times [2019-09-10 08:15:57,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:57,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:57,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:57,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:57,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:57,752 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:15:57,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:57,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:15:57,752 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:57,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:15:57,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:15:57,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:15:57,753 INFO L87 Difference]: Start difference. First operand 760 states and 952 transitions. Second operand 11 states. [2019-09-10 08:15:58,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:58,840 INFO L93 Difference]: Finished difference Result 1246 states and 1608 transitions. [2019-09-10 08:15:58,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:15:58,841 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2019-09-10 08:15:58,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:58,842 INFO L225 Difference]: With dead ends: 1246 [2019-09-10 08:15:58,843 INFO L226 Difference]: Without dead ends: 1246 [2019-09-10 08:15:58,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:15:58,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2019-09-10 08:15:58,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 733. [2019-09-10 08:15:58,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2019-09-10 08:15:58,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 917 transitions. [2019-09-10 08:15:58,850 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 917 transitions. Word has length 105 [2019-09-10 08:15:58,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:58,850 INFO L475 AbstractCegarLoop]: Abstraction has 733 states and 917 transitions. [2019-09-10 08:15:58,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:15:58,851 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 917 transitions. [2019-09-10 08:15:58,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:15:58,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:58,852 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:58,852 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:58,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:58,852 INFO L82 PathProgramCache]: Analyzing trace with hash -871173262, now seen corresponding path program 1 times [2019-09-10 08:15:58,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:58,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:58,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:58,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:58,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:59,239 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:15:59,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:59,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:15:59,239 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:59,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:15:59,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:15:59,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:15:59,240 INFO L87 Difference]: Start difference. First operand 733 states and 917 transitions. Second operand 12 states. [2019-09-10 08:16:00,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:00,495 INFO L93 Difference]: Finished difference Result 1653 states and 2227 transitions. [2019-09-10 08:16:00,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:16:00,495 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2019-09-10 08:16:00,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:00,497 INFO L225 Difference]: With dead ends: 1653 [2019-09-10 08:16:00,497 INFO L226 Difference]: Without dead ends: 1653 [2019-09-10 08:16:00,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:16:00,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2019-09-10 08:16:00,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 668. [2019-09-10 08:16:00,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-09-10 08:16:00,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 839 transitions. [2019-09-10 08:16:00,505 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 839 transitions. Word has length 105 [2019-09-10 08:16:00,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:00,506 INFO L475 AbstractCegarLoop]: Abstraction has 668 states and 839 transitions. [2019-09-10 08:16:00,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:16:00,506 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 839 transitions. [2019-09-10 08:16:00,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:16:00,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:00,507 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:00,507 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:00,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:00,507 INFO L82 PathProgramCache]: Analyzing trace with hash 593307121, now seen corresponding path program 1 times [2019-09-10 08:16:00,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:00,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:00,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:00,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:00,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:01,557 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:16:01,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:01,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:16:01,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:01,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:16:01,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:16:01,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:16:01,558 INFO L87 Difference]: Start difference. First operand 668 states and 839 transitions. Second operand 21 states. [2019-09-10 08:16:02,554 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-10 08:16:02,860 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-09-10 08:16:03,025 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 08:16:03,190 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 08:16:03,342 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 08:16:07,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:07,942 INFO L93 Difference]: Finished difference Result 1331 states and 1678 transitions. [2019-09-10 08:16:07,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:16:07,943 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 105 [2019-09-10 08:16:07,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:07,945 INFO L225 Difference]: With dead ends: 1331 [2019-09-10 08:16:07,945 INFO L226 Difference]: Without dead ends: 1331 [2019-09-10 08:16:07,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=340, Invalid=1066, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 08:16:07,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2019-09-10 08:16:07,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 668. [2019-09-10 08:16:07,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-09-10 08:16:07,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 838 transitions. [2019-09-10 08:16:07,952 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 838 transitions. Word has length 105 [2019-09-10 08:16:07,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:07,952 INFO L475 AbstractCegarLoop]: Abstraction has 668 states and 838 transitions. [2019-09-10 08:16:07,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:16:07,953 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 838 transitions. [2019-09-10 08:16:07,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:16:07,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:07,954 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:07,954 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:07,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:07,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1230801955, now seen corresponding path program 1 times [2019-09-10 08:16:07,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:07,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:07,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:07,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:07,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:08,680 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:16:08,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:08,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:16:08,680 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:08,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:16:08,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:16:08,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:16:08,681 INFO L87 Difference]: Start difference. First operand 668 states and 838 transitions. Second operand 16 states. [2019-09-10 08:16:09,386 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 08:16:09,550 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:16:09,694 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:16:09,871 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:16:10,031 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 08:16:12,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:12,646 INFO L93 Difference]: Finished difference Result 1030 states and 1291 transitions. [2019-09-10 08:16:12,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:16:12,647 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2019-09-10 08:16:12,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:12,649 INFO L225 Difference]: With dead ends: 1030 [2019-09-10 08:16:12,649 INFO L226 Difference]: Without dead ends: 1030 [2019-09-10 08:16:12,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:16:12,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2019-09-10 08:16:12,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 667. [2019-09-10 08:16:12,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2019-09-10 08:16:12,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 836 transitions. [2019-09-10 08:16:12,655 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 836 transitions. Word has length 105 [2019-09-10 08:16:12,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:12,656 INFO L475 AbstractCegarLoop]: Abstraction has 667 states and 836 transitions. [2019-09-10 08:16:12,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:16:12,656 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 836 transitions. [2019-09-10 08:16:12,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:16:12,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:12,656 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:12,657 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:12,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:12,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1674768317, now seen corresponding path program 1 times [2019-09-10 08:16:12,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:12,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:12,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:12,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:12,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:13,201 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:16:13,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:13,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:16:13,201 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:13,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:16:13,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:16:13,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:16:13,202 INFO L87 Difference]: Start difference. First operand 667 states and 836 transitions. Second operand 13 states. [2019-09-10 08:16:15,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:15,073 INFO L93 Difference]: Finished difference Result 2391 states and 3270 transitions. [2019-09-10 08:16:15,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:16:15,073 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 105 [2019-09-10 08:16:15,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:15,076 INFO L225 Difference]: With dead ends: 2391 [2019-09-10 08:16:15,077 INFO L226 Difference]: Without dead ends: 2391 [2019-09-10 08:16:15,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:16:15,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2019-09-10 08:16:15,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 624. [2019-09-10 08:16:15,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-09-10 08:16:15,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 781 transitions. [2019-09-10 08:16:15,086 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 781 transitions. Word has length 105 [2019-09-10 08:16:15,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:15,086 INFO L475 AbstractCegarLoop]: Abstraction has 624 states and 781 transitions. [2019-09-10 08:16:15,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:16:15,086 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 781 transitions. [2019-09-10 08:16:15,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:16:15,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:15,087 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:15,087 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:15,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:15,088 INFO L82 PathProgramCache]: Analyzing trace with hash 390784349, now seen corresponding path program 1 times [2019-09-10 08:16:15,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:15,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:15,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:15,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:15,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:15,556 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:16:15,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:15,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:16:15,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:15,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:16:15,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:16:15,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:16:15,557 INFO L87 Difference]: Start difference. First operand 624 states and 781 transitions. Second operand 12 states. [2019-09-10 08:16:16,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:16,345 INFO L93 Difference]: Finished difference Result 929 states and 1250 transitions. [2019-09-10 08:16:16,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:16:16,346 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2019-09-10 08:16:16,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:16,347 INFO L225 Difference]: With dead ends: 929 [2019-09-10 08:16:16,347 INFO L226 Difference]: Without dead ends: 929 [2019-09-10 08:16:16,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:16:16,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-09-10 08:16:16,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 490. [2019-09-10 08:16:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-10 08:16:16,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 621 transitions. [2019-09-10 08:16:16,353 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 621 transitions. Word has length 105 [2019-09-10 08:16:16,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:16,353 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 621 transitions. [2019-09-10 08:16:16,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:16:16,353 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 621 transitions. [2019-09-10 08:16:16,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:16:16,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:16,354 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:16,354 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:16,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:16,355 INFO L82 PathProgramCache]: Analyzing trace with hash 238920912, now seen corresponding path program 1 times [2019-09-10 08:16:16,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:16,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:16,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:16,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:16,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:16,912 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:16:16,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:16,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:16:16,912 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:16,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:16:16,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:16:16,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:16:16,913 INFO L87 Difference]: Start difference. First operand 490 states and 621 transitions. Second operand 15 states. [2019-09-10 08:16:17,453 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:16:18,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:18,720 INFO L93 Difference]: Finished difference Result 764 states and 1023 transitions. [2019-09-10 08:16:18,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:16:18,720 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 105 [2019-09-10 08:16:18,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:18,721 INFO L225 Difference]: With dead ends: 764 [2019-09-10 08:16:18,722 INFO L226 Difference]: Without dead ends: 764 [2019-09-10 08:16:18,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:16:18,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-09-10 08:16:18,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 429. [2019-09-10 08:16:18,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-09-10 08:16:18,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 547 transitions. [2019-09-10 08:16:18,728 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 547 transitions. Word has length 105 [2019-09-10 08:16:18,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:18,728 INFO L475 AbstractCegarLoop]: Abstraction has 429 states and 547 transitions. [2019-09-10 08:16:18,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:16:18,728 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 547 transitions. [2019-09-10 08:16:18,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:16:18,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:18,729 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:18,729 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:18,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:18,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1983508514, now seen corresponding path program 1 times [2019-09-10 08:16:18,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:18,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:18,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:18,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:18,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:19,086 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:16:19,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:19,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 08:16:19,086 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:19,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 08:16:19,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 08:16:19,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:16:19,087 INFO L87 Difference]: Start difference. First operand 429 states and 547 transitions. Second operand 10 states. [2019-09-10 08:16:19,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:19,625 INFO L93 Difference]: Finished difference Result 769 states and 1070 transitions. [2019-09-10 08:16:19,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 08:16:19,625 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 105 [2019-09-10 08:16:19,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:19,626 INFO L225 Difference]: With dead ends: 769 [2019-09-10 08:16:19,626 INFO L226 Difference]: Without dead ends: 769 [2019-09-10 08:16:19,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:16:19,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2019-09-10 08:16:19,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 305. [2019-09-10 08:16:19,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-09-10 08:16:19,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 391 transitions. [2019-09-10 08:16:19,630 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 391 transitions. Word has length 105 [2019-09-10 08:16:19,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:19,631 INFO L475 AbstractCegarLoop]: Abstraction has 305 states and 391 transitions. [2019-09-10 08:16:19,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 08:16:19,631 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 391 transitions. [2019-09-10 08:16:19,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:16:19,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:19,631 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:19,632 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:19,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:19,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1740537637, now seen corresponding path program 1 times [2019-09-10 08:16:19,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:19,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:19,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:19,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:19,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:20,984 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:16:20,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:20,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2019-09-10 08:16:20,984 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:20,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 08:16:20,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 08:16:20,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=943, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:16:20,985 INFO L87 Difference]: Start difference. First operand 305 states and 391 transitions. Second operand 33 states. [2019-09-10 08:16:21,390 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 105 [2019-09-10 08:16:22,774 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 08:16:23,013 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 08:16:23,312 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-10 08:16:23,660 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2019-09-10 08:16:24,042 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-09-10 08:16:24,259 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-09-10 08:16:24,470 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-09-10 08:16:26,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:26,931 INFO L93 Difference]: Finished difference Result 1112 states and 1563 transitions. [2019-09-10 08:16:26,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 08:16:26,931 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 107 [2019-09-10 08:16:26,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:26,933 INFO L225 Difference]: With dead ends: 1112 [2019-09-10 08:16:26,933 INFO L226 Difference]: Without dead ends: 1112 [2019-09-10 08:16:26,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=597, Invalid=3185, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 08:16:26,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2019-09-10 08:16:26,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 326. [2019-09-10 08:16:26,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-09-10 08:16:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 417 transitions. [2019-09-10 08:16:26,939 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 417 transitions. Word has length 107 [2019-09-10 08:16:26,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:26,939 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 417 transitions. [2019-09-10 08:16:26,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 08:16:26,939 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 417 transitions. [2019-09-10 08:16:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:16:26,940 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:26,940 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:26,940 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:26,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:26,940 INFO L82 PathProgramCache]: Analyzing trace with hash -412004435, now seen corresponding path program 1 times [2019-09-10 08:16:26,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:26,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:26,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:26,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:26,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:27,634 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:16:27,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:27,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:16:27,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:27,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:16:27,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:16:27,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:16:27,635 INFO L87 Difference]: Start difference. First operand 326 states and 417 transitions. Second operand 16 states. [2019-09-10 08:16:28,771 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-10 08:16:29,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:29,760 INFO L93 Difference]: Finished difference Result 1008 states and 1397 transitions. [2019-09-10 08:16:29,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:16:29,761 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2019-09-10 08:16:29,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:29,762 INFO L225 Difference]: With dead ends: 1008 [2019-09-10 08:16:29,762 INFO L226 Difference]: Without dead ends: 1008 [2019-09-10 08:16:29,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:16:29,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-09-10 08:16:29,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 332. [2019-09-10 08:16:29,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-09-10 08:16:29,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 425 transitions. [2019-09-10 08:16:29,767 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 425 transitions. Word has length 108 [2019-09-10 08:16:29,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:29,767 INFO L475 AbstractCegarLoop]: Abstraction has 332 states and 425 transitions. [2019-09-10 08:16:29,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:16:29,767 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 425 transitions. [2019-09-10 08:16:29,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:16:29,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:29,768 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:29,768 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:29,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:29,768 INFO L82 PathProgramCache]: Analyzing trace with hash 451424884, now seen corresponding path program 1 times [2019-09-10 08:16:29,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:29,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:29,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:29,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:29,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:31,540 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:16:31,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:31,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 08:16:31,541 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:31,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 08:16:31,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 08:16:31,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:16:31,541 INFO L87 Difference]: Start difference. First operand 332 states and 425 transitions. Second operand 26 states. [2019-09-10 08:16:31,705 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 41 [2019-09-10 08:16:32,887 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-09-10 08:16:33,157 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-09-10 08:16:33,456 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2019-09-10 08:16:33,830 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 90 [2019-09-10 08:16:34,058 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 08:16:34,276 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 08:16:36,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:36,004 INFO L93 Difference]: Finished difference Result 685 states and 929 transitions. [2019-09-10 08:16:36,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:16:36,004 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 108 [2019-09-10 08:16:36,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:36,006 INFO L225 Difference]: With dead ends: 685 [2019-09-10 08:16:36,006 INFO L226 Difference]: Without dead ends: 685 [2019-09-10 08:16:36,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=321, Invalid=1319, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 08:16:36,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-09-10 08:16:36,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 333. [2019-09-10 08:16:36,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-10 08:16:36,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 426 transitions. [2019-09-10 08:16:36,011 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 426 transitions. Word has length 108 [2019-09-10 08:16:36,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:36,011 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 426 transitions. [2019-09-10 08:16:36,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 08:16:36,012 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 426 transitions. [2019-09-10 08:16:36,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:16:36,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:36,012 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:36,013 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:36,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:36,013 INFO L82 PathProgramCache]: Analyzing trace with hash -488774045, now seen corresponding path program 1 times [2019-09-10 08:16:36,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:36,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:36,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:36,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:36,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:37,133 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:16:37,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:37,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:16:37,133 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:37,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:16:37,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:16:37,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:16:37,134 INFO L87 Difference]: Start difference. First operand 333 states and 426 transitions. Second operand 21 states. [2019-09-10 08:16:38,176 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-10 08:16:38,417 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-09-10 08:16:38,586 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 08:16:38,752 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 08:16:39,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:39,723 INFO L93 Difference]: Finished difference Result 673 states and 916 transitions. [2019-09-10 08:16:39,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:16:39,724 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 108 [2019-09-10 08:16:39,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:39,725 INFO L225 Difference]: With dead ends: 673 [2019-09-10 08:16:39,725 INFO L226 Difference]: Without dead ends: 673 [2019-09-10 08:16:39,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:16:39,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-09-10 08:16:39,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 334. [2019-09-10 08:16:39,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-09-10 08:16:39,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 427 transitions. [2019-09-10 08:16:39,730 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 427 transitions. Word has length 108 [2019-09-10 08:16:39,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:39,731 INFO L475 AbstractCegarLoop]: Abstraction has 334 states and 427 transitions. [2019-09-10 08:16:39,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:16:39,731 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 427 transitions. [2019-09-10 08:16:39,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:16:39,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:39,731 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:39,731 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:39,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:39,732 INFO L82 PathProgramCache]: Analyzing trace with hash -755651892, now seen corresponding path program 1 times [2019-09-10 08:16:39,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:39,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:39,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:39,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:39,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:40,422 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:16:40,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:40,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:16:40,422 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:40,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:16:40,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:16:40,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:16:40,423 INFO L87 Difference]: Start difference. First operand 334 states and 427 transitions. Second operand 16 states. [2019-09-10 08:16:41,044 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 08:16:42,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:42,424 INFO L93 Difference]: Finished difference Result 1119 states and 1573 transitions. [2019-09-10 08:16:42,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:16:42,425 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2019-09-10 08:16:42,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:42,426 INFO L225 Difference]: With dead ends: 1119 [2019-09-10 08:16:42,426 INFO L226 Difference]: Without dead ends: 1119 [2019-09-10 08:16:42,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:16:42,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2019-09-10 08:16:42,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 311. [2019-09-10 08:16:42,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-09-10 08:16:42,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 398 transitions. [2019-09-10 08:16:42,432 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 398 transitions. Word has length 108 [2019-09-10 08:16:42,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:42,432 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 398 transitions. [2019-09-10 08:16:42,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:16:42,432 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 398 transitions. [2019-09-10 08:16:42,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:16:42,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:42,433 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:16:42,433 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:42,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:42,433 INFO L82 PathProgramCache]: Analyzing trace with hash -398163250, now seen corresponding path program 1 times [2019-09-10 08:16:42,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:42,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:42,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:42,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:42,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:43,334 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-10 08:16:43,474 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-10 08:16:43,621 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 08:16:45,831 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:16:45,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:45,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2019-09-10 08:16:45,831 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:45,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 08:16:45,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 08:16:45,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:16:45,832 INFO L87 Difference]: Start difference. First operand 311 states and 398 transitions. Second operand 33 states. [2019-09-10 08:16:46,150 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 55 [2019-09-10 08:16:46,896 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-09-10 08:16:47,084 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-09-10 08:16:47,308 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-10 08:16:47,583 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-10 08:16:47,892 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:16:48,213 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2019-09-10 08:16:48,783 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 53 [2019-09-10 08:16:49,101 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 63 [2019-09-10 08:16:49,441 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 71 [2019-09-10 08:16:49,830 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 80 [2019-09-10 08:16:50,276 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 91 [2019-09-10 08:16:50,811 WARN L188 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 107 [2019-09-10 08:16:51,156 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 84 [2019-09-10 08:16:51,479 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 84 [2019-09-10 08:16:51,805 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 81 [2019-09-10 08:16:52,153 WARN L188 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 88 [2019-09-10 08:16:52,500 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 85 [2019-09-10 08:16:52,734 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 50 [2019-09-10 08:16:53,033 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 79 [2019-09-10 08:16:53,340 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:16:55,037 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 08:16:55,463 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 08:16:56,335 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-09-10 08:16:56,830 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:16:57,139 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2019-09-10 08:16:58,951 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 60 [2019-09-10 08:17:00,598 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2019-09-10 08:17:10,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:10,473 INFO L93 Difference]: Finished difference Result 2754 states and 3913 transitions. [2019-09-10 08:17:10,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-10 08:17:10,474 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 108 [2019-09-10 08:17:10,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:10,477 INFO L225 Difference]: With dead ends: 2754 [2019-09-10 08:17:10,477 INFO L226 Difference]: Without dead ends: 2754 [2019-09-10 08:17:10,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=832, Invalid=4570, Unknown=0, NotChecked=0, Total=5402 [2019-09-10 08:17:10,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2754 states. [2019-09-10 08:17:10,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2754 to 326. [2019-09-10 08:17:10,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-09-10 08:17:10,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 416 transitions. [2019-09-10 08:17:10,487 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 416 transitions. Word has length 108 [2019-09-10 08:17:10,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:10,487 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 416 transitions. [2019-09-10 08:17:10,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 08:17:10,487 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 416 transitions. [2019-09-10 08:17:10,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 08:17:10,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:10,488 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:10,488 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:10,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:10,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1423793173, now seen corresponding path program 1 times [2019-09-10 08:17:10,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:10,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:10,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:10,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:10,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:11,094 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:17:11,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:11,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 08:17:11,094 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:11,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 08:17:11,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 08:17:11,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:17:11,095 INFO L87 Difference]: Start difference. First operand 326 states and 416 transitions. Second operand 14 states. [2019-09-10 08:17:12,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:12,400 INFO L93 Difference]: Finished difference Result 1052 states and 1474 transitions. [2019-09-10 08:17:12,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-10 08:17:12,400 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 109 [2019-09-10 08:17:12,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:12,401 INFO L225 Difference]: With dead ends: 1052 [2019-09-10 08:17:12,402 INFO L226 Difference]: Without dead ends: 1052 [2019-09-10 08:17:12,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:17:12,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-09-10 08:17:12,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 299. [2019-09-10 08:17:12,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-09-10 08:17:12,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 384 transitions. [2019-09-10 08:17:12,407 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 384 transitions. Word has length 109 [2019-09-10 08:17:12,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:12,407 INFO L475 AbstractCegarLoop]: Abstraction has 299 states and 384 transitions. [2019-09-10 08:17:12,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 08:17:12,407 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 384 transitions. [2019-09-10 08:17:12,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 08:17:12,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:12,408 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:12,408 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:12,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:12,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1928476296, now seen corresponding path program 1 times [2019-09-10 08:17:12,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:12,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:12,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:12,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:12,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:12,493 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:17:12,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:12,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:17:12,494 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:12,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:17:12,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:17:12,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:17:12,494 INFO L87 Difference]: Start difference. First operand 299 states and 384 transitions. Second operand 3 states. [2019-09-10 08:17:12,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:12,528 INFO L93 Difference]: Finished difference Result 439 states and 586 transitions. [2019-09-10 08:17:12,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:17:12,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-09-10 08:17:12,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:12,529 INFO L225 Difference]: With dead ends: 439 [2019-09-10 08:17:12,529 INFO L226 Difference]: Without dead ends: 439 [2019-09-10 08:17:12,529 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:17:12,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-09-10 08:17:12,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 437. [2019-09-10 08:17:12,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-09-10 08:17:12,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 585 transitions. [2019-09-10 08:17:12,534 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 585 transitions. Word has length 139 [2019-09-10 08:17:12,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:12,534 INFO L475 AbstractCegarLoop]: Abstraction has 437 states and 585 transitions. [2019-09-10 08:17:12,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:17:12,534 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 585 transitions. [2019-09-10 08:17:12,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 08:17:12,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:12,535 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:12,535 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:12,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:12,536 INFO L82 PathProgramCache]: Analyzing trace with hash -458142361, now seen corresponding path program 1 times [2019-09-10 08:17:12,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:12,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:12,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:12,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:12,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:12,632 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:17:12,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:12,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:17:12,633 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:12,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:17:12,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:17:12,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:17:12,633 INFO L87 Difference]: Start difference. First operand 437 states and 585 transitions. Second operand 7 states. [2019-09-10 08:17:13,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:13,142 INFO L93 Difference]: Finished difference Result 1647 states and 2344 transitions. [2019-09-10 08:17:13,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:17:13,142 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-09-10 08:17:13,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:13,144 INFO L225 Difference]: With dead ends: 1647 [2019-09-10 08:17:13,144 INFO L226 Difference]: Without dead ends: 1647 [2019-09-10 08:17:13,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:17:13,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2019-09-10 08:17:13,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 761. [2019-09-10 08:17:13,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-09-10 08:17:13,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1061 transitions. [2019-09-10 08:17:13,153 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1061 transitions. Word has length 141 [2019-09-10 08:17:13,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:13,153 INFO L475 AbstractCegarLoop]: Abstraction has 761 states and 1061 transitions. [2019-09-10 08:17:13,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:17:13,153 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1061 transitions. [2019-09-10 08:17:13,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 08:17:13,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:13,154 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:13,154 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:13,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:13,154 INFO L82 PathProgramCache]: Analyzing trace with hash 569314779, now seen corresponding path program 1 times [2019-09-10 08:17:13,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:13,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:13,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:13,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:13,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:13,247 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:17:13,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:13,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:17:13,248 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:13,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:17:13,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:17:13,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:17:13,248 INFO L87 Difference]: Start difference. First operand 761 states and 1061 transitions. Second operand 7 states. [2019-09-10 08:17:13,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:13,748 INFO L93 Difference]: Finished difference Result 2975 states and 4264 transitions. [2019-09-10 08:17:13,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:17:13,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-09-10 08:17:13,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:13,752 INFO L225 Difference]: With dead ends: 2975 [2019-09-10 08:17:13,752 INFO L226 Difference]: Without dead ends: 2975 [2019-09-10 08:17:13,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:17:13,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2019-09-10 08:17:13,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 1449. [2019-09-10 08:17:13,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1449 states. [2019-09-10 08:17:13,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1449 states and 2069 transitions. [2019-09-10 08:17:13,767 INFO L78 Accepts]: Start accepts. Automaton has 1449 states and 2069 transitions. Word has length 141 [2019-09-10 08:17:13,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:13,767 INFO L475 AbstractCegarLoop]: Abstraction has 1449 states and 2069 transitions. [2019-09-10 08:17:13,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:17:13,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 2069 transitions. [2019-09-10 08:17:13,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 08:17:13,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:13,768 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:13,768 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:13,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:13,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1954899243, now seen corresponding path program 1 times [2019-09-10 08:17:13,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:13,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:13,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:13,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:13,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:13,863 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:17:13,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:13,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:17:13,864 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:13,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:17:13,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:17:13,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:17:13,865 INFO L87 Difference]: Start difference. First operand 1449 states and 2069 transitions. Second operand 7 states. [2019-09-10 08:17:14,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:14,354 INFO L93 Difference]: Finished difference Result 5791 states and 8328 transitions. [2019-09-10 08:17:14,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:17:14,355 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-09-10 08:17:14,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:14,361 INFO L225 Difference]: With dead ends: 5791 [2019-09-10 08:17:14,361 INFO L226 Difference]: Without dead ends: 5791 [2019-09-10 08:17:14,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:17:14,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5791 states. [2019-09-10 08:17:14,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5791 to 2905. [2019-09-10 08:17:14,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2905 states. [2019-09-10 08:17:14,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2905 states to 2905 states and 4197 transitions. [2019-09-10 08:17:14,390 INFO L78 Accepts]: Start accepts. Automaton has 2905 states and 4197 transitions. Word has length 141 [2019-09-10 08:17:14,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:14,390 INFO L475 AbstractCegarLoop]: Abstraction has 2905 states and 4197 transitions. [2019-09-10 08:17:14,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:17:14,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2905 states and 4197 transitions. [2019-09-10 08:17:14,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 08:17:14,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:14,391 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:14,392 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:14,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:14,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1726425210, now seen corresponding path program 1 times [2019-09-10 08:17:14,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:14,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:14,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:14,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:14,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:14,469 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:17:14,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:14,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:17:14,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:14,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:17:14,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:17:14,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:17:14,470 INFO L87 Difference]: Start difference. First operand 2905 states and 4197 transitions. Second operand 3 states. [2019-09-10 08:17:14,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:14,516 INFO L93 Difference]: Finished difference Result 4315 states and 6238 transitions. [2019-09-10 08:17:14,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:17:14,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-09-10 08:17:14,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:14,521 INFO L225 Difference]: With dead ends: 4315 [2019-09-10 08:17:14,521 INFO L226 Difference]: Without dead ends: 4315 [2019-09-10 08:17:14,521 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:17:14,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4315 states. [2019-09-10 08:17:14,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4315 to 4313. [2019-09-10 08:17:14,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4313 states. [2019-09-10 08:17:14,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4313 states to 4313 states and 6237 transitions. [2019-09-10 08:17:14,549 INFO L78 Accepts]: Start accepts. Automaton has 4313 states and 6237 transitions. Word has length 141 [2019-09-10 08:17:14,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:14,549 INFO L475 AbstractCegarLoop]: Abstraction has 4313 states and 6237 transitions. [2019-09-10 08:17:14,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:17:14,550 INFO L276 IsEmpty]: Start isEmpty. Operand 4313 states and 6237 transitions. [2019-09-10 08:17:14,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 08:17:14,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:14,551 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:14,551 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:14,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:14,552 INFO L82 PathProgramCache]: Analyzing trace with hash 986684889, now seen corresponding path program 1 times [2019-09-10 08:17:14,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:14,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:14,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:14,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:14,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:14,609 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:17:14,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:14,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:17:14,609 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:14,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:17:14,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:17:14,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:17:14,610 INFO L87 Difference]: Start difference. First operand 4313 states and 6237 transitions. Second operand 3 states. [2019-09-10 08:17:14,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:14,647 INFO L93 Difference]: Finished difference Result 6403 states and 9186 transitions. [2019-09-10 08:17:14,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:17:14,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-09-10 08:17:14,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:14,653 INFO L225 Difference]: With dead ends: 6403 [2019-09-10 08:17:14,653 INFO L226 Difference]: Without dead ends: 6403 [2019-09-10 08:17:14,653 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:17:14,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6403 states. [2019-09-10 08:17:14,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6403 to 6401. [2019-09-10 08:17:14,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6401 states. [2019-09-10 08:17:14,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6401 states to 6401 states and 9185 transitions. [2019-09-10 08:17:14,730 INFO L78 Accepts]: Start accepts. Automaton has 6401 states and 9185 transitions. Word has length 141 [2019-09-10 08:17:14,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:14,730 INFO L475 AbstractCegarLoop]: Abstraction has 6401 states and 9185 transitions. [2019-09-10 08:17:14,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:17:14,730 INFO L276 IsEmpty]: Start isEmpty. Operand 6401 states and 9185 transitions. [2019-09-10 08:17:14,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 08:17:14,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:14,732 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:14,732 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:14,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:14,732 INFO L82 PathProgramCache]: Analyzing trace with hash 358346831, now seen corresponding path program 1 times [2019-09-10 08:17:14,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:14,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:14,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:14,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:14,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:14,829 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:17:14,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:14,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:17:14,829 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:14,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:17:14,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:17:14,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:17:14,830 INFO L87 Difference]: Start difference. First operand 6401 states and 9185 transitions. Second operand 7 states. [2019-09-10 08:17:15,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:15,343 INFO L93 Difference]: Finished difference Result 25727 states and 36536 transitions. [2019-09-10 08:17:15,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:17:15,343 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-09-10 08:17:15,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:15,367 INFO L225 Difference]: With dead ends: 25727 [2019-09-10 08:17:15,367 INFO L226 Difference]: Without dead ends: 25727 [2019-09-10 08:17:15,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:17:15,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25727 states. [2019-09-10 08:17:15,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25727 to 13369. [2019-09-10 08:17:15,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13369 states. [2019-09-10 08:17:15,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13369 states to 13369 states and 19213 transitions. [2019-09-10 08:17:15,539 INFO L78 Accepts]: Start accepts. Automaton has 13369 states and 19213 transitions. Word has length 141 [2019-09-10 08:17:15,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:15,539 INFO L475 AbstractCegarLoop]: Abstraction has 13369 states and 19213 transitions. [2019-09-10 08:17:15,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:17:15,540 INFO L276 IsEmpty]: Start isEmpty. Operand 13369 states and 19213 transitions. [2019-09-10 08:17:15,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 08:17:15,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:15,541 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:15,542 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:15,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:15,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1091090079, now seen corresponding path program 1 times [2019-09-10 08:17:15,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:15,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:15,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:15,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:15,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:15,649 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:17:15,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:15,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:17:15,649 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:15,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:17:15,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:17:15,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:17:15,650 INFO L87 Difference]: Start difference. First operand 13369 states and 19213 transitions. Second operand 7 states. [2019-09-10 08:17:16,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:16,211 INFO L93 Difference]: Finished difference Result 48303 states and 68976 transitions. [2019-09-10 08:17:16,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:17:16,212 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-09-10 08:17:16,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:16,252 INFO L225 Difference]: With dead ends: 48303 [2019-09-10 08:17:16,253 INFO L226 Difference]: Without dead ends: 48303 [2019-09-10 08:17:16,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:17:16,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48303 states. [2019-09-10 08:17:16,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48303 to 28025. [2019-09-10 08:17:16,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28025 states. [2019-09-10 08:17:16,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28025 states to 28025 states and 40277 transitions. [2019-09-10 08:17:16,652 INFO L78 Accepts]: Start accepts. Automaton has 28025 states and 40277 transitions. Word has length 141 [2019-09-10 08:17:16,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:16,652 INFO L475 AbstractCegarLoop]: Abstraction has 28025 states and 40277 transitions. [2019-09-10 08:17:16,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:17:16,652 INFO L276 IsEmpty]: Start isEmpty. Operand 28025 states and 40277 transitions. [2019-09-10 08:17:16,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 08:17:16,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:16,655 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:16,655 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:16,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:16,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1360730605, now seen corresponding path program 1 times [2019-09-10 08:17:16,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:16,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:16,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:16,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:16,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:16,747 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:17:16,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:16,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:17:16,748 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:16,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:17:16,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:17:16,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:17:16,748 INFO L87 Difference]: Start difference. First operand 28025 states and 40277 transitions. Second operand 7 states. [2019-09-10 08:17:17,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:17,245 INFO L93 Difference]: Finished difference Result 59935 states and 84744 transitions. [2019-09-10 08:17:17,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:17:17,246 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-09-10 08:17:17,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:17,302 INFO L225 Difference]: With dead ends: 59935 [2019-09-10 08:17:17,302 INFO L226 Difference]: Without dead ends: 59935 [2019-09-10 08:17:17,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:17:17,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59935 states. [2019-09-10 08:17:18,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59935 to 32665. [2019-09-10 08:17:18,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32665 states. [2019-09-10 08:17:18,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32665 states to 32665 states and 46229 transitions. [2019-09-10 08:17:18,522 INFO L78 Accepts]: Start accepts. Automaton has 32665 states and 46229 transitions. Word has length 141 [2019-09-10 08:17:18,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:18,522 INFO L475 AbstractCegarLoop]: Abstraction has 32665 states and 46229 transitions. [2019-09-10 08:17:18,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:17:18,522 INFO L276 IsEmpty]: Start isEmpty. Operand 32665 states and 46229 transitions. [2019-09-10 08:17:18,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 08:17:18,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:18,525 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:18,525 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:18,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:18,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1920406526, now seen corresponding path program 1 times [2019-09-10 08:17:18,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:18,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:18,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:18,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:18,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:18,617 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:17:18,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:18,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:17:18,617 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:18,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:17:18,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:17:18,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:17:18,618 INFO L87 Difference]: Start difference. First operand 32665 states and 46229 transitions. Second operand 6 states. [2019-09-10 08:17:18,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:18,785 INFO L93 Difference]: Finished difference Result 54237 states and 75656 transitions. [2019-09-10 08:17:18,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:17:18,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-09-10 08:17:18,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:18,840 INFO L225 Difference]: With dead ends: 54237 [2019-09-10 08:17:18,841 INFO L226 Difference]: Without dead ends: 54237 [2019-09-10 08:17:18,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:17:18,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54237 states. [2019-09-10 08:17:19,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54237 to 33049. [2019-09-10 08:17:19,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33049 states. [2019-09-10 08:17:19,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33049 states to 33049 states and 46485 transitions. [2019-09-10 08:17:19,509 INFO L78 Accepts]: Start accepts. Automaton has 33049 states and 46485 transitions. Word has length 142 [2019-09-10 08:17:19,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:19,510 INFO L475 AbstractCegarLoop]: Abstraction has 33049 states and 46485 transitions. [2019-09-10 08:17:19,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:17:19,510 INFO L276 IsEmpty]: Start isEmpty. Operand 33049 states and 46485 transitions. [2019-09-10 08:17:19,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 08:17:19,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:19,512 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:19,512 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:19,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:19,513 INFO L82 PathProgramCache]: Analyzing trace with hash 938906370, now seen corresponding path program 1 times [2019-09-10 08:17:19,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:19,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:19,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:19,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:19,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:19,575 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:17:19,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:19,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:17:19,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:19,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:17:19,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:17:19,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:17:19,576 INFO L87 Difference]: Start difference. First operand 33049 states and 46485 transitions. Second operand 3 states. [2019-09-10 08:17:19,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:19,689 INFO L93 Difference]: Finished difference Result 54075 states and 76326 transitions. [2019-09-10 08:17:19,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:17:19,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-09-10 08:17:19,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:19,743 INFO L225 Difference]: With dead ends: 54075 [2019-09-10 08:17:19,743 INFO L226 Difference]: Without dead ends: 54075 [2019-09-10 08:17:19,743 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:17:19,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54075 states. [2019-09-10 08:17:20,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54075 to 39561. [2019-09-10 08:17:20,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39561 states. [2019-09-10 08:17:20,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39561 states to 39561 states and 56061 transitions. [2019-09-10 08:17:20,142 INFO L78 Accepts]: Start accepts. Automaton has 39561 states and 56061 transitions. Word has length 142 [2019-09-10 08:17:20,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:20,143 INFO L475 AbstractCegarLoop]: Abstraction has 39561 states and 56061 transitions. [2019-09-10 08:17:20,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:17:20,143 INFO L276 IsEmpty]: Start isEmpty. Operand 39561 states and 56061 transitions. [2019-09-10 08:17:20,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 08:17:20,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:20,145 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:20,145 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:20,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:20,145 INFO L82 PathProgramCache]: Analyzing trace with hash 824570804, now seen corresponding path program 1 times [2019-09-10 08:17:20,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:20,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:20,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:20,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:20,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:20,223 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:17:20,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:20,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:17:20,224 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:20,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:17:20,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:17:20,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:17:20,225 INFO L87 Difference]: Start difference. First operand 39561 states and 56061 transitions. Second operand 3 states. [2019-09-10 08:17:21,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:21,233 INFO L93 Difference]: Finished difference Result 49611 states and 69558 transitions. [2019-09-10 08:17:21,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:17:21,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-09-10 08:17:21,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:21,273 INFO L225 Difference]: With dead ends: 49611 [2019-09-10 08:17:21,273 INFO L226 Difference]: Without dead ends: 49611 [2019-09-10 08:17:21,274 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:17:21,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49611 states. [2019-09-10 08:17:21,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49611 to 36921. [2019-09-10 08:17:21,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36921 states. [2019-09-10 08:17:21,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36921 states to 36921 states and 51813 transitions. [2019-09-10 08:17:21,602 INFO L78 Accepts]: Start accepts. Automaton has 36921 states and 51813 transitions. Word has length 143 [2019-09-10 08:17:21,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:21,603 INFO L475 AbstractCegarLoop]: Abstraction has 36921 states and 51813 transitions. [2019-09-10 08:17:21,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:17:21,603 INFO L276 IsEmpty]: Start isEmpty. Operand 36921 states and 51813 transitions. [2019-09-10 08:17:21,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 08:17:21,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:21,604 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:21,604 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:21,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:21,605 INFO L82 PathProgramCache]: Analyzing trace with hash -405671189, now seen corresponding path program 1 times [2019-09-10 08:17:21,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:21,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:21,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:21,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:21,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:21,673 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:17:21,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:21,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:17:21,674 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:21,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:17:21,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:17:21,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:17:21,674 INFO L87 Difference]: Start difference. First operand 36921 states and 51813 transitions. Second operand 3 states. [2019-09-10 08:17:21,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:21,767 INFO L93 Difference]: Finished difference Result 45723 states and 63510 transitions. [2019-09-10 08:17:21,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:17:21,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-10 08:17:21,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:21,810 INFO L225 Difference]: With dead ends: 45723 [2019-09-10 08:17:21,810 INFO L226 Difference]: Without dead ends: 45723 [2019-09-10 08:17:21,810 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:17:21,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45723 states. [2019-09-10 08:17:22,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45723 to 34005. [2019-09-10 08:17:22,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34005 states. [2019-09-10 08:17:22,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34005 states to 34005 states and 47277 transitions. [2019-09-10 08:17:22,412 INFO L78 Accepts]: Start accepts. Automaton has 34005 states and 47277 transitions. Word has length 144 [2019-09-10 08:17:22,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:22,413 INFO L475 AbstractCegarLoop]: Abstraction has 34005 states and 47277 transitions. [2019-09-10 08:17:22,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:17:22,413 INFO L276 IsEmpty]: Start isEmpty. Operand 34005 states and 47277 transitions. [2019-09-10 08:17:22,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 08:17:22,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:22,414 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:22,414 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:22,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:22,414 INFO L82 PathProgramCache]: Analyzing trace with hash 943669271, now seen corresponding path program 1 times [2019-09-10 08:17:22,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:22,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:22,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:22,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:22,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:22,477 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:17:22,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:22,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:17:22,477 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:22,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:17:22,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:17:22,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:17:22,478 INFO L87 Difference]: Start difference. First operand 34005 states and 47277 transitions. Second operand 3 states. [2019-09-10 08:17:22,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:22,554 INFO L93 Difference]: Finished difference Result 31487 states and 43078 transitions. [2019-09-10 08:17:22,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:17:22,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-09-10 08:17:22,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:22,583 INFO L225 Difference]: With dead ends: 31487 [2019-09-10 08:17:22,583 INFO L226 Difference]: Without dead ends: 31487 [2019-09-10 08:17:22,584 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:17:22,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31487 states. [2019-09-10 08:17:22,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31487 to 25839. [2019-09-10 08:17:22,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25839 states. [2019-09-10 08:17:22,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25839 states to 25839 states and 35373 transitions. [2019-09-10 08:17:22,812 INFO L78 Accepts]: Start accepts. Automaton has 25839 states and 35373 transitions. Word has length 145 [2019-09-10 08:17:22,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:22,813 INFO L475 AbstractCegarLoop]: Abstraction has 25839 states and 35373 transitions. [2019-09-10 08:17:22,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:17:22,813 INFO L276 IsEmpty]: Start isEmpty. Operand 25839 states and 35373 transitions. [2019-09-10 08:17:22,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:17:22,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:22,813 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:22,814 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:22,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:22,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1509471361, now seen corresponding path program 1 times [2019-09-10 08:17:22,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:22,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:22,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:22,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:22,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:22,899 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:17:22,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:22,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:17:22,900 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:22,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:17:22,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:17:22,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:17:22,900 INFO L87 Difference]: Start difference. First operand 25839 states and 35373 transitions. Second operand 3 states. [2019-09-10 08:17:22,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:22,967 INFO L93 Difference]: Finished difference Result 30239 states and 41158 transitions. [2019-09-10 08:17:22,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:17:22,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-09-10 08:17:22,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:22,995 INFO L225 Difference]: With dead ends: 30239 [2019-09-10 08:17:22,995 INFO L226 Difference]: Without dead ends: 30239 [2019-09-10 08:17:22,995 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:17:23,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30239 states. [2019-09-10 08:17:23,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30239 to 29757. [2019-09-10 08:17:23,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29757 states. [2019-09-10 08:17:23,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29757 states to 29757 states and 40497 transitions. [2019-09-10 08:17:23,459 INFO L78 Accepts]: Start accepts. Automaton has 29757 states and 40497 transitions. Word has length 146 [2019-09-10 08:17:23,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:23,459 INFO L475 AbstractCegarLoop]: Abstraction has 29757 states and 40497 transitions. [2019-09-10 08:17:23,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:17:23,459 INFO L276 IsEmpty]: Start isEmpty. Operand 29757 states and 40497 transitions. [2019-09-10 08:17:23,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 08:17:23,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:23,460 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:23,460 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:23,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:23,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1252264766, now seen corresponding path program 1 times [2019-09-10 08:17:23,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:23,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:23,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:23,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:23,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:23,517 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:17:23,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:23,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:17:23,518 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:23,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:17:23,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:17:23,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:17:23,519 INFO L87 Difference]: Start difference. First operand 29757 states and 40497 transitions. Second operand 3 states. [2019-09-10 08:17:23,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:23,595 INFO L93 Difference]: Finished difference Result 32771 states and 44498 transitions. [2019-09-10 08:17:23,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:17:23,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-09-10 08:17:23,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:23,626 INFO L225 Difference]: With dead ends: 32771 [2019-09-10 08:17:23,627 INFO L226 Difference]: Without dead ends: 32771 [2019-09-10 08:17:23,627 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:17:23,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32771 states. [2019-09-10 08:17:23,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32771 to 32769. [2019-09-10 08:17:23,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32769 states. [2019-09-10 08:17:23,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32769 states to 32769 states and 44497 transitions. [2019-09-10 08:17:23,875 INFO L78 Accepts]: Start accepts. Automaton has 32769 states and 44497 transitions. Word has length 147 [2019-09-10 08:17:23,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:23,875 INFO L475 AbstractCegarLoop]: Abstraction has 32769 states and 44497 transitions. [2019-09-10 08:17:23,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:17:23,875 INFO L276 IsEmpty]: Start isEmpty. Operand 32769 states and 44497 transitions. [2019-09-10 08:17:23,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 08:17:23,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:23,879 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:23,879 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:23,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:23,880 INFO L82 PathProgramCache]: Analyzing trace with hash -62334838, now seen corresponding path program 1 times [2019-09-10 08:17:23,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:23,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:23,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:23,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:23,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:24,071 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 08:17:24,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:24,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:17:24,071 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:24,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:17:24,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:17:24,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:17:24,072 INFO L87 Difference]: Start difference. First operand 32769 states and 44497 transitions. Second operand 8 states. [2019-09-10 08:17:24,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:24,585 INFO L93 Difference]: Finished difference Result 196899 states and 267047 transitions. [2019-09-10 08:17:24,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:17:24,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 182 [2019-09-10 08:17:24,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:25,122 INFO L225 Difference]: With dead ends: 196899 [2019-09-10 08:17:25,122 INFO L226 Difference]: Without dead ends: 196899 [2019-09-10 08:17:25,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:17:25,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196899 states. [2019-09-10 08:17:25,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196899 to 53289. [2019-09-10 08:17:25,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53289 states. [2019-09-10 08:17:26,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53289 states to 53289 states and 72097 transitions. [2019-09-10 08:17:26,513 INFO L78 Accepts]: Start accepts. Automaton has 53289 states and 72097 transitions. Word has length 182 [2019-09-10 08:17:26,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:26,514 INFO L475 AbstractCegarLoop]: Abstraction has 53289 states and 72097 transitions. [2019-09-10 08:17:26,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:17:26,514 INFO L276 IsEmpty]: Start isEmpty. Operand 53289 states and 72097 transitions. [2019-09-10 08:17:26,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-10 08:17:26,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:26,518 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:26,518 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:26,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:26,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1559091720, now seen corresponding path program 1 times [2019-09-10 08:17:26,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:26,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:26,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:26,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:26,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:26,596 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:26,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:26,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:17:26,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:26,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:17:26,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:17:26,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:17:26,597 INFO L87 Difference]: Start difference. First operand 53289 states and 72097 transitions. Second operand 3 states. [2019-09-10 08:17:26,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:26,715 INFO L93 Difference]: Finished difference Result 65627 states and 87542 transitions. [2019-09-10 08:17:26,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:17:26,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-10 08:17:26,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:26,772 INFO L225 Difference]: With dead ends: 65627 [2019-09-10 08:17:26,772 INFO L226 Difference]: Without dead ends: 65627 [2019-09-10 08:17:26,772 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:17:26,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65627 states. [2019-09-10 08:17:27,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65627 to 63065. [2019-09-10 08:17:27,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63065 states. [2019-09-10 08:17:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63065 states to 63065 states and 84469 transitions. [2019-09-10 08:17:27,267 INFO L78 Accepts]: Start accepts. Automaton has 63065 states and 84469 transitions. Word has length 182 [2019-09-10 08:17:27,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:27,267 INFO L475 AbstractCegarLoop]: Abstraction has 63065 states and 84469 transitions. [2019-09-10 08:17:27,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:17:27,267 INFO L276 IsEmpty]: Start isEmpty. Operand 63065 states and 84469 transitions. [2019-09-10 08:17:27,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 08:17:27,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:27,272 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:27,273 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:27,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:27,273 INFO L82 PathProgramCache]: Analyzing trace with hash -311275417, now seen corresponding path program 1 times [2019-09-10 08:17:27,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:27,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:27,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:27,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:27,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:27,396 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 08:17:27,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:27,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:17:27,397 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:27,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:17:27,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:17:27,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:17:27,398 INFO L87 Difference]: Start difference. First operand 63065 states and 84469 transitions. Second operand 5 states. [2019-09-10 08:17:28,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:28,106 INFO L93 Difference]: Finished difference Result 89301 states and 119319 transitions. [2019-09-10 08:17:28,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:17:28,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2019-09-10 08:17:28,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:28,180 INFO L225 Difference]: With dead ends: 89301 [2019-09-10 08:17:28,180 INFO L226 Difference]: Without dead ends: 89301 [2019-09-10 08:17:28,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:17:28,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89301 states. [2019-09-10 08:17:28,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89301 to 75385. [2019-09-10 08:17:28,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75385 states. [2019-09-10 08:17:28,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75385 states to 75385 states and 101013 transitions. [2019-09-10 08:17:28,795 INFO L78 Accepts]: Start accepts. Automaton has 75385 states and 101013 transitions. Word has length 183 [2019-09-10 08:17:28,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:28,796 INFO L475 AbstractCegarLoop]: Abstraction has 75385 states and 101013 transitions. [2019-09-10 08:17:28,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:17:28,796 INFO L276 IsEmpty]: Start isEmpty. Operand 75385 states and 101013 transitions. [2019-09-10 08:17:28,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 08:17:28,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:28,802 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:28,803 INFO L418 AbstractCegarLoop]: === Iteration 120 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:28,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:28,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1459477857, now seen corresponding path program 1 times [2019-09-10 08:17:28,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:28,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:28,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:28,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:28,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:28,921 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 08:17:28,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:28,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:17:28,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:28,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:17:28,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:17:28,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:17:28,922 INFO L87 Difference]: Start difference. First operand 75385 states and 101013 transitions. Second operand 5 states. [2019-09-10 08:17:30,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:30,614 INFO L93 Difference]: Finished difference Result 100829 states and 134759 transitions. [2019-09-10 08:17:30,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:17:30,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2019-09-10 08:17:30,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:30,703 INFO L225 Difference]: With dead ends: 100829 [2019-09-10 08:17:30,704 INFO L226 Difference]: Without dead ends: 100829 [2019-09-10 08:17:30,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:17:30,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100829 states. [2019-09-10 08:17:31,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100829 to 87705. [2019-09-10 08:17:31,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87705 states. [2019-09-10 08:17:31,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87705 states to 87705 states and 117557 transitions. [2019-09-10 08:17:31,434 INFO L78 Accepts]: Start accepts. Automaton has 87705 states and 117557 transitions. Word has length 183 [2019-09-10 08:17:31,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:31,434 INFO L475 AbstractCegarLoop]: Abstraction has 87705 states and 117557 transitions. [2019-09-10 08:17:31,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:17:31,434 INFO L276 IsEmpty]: Start isEmpty. Operand 87705 states and 117557 transitions. [2019-09-10 08:17:31,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 08:17:31,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:31,443 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:31,444 INFO L418 AbstractCegarLoop]: === Iteration 121 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:31,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:31,444 INFO L82 PathProgramCache]: Analyzing trace with hash -522243365, now seen corresponding path program 1 times [2019-09-10 08:17:31,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:31,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:31,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:31,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:31,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:31,874 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 08:17:31,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:31,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:17:31,875 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:31,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:17:31,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:17:31,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:17:31,876 INFO L87 Difference]: Start difference. First operand 87705 states and 117557 transitions. Second operand 5 states. [2019-09-10 08:17:32,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:32,149 INFO L93 Difference]: Finished difference Result 112573 states and 150487 transitions. [2019-09-10 08:17:32,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:17:32,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2019-09-10 08:17:32,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:32,253 INFO L225 Difference]: With dead ends: 112573 [2019-09-10 08:17:32,253 INFO L226 Difference]: Without dead ends: 112573 [2019-09-10 08:17:32,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:17:32,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112573 states. [2019-09-10 08:17:33,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112573 to 100025. [2019-09-10 08:17:33,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100025 states. [2019-09-10 08:17:33,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100025 states to 100025 states and 134101 transitions. [2019-09-10 08:17:33,615 INFO L78 Accepts]: Start accepts. Automaton has 100025 states and 134101 transitions. Word has length 183 [2019-09-10 08:17:33,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:33,615 INFO L475 AbstractCegarLoop]: Abstraction has 100025 states and 134101 transitions. [2019-09-10 08:17:33,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:17:33,615 INFO L276 IsEmpty]: Start isEmpty. Operand 100025 states and 134101 transitions. [2019-09-10 08:17:33,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 08:17:33,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:33,622 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:33,623 INFO L418 AbstractCegarLoop]: === Iteration 122 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:33,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:33,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1971680275, now seen corresponding path program 1 times [2019-09-10 08:17:33,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:33,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:33,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:33,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:33,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:33,745 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 08:17:33,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:33,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:17:33,746 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:33,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:17:33,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:17:33,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:17:33,747 INFO L87 Difference]: Start difference. First operand 100025 states and 134101 transitions. Second operand 5 states. [2019-09-10 08:17:34,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:34,042 INFO L93 Difference]: Finished difference Result 127053 states and 170055 transitions. [2019-09-10 08:17:34,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:17:34,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2019-09-10 08:17:34,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:34,151 INFO L225 Difference]: With dead ends: 127053 [2019-09-10 08:17:34,151 INFO L226 Difference]: Without dead ends: 127053 [2019-09-10 08:17:34,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:17:34,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127053 states. [2019-09-10 08:17:35,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127053 to 112345. [2019-09-10 08:17:35,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112345 states. [2019-09-10 08:17:35,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112345 states to 112345 states and 150645 transitions. [2019-09-10 08:17:35,510 INFO L78 Accepts]: Start accepts. Automaton has 112345 states and 150645 transitions. Word has length 183 [2019-09-10 08:17:35,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:35,510 INFO L475 AbstractCegarLoop]: Abstraction has 112345 states and 150645 transitions. [2019-09-10 08:17:35,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:17:35,510 INFO L276 IsEmpty]: Start isEmpty. Operand 112345 states and 150645 transitions. [2019-09-10 08:17:35,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 08:17:35,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:35,519 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:35,519 INFO L418 AbstractCegarLoop]: === Iteration 123 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:35,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:35,519 INFO L82 PathProgramCache]: Analyzing trace with hash 480140409, now seen corresponding path program 1 times [2019-09-10 08:17:35,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:35,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:35,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:35,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:35,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:35,699 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 08:17:35,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:35,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:17:35,700 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:35,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:17:35,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:17:35,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:17:35,700 INFO L87 Difference]: Start difference. First operand 112345 states and 150645 transitions. Second operand 8 states. [2019-09-10 08:17:37,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:37,306 INFO L93 Difference]: Finished difference Result 427853 states and 574203 transitions. [2019-09-10 08:17:37,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:17:37,307 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 183 [2019-09-10 08:17:37,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:37,768 INFO L225 Difference]: With dead ends: 427853 [2019-09-10 08:17:37,769 INFO L226 Difference]: Without dead ends: 427853 [2019-09-10 08:17:37,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:17:37,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427853 states. [2019-09-10 08:17:43,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427853 to 148793. [2019-09-10 08:17:43,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148793 states. [2019-09-10 08:17:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148793 states to 148793 states and 198997 transitions. [2019-09-10 08:17:43,522 INFO L78 Accepts]: Start accepts. Automaton has 148793 states and 198997 transitions. Word has length 183 [2019-09-10 08:17:43,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:43,522 INFO L475 AbstractCegarLoop]: Abstraction has 148793 states and 198997 transitions. [2019-09-10 08:17:43,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:17:43,523 INFO L276 IsEmpty]: Start isEmpty. Operand 148793 states and 198997 transitions. [2019-09-10 08:17:43,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:17:43,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:43,531 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:43,531 INFO L418 AbstractCegarLoop]: === Iteration 124 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:43,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:43,532 INFO L82 PathProgramCache]: Analyzing trace with hash -589585930, now seen corresponding path program 1 times [2019-09-10 08:17:43,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:43,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:43,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:43,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:43,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:44,229 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:44,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:17:44,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:17:44,231 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2019-09-10 08:17:44,233 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], [130], [133], [136], [140], [143], [146], [150], [153], [156], [160], [163], [166], [170], [173], [176], [180], [183], [186], [189], [193], [196], [199], [203], [205], [208], [211], [214], [217], [219], [221], [224], [227], [230], [232], [234], [237], [240], [243], [245], [247], [250], [253], [256], [258], [260], [263], [266], [269], [271], [273], [276], [286], [289], [293], [296], [299], [303], [305], [308], [311], [319], [321], [324], [332], [334], [337], [345], [347], [350], [358], [360], [363], [371], [373], [376], [384], [386], [388], [390], [393], [396], [400], [402], [404], [407], [408], [410], [412], [414], [419], [421], [424], [437], [439], [442], [445], [447], [462], [464], [467], [470], [472], [487], [489], [492], [495], [497], [512], [514], [517], [520], [522], [537], [539], [542], [545], [547], [562], [564], [567], [570], [572], [608], [4346], [4347], [4351], [4352], [4353] [2019-09-10 08:17:44,306 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:17:44,306 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:17:44,654 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:17:46,693 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:17:46,696 INFO L272 AbstractInterpreter]: Visited 171 different actions 1452 times. Merged at 65 different actions 1108 times. Widened at 30 different actions 216 times. Performed 5365 root evaluator evaluations with a maximum evaluation depth of 8. Performed 5365 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 176 fixpoints after 29 different actions. Largest state had 406 variables. [2019-09-10 08:17:46,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:46,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:17:46,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:17:46,702 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:17:46,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:46,739 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:17:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:47,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 2279 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 08:17:47,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:17:47,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:17:47,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:17:47,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:17:47,647 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:47,648 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:17:47,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:17:47,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:17:47,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:17:47,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:17:47,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:17:50,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:17:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:52,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:17:52,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2019-09-10 08:17:52,864 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:17:52,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:17:52,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:17:52,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2019-09-10 08:17:52,865 INFO L87 Difference]: Start difference. First operand 148793 states and 198997 transitions. Second operand 20 states. [2019-09-10 08:17:55,436 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 35 [2019-09-10 08:17:56,364 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2019-09-10 08:18:10,597 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 35 [2019-09-10 08:18:10,931 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2019-09-10 08:18:39,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:39,292 INFO L93 Difference]: Finished difference Result 2029721 states and 2657884 transitions. [2019-09-10 08:18:39,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 285 states. [2019-09-10 08:18:39,292 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 184 [2019-09-10 08:18:39,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:42,196 INFO L225 Difference]: With dead ends: 2029721 [2019-09-10 08:18:42,197 INFO L226 Difference]: Without dead ends: 2029721 [2019-09-10 08:18:42,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 661 GetRequests, 294 SyntacticMatches, 57 SemanticMatches, 310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41412 ImplicationChecksByTransitivity, 29.9s TimeCoverageRelationStatistics Valid=11722, Invalid=85310, Unknown=0, NotChecked=0, Total=97032 [2019-09-10 08:18:43,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029721 states. [2019-09-10 08:19:03,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029721 to 530496. [2019-09-10 08:19:03,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530496 states. [2019-09-10 08:19:04,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530496 states to 530496 states and 703012 transitions. [2019-09-10 08:19:04,747 INFO L78 Accepts]: Start accepts. Automaton has 530496 states and 703012 transitions. Word has length 184 [2019-09-10 08:19:04,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:04,747 INFO L475 AbstractCegarLoop]: Abstraction has 530496 states and 703012 transitions. [2019-09-10 08:19:04,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:19:04,747 INFO L276 IsEmpty]: Start isEmpty. Operand 530496 states and 703012 transitions. [2019-09-10 08:19:04,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 08:19:04,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:04,824 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:04,825 INFO L418 AbstractCegarLoop]: === Iteration 125 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:04,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:04,825 INFO L82 PathProgramCache]: Analyzing trace with hash -764861400, now seen corresponding path program 1 times [2019-09-10 08:19:04,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:04,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:04,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:04,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:04,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:10,868 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 08:19:10,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:10,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:19:10,870 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:10,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:19:10,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:19:10,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:19:10,871 INFO L87 Difference]: Start difference. First operand 530496 states and 703012 transitions. Second operand 9 states. [2019-09-10 08:19:14,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:14,624 INFO L93 Difference]: Finished difference Result 1072723 states and 1417742 transitions. [2019-09-10 08:19:14,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:19:14,624 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 185 [2019-09-10 08:19:14,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:15,841 INFO L225 Difference]: With dead ends: 1072723 [2019-09-10 08:19:15,841 INFO L226 Difference]: Without dead ends: 1072723 [2019-09-10 08:19:15,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:19:16,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072723 states. [2019-09-10 08:19:30,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072723 to 530496. [2019-09-10 08:19:30,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530496 states. [2019-09-10 08:19:32,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530496 states to 530496 states and 703010 transitions. [2019-09-10 08:19:32,377 INFO L78 Accepts]: Start accepts. Automaton has 530496 states and 703010 transitions. Word has length 185 [2019-09-10 08:19:32,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:32,378 INFO L475 AbstractCegarLoop]: Abstraction has 530496 states and 703010 transitions. [2019-09-10 08:19:32,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:19:32,378 INFO L276 IsEmpty]: Start isEmpty. Operand 530496 states and 703010 transitions. [2019-09-10 08:19:32,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 08:19:32,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:32,408 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:32,409 INFO L418 AbstractCegarLoop]: === Iteration 126 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:32,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:32,409 INFO L82 PathProgramCache]: Analyzing trace with hash -503165955, now seen corresponding path program 1 times [2019-09-10 08:19:32,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:32,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:32,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:32,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:32,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:32,922 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:32,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:19:32,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:19:32,924 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 188 with the following transitions: [2019-09-10 08:19:32,926 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], [130], [133], [136], [140], [143], [146], [150], [153], [156], [160], [163], [166], [170], [173], [176], [180], [183], [186], [189], [193], [196], [199], [203], [205], [208], [211], [214], [217], [219], [221], [224], [227], [230], [232], [234], [237], [240], [243], [245], [247], [250], [253], [256], [258], [260], [263], [266], [269], [271], [273], [276], [279], [282], [284], [286], [289], [293], [296], [299], [303], [305], [308], [311], [319], [321], [324], [327], [332], [334], [337], [345], [347], [350], [353], [358], [360], [363], [371], [373], [376], [384], [386], [388], [390], [393], [400], [402], [404], [407], [408], [410], [412], [421], [424], [428], [437], [439], [442], [445], [447], [462], [464], [467], [470], [472], [480], [483], [489], [492], [495], [497], [512], [514], [517], [520], [522], [530], [533], [539], [542], [545], [547], [562], [564], [567], [570], [572], [4346], [4347], [4351], [4352], [4353] [2019-09-10 08:19:32,938 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:19:32,938 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:19:33,047 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:19:34,468 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:19:34,469 INFO L272 AbstractInterpreter]: Visited 175 different actions 1215 times. Merged at 67 different actions 915 times. Widened at 28 different actions 184 times. Performed 4634 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4634 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 104 fixpoints after 21 different actions. Largest state had 406 variables. [2019-09-10 08:19:34,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:34,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:19:34,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:19:34,469 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:19:34,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:34,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:19:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:40,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 2286 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-10 08:19:40,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:19:41,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:19:41,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:19:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:41,653 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:19:41,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:19:41,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:19:41,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:19:41,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:19:41,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:19:41,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:19:41,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:19:41,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:19:41,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:19:41,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:19:41,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:19:41,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:19:41,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:19:41,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:19:41,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:19:41,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:19:41,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:19:41,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:19:41,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:19:41,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:19:41,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:19:41,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:19:41,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:19:41,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:19:41,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:19:43,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:19:43,915 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:43,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:19:43,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2019-09-10 08:19:43,921 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:19:43,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:19:43,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:19:43,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:19:43,922 INFO L87 Difference]: Start difference. First operand 530496 states and 703010 transitions. Second operand 21 states. [2019-09-10 08:19:44,122 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 08:19:44,693 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 08:19:45,196 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-10 08:19:45,548 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-10 08:19:45,951 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-09-10 08:19:46,480 WARN L188 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-09-10 08:19:46,850 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-10 08:19:47,152 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-09-10 08:19:47,895 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-09-10 08:19:48,299 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-10 08:19:48,750 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2019-09-10 08:19:50,040 WARN L188 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2019-09-10 08:19:50,495 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-10 08:19:50,863 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-10 08:19:51,274 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 79 [2019-09-10 08:19:51,533 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-09-10 08:19:52,352 WARN L188 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 89 [2019-09-10 08:19:53,084 WARN L188 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 94 [2019-09-10 08:19:53,401 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-10 08:19:53,713 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-09-10 08:19:54,165 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-09-10 08:19:54,493 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2019-09-10 08:19:55,417 WARN L188 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 94 [2019-09-10 08:19:55,765 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2019-09-10 08:19:56,281 WARN L188 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-09-10 08:19:56,686 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 79 [2019-09-10 08:19:57,037 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2019-09-10 08:19:57,863 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-09-10 08:19:58,309 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-10 08:19:58,720 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-10 08:19:59,138 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 89 [2019-09-10 08:19:59,537 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2019-09-10 08:20:00,031 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 79 [2019-09-10 08:20:00,353 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-09-10 08:20:00,904 WARN L188 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 97 [2019-09-10 08:20:01,449 WARN L188 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2019-09-10 08:20:01,847 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-09-10 08:20:02,570 WARN L188 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2019-09-10 08:20:03,071 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-10 08:20:03,419 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-09-10 08:20:04,052 WARN L188 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 87 [2019-09-10 08:20:04,657 WARN L188 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 94 [2019-09-10 08:20:05,002 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 82 [2019-09-10 08:20:05,403 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 89 [2019-09-10 08:20:05,940 WARN L188 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 97 [2019-09-10 08:20:06,356 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 94 [2019-09-10 08:20:06,820 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 79 [2019-09-10 08:20:07,177 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 87 [2019-09-10 08:20:07,597 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-09-10 08:20:08,069 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2019-09-10 08:20:08,389 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2019-09-10 08:20:09,016 WARN L188 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 82 [2019-09-10 08:20:09,631 WARN L188 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 79 [2019-09-10 08:20:10,005 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-10 08:20:10,637 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-09-10 08:20:11,118 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2019-09-10 08:20:11,550 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-10 08:20:11,888 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-09-10 08:20:12,401 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2019-09-10 08:20:12,868 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2019-09-10 08:20:13,264 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 92 [2019-09-10 08:20:13,687 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 92 [2019-09-10 08:20:14,041 WARN L188 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-09-10 08:20:14,523 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 89 [2019-09-10 08:20:15,132 WARN L188 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 89 [2019-09-10 08:20:15,488 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 89 [2019-09-10 08:20:15,995 WARN L188 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-10 08:20:16,676 WARN L188 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-10 08:20:17,011 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-10 08:20:17,624 WARN L188 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-10 08:20:18,302 WARN L188 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2019-09-10 08:20:18,916 WARN L188 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2019-09-10 08:20:19,454 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 92 [2019-09-10 08:20:20,015 WARN L188 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 92 [2019-09-10 08:20:20,384 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-09-10 08:20:20,900 WARN L188 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 89 [2019-09-10 08:20:21,497 WARN L188 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 89 [2019-09-10 08:20:21,958 WARN L188 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 89 [2019-09-10 08:20:22,313 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-10 08:20:23,084 WARN L188 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2019-09-10 08:20:23,720 WARN L188 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2019-09-10 08:20:24,262 WARN L188 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 92 [2019-09-10 08:20:24,775 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 92 [2019-09-10 08:20:25,207 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 93 [2019-09-10 08:20:25,759 WARN L188 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 93 [2019-09-10 08:20:26,375 WARN L188 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 101 [2019-09-10 08:20:26,995 WARN L188 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 101 [2019-09-10 08:20:27,415 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-10 08:20:27,754 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-10 08:20:28,126 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 84 [2019-09-10 08:20:28,459 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-10 08:20:28,931 WARN L188 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 98 [2019-09-10 08:20:29,313 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 89 [2019-09-10 08:20:29,812 WARN L188 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 89 [2019-09-10 08:20:30,251 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 98 [2019-09-10 08:20:30,733 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 98 [2019-09-10 08:20:31,148 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 89 [2019-09-10 08:20:31,749 WARN L188 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 89 [2019-09-10 08:20:32,130 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 89 [2019-09-10 08:20:32,681 WARN L188 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 97 [2019-09-10 08:20:33,370 WARN L188 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 97 [2019-09-10 08:20:33,840 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-10 08:20:34,201 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-10 08:20:34,744 WARN L188 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 89 [2019-09-10 08:20:35,136 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 89 [2019-09-10 08:20:35,586 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 97 [2019-09-10 08:20:36,039 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 97 [2019-09-10 08:20:36,475 WARN L188 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-09-10 08:20:36,972 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-09-10 08:20:37,435 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-10 08:20:38,119 WARN L188 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2019-09-10 08:20:38,499 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2019-09-10 08:20:39,102 WARN L188 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 94 [2019-09-10 08:20:39,650 WARN L188 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 94 [2019-09-10 08:20:40,188 WARN L188 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 94 [2019-09-10 08:20:40,616 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 94 [2019-09-10 08:20:41,167 WARN L188 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 94 [2019-09-10 08:20:41,683 WARN L188 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2019-09-10 08:20:42,208 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-09-10 08:20:42,597 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-09-10 08:20:43,045 WARN L188 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 93 [2019-09-10 08:20:43,438 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2019-09-10 08:20:43,890 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 93 [2019-09-10 08:20:44,440 WARN L188 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2019-09-10 08:20:44,962 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 101 [2019-09-10 08:20:45,345 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 92 [2019-09-10 08:20:45,954 WARN L188 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 101 [2019-09-10 08:20:46,374 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 92 [2019-09-10 08:20:46,779 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-09-10 08:20:47,261 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-09-10 08:20:47,609 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-09-10 08:20:47,975 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 84 [2019-09-10 08:20:48,309 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-09-10 08:20:48,666 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-09-10 08:20:49,110 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 98 [2019-09-10 08:20:49,505 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 89 [2019-09-10 08:20:49,972 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 98 [2019-09-10 08:20:50,353 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 89 [2019-09-10 08:20:50,841 WARN L188 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 98 [2019-09-10 08:20:51,184 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 89 [2019-09-10 08:20:51,577 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 89 [2019-09-10 08:20:51,942 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-10 08:20:52,463 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2019-09-10 08:20:53,122 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 84 [2019-09-10 08:20:53,742 WARN L188 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 92 [2019-09-10 08:20:54,316 WARN L188 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 92 [2019-09-10 08:20:54,825 WARN L188 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-09-10 08:20:55,166 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-10 08:20:55,593 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-09-10 08:20:56,044 WARN L188 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-10 08:20:56,464 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-09-10 08:20:56,862 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2019-09-10 08:20:57,175 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-10 08:20:57,565 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 89 [2019-09-10 08:20:58,050 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 89 [2019-09-10 08:20:58,459 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 89 [2019-09-10 08:20:58,849 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-09-10 08:20:59,920 WARN L188 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-10 08:21:00,277 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-10 08:21:00,646 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-10 08:21:05,837 WARN L188 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 76 [2019-09-10 08:21:06,197 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 87 [2019-09-10 08:21:06,674 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 81 [2019-09-10 08:21:07,049 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 86 [2019-09-10 08:21:07,685 WARN L188 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 92 [2019-09-10 08:21:08,238 WARN L188 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 97 [2019-09-10 08:21:08,755 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 86 [2019-09-10 08:21:09,204 WARN L188 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2019-09-10 08:21:09,810 WARN L188 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2019-09-10 08:21:10,333 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 82 [2019-09-10 08:21:10,755 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 86 [2019-09-10 08:21:11,200 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 97 [2019-09-10 08:21:11,724 WARN L188 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 93 [2019-09-10 08:21:12,062 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 79 [2019-09-10 08:21:12,586 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 90 [2019-09-10 08:21:13,097 WARN L188 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 76 [2019-09-10 08:21:13,647 WARN L188 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 81 [2019-09-10 08:21:14,249 WARN L188 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 101 [2019-09-10 08:21:14,725 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 87 [2019-09-10 08:21:15,137 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 92 [2019-09-10 08:21:15,593 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 98 [2019-09-10 08:21:16,162 WARN L188 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2019-09-10 08:21:16,697 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 84 [2019-09-10 08:21:17,161 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-09-10 08:21:17,624 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 98 [2019-09-10 08:21:18,009 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2019-09-10 08:21:18,562 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 95 [2019-09-10 08:21:18,975 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-09-10 08:21:19,496 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 86 [2019-09-10 08:21:19,884 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 89 [2019-09-10 08:21:21,667 WARN L188 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-10 08:21:22,086 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 81 [2019-09-10 08:21:22,627 WARN L188 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 92 [2019-09-10 08:21:23,034 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-09-10 08:21:23,403 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-10 08:21:23,859 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2019-09-10 08:21:24,181 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-10 08:21:24,628 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 86 [2019-09-10 08:21:28,565 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2019-09-10 08:21:29,061 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-09-10 08:21:29,467 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-09-10 08:21:29,920 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 95 [2019-09-10 08:21:30,279 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-09-10 08:21:30,915 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-10 08:21:32,291 WARN L188 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-09-10 08:21:32,676 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2019-09-10 08:21:33,127 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2019-09-10 08:21:33,499 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-09-10 08:21:34,007 WARN L188 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2019-09-10 08:21:34,361 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2019-09-10 08:21:34,699 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-09-10 08:21:35,245 WARN L188 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-09-10 08:21:35,683 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 92 [2019-09-10 08:21:36,115 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 94 [2019-09-10 08:21:36,518 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-09-10 08:21:37,021 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-10 08:21:38,939 WARN L188 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-09-10 08:21:39,421 WARN L188 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-09-10 08:21:39,953 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2019-09-10 08:21:40,408 WARN L188 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-09-10 08:21:40,958 WARN L188 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 82 [2019-09-10 08:21:41,309 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-10 08:21:41,886 WARN L188 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 95 [2019-09-10 08:21:42,243 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-09-10 08:21:42,774 WARN L188 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-09-10 08:21:44,102 WARN L188 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-09-10 08:21:44,551 WARN L188 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-10 08:21:45,223 WARN L188 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-10 08:21:45,663 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-09-10 08:21:46,073 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 90 [2019-09-10 08:21:46,434 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-09-10 08:21:46,796 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-10 08:21:47,197 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2019-09-10 08:21:47,654 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 89 [2019-09-10 08:21:48,106 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 96 [2019-09-10 08:21:48,675 WARN L188 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 98 [2019-09-10 08:21:49,049 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2019-09-10 08:21:49,405 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 89 [2019-09-10 08:21:50,020 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 100 [2019-09-10 08:21:50,468 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2019-09-10 08:21:50,852 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-09-10 08:21:51,237 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-10 08:21:51,546 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 77 [2019-09-10 08:21:51,852 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-09-10 08:21:52,263 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2019-09-10 08:21:52,616 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-10 08:21:53,129 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2019-09-10 08:21:54,513 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 92 [2019-09-10 08:21:54,950 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 94 [2019-09-10 08:21:55,465 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 90 [2019-09-10 08:21:55,950 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-09-10 08:21:56,439 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 101 [2019-09-10 08:21:56,865 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 87 [2019-09-10 08:21:57,218 WARN L188 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2019-09-10 08:21:57,752 WARN L188 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 98 [2019-09-10 08:21:58,127 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-10 08:21:58,474 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-09-10 08:21:58,909 WARN L188 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-09-10 08:21:59,310 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-10 08:21:59,759 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 82 [2019-09-10 08:22:00,142 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-10 08:22:00,645 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 95 [2019-09-10 08:22:01,145 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2019-09-10 08:22:01,539 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 89 [2019-09-10 08:22:02,203 WARN L188 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 104 [2019-09-10 08:22:02,658 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 95 [2019-09-10 08:22:03,185 WARN L188 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 93 [2019-09-10 08:22:03,635 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 95 [2019-09-10 08:22:05,043 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 79 [2019-09-10 08:22:05,419 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-09-10 08:22:05,795 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-09-10 08:22:06,446 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 85 [2019-09-10 08:22:06,824 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-10 08:22:07,588 WARN L188 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 100 [2019-09-10 08:22:08,142 WARN L188 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2019-09-10 08:22:08,702 WARN L188 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 90 [2019-09-10 08:22:09,148 WARN L188 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 95 [2019-09-10 08:22:09,776 WARN L188 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 101 [2019-09-10 08:22:10,382 WARN L188 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-09-10 08:22:10,925 WARN L188 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 87 [2019-09-10 08:22:15,075 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2019-09-10 08:22:15,547 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2019-09-10 08:22:16,199 WARN L188 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2019-09-10 08:22:16,653 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2019-09-10 08:22:17,315 WARN L188 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-10 08:22:17,674 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-10 08:22:18,045 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-09-10 08:22:18,370 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-09-10 08:22:20,336 WARN L188 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2019-09-10 08:22:20,784 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 96 [2019-09-10 08:22:21,128 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 79 [2019-09-10 08:22:21,727 WARN L188 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 87 [2019-09-10 08:22:23,350 WARN L188 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2019-09-10 08:22:23,861 WARN L188 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2019-09-10 08:22:24,514 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2019-09-10 08:22:24,955 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 96 [2019-09-10 08:22:25,577 WARN L188 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 87 [2019-09-10 08:22:26,074 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-09-10 08:22:26,406 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-10 08:22:26,801 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2019-09-10 08:22:27,128 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 79 [2019-09-10 08:22:27,645 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2019-09-10 08:22:27,974 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2019-09-10 08:22:28,400 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2019-09-10 08:22:28,713 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-10 08:22:31,166 WARN L188 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 102 [2019-09-10 08:22:31,597 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 84 [2019-09-10 08:22:32,102 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-09-10 08:22:32,749 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 102 [2019-09-10 08:22:33,378 WARN L188 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2019-09-10 08:22:33,820 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 93