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.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:05:19,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:05:19,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:05:19,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:05:19,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:05:19,262 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:05:19,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:05:19,277 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:05:19,279 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:05:19,280 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:05:19,283 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:05:19,286 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:05:19,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:05:19,287 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:05:19,291 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:05:19,293 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:05:19,295 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:05:19,297 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:05:19,299 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:05:19,303 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:05:19,308 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:05:19,310 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:05:19,312 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:05:19,313 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:05:19,317 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:05:19,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:05:19,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:05:19,320 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:05:19,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:05:19,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:05:19,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:05:19,324 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:05:19,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:05:19,326 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:05:19,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:05:19,328 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:05:19,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:05:19,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:05:19,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:05:19,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:05:19,331 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:05:19,332 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:05:19,358 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:05:19,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:05:19,359 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:05:19,359 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:05:19,360 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:05:19,360 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:05:19,360 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:05:19,361 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:05:19,361 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:05:19,361 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:05:19,363 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:05:19,363 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:05:19,364 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:05:19,364 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:05:19,364 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:05:19,364 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:05:19,365 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:05:19,365 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:05:19,365 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:05:19,365 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:05:19,365 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:05:19,366 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:05:19,366 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:05:19,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:05:19,366 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:05:19,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:05:19,367 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:05:19,367 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:05:19,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:05:19,367 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:05:19,413 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:05:19,426 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:05:19,429 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:05:19,430 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:05:19,431 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:05:19,432 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:05:19,513 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/342e98a35/13352a00b64a4292beef13800d6a0cd8/FLAG36c5c4ce8 [2019-09-10 08:05:20,233 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:05:20,236 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:05:20,258 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/342e98a35/13352a00b64a4292beef13800d6a0cd8/FLAG36c5c4ce8 [2019-09-10 08:05:20,349 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/342e98a35/13352a00b64a4292beef13800d6a0cd8 [2019-09-10 08:05:20,359 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:05:20,361 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:05:20,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:05:20,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:05:20,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:05:20,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:05:20" (1/1) ... [2019-09-10 08:05:20,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@209d9765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:05:20, skipping insertion in model container [2019-09-10 08:05:20,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:05:20" (1/1) ... [2019-09-10 08:05:20,379 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:05:20,497 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:05:21,601 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:05:21,618 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:05:22,065 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:05:22,103 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:05:22,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:05:22 WrapperNode [2019-09-10 08:05:22,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:05:22,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:05:22,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:05:22,104 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:05:22,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:05:22" (1/1) ... [2019-09-10 08:05:22,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:05:22" (1/1) ... [2019-09-10 08:05:22,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:05:22" (1/1) ... [2019-09-10 08:05:22,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:05:22" (1/1) ... [2019-09-10 08:05:22,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:05:22" (1/1) ... [2019-09-10 08:05:22,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:05:22" (1/1) ... [2019-09-10 08:05:22,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:05:22" (1/1) ... [2019-09-10 08:05:22,338 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:05:22,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:05:22,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:05:22,340 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:05:22,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:05:22" (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:05:22,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:05:22,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:05:22,430 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:05:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:05:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:05:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:05:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:05:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:05:22,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:05:22,432 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:05:22,432 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:05:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:05:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:05:22,434 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:05:22,434 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:05:22,435 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:05:22,435 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:05:22,435 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:05:22,436 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:05:22,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:05:22,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:05:25,294 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:05:25,294 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:05:25,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:05:25 BoogieIcfgContainer [2019-09-10 08:05:25,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:05:25,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:05:25,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:05:25,300 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:05:25,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:05:20" (1/3) ... [2019-09-10 08:05:25,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2947bec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:05:25, skipping insertion in model container [2019-09-10 08:05:25,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:05:22" (2/3) ... [2019-09-10 08:05:25,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2947bec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:05:25, skipping insertion in model container [2019-09-10 08:05:25,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:05:25" (3/3) ... [2019-09-10 08:05:25,304 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:05:25,315 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:05:25,325 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-10 08:05:25,342 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-10 08:05:25,371 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:05:25,371 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:05:25,371 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:05:25,371 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:05:25,372 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:05:25,372 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:05:25,372 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:05:25,372 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:05:25,415 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states. [2019-09-10 08:05:25,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-10 08:05:25,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:25,461 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] [2019-09-10 08:05:25,463 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:25,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:25,469 INFO L82 PathProgramCache]: Analyzing trace with hash -753741321, now seen corresponding path program 1 times [2019-09-10 08:05:25,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:25,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:25,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:25,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:25,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:26,076 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:05:26,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:26,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:05:26,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:26,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:05:26,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:05:26,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:05:26,105 INFO L87 Difference]: Start difference. First operand 631 states. Second operand 5 states. [2019-09-10 08:05:26,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:26,879 INFO L93 Difference]: Finished difference Result 514 states and 870 transitions. [2019-09-10 08:05:26,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:05:26,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-10 08:05:26,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:26,915 INFO L225 Difference]: With dead ends: 514 [2019-09-10 08:05:26,916 INFO L226 Difference]: Without dead ends: 502 [2019-09-10 08:05:26,922 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:05:26,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-09-10 08:05:27,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2019-09-10 08:05:27,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-09-10 08:05:27,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 636 transitions. [2019-09-10 08:05:27,027 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 636 transitions. Word has length 75 [2019-09-10 08:05:27,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:27,028 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 636 transitions. [2019-09-10 08:05:27,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:05:27,028 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 636 transitions. [2019-09-10 08:05:27,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 08:05:27,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:27,032 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] [2019-09-10 08:05:27,032 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:27,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:27,033 INFO L82 PathProgramCache]: Analyzing trace with hash -4055452, now seen corresponding path program 1 times [2019-09-10 08:05:27,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:27,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:27,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:27,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:27,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:27,245 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:05:27,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:27,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:05:27,245 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:27,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:05:27,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:05:27,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:05:27,251 INFO L87 Difference]: Start difference. First operand 502 states and 636 transitions. Second operand 5 states. [2019-09-10 08:05:27,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:27,601 INFO L93 Difference]: Finished difference Result 441 states and 566 transitions. [2019-09-10 08:05:27,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:05:27,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-10 08:05:27,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:27,605 INFO L225 Difference]: With dead ends: 441 [2019-09-10 08:05:27,605 INFO L226 Difference]: Without dead ends: 441 [2019-09-10 08:05:27,606 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:05:27,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-09-10 08:05:27,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2019-09-10 08:05:27,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-09-10 08:05:27,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 566 transitions. [2019-09-10 08:05:27,623 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 566 transitions. Word has length 76 [2019-09-10 08:05:27,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:27,623 INFO L475 AbstractCegarLoop]: Abstraction has 441 states and 566 transitions. [2019-09-10 08:05:27,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:05:27,623 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 566 transitions. [2019-09-10 08:05:27,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 08:05:27,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:27,626 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:27,626 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:27,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:27,627 INFO L82 PathProgramCache]: Analyzing trace with hash 211673049, now seen corresponding path program 1 times [2019-09-10 08:05:27,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:27,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:27,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:27,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:27,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:27,743 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:05:27,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:27,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:05:27,744 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:27,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:05:27,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:05:27,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:05:27,745 INFO L87 Difference]: Start difference. First operand 441 states and 566 transitions. Second operand 5 states. [2019-09-10 08:05:28,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:28,141 INFO L93 Difference]: Finished difference Result 415 states and 535 transitions. [2019-09-10 08:05:28,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:05:28,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-10 08:05:28,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:28,144 INFO L225 Difference]: With dead ends: 415 [2019-09-10 08:05:28,145 INFO L226 Difference]: Without dead ends: 415 [2019-09-10 08:05:28,145 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:05:28,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-09-10 08:05:28,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2019-09-10 08:05:28,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-09-10 08:05:28,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 535 transitions. [2019-09-10 08:05:28,158 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 535 transitions. Word has length 77 [2019-09-10 08:05:28,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:28,159 INFO L475 AbstractCegarLoop]: Abstraction has 415 states and 535 transitions. [2019-09-10 08:05:28,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:05:28,159 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 535 transitions. [2019-09-10 08:05:28,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 08:05:28,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:28,162 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:28,162 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:28,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:28,163 INFO L82 PathProgramCache]: Analyzing trace with hash -11531761, now seen corresponding path program 1 times [2019-09-10 08:05:28,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:28,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:28,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:28,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:28,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:28,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:28,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:28,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:05:28,336 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:28,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:05:28,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:05:28,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:05:28,338 INFO L87 Difference]: Start difference. First operand 415 states and 535 transitions. Second operand 5 states. [2019-09-10 08:05:28,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:28,778 INFO L93 Difference]: Finished difference Result 405 states and 522 transitions. [2019-09-10 08:05:28,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:05:28,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-10 08:05:28,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:28,782 INFO L225 Difference]: With dead ends: 405 [2019-09-10 08:05:28,782 INFO L226 Difference]: Without dead ends: 405 [2019-09-10 08:05:28,782 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:05:28,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-09-10 08:05:28,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2019-09-10 08:05:28,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-10 08:05:28,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 522 transitions. [2019-09-10 08:05:28,792 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 522 transitions. Word has length 78 [2019-09-10 08:05:28,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:28,793 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 522 transitions. [2019-09-10 08:05:28,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:05:28,793 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 522 transitions. [2019-09-10 08:05:28,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 08:05:28,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:28,795 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:28,796 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:28,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:28,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1775015611, now seen corresponding path program 1 times [2019-09-10 08:05:28,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:28,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:28,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:28,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:28,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:28,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:05:28,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:28,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:05:28,894 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:28,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:05:28,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:05:28,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:05:28,895 INFO L87 Difference]: Start difference. First operand 405 states and 522 transitions. Second operand 5 states. [2019-09-10 08:05:29,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:29,233 INFO L93 Difference]: Finished difference Result 394 states and 509 transitions. [2019-09-10 08:05:29,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:05:29,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-09-10 08:05:29,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:29,237 INFO L225 Difference]: With dead ends: 394 [2019-09-10 08:05:29,237 INFO L226 Difference]: Without dead ends: 394 [2019-09-10 08:05:29,238 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:05:29,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-09-10 08:05:29,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2019-09-10 08:05:29,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:05:29,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 509 transitions. [2019-09-10 08:05:29,252 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 509 transitions. Word has length 79 [2019-09-10 08:05:29,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:29,253 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 509 transitions. [2019-09-10 08:05:29,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:05:29,253 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 509 transitions. [2019-09-10 08:05:29,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 08:05:29,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:29,256 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:29,257 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:29,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:29,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1857846520, now seen corresponding path program 1 times [2019-09-10 08:05:29,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:29,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:29,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:29,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:29,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:29,568 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:05:29,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:29,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:05:29,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:29,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:05:29,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:05:29,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:05:29,570 INFO L87 Difference]: Start difference. First operand 394 states and 509 transitions. Second operand 9 states. [2019-09-10 08:05:31,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:31,229 INFO L93 Difference]: Finished difference Result 735 states and 980 transitions. [2019-09-10 08:05:31,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:31,230 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-10 08:05:31,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:31,235 INFO L225 Difference]: With dead ends: 735 [2019-09-10 08:05:31,236 INFO L226 Difference]: Without dead ends: 735 [2019-09-10 08:05:31,236 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:05:31,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-09-10 08:05:31,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 394. [2019-09-10 08:05:31,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:05:31,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 508 transitions. [2019-09-10 08:05:31,249 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 508 transitions. Word has length 80 [2019-09-10 08:05:31,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:31,250 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 508 transitions. [2019-09-10 08:05:31,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:05:31,250 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 508 transitions. [2019-09-10 08:05:31,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 08:05:31,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:31,252 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:31,252 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:31,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:31,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1356435279, now seen corresponding path program 1 times [2019-09-10 08:05:31,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:31,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:31,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:31,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:31,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:31,423 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:05:31,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:31,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:05:31,424 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:31,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:05:31,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:05:31,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:05:31,425 INFO L87 Difference]: Start difference. First operand 394 states and 508 transitions. Second operand 9 states. [2019-09-10 08:05:32,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:32,694 INFO L93 Difference]: Finished difference Result 739 states and 983 transitions. [2019-09-10 08:05:32,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:32,695 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-10 08:05:32,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:32,700 INFO L225 Difference]: With dead ends: 739 [2019-09-10 08:05:32,701 INFO L226 Difference]: Without dead ends: 739 [2019-09-10 08:05:32,701 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:05:32,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-09-10 08:05:32,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 394. [2019-09-10 08:05:32,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:05:32,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 507 transitions. [2019-09-10 08:05:32,719 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 507 transitions. Word has length 80 [2019-09-10 08:05:32,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:32,720 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 507 transitions. [2019-09-10 08:05:32,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:05:32,720 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 507 transitions. [2019-09-10 08:05:32,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 08:05:32,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:32,723 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:32,724 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:32,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:32,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1849417194, now seen corresponding path program 1 times [2019-09-10 08:05:32,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:32,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:32,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:32,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:32,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:32,931 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:05:32,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:32,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:05:32,933 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:32,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:05:32,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:05:32,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:05:32,934 INFO L87 Difference]: Start difference. First operand 394 states and 507 transitions. Second operand 8 states. [2019-09-10 08:05:33,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:33,705 INFO L93 Difference]: Finished difference Result 546 states and 682 transitions. [2019-09-10 08:05:33,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:05:33,706 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2019-09-10 08:05:33,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:33,710 INFO L225 Difference]: With dead ends: 546 [2019-09-10 08:05:33,710 INFO L226 Difference]: Without dead ends: 546 [2019-09-10 08:05:33,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:05:33,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-09-10 08:05:33,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 394. [2019-09-10 08:05:33,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:05:33,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 506 transitions. [2019-09-10 08:05:33,726 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 506 transitions. Word has length 80 [2019-09-10 08:05:33,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:33,726 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 506 transitions. [2019-09-10 08:05:33,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:05:33,726 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 506 transitions. [2019-09-10 08:05:33,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 08:05:33,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:33,728 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:33,729 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:33,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:33,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1030150032, now seen corresponding path program 1 times [2019-09-10 08:05:33,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:33,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:33,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:33,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:33,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:33,927 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:05:33,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:33,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:05:33,928 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:33,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:05:33,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:05:33,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:05:33,929 INFO L87 Difference]: Start difference. First operand 394 states and 506 transitions. Second operand 9 states. [2019-09-10 08:05:35,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:35,480 INFO L93 Difference]: Finished difference Result 727 states and 960 transitions. [2019-09-10 08:05:35,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:35,481 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-10 08:05:35,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:35,486 INFO L225 Difference]: With dead ends: 727 [2019-09-10 08:05:35,487 INFO L226 Difference]: Without dead ends: 727 [2019-09-10 08:05:35,487 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:05:35,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-10 08:05:35,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2019-09-10 08:05:35,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:05:35,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 505 transitions. [2019-09-10 08:05:35,499 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 505 transitions. Word has length 82 [2019-09-10 08:05:35,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:35,499 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 505 transitions. [2019-09-10 08:05:35,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:05:35,499 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 505 transitions. [2019-09-10 08:05:35,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 08:05:35,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:35,501 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:35,501 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:35,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:35,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1206210007, now seen corresponding path program 1 times [2019-09-10 08:05:35,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:35,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:35,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:35,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:35,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:35,689 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:05:35,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:35,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:05:35,690 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:35,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:05:35,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:05:35,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:05:35,691 INFO L87 Difference]: Start difference. First operand 394 states and 505 transitions. Second operand 9 states. [2019-09-10 08:05:37,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:37,214 INFO L93 Difference]: Finished difference Result 735 states and 974 transitions. [2019-09-10 08:05:37,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:37,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-10 08:05:37,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:37,221 INFO L225 Difference]: With dead ends: 735 [2019-09-10 08:05:37,221 INFO L226 Difference]: Without dead ends: 735 [2019-09-10 08:05:37,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:05:37,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-09-10 08:05:37,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 394. [2019-09-10 08:05:37,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:05:37,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 504 transitions. [2019-09-10 08:05:37,233 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 504 transitions. Word has length 82 [2019-09-10 08:05:37,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:37,233 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 504 transitions. [2019-09-10 08:05:37,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:05:37,233 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 504 transitions. [2019-09-10 08:05:37,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 08:05:37,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:37,235 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:37,235 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:37,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:37,236 INFO L82 PathProgramCache]: Analyzing trace with hash -2075347116, now seen corresponding path program 1 times [2019-09-10 08:05:37,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:37,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:37,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:37,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:37,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:37,409 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:05:37,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:37,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:05:37,410 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:37,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:05:37,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:05:37,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:05:37,411 INFO L87 Difference]: Start difference. First operand 394 states and 504 transitions. Second operand 9 states. [2019-09-10 08:05:38,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:38,935 INFO L93 Difference]: Finished difference Result 727 states and 958 transitions. [2019-09-10 08:05:38,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:38,936 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-10 08:05:38,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:38,940 INFO L225 Difference]: With dead ends: 727 [2019-09-10 08:05:38,941 INFO L226 Difference]: Without dead ends: 727 [2019-09-10 08:05:38,942 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:05:38,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-10 08:05:38,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2019-09-10 08:05:38,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:05:38,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 503 transitions. [2019-09-10 08:05:38,953 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 503 transitions. Word has length 82 [2019-09-10 08:05:38,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:38,954 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 503 transitions. [2019-09-10 08:05:38,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:05:38,954 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 503 transitions. [2019-09-10 08:05:38,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 08:05:38,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:38,956 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:38,956 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:38,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:38,957 INFO L82 PathProgramCache]: Analyzing trace with hash -147519972, now seen corresponding path program 1 times [2019-09-10 08:05:38,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:38,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:38,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:38,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:38,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:39,108 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:05:39,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:39,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:05:39,109 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:39,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:05:39,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:05:39,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:05:39,110 INFO L87 Difference]: Start difference. First operand 394 states and 503 transitions. Second operand 9 states. [2019-09-10 08:05:40,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:40,640 INFO L93 Difference]: Finished difference Result 727 states and 956 transitions. [2019-09-10 08:05:40,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:40,640 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-10 08:05:40,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:40,644 INFO L225 Difference]: With dead ends: 727 [2019-09-10 08:05:40,644 INFO L226 Difference]: Without dead ends: 727 [2019-09-10 08:05:40,645 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:05:40,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-10 08:05:40,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2019-09-10 08:05:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:05:40,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 502 transitions. [2019-09-10 08:05:40,656 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 502 transitions. Word has length 82 [2019-09-10 08:05:40,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:40,656 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 502 transitions. [2019-09-10 08:05:40,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:05:40,657 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 502 transitions. [2019-09-10 08:05:40,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 08:05:40,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:40,658 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:40,659 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:40,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:40,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1924278388, now seen corresponding path program 1 times [2019-09-10 08:05:40,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:40,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:40,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:40,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:40,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:40,841 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:05:40,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:40,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:05:40,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:40,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:05:40,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:05:40,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:05:40,843 INFO L87 Difference]: Start difference. First operand 394 states and 502 transitions. Second operand 9 states. [2019-09-10 08:05:42,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:42,321 INFO L93 Difference]: Finished difference Result 727 states and 955 transitions. [2019-09-10 08:05:42,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:42,322 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-10 08:05:42,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:42,327 INFO L225 Difference]: With dead ends: 727 [2019-09-10 08:05:42,327 INFO L226 Difference]: Without dead ends: 727 [2019-09-10 08:05:42,328 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:05:42,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-10 08:05:42,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2019-09-10 08:05:42,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:05:42,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 501 transitions. [2019-09-10 08:05:42,337 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 501 transitions. Word has length 82 [2019-09-10 08:05:42,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:42,338 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 501 transitions. [2019-09-10 08:05:42,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:05:42,338 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 501 transitions. [2019-09-10 08:05:42,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 08:05:42,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:42,340 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:42,340 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:42,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:42,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1020669943, now seen corresponding path program 1 times [2019-09-10 08:05:42,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:42,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:42,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:42,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:42,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:42,484 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:05:42,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:42,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:05:42,485 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:42,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:05:42,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:05:42,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:05:42,486 INFO L87 Difference]: Start difference. First operand 394 states and 501 transitions. Second operand 9 states. [2019-09-10 08:05:44,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:44,119 INFO L93 Difference]: Finished difference Result 735 states and 970 transitions. [2019-09-10 08:05:44,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:44,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-10 08:05:44,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:44,124 INFO L225 Difference]: With dead ends: 735 [2019-09-10 08:05:44,124 INFO L226 Difference]: Without dead ends: 735 [2019-09-10 08:05:44,125 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:05:44,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-09-10 08:05:44,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 394. [2019-09-10 08:05:44,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:05:44,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 500 transitions. [2019-09-10 08:05:44,135 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 500 transitions. Word has length 82 [2019-09-10 08:05:44,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:44,135 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 500 transitions. [2019-09-10 08:05:44,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:05:44,135 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 500 transitions. [2019-09-10 08:05:44,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 08:05:44,137 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:44,137 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:44,137 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:44,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:44,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1567452331, now seen corresponding path program 1 times [2019-09-10 08:05:44,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:44,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:44,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:44,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:44,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:44,274 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:05:44,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:44,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:05:44,275 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:44,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:05:44,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:05:44,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:05:44,276 INFO L87 Difference]: Start difference. First operand 394 states and 500 transitions. Second operand 9 states. [2019-09-10 08:05:45,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:45,832 INFO L93 Difference]: Finished difference Result 739 states and 972 transitions. [2019-09-10 08:05:45,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:45,833 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-09-10 08:05:45,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:45,837 INFO L225 Difference]: With dead ends: 739 [2019-09-10 08:05:45,837 INFO L226 Difference]: Without dead ends: 739 [2019-09-10 08:05:45,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:05:45,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-09-10 08:05:45,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 394. [2019-09-10 08:05:45,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:05:45,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 499 transitions. [2019-09-10 08:05:45,848 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 499 transitions. Word has length 82 [2019-09-10 08:05:45,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:45,849 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 499 transitions. [2019-09-10 08:05:45,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:05:45,849 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 499 transitions. [2019-09-10 08:05:45,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 08:05:45,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:45,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] [2019-09-10 08:05:45,851 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:45,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:45,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1772826454, now seen corresponding path program 1 times [2019-09-10 08:05:45,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:45,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:45,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:45,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:45,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:45,999 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:05:45,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:45,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:05:46,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:46,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:05:46,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:05:46,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:05:46,001 INFO L87 Difference]: Start difference. First operand 394 states and 499 transitions. Second operand 9 states. [2019-09-10 08:05:47,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:47,507 INFO L93 Difference]: Finished difference Result 711 states and 925 transitions. [2019-09-10 08:05:47,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:47,508 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 08:05:47,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:47,511 INFO L225 Difference]: With dead ends: 711 [2019-09-10 08:05:47,511 INFO L226 Difference]: Without dead ends: 711 [2019-09-10 08:05:47,512 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:05:47,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-10 08:05:47,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-10 08:05:47,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:05:47,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 498 transitions. [2019-09-10 08:05:47,521 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 498 transitions. Word has length 84 [2019-09-10 08:05:47,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:47,521 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 498 transitions. [2019-09-10 08:05:47,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:05:47,522 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 498 transitions. [2019-09-10 08:05:47,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 08:05:47,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:47,523 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:47,524 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:47,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:47,524 INFO L82 PathProgramCache]: Analyzing trace with hash 156330058, now seen corresponding path program 1 times [2019-09-10 08:05:47,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:47,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:47,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:47,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:47,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:47,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:05:47,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:47,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:05:47,664 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:47,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:05:47,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:05:47,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:05:47,665 INFO L87 Difference]: Start difference. First operand 394 states and 498 transitions. Second operand 9 states. [2019-09-10 08:05:49,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:49,184 INFO L93 Difference]: Finished difference Result 727 states and 949 transitions. [2019-09-10 08:05:49,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:49,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 08:05:49,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:49,189 INFO L225 Difference]: With dead ends: 727 [2019-09-10 08:05:49,189 INFO L226 Difference]: Without dead ends: 727 [2019-09-10 08:05:49,190 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:05:49,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-10 08:05:49,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2019-09-10 08:05:49,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:05:49,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 497 transitions. [2019-09-10 08:05:49,200 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 497 transitions. Word has length 84 [2019-09-10 08:05:49,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:49,200 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 497 transitions. [2019-09-10 08:05:49,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:05:49,200 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 497 transitions. [2019-09-10 08:05:49,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 08:05:49,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:49,202 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:49,202 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:49,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:49,202 INFO L82 PathProgramCache]: Analyzing trace with hash -808913805, now seen corresponding path program 1 times [2019-09-10 08:05:49,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:49,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:49,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:49,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:49,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:49,343 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:05:49,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:49,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:05:49,344 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:49,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:05:49,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:05:49,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:05:49,345 INFO L87 Difference]: Start difference. First operand 394 states and 497 transitions. Second operand 9 states. [2019-09-10 08:05:50,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:50,877 INFO L93 Difference]: Finished difference Result 711 states and 923 transitions. [2019-09-10 08:05:50,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:50,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 08:05:50,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:50,880 INFO L225 Difference]: With dead ends: 711 [2019-09-10 08:05:50,880 INFO L226 Difference]: Without dead ends: 711 [2019-09-10 08:05:50,881 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:05:50,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-10 08:05:50,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-10 08:05:50,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:05:50,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 496 transitions. [2019-09-10 08:05:50,892 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 496 transitions. Word has length 84 [2019-09-10 08:05:50,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:50,892 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 496 transitions. [2019-09-10 08:05:50,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:05:50,893 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 496 transitions. [2019-09-10 08:05:50,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 08:05:50,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:50,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] [2019-09-10 08:05:50,895 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:50,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:50,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1360926238, now seen corresponding path program 1 times [2019-09-10 08:05:50,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:50,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:50,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:50,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:50,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:51,054 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:05:51,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:51,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:05:51,054 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:51,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:05:51,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:05:51,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:05:51,057 INFO L87 Difference]: Start difference. First operand 394 states and 496 transitions. Second operand 9 states. [2019-09-10 08:05:52,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:52,579 INFO L93 Difference]: Finished difference Result 711 states and 921 transitions. [2019-09-10 08:05:52,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:52,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 08:05:52,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:52,584 INFO L225 Difference]: With dead ends: 711 [2019-09-10 08:05:52,584 INFO L226 Difference]: Without dead ends: 711 [2019-09-10 08:05:52,584 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:05:52,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-10 08:05:52,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-10 08:05:52,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:05:52,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 495 transitions. [2019-09-10 08:05:52,598 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 495 transitions. Word has length 84 [2019-09-10 08:05:52,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:52,598 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 495 transitions. [2019-09-10 08:05:52,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:05:52,598 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 495 transitions. [2019-09-10 08:05:52,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 08:05:52,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:52,600 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:52,601 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:52,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:52,601 INFO L82 PathProgramCache]: Analyzing trace with hash -948259243, now seen corresponding path program 1 times [2019-09-10 08:05:52,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:52,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:52,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:52,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:52,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:52,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:05:52,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:52,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:05:52,756 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:52,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:05:52,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:05:52,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:05:52,757 INFO L87 Difference]: Start difference. First operand 394 states and 495 transitions. Second operand 9 states. [2019-09-10 08:05:54,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:54,214 INFO L93 Difference]: Finished difference Result 711 states and 919 transitions. [2019-09-10 08:05:54,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:54,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 08:05:54,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:54,220 INFO L225 Difference]: With dead ends: 711 [2019-09-10 08:05:54,220 INFO L226 Difference]: Without dead ends: 711 [2019-09-10 08:05:54,220 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:05:54,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-10 08:05:54,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-10 08:05:54,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:05:54,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 494 transitions. [2019-09-10 08:05:54,229 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 494 transitions. Word has length 84 [2019-09-10 08:05:54,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:54,229 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 494 transitions. [2019-09-10 08:05:54,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:05:54,229 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 494 transitions. [2019-09-10 08:05:54,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 08:05:54,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:54,231 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:54,231 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:54,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:54,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1254134787, now seen corresponding path program 1 times [2019-09-10 08:05:54,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:54,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:54,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:54,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:54,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:54,430 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:05:54,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:54,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:05:54,431 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:54,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:05:54,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:05:54,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:05:54,432 INFO L87 Difference]: Start difference. First operand 394 states and 494 transitions. Second operand 9 states. [2019-09-10 08:05:55,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:55,850 INFO L93 Difference]: Finished difference Result 711 states and 918 transitions. [2019-09-10 08:05:55,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:55,850 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 08:05:55,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:55,855 INFO L225 Difference]: With dead ends: 711 [2019-09-10 08:05:55,855 INFO L226 Difference]: Without dead ends: 711 [2019-09-10 08:05:55,855 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:05:55,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-10 08:05:55,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-10 08:05:55,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:05:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 493 transitions. [2019-09-10 08:05:55,862 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 493 transitions. Word has length 84 [2019-09-10 08:05:55,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:55,862 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 493 transitions. [2019-09-10 08:05:55,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:05:55,863 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 493 transitions. [2019-09-10 08:05:55,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 08:05:55,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:55,864 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:55,865 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:55,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:55,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1128458993, now seen corresponding path program 1 times [2019-09-10 08:05:55,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:55,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:55,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:55,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:55,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:56,003 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:05:56,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:56,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:05:56,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:56,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:05:56,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:05:56,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:05:56,005 INFO L87 Difference]: Start difference. First operand 394 states and 493 transitions. Second operand 9 states. [2019-09-10 08:05:57,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:57,372 INFO L93 Difference]: Finished difference Result 711 states and 917 transitions. [2019-09-10 08:05:57,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:57,374 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 08:05:57,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:57,377 INFO L225 Difference]: With dead ends: 711 [2019-09-10 08:05:57,377 INFO L226 Difference]: Without dead ends: 711 [2019-09-10 08:05:57,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:05:57,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-10 08:05:57,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-10 08:05:57,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:05:57,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 492 transitions. [2019-09-10 08:05:57,385 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 492 transitions. Word has length 84 [2019-09-10 08:05:57,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:57,385 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 492 transitions. [2019-09-10 08:05:57,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:05:57,385 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 492 transitions. [2019-09-10 08:05:57,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 08:05:57,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:57,387 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:57,387 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:57,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:57,388 INFO L82 PathProgramCache]: Analyzing trace with hash -145040535, now seen corresponding path program 1 times [2019-09-10 08:05:57,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:57,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:57,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:57,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:57,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:57,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:05:57,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:57,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:05:57,523 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:57,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:05:57,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:05:57,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:05:57,524 INFO L87 Difference]: Start difference. First operand 394 states and 492 transitions. Second operand 9 states. [2019-09-10 08:05:58,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:05:58,994 INFO L93 Difference]: Finished difference Result 711 states and 915 transitions. [2019-09-10 08:05:58,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:05:58,994 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 08:05:58,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:05:58,997 INFO L225 Difference]: With dead ends: 711 [2019-09-10 08:05:58,997 INFO L226 Difference]: Without dead ends: 711 [2019-09-10 08:05:58,998 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:05:58,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-10 08:05:59,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-10 08:05:59,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:05:59,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 491 transitions. [2019-09-10 08:05:59,005 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 491 transitions. Word has length 84 [2019-09-10 08:05:59,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:05:59,006 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 491 transitions. [2019-09-10 08:05:59,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:05:59,006 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 491 transitions. [2019-09-10 08:05:59,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 08:05:59,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:05:59,007 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:05:59,008 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:05:59,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:05:59,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1972694375, now seen corresponding path program 1 times [2019-09-10 08:05:59,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:05:59,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:59,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:05:59,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:05:59,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:05:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:05:59,145 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:05:59,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:05:59,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:05:59,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:05:59,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:05:59,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:05:59,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:05:59,147 INFO L87 Difference]: Start difference. First operand 394 states and 491 transitions. Second operand 9 states. [2019-09-10 08:06:00,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:00,467 INFO L93 Difference]: Finished difference Result 711 states and 914 transitions. [2019-09-10 08:06:00,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:00,468 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 08:06:00,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:00,472 INFO L225 Difference]: With dead ends: 711 [2019-09-10 08:06:00,472 INFO L226 Difference]: Without dead ends: 711 [2019-09-10 08:06:00,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:06:00,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-10 08:06:00,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-10 08:06:00,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:00,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 490 transitions. [2019-09-10 08:06:00,479 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 490 transitions. Word has length 84 [2019-09-10 08:06:00,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:00,479 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 490 transitions. [2019-09-10 08:06:00,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:00,480 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 490 transitions. [2019-09-10 08:06:00,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 08:06:00,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:00,481 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:00,482 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:00,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:00,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1587646214, now seen corresponding path program 1 times [2019-09-10 08:06:00,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:00,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:00,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:00,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:00,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:00,619 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:06:00,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:00,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:00,620 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:00,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:00,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:00,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:00,621 INFO L87 Difference]: Start difference. First operand 394 states and 490 transitions. Second operand 9 states. [2019-09-10 08:06:02,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:02,113 INFO L93 Difference]: Finished difference Result 727 states and 937 transitions. [2019-09-10 08:06:02,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:02,114 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 08:06:02,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:02,118 INFO L225 Difference]: With dead ends: 727 [2019-09-10 08:06:02,118 INFO L226 Difference]: Without dead ends: 727 [2019-09-10 08:06:02,119 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:06:02,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-10 08:06:02,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2019-09-10 08:06:02,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:02,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 489 transitions. [2019-09-10 08:06:02,126 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 489 transitions. Word has length 84 [2019-09-10 08:06:02,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:02,126 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 489 transitions. [2019-09-10 08:06:02,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:02,127 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 489 transitions. [2019-09-10 08:06:02,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 08:06:02,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:02,128 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:02,129 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:02,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:02,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1234023999, now seen corresponding path program 1 times [2019-09-10 08:06:02,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:02,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:02,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:02,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:02,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:02,263 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:06:02,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:02,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:02,264 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:02,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:02,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:02,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:02,265 INFO L87 Difference]: Start difference. First operand 394 states and 489 transitions. Second operand 9 states. [2019-09-10 08:06:03,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:03,642 INFO L93 Difference]: Finished difference Result 711 states and 912 transitions. [2019-09-10 08:06:03,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:03,643 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 08:06:03,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:03,646 INFO L225 Difference]: With dead ends: 711 [2019-09-10 08:06:03,646 INFO L226 Difference]: Without dead ends: 711 [2019-09-10 08:06:03,647 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:06:03,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-10 08:06:03,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-10 08:06:03,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:03,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 488 transitions. [2019-09-10 08:06:03,653 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 488 transitions. Word has length 84 [2019-09-10 08:06:03,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:03,653 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 488 transitions. [2019-09-10 08:06:03,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:03,653 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 488 transitions. [2019-09-10 08:06:03,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 08:06:03,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:03,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] [2019-09-10 08:06:03,655 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:03,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:03,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1787094233, now seen corresponding path program 1 times [2019-09-10 08:06:03,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:03,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:03,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:03,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:03,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:03,785 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:06:03,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:03,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:03,785 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:03,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:03,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:03,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:03,786 INFO L87 Difference]: Start difference. First operand 394 states and 488 transitions. Second operand 9 states. [2019-09-10 08:06:05,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:05,244 INFO L93 Difference]: Finished difference Result 711 states and 910 transitions. [2019-09-10 08:06:05,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:05,244 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 08:06:05,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:05,247 INFO L225 Difference]: With dead ends: 711 [2019-09-10 08:06:05,247 INFO L226 Difference]: Without dead ends: 711 [2019-09-10 08:06:05,248 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:06:05,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-10 08:06:05,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-10 08:06:05,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:05,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 487 transitions. [2019-09-10 08:06:05,254 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 487 transitions. Word has length 84 [2019-09-10 08:06:05,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:05,255 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 487 transitions. [2019-09-10 08:06:05,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:05,255 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 487 transitions. [2019-09-10 08:06:05,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 08:06:05,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:05,256 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:05,257 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:05,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:05,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1753371594, now seen corresponding path program 1 times [2019-09-10 08:06:05,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:05,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:05,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:05,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:05,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:05,393 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:06:05,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:05,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:05,393 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:05,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:05,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:05,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:05,394 INFO L87 Difference]: Start difference. First operand 394 states and 487 transitions. Second operand 9 states. [2019-09-10 08:06:06,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:06,674 INFO L93 Difference]: Finished difference Result 727 states and 934 transitions. [2019-09-10 08:06:06,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:06,675 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 08:06:06,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:06,679 INFO L225 Difference]: With dead ends: 727 [2019-09-10 08:06:06,679 INFO L226 Difference]: Without dead ends: 727 [2019-09-10 08:06:06,679 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:06:06,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2019-09-10 08:06:06,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 394. [2019-09-10 08:06:06,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:06,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 486 transitions. [2019-09-10 08:06:06,686 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 486 transitions. Word has length 84 [2019-09-10 08:06:06,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:06,686 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 486 transitions. [2019-09-10 08:06:06,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:06,686 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 486 transitions. [2019-09-10 08:06:06,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 08:06:06,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:06,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] [2019-09-10 08:06:06,688 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:06,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:06,688 INFO L82 PathProgramCache]: Analyzing trace with hash -175784918, now seen corresponding path program 1 times [2019-09-10 08:06:06,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:06,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:06,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:06,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:06,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:06,813 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:06:06,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:06,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:06,813 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:06,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:06,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:06,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:06,814 INFO L87 Difference]: Start difference. First operand 394 states and 486 transitions. Second operand 9 states. [2019-09-10 08:06:08,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:08,244 INFO L93 Difference]: Finished difference Result 711 states and 908 transitions. [2019-09-10 08:06:08,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:08,245 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 08:06:08,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:08,248 INFO L225 Difference]: With dead ends: 711 [2019-09-10 08:06:08,249 INFO L226 Difference]: Without dead ends: 711 [2019-09-10 08:06:08,249 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:06:08,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-09-10 08:06:08,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 394. [2019-09-10 08:06:08,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 485 transitions. [2019-09-10 08:06:08,255 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 485 transitions. Word has length 84 [2019-09-10 08:06:08,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:08,255 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 485 transitions. [2019-09-10 08:06:08,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:08,256 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 485 transitions. [2019-09-10 08:06:08,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 08:06:08,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:08,257 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:08,257 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:08,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:08,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1958628796, now seen corresponding path program 1 times [2019-09-10 08:06:08,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:08,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:08,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:08,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:08,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:08,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:06:08,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:08,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:08,387 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:08,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:08,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:08,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:08,388 INFO L87 Difference]: Start difference. First operand 394 states and 485 transitions. Second operand 9 states. [2019-09-10 08:06:09,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:09,957 INFO L93 Difference]: Finished difference Result 735 states and 947 transitions. [2019-09-10 08:06:09,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:09,957 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-09-10 08:06:09,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:09,961 INFO L225 Difference]: With dead ends: 735 [2019-09-10 08:06:09,961 INFO L226 Difference]: Without dead ends: 735 [2019-09-10 08:06:09,961 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:06:09,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-09-10 08:06:09,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 394. [2019-09-10 08:06:09,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-10 08:06:09,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 484 transitions. [2019-09-10 08:06:09,970 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 484 transitions. Word has length 84 [2019-09-10 08:06:09,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:09,970 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 484 transitions. [2019-09-10 08:06:09,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:09,970 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 484 transitions. [2019-09-10 08:06:09,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:06:09,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:09,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] [2019-09-10 08:06:09,972 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:09,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:09,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1126502043, now seen corresponding path program 1 times [2019-09-10 08:06:09,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:09,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:09,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:09,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:09,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:11,586 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:06:11,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:11,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-10 08:06:11,586 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:11,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-10 08:06:11,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-10 08:06:11,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:06:11,588 INFO L87 Difference]: Start difference. First operand 394 states and 484 transitions. Second operand 25 states. [2019-09-10 08:06:12,566 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-09-10 08:06:12,843 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2019-09-10 08:06:13,120 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 66 [2019-09-10 08:06:13,421 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 73 [2019-09-10 08:06:13,637 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-09-10 08:06:13,833 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-09-10 08:06:14,012 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-09-10 08:06:14,191 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-10 08:06:14,377 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-10 08:06:14,632 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-09-10 08:06:18,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:18,997 INFO L93 Difference]: Finished difference Result 793 states and 994 transitions. [2019-09-10 08:06:18,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:06:18,998 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 86 [2019-09-10 08:06:18,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:19,001 INFO L225 Difference]: With dead ends: 793 [2019-09-10 08:06:19,001 INFO L226 Difference]: Without dead ends: 793 [2019-09-10 08:06:19,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=415, Invalid=1391, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 08:06:19,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2019-09-10 08:06:19,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 405. [2019-09-10 08:06:19,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-10 08:06:19,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 496 transitions. [2019-09-10 08:06:19,010 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 496 transitions. Word has length 86 [2019-09-10 08:06:19,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:19,010 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 496 transitions. [2019-09-10 08:06:19,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-10 08:06:19,011 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 496 transitions. [2019-09-10 08:06:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:06:19,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:19,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] [2019-09-10 08:06:19,012 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:19,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:19,013 INFO L82 PathProgramCache]: Analyzing trace with hash 863263109, now seen corresponding path program 1 times [2019-09-10 08:06:19,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:19,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:19,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:19,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:19,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:19,574 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:06:19,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:19,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:06:19,574 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:19,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:06:19,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:06:19,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:06:19,576 INFO L87 Difference]: Start difference. First operand 405 states and 496 transitions. Second operand 15 states. [2019-09-10 08:06:21,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:21,479 INFO L93 Difference]: Finished difference Result 710 states and 905 transitions. [2019-09-10 08:06:21,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:06:21,480 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 86 [2019-09-10 08:06:21,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:21,483 INFO L225 Difference]: With dead ends: 710 [2019-09-10 08:06:21,483 INFO L226 Difference]: Without dead ends: 710 [2019-09-10 08:06:21,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:06:21,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-09-10 08:06:21,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 346. [2019-09-10 08:06:21,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-09-10 08:06:21,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 421 transitions. [2019-09-10 08:06:21,490 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 421 transitions. Word has length 86 [2019-09-10 08:06:21,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:21,490 INFO L475 AbstractCegarLoop]: Abstraction has 346 states and 421 transitions. [2019-09-10 08:06:21,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:06:21,491 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 421 transitions. [2019-09-10 08:06:21,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:06:21,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:21,492 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:21,492 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:21,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:21,492 INFO L82 PathProgramCache]: Analyzing trace with hash 679846051, now seen corresponding path program 1 times [2019-09-10 08:06:21,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:21,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:21,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:21,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:21,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:22,195 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:06:22,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:22,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:06:22,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:22,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:06:22,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:06:22,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:06:22,197 INFO L87 Difference]: Start difference. First operand 346 states and 421 transitions. Second operand 16 states. [2019-09-10 08:06:22,784 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-10 08:06:24,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:24,604 INFO L93 Difference]: Finished difference Result 641 states and 770 transitions. [2019-09-10 08:06:24,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:06:24,605 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2019-09-10 08:06:24,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:24,608 INFO L225 Difference]: With dead ends: 641 [2019-09-10 08:06:24,608 INFO L226 Difference]: Without dead ends: 641 [2019-09-10 08:06:24,609 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:06:24,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-09-10 08:06:24,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 368. [2019-09-10 08:06:24,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-10 08:06:24,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 451 transitions. [2019-09-10 08:06:24,615 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 451 transitions. Word has length 86 [2019-09-10 08:06:24,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:24,615 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 451 transitions. [2019-09-10 08:06:24,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:06:24,615 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 451 transitions. [2019-09-10 08:06:24,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:06:24,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:24,616 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:24,617 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:24,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:24,617 INFO L82 PathProgramCache]: Analyzing trace with hash 2034960557, now seen corresponding path program 1 times [2019-09-10 08:06:24,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:24,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:24,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:24,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:24,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:25,488 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:06:25,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:25,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:06:25,489 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:25,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:06:25,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:06:25,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:06:25,491 INFO L87 Difference]: Start difference. First operand 368 states and 451 transitions. Second operand 17 states. [2019-09-10 08:06:26,121 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:06:27,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:27,719 INFO L93 Difference]: Finished difference Result 638 states and 820 transitions. [2019-09-10 08:06:27,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:06:27,720 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 86 [2019-09-10 08:06:27,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:27,722 INFO L225 Difference]: With dead ends: 638 [2019-09-10 08:06:27,722 INFO L226 Difference]: Without dead ends: 638 [2019-09-10 08:06:27,723 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:06:27,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-09-10 08:06:27,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 344. [2019-09-10 08:06:27,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-09-10 08:06:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 418 transitions. [2019-09-10 08:06:27,729 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 418 transitions. Word has length 86 [2019-09-10 08:06:27,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:27,729 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 418 transitions. [2019-09-10 08:06:27,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:06:27,730 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 418 transitions. [2019-09-10 08:06:27,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:06:27,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:27,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] [2019-09-10 08:06:27,731 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:27,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:27,731 INFO L82 PathProgramCache]: Analyzing trace with hash 327077445, now seen corresponding path program 1 times [2019-09-10 08:06:27,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:27,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:27,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:27,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:27,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:28,439 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:06:28,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:28,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:06:28,439 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:28,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:06:28,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:06:28,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:06:28,440 INFO L87 Difference]: Start difference. First operand 344 states and 418 transitions. Second operand 17 states. [2019-09-10 08:06:29,044 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:06:30,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:30,687 INFO L93 Difference]: Finished difference Result 632 states and 812 transitions. [2019-09-10 08:06:30,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:06:30,688 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 86 [2019-09-10 08:06:30,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:30,691 INFO L225 Difference]: With dead ends: 632 [2019-09-10 08:06:30,691 INFO L226 Difference]: Without dead ends: 632 [2019-09-10 08:06:30,692 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:06:30,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-09-10 08:06:30,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 333. [2019-09-10 08:06:30,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-09-10 08:06:30,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 403 transitions. [2019-09-10 08:06:30,699 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 403 transitions. Word has length 86 [2019-09-10 08:06:30,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:30,699 INFO L475 AbstractCegarLoop]: Abstraction has 333 states and 403 transitions. [2019-09-10 08:06:30,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:06:30,699 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 403 transitions. [2019-09-10 08:06:30,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 08:06:30,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:30,700 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:06:30,700 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:30,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:30,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1178808939, now seen corresponding path program 1 times [2019-09-10 08:06:30,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:30,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:30,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:30,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:30,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:32,591 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:06:32,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:32,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-10 08:06:32,591 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:32,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 08:06:32,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 08:06:32,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:06:32,592 INFO L87 Difference]: Start difference. First operand 333 states and 403 transitions. Second operand 26 states. [2019-09-10 08:06:33,708 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2019-09-10 08:06:33,928 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2019-09-10 08:06:34,209 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2019-09-10 08:06:34,598 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 88 [2019-09-10 08:06:34,824 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-10 08:06:35,038 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-09-10 08:06:35,276 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-09-10 08:06:37,632 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-10 08:06:38,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:38,603 INFO L93 Difference]: Finished difference Result 596 states and 721 transitions. [2019-09-10 08:06:38,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:06:38,604 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 86 [2019-09-10 08:06:38,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:38,607 INFO L225 Difference]: With dead ends: 596 [2019-09-10 08:06:38,607 INFO L226 Difference]: Without dead ends: 596 [2019-09-10 08:06:38,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=354, Invalid=1368, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 08:06:38,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-09-10 08:06:38,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 348. [2019-09-10 08:06:38,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-09-10 08:06:38,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 424 transitions. [2019-09-10 08:06:38,613 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 424 transitions. Word has length 86 [2019-09-10 08:06:38,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:38,613 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 424 transitions. [2019-09-10 08:06:38,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 08:06:38,613 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 424 transitions. [2019-09-10 08:06:38,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:06:38,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:38,614 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] [2019-09-10 08:06:38,615 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:38,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:38,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1246040559, now seen corresponding path program 1 times [2019-09-10 08:06:38,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:38,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:38,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:38,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:38,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:39,034 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:06:39,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:39,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:06:39,035 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:39,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:06:39,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:06:39,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:06:39,037 INFO L87 Difference]: Start difference. First operand 348 states and 424 transitions. Second operand 12 states. [2019-09-10 08:06:40,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:40,270 INFO L93 Difference]: Finished difference Result 494 states and 606 transitions. [2019-09-10 08:06:40,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:06:40,270 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2019-09-10 08:06:40,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:40,273 INFO L225 Difference]: With dead ends: 494 [2019-09-10 08:06:40,273 INFO L226 Difference]: Without dead ends: 494 [2019-09-10 08:06:40,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:06:40,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-09-10 08:06:40,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 344. [2019-09-10 08:06:40,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-09-10 08:06:40,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 419 transitions. [2019-09-10 08:06:40,279 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 419 transitions. Word has length 87 [2019-09-10 08:06:40,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:40,279 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 419 transitions. [2019-09-10 08:06:40,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:06:40,279 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 419 transitions. [2019-09-10 08:06:40,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:06:40,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:40,280 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] [2019-09-10 08:06:40,281 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:40,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:40,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1482173800, now seen corresponding path program 1 times [2019-09-10 08:06:40,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:40,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:40,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:40,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:40,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:40,992 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:06:40,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:40,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:06:40,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:40,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:06:40,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:06:40,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:06:40,994 INFO L87 Difference]: Start difference. First operand 344 states and 419 transitions. Second operand 17 states. [2019-09-10 08:06:41,558 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 08:06:43,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:43,379 INFO L93 Difference]: Finished difference Result 646 states and 827 transitions. [2019-09-10 08:06:43,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:06:43,379 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2019-09-10 08:06:43,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:43,382 INFO L225 Difference]: With dead ends: 646 [2019-09-10 08:06:43,382 INFO L226 Difference]: Without dead ends: 646 [2019-09-10 08:06:43,382 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:06:43,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-09-10 08:06:43,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 343. [2019-09-10 08:06:43,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-09-10 08:06:43,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 416 transitions. [2019-09-10 08:06:43,388 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 416 transitions. Word has length 87 [2019-09-10 08:06:43,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:43,388 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 416 transitions. [2019-09-10 08:06:43,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:06:43,388 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 416 transitions. [2019-09-10 08:06:43,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:06:43,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:43,389 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] [2019-09-10 08:06:43,389 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:43,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:43,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1059161585, now seen corresponding path program 1 times [2019-09-10 08:06:43,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:43,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:43,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:43,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:43,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:43,718 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:06:43,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:43,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:06:43,718 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:43,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:06:43,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:06:43,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:06:43,719 INFO L87 Difference]: Start difference. First operand 343 states and 416 transitions. Second operand 11 states. [2019-09-10 08:06:44,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:44,358 INFO L93 Difference]: Finished difference Result 738 states and 973 transitions. [2019-09-10 08:06:44,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:06:44,359 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2019-09-10 08:06:44,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:44,362 INFO L225 Difference]: With dead ends: 738 [2019-09-10 08:06:44,362 INFO L226 Difference]: Without dead ends: 738 [2019-09-10 08:06:44,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:06:44,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-09-10 08:06:44,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 319. [2019-09-10 08:06:44,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-09-10 08:06:44,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 385 transitions. [2019-09-10 08:06:44,369 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 385 transitions. Word has length 87 [2019-09-10 08:06:44,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:44,369 INFO L475 AbstractCegarLoop]: Abstraction has 319 states and 385 transitions. [2019-09-10 08:06:44,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:06:44,369 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 385 transitions. [2019-09-10 08:06:44,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:06:44,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:44,370 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] [2019-09-10 08:06:44,370 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:44,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:44,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1860216222, now seen corresponding path program 1 times [2019-09-10 08:06:44,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:44,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:44,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:44,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:44,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:44,798 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:06:44,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:44,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:06:44,799 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:44,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:06:44,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:06:44,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:06:44,800 INFO L87 Difference]: Start difference. First operand 319 states and 385 transitions. Second operand 12 states. [2019-09-10 08:06:45,243 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-10 08:06:45,378 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-10 08:06:45,575 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-09-10 08:06:46,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:46,183 INFO L93 Difference]: Finished difference Result 712 states and 938 transitions. [2019-09-10 08:06:46,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:06:46,183 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2019-09-10 08:06:46,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:46,186 INFO L225 Difference]: With dead ends: 712 [2019-09-10 08:06:46,187 INFO L226 Difference]: Without dead ends: 712 [2019-09-10 08:06:46,187 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:06:46,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-09-10 08:06:46,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 288. [2019-09-10 08:06:46,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-10 08:06:46,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 345 transitions. [2019-09-10 08:06:46,208 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 345 transitions. Word has length 87 [2019-09-10 08:06:46,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:46,209 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 345 transitions. [2019-09-10 08:06:46,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:06:46,209 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 345 transitions. [2019-09-10 08:06:46,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:06:46,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:46,210 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] [2019-09-10 08:06:46,210 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:46,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:46,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1944199773, now seen corresponding path program 1 times [2019-09-10 08:06:46,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:46,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:46,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:46,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:46,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:46,771 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:06:46,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:46,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:06:46,771 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:46,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:06:46,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:06:46,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:06:46,773 INFO L87 Difference]: Start difference. First operand 288 states and 345 transitions. Second operand 13 states. [2019-09-10 08:06:47,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:47,922 INFO L93 Difference]: Finished difference Result 614 states and 777 transitions. [2019-09-10 08:06:47,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:47,923 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 87 [2019-09-10 08:06:47,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:47,926 INFO L225 Difference]: With dead ends: 614 [2019-09-10 08:06:47,927 INFO L226 Difference]: Without dead ends: 614 [2019-09-10 08:06:47,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:06:47,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-10 08:06:47,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 277. [2019-09-10 08:06:47,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-09-10 08:06:47,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 331 transitions. [2019-09-10 08:06:47,933 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 331 transitions. Word has length 87 [2019-09-10 08:06:47,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:47,933 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 331 transitions. [2019-09-10 08:06:47,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:06:47,933 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 331 transitions. [2019-09-10 08:06:47,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:06:47,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:47,934 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] [2019-09-10 08:06:47,935 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:47,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:47,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1585662154, now seen corresponding path program 1 times [2019-09-10 08:06:47,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:47,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:47,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:47,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:47,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:48,310 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:06:48,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:48,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:06:48,311 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:48,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:06:48,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:06:48,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:06:48,311 INFO L87 Difference]: Start difference. First operand 277 states and 331 transitions. Second operand 12 states. [2019-09-10 08:06:49,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:49,564 INFO L93 Difference]: Finished difference Result 814 states and 1098 transitions. [2019-09-10 08:06:49,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:06:49,564 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2019-09-10 08:06:49,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:49,567 INFO L225 Difference]: With dead ends: 814 [2019-09-10 08:06:49,567 INFO L226 Difference]: Without dead ends: 814 [2019-09-10 08:06:49,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:06:49,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2019-09-10 08:06:49,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 255. [2019-09-10 08:06:49,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-10 08:06:49,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 306 transitions. [2019-09-10 08:06:49,573 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 306 transitions. Word has length 87 [2019-09-10 08:06:49,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:49,573 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 306 transitions. [2019-09-10 08:06:49,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:06:49,574 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 306 transitions. [2019-09-10 08:06:49,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 08:06:49,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:49,574 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] [2019-09-10 08:06:49,575 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:49,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:49,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1736542280, now seen corresponding path program 1 times [2019-09-10 08:06:49,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:49,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:49,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:49,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:49,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:49,704 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:06:49,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:49,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:49,705 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:49,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:49,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:49,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:49,706 INFO L87 Difference]: Start difference. First operand 255 states and 306 transitions. Second operand 9 states. [2019-09-10 08:06:50,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:50,967 INFO L93 Difference]: Finished difference Result 506 states and 655 transitions. [2019-09-10 08:06:50,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:06:50,967 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-09-10 08:06:50,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:50,969 INFO L225 Difference]: With dead ends: 506 [2019-09-10 08:06:50,969 INFO L226 Difference]: Without dead ends: 506 [2019-09-10 08:06:50,969 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:06:50,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-09-10 08:06:50,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 255. [2019-09-10 08:06:50,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-10 08:06:50,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 305 transitions. [2019-09-10 08:06:50,974 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 305 transitions. Word has length 87 [2019-09-10 08:06:50,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:50,974 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 305 transitions. [2019-09-10 08:06:50,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:50,974 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 305 transitions. [2019-09-10 08:06:50,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 08:06:50,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:50,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] [2019-09-10 08:06:50,975 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:50,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:50,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1081579309, now seen corresponding path program 1 times [2019-09-10 08:06:50,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:50,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:50,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:50,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:50,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:51,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:06:51,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:51,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:51,134 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:51,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:51,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:51,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:51,135 INFO L87 Difference]: Start difference. First operand 255 states and 305 transitions. Second operand 9 states. [2019-09-10 08:06:51,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:51,839 INFO L93 Difference]: Finished difference Result 378 states and 463 transitions. [2019-09-10 08:06:51,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:06:51,839 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-10 08:06:51,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:51,840 INFO L225 Difference]: With dead ends: 378 [2019-09-10 08:06:51,840 INFO L226 Difference]: Without dead ends: 378 [2019-09-10 08:06:51,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:06:51,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-09-10 08:06:51,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 255. [2019-09-10 08:06:51,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-10 08:06:51,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 304 transitions. [2019-09-10 08:06:51,844 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 304 transitions. Word has length 88 [2019-09-10 08:06:51,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:51,845 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 304 transitions. [2019-09-10 08:06:51,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:51,845 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 304 transitions. [2019-09-10 08:06:51,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 08:06:51,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:51,846 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] [2019-09-10 08:06:51,846 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:51,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:51,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1026055433, now seen corresponding path program 1 times [2019-09-10 08:06:51,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:51,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:51,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:51,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:51,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:52,397 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:06:52,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:52,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 08:06:52,397 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:52,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 08:06:52,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 08:06:52,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:06:52,398 INFO L87 Difference]: Start difference. First operand 255 states and 304 transitions. Second operand 14 states. [2019-09-10 08:06:53,098 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 08:06:53,221 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 08:06:53,345 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-09-10 08:06:53,490 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 08:06:54,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:54,194 INFO L93 Difference]: Finished difference Result 387 states and 473 transitions. [2019-09-10 08:06:54,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:06:54,195 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 88 [2019-09-10 08:06:54,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:54,196 INFO L225 Difference]: With dead ends: 387 [2019-09-10 08:06:54,196 INFO L226 Difference]: Without dead ends: 384 [2019-09-10 08:06:54,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:06:54,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-09-10 08:06:54,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 245. [2019-09-10 08:06:54,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-09-10 08:06:54,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 293 transitions. [2019-09-10 08:06:54,200 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 293 transitions. Word has length 88 [2019-09-10 08:06:54,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:54,200 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 293 transitions. [2019-09-10 08:06:54,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 08:06:54,200 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 293 transitions. [2019-09-10 08:06:54,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 08:06:54,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:54,201 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] [2019-09-10 08:06:54,201 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:54,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:54,201 INFO L82 PathProgramCache]: Analyzing trace with hash 309584746, now seen corresponding path program 1 times [2019-09-10 08:06:54,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:54,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:54,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:54,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:54,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:54,950 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:06:54,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:54,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:06:54,951 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:54,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:06:54,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:06:54,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:06:54,952 INFO L87 Difference]: Start difference. First operand 245 states and 293 transitions. Second operand 16 states. [2019-09-10 08:06:55,912 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2019-09-10 08:06:56,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:56,985 INFO L93 Difference]: Finished difference Result 796 states and 1067 transitions. [2019-09-10 08:06:56,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:06:56,985 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 88 [2019-09-10 08:06:56,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:56,988 INFO L225 Difference]: With dead ends: 796 [2019-09-10 08:06:56,988 INFO L226 Difference]: Without dead ends: 796 [2019-09-10 08:06:56,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:06:56,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2019-09-10 08:06:56,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 225. [2019-09-10 08:06:56,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-10 08:06:56,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 269 transitions. [2019-09-10 08:06:56,995 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 269 transitions. Word has length 88 [2019-09-10 08:06:56,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:56,995 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 269 transitions. [2019-09-10 08:06:56,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:06:56,996 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 269 transitions. [2019-09-10 08:06:56,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 08:06:56,996 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:56,996 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] [2019-09-10 08:06:56,997 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:56,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:56,997 INFO L82 PathProgramCache]: Analyzing trace with hash -859860802, now seen corresponding path program 1 times [2019-09-10 08:06:56,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:56,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:56,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:56,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:56,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:57,211 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:06:57,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:57,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:06:57,211 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:57,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:06:57,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:06:57,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:06:57,212 INFO L87 Difference]: Start difference. First operand 225 states and 269 transitions. Second operand 9 states. [2019-09-10 08:06:58,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:06:58,032 INFO L93 Difference]: Finished difference Result 338 states and 414 transitions. [2019-09-10 08:06:58,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:06:58,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-10 08:06:58,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:06:58,034 INFO L225 Difference]: With dead ends: 338 [2019-09-10 08:06:58,035 INFO L226 Difference]: Without dead ends: 338 [2019-09-10 08:06:58,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:06:58,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-09-10 08:06:58,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 225. [2019-09-10 08:06:58,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-10 08:06:58,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 268 transitions. [2019-09-10 08:06:58,040 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 268 transitions. Word has length 88 [2019-09-10 08:06:58,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:06:58,040 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 268 transitions. [2019-09-10 08:06:58,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:06:58,040 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 268 transitions. [2019-09-10 08:06:58,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 08:06:58,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:06:58,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] [2019-09-10 08:06:58,041 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:06:58,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:06:58,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1443233902, now seen corresponding path program 1 times [2019-09-10 08:06:58,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:06:58,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:58,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:06:58,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:06:58,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:06:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:06:58,676 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:06:58,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:06:58,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:06:58,676 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:06:58,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:06:58,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:06:58,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:06:58,677 INFO L87 Difference]: Start difference. First operand 225 states and 268 transitions. Second operand 16 states. [2019-09-10 08:07:00,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:00,688 INFO L93 Difference]: Finished difference Result 642 states and 848 transitions. [2019-09-10 08:07:00,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:07:00,689 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2019-09-10 08:07:00,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:00,690 INFO L225 Difference]: With dead ends: 642 [2019-09-10 08:07:00,690 INFO L226 Difference]: Without dead ends: 642 [2019-09-10 08:07:00,691 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:07:00,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-09-10 08:07:00,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 243. [2019-09-10 08:07:00,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-09-10 08:07:00,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 290 transitions. [2019-09-10 08:07:00,696 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 290 transitions. Word has length 89 [2019-09-10 08:07:00,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:00,696 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 290 transitions. [2019-09-10 08:07:00,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:07:00,697 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 290 transitions. [2019-09-10 08:07:00,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 08:07:00,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:00,697 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:07:00,697 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:00,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:00,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1663669706, now seen corresponding path program 1 times [2019-09-10 08:07:00,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:00,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:00,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:00,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:00,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:02,295 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:07:02,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:02,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-10 08:07:02,296 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:02,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 08:07:02,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 08:07:02,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:07:02,297 INFO L87 Difference]: Start difference. First operand 243 states and 290 transitions. Second operand 28 states. [2019-09-10 08:07:02,488 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 08:07:03,234 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-10 08:07:03,456 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-10 08:07:03,811 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-10 08:07:04,130 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-09-10 08:07:04,522 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-09-10 08:07:04,971 WARN L188 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 77 [2019-09-10 08:07:05,217 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-09-10 08:07:05,455 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 08:07:05,696 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-09-10 08:07:06,034 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2019-09-10 08:07:06,261 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2019-09-10 08:07:06,502 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 08:07:06,761 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 08:07:07,031 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2019-09-10 08:07:12,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:12,831 INFO L93 Difference]: Finished difference Result 951 states and 1259 transitions. [2019-09-10 08:07:12,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 08:07:12,833 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 90 [2019-09-10 08:07:12,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:12,835 INFO L225 Difference]: With dead ends: 951 [2019-09-10 08:07:12,835 INFO L226 Difference]: Without dead ends: 951 [2019-09-10 08:07:12,837 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=545, Invalid=2211, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 08:07:12,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-09-10 08:07:12,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 253. [2019-09-10 08:07:12,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-09-10 08:07:12,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 301 transitions. [2019-09-10 08:07:12,848 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 301 transitions. Word has length 90 [2019-09-10 08:07:12,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:12,848 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 301 transitions. [2019-09-10 08:07:12,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 08:07:12,849 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 301 transitions. [2019-09-10 08:07:12,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 08:07:12,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:12,850 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:07:12,850 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:12,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:12,850 INFO L82 PathProgramCache]: Analyzing trace with hash -868794427, now seen corresponding path program 1 times [2019-09-10 08:07:12,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:12,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:12,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:12,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:12,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:13,316 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:07:13,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:13,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:07:13,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:13,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:07:13,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:07:13,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:07:13,318 INFO L87 Difference]: Start difference. First operand 253 states and 301 transitions. Second operand 12 states. [2019-09-10 08:07:13,842 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-10 08:07:13,989 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2019-09-10 08:07:14,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:14,874 INFO L93 Difference]: Finished difference Result 650 states and 855 transitions. [2019-09-10 08:07:14,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:07:14,875 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 90 [2019-09-10 08:07:14,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:14,877 INFO L225 Difference]: With dead ends: 650 [2019-09-10 08:07:14,877 INFO L226 Difference]: Without dead ends: 650 [2019-09-10 08:07:14,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:07:14,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-09-10 08:07:14,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 229. [2019-09-10 08:07:14,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-09-10 08:07:14,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 273 transitions. [2019-09-10 08:07:14,883 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 273 transitions. Word has length 90 [2019-09-10 08:07:14,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:14,884 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 273 transitions. [2019-09-10 08:07:14,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:07:14,884 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 273 transitions. [2019-09-10 08:07:14,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 08:07:14,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:14,885 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:07:14,885 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:14,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:14,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1820672010, now seen corresponding path program 1 times [2019-09-10 08:07:14,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:14,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:14,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:14,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:14,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:16,865 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:07:16,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:16,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-10 08:07:16,866 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:16,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 08:07:16,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 08:07:16,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:07:16,867 INFO L87 Difference]: Start difference. First operand 229 states and 273 transitions. Second operand 28 states. [2019-09-10 08:07:17,043 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 08:07:17,953 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:07:18,341 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 08:07:18,625 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-09-10 08:07:18,985 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-09-10 08:07:19,427 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 95 [2019-09-10 08:07:19,663 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:07:19,891 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 08:07:20,082 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-10 08:07:20,376 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-09-10 08:07:20,906 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-09-10 08:07:21,122 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-09-10 08:07:26,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:26,587 INFO L93 Difference]: Finished difference Result 854 states and 1126 transitions. [2019-09-10 08:07:26,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 08:07:26,588 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 90 [2019-09-10 08:07:26,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:26,589 INFO L225 Difference]: With dead ends: 854 [2019-09-10 08:07:26,589 INFO L226 Difference]: Without dead ends: 854 [2019-09-10 08:07:26,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=548, Invalid=2644, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 08:07:26,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-09-10 08:07:26,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 234. [2019-09-10 08:07:26,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-09-10 08:07:26,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 278 transitions. [2019-09-10 08:07:26,596 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 278 transitions. Word has length 90 [2019-09-10 08:07:26,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:26,596 INFO L475 AbstractCegarLoop]: Abstraction has 234 states and 278 transitions. [2019-09-10 08:07:26,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 08:07:26,596 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 278 transitions. [2019-09-10 08:07:26,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 08:07:26,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:26,597 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:07:26,598 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:26,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:26,598 INFO L82 PathProgramCache]: Analyzing trace with hash -2135673714, now seen corresponding path program 1 times [2019-09-10 08:07:26,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:26,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:26,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:26,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:26,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:27,111 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:07:27,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:27,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 08:07:27,112 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:27,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 08:07:27,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 08:07:27,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:07:27,113 INFO L87 Difference]: Start difference. First operand 234 states and 278 transitions. Second operand 14 states. [2019-09-10 08:07:27,789 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-10 08:07:28,169 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 08:07:28,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:28,735 INFO L93 Difference]: Finished difference Result 342 states and 418 transitions. [2019-09-10 08:07:28,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:07:28,736 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 91 [2019-09-10 08:07:28,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:28,737 INFO L225 Difference]: With dead ends: 342 [2019-09-10 08:07:28,737 INFO L226 Difference]: Without dead ends: 337 [2019-09-10 08:07:28,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2019-09-10 08:07:28,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-10 08:07:28,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 228. [2019-09-10 08:07:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-09-10 08:07:28,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 270 transitions. [2019-09-10 08:07:28,741 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 270 transitions. Word has length 91 [2019-09-10 08:07:28,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:28,742 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 270 transitions. [2019-09-10 08:07:28,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-10 08:07:28,742 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 270 transitions. [2019-09-10 08:07:28,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 08:07:28,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:28,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] [2019-09-10 08:07:28,743 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:28,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:28,743 INFO L82 PathProgramCache]: Analyzing trace with hash 890051108, now seen corresponding path program 1 times [2019-09-10 08:07:28,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:28,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:28,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:28,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:28,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:29,385 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:07:29,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:29,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:07:29,386 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:29,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:07:29,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:07:29,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:07:29,386 INFO L87 Difference]: Start difference. First operand 228 states and 270 transitions. Second operand 15 states. [2019-09-10 08:07:30,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:30,267 INFO L93 Difference]: Finished difference Result 325 states and 404 transitions. [2019-09-10 08:07:30,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:07:30,267 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 91 [2019-09-10 08:07:30,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:30,268 INFO L225 Difference]: With dead ends: 325 [2019-09-10 08:07:30,269 INFO L226 Difference]: Without dead ends: 299 [2019-09-10 08:07:30,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:07:30,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-09-10 08:07:30,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 194. [2019-09-10 08:07:30,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-10 08:07:30,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 234 transitions. [2019-09-10 08:07:30,273 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 234 transitions. Word has length 91 [2019-09-10 08:07:30,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:30,274 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 234 transitions. [2019-09-10 08:07:30,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:07:30,274 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 234 transitions. [2019-09-10 08:07:30,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 08:07:30,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:30,275 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:07:30,275 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:30,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:30,275 INFO L82 PathProgramCache]: Analyzing trace with hash -223927789, now seen corresponding path program 1 times [2019-09-10 08:07:30,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:30,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:30,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:30,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:30,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:31,047 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:07:31,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:31,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:07:31,047 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:31,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:07:31,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:07:31,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:07:31,048 INFO L87 Difference]: Start difference. First operand 194 states and 234 transitions. Second operand 16 states. [2019-09-10 08:07:32,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:32,859 INFO L93 Difference]: Finished difference Result 484 states and 656 transitions. [2019-09-10 08:07:32,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:07:32,863 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 91 [2019-09-10 08:07:32,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:32,864 INFO L225 Difference]: With dead ends: 484 [2019-09-10 08:07:32,865 INFO L226 Difference]: Without dead ends: 484 [2019-09-10 08:07:32,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:07:32,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-09-10 08:07:32,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 159. [2019-09-10 08:07:32,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-09-10 08:07:32,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 196 transitions. [2019-09-10 08:07:32,869 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 196 transitions. Word has length 91 [2019-09-10 08:07:32,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:32,870 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 196 transitions. [2019-09-10 08:07:32,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:07:32,870 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 196 transitions. [2019-09-10 08:07:32,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:07:32,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:32,871 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] [2019-09-10 08:07:32,871 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:32,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:32,871 INFO L82 PathProgramCache]: Analyzing trace with hash -432709058, now seen corresponding path program 1 times [2019-09-10 08:07:32,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:32,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:32,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:32,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:32,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:32,947 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:07:32,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:32,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:07:32,947 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:32,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:07:32,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:07:32,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:07:32,948 INFO L87 Difference]: Start difference. First operand 159 states and 196 transitions. Second operand 3 states. [2019-09-10 08:07:32,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:32,979 INFO L93 Difference]: Finished difference Result 219 states and 282 transitions. [2019-09-10 08:07:32,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:07:32,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-10 08:07:32,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:32,981 INFO L225 Difference]: With dead ends: 219 [2019-09-10 08:07:32,981 INFO L226 Difference]: Without dead ends: 219 [2019-09-10 08:07:32,981 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:07:32,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-10 08:07:32,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2019-09-10 08:07:32,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-09-10 08:07:32,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 281 transitions. [2019-09-10 08:07:32,986 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 281 transitions. Word has length 116 [2019-09-10 08:07:32,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:32,987 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 281 transitions. [2019-09-10 08:07:32,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:07:32,987 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 281 transitions. [2019-09-10 08:07:32,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:07:32,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:32,988 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] [2019-09-10 08:07:32,989 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:32,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:32,989 INFO L82 PathProgramCache]: Analyzing trace with hash -2103932360, now seen corresponding path program 1 times [2019-09-10 08:07:32,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:32,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:32,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:32,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:32,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:33,128 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:07:33,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:33,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:07:33,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:33,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:07:33,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:07:33,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:07:33,130 INFO L87 Difference]: Start difference. First operand 217 states and 281 transitions. Second operand 7 states. [2019-09-10 08:07:33,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:33,635 INFO L93 Difference]: Finished difference Result 715 states and 1005 transitions. [2019-09-10 08:07:33,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:07:33,635 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-09-10 08:07:33,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:33,637 INFO L225 Difference]: With dead ends: 715 [2019-09-10 08:07:33,637 INFO L226 Difference]: Without dead ends: 715 [2019-09-10 08:07:33,637 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:07:33,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-09-10 08:07:33,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 357. [2019-09-10 08:07:33,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-09-10 08:07:33,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 488 transitions. [2019-09-10 08:07:33,645 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 488 transitions. Word has length 118 [2019-09-10 08:07:33,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:33,645 INFO L475 AbstractCegarLoop]: Abstraction has 357 states and 488 transitions. [2019-09-10 08:07:33,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:07:33,645 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 488 transitions. [2019-09-10 08:07:33,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:07:33,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:33,646 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] [2019-09-10 08:07:33,647 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:33,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:33,647 INFO L82 PathProgramCache]: Analyzing trace with hash -792007490, now seen corresponding path program 1 times [2019-09-10 08:07:33,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:33,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:33,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:33,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:33,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:33,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:07:33,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:33,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:07:33,747 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:33,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:07:33,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:07:33,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:07:33,748 INFO L87 Difference]: Start difference. First operand 357 states and 488 transitions. Second operand 7 states. [2019-09-10 08:07:34,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:34,171 INFO L93 Difference]: Finished difference Result 1327 states and 1897 transitions. [2019-09-10 08:07:34,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:07:34,172 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-09-10 08:07:34,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:34,175 INFO L225 Difference]: With dead ends: 1327 [2019-09-10 08:07:34,175 INFO L226 Difference]: Without dead ends: 1327 [2019-09-10 08:07:34,175 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:07:34,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2019-09-10 08:07:34,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 657. [2019-09-10 08:07:34,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-09-10 08:07:34,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 930 transitions. [2019-09-10 08:07:34,188 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 930 transitions. Word has length 118 [2019-09-10 08:07:34,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:34,189 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 930 transitions. [2019-09-10 08:07:34,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:07:34,189 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 930 transitions. [2019-09-10 08:07:34,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:07:34,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:34,190 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] [2019-09-10 08:07:34,190 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:34,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:34,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1202645697, now seen corresponding path program 1 times [2019-09-10 08:07:34,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:34,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:34,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:34,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:34,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:34,277 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:07:34,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:34,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:07:34,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:34,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:07:34,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:07:34,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:07:34,279 INFO L87 Difference]: Start difference. First operand 657 states and 930 transitions. Second operand 3 states. [2019-09-10 08:07:34,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:34,324 INFO L93 Difference]: Finished difference Result 947 states and 1351 transitions. [2019-09-10 08:07:34,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:07:34,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-10 08:07:34,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:34,328 INFO L225 Difference]: With dead ends: 947 [2019-09-10 08:07:34,328 INFO L226 Difference]: Without dead ends: 947 [2019-09-10 08:07:34,329 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:07:34,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2019-09-10 08:07:34,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 945. [2019-09-10 08:07:34,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-09-10 08:07:34,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1350 transitions. [2019-09-10 08:07:34,353 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1350 transitions. Word has length 118 [2019-09-10 08:07:34,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:34,354 INFO L475 AbstractCegarLoop]: Abstraction has 945 states and 1350 transitions. [2019-09-10 08:07:34,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:07:34,354 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1350 transitions. [2019-09-10 08:07:34,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:07:34,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:34,356 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:07:34,356 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:34,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:34,356 INFO L82 PathProgramCache]: Analyzing trace with hash 492458048, now seen corresponding path program 1 times [2019-09-10 08:07:34,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:34,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:34,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:34,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:34,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:34,454 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:07:34,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:34,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:07:34,455 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:34,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:07:34,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:07:34,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:07:34,456 INFO L87 Difference]: Start difference. First operand 945 states and 1350 transitions. Second operand 3 states. [2019-09-10 08:07:34,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:34,490 INFO L93 Difference]: Finished difference Result 1375 states and 1951 transitions. [2019-09-10 08:07:34,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:07:34,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-10 08:07:34,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:34,494 INFO L225 Difference]: With dead ends: 1375 [2019-09-10 08:07:34,494 INFO L226 Difference]: Without dead ends: 1375 [2019-09-10 08:07:34,494 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:07:34,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2019-09-10 08:07:34,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1361. [2019-09-10 08:07:34,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1361 states. [2019-09-10 08:07:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1938 transitions. [2019-09-10 08:07:34,515 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1938 transitions. Word has length 118 [2019-09-10 08:07:34,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:34,515 INFO L475 AbstractCegarLoop]: Abstraction has 1361 states and 1938 transitions. [2019-09-10 08:07:34,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:07:34,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1938 transitions. [2019-09-10 08:07:34,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:07:34,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:34,517 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] [2019-09-10 08:07:34,517 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:34,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:34,517 INFO L82 PathProgramCache]: Analyzing trace with hash -208893878, now seen corresponding path program 1 times [2019-09-10 08:07:34,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:34,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:34,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:34,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:34,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:34,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:07:34,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:34,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:07:34,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:34,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:07:34,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:07:34,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:07:34,629 INFO L87 Difference]: Start difference. First operand 1361 states and 1938 transitions. Second operand 7 states. [2019-09-10 08:07:35,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:35,059 INFO L93 Difference]: Finished difference Result 5267 states and 7485 transitions. [2019-09-10 08:07:35,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:07:35,059 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-09-10 08:07:35,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:35,068 INFO L225 Difference]: With dead ends: 5267 [2019-09-10 08:07:35,068 INFO L226 Difference]: Without dead ends: 5267 [2019-09-10 08:07:35,069 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:07:35,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5267 states. [2019-09-10 08:07:35,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5267 to 2805. [2019-09-10 08:07:35,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2805 states. [2019-09-10 08:07:35,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2805 states to 2805 states and 4026 transitions. [2019-09-10 08:07:35,118 INFO L78 Accepts]: Start accepts. Automaton has 2805 states and 4026 transitions. Word has length 118 [2019-09-10 08:07:35,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:35,118 INFO L475 AbstractCegarLoop]: Abstraction has 2805 states and 4026 transitions. [2019-09-10 08:07:35,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:07:35,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2805 states and 4026 transitions. [2019-09-10 08:07:35,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 08:07:35,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:35,120 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] [2019-09-10 08:07:35,120 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:35,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:35,121 INFO L82 PathProgramCache]: Analyzing trace with hash 781686468, now seen corresponding path program 1 times [2019-09-10 08:07:35,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:35,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:35,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:35,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:35,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:35,217 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:07:35,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:35,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:07:35,218 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:35,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:07:35,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:07:35,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:07:35,218 INFO L87 Difference]: Start difference. First operand 2805 states and 4026 transitions. Second operand 7 states. [2019-09-10 08:07:35,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:35,596 INFO L93 Difference]: Finished difference Result 9235 states and 13173 transitions. [2019-09-10 08:07:35,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:07:35,596 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-09-10 08:07:35,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:35,611 INFO L225 Difference]: With dead ends: 9235 [2019-09-10 08:07:35,611 INFO L226 Difference]: Without dead ends: 9235 [2019-09-10 08:07:35,612 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:07:35,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9235 states. [2019-09-10 08:07:35,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9235 to 5873. [2019-09-10 08:07:35,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5873 states. [2019-09-10 08:07:35,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5873 states to 5873 states and 8454 transitions. [2019-09-10 08:07:35,723 INFO L78 Accepts]: Start accepts. Automaton has 5873 states and 8454 transitions. Word has length 118 [2019-09-10 08:07:35,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:35,723 INFO L475 AbstractCegarLoop]: Abstraction has 5873 states and 8454 transitions. [2019-09-10 08:07:35,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:07:35,723 INFO L276 IsEmpty]: Start isEmpty. Operand 5873 states and 8454 transitions. [2019-09-10 08:07:35,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:07:35,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:35,725 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] [2019-09-10 08:07:35,725 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:35,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:35,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1587754861, now seen corresponding path program 1 times [2019-09-10 08:07:35,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:35,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:35,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:35,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:35,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:35,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:35,781 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:07:35,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:35,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:07:35,782 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:35,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:07:35,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:07:35,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:07:35,784 INFO L87 Difference]: Start difference. First operand 5873 states and 8454 transitions. Second operand 3 states. [2019-09-10 08:07:35,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:35,824 INFO L93 Difference]: Finished difference Result 6467 states and 9255 transitions. [2019-09-10 08:07:35,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:07:35,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-09-10 08:07:35,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:35,836 INFO L225 Difference]: With dead ends: 6467 [2019-09-10 08:07:35,836 INFO L226 Difference]: Without dead ends: 6467 [2019-09-10 08:07:35,838 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:07:35,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6467 states. [2019-09-10 08:07:35,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6467 to 6417. [2019-09-10 08:07:35,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6417 states. [2019-09-10 08:07:35,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6417 states to 6417 states and 9198 transitions. [2019-09-10 08:07:35,909 INFO L78 Accepts]: Start accepts. Automaton has 6417 states and 9198 transitions. Word has length 119 [2019-09-10 08:07:35,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:35,909 INFO L475 AbstractCegarLoop]: Abstraction has 6417 states and 9198 transitions. [2019-09-10 08:07:35,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:07:35,909 INFO L276 IsEmpty]: Start isEmpty. Operand 6417 states and 9198 transitions. [2019-09-10 08:07:35,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:07:35,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:35,911 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] [2019-09-10 08:07:35,911 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:35,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:35,912 INFO L82 PathProgramCache]: Analyzing trace with hash 546629509, now seen corresponding path program 1 times [2019-09-10 08:07:35,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:35,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:35,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:35,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:35,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:36,004 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:07:36,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:36,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:07:36,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:36,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:07:36,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:07:36,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:07:36,013 INFO L87 Difference]: Start difference. First operand 6417 states and 9198 transitions. Second operand 7 states. [2019-09-10 08:07:36,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:36,347 INFO L93 Difference]: Finished difference Result 13463 states and 19081 transitions. [2019-09-10 08:07:36,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:07:36,347 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2019-09-10 08:07:36,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:36,371 INFO L225 Difference]: With dead ends: 13463 [2019-09-10 08:07:36,372 INFO L226 Difference]: Without dead ends: 13463 [2019-09-10 08:07:36,372 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:07:36,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13463 states. [2019-09-10 08:07:36,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13463 to 7585. [2019-09-10 08:07:36,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7585 states. [2019-09-10 08:07:36,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7585 states to 7585 states and 10742 transitions. [2019-09-10 08:07:36,488 INFO L78 Accepts]: Start accepts. Automaton has 7585 states and 10742 transitions. Word has length 119 [2019-09-10 08:07:36,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:36,488 INFO L475 AbstractCegarLoop]: Abstraction has 7585 states and 10742 transitions. [2019-09-10 08:07:36,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:07:36,488 INFO L276 IsEmpty]: Start isEmpty. Operand 7585 states and 10742 transitions. [2019-09-10 08:07:36,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-10 08:07:36,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:36,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:07:36,490 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:36,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:36,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1431856554, now seen corresponding path program 1 times [2019-09-10 08:07:36,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:36,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:36,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:36,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:36,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:36,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:07:36,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:36,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:07:36,611 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:36,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:07:36,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:07:36,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:07:36,613 INFO L87 Difference]: Start difference. First operand 7585 states and 10742 transitions. Second operand 6 states. [2019-09-10 08:07:36,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:36,721 INFO L93 Difference]: Finished difference Result 12087 states and 16804 transitions. [2019-09-10 08:07:36,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:07:36,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-09-10 08:07:36,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:36,746 INFO L225 Difference]: With dead ends: 12087 [2019-09-10 08:07:36,746 INFO L226 Difference]: Without dead ends: 12087 [2019-09-10 08:07:36,749 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:07:36,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12087 states. [2019-09-10 08:07:36,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12087 to 7681. [2019-09-10 08:07:36,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7681 states. [2019-09-10 08:07:36,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7681 states to 7681 states and 10806 transitions. [2019-09-10 08:07:36,873 INFO L78 Accepts]: Start accepts. Automaton has 7681 states and 10806 transitions. Word has length 119 [2019-09-10 08:07:36,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:36,873 INFO L475 AbstractCegarLoop]: Abstraction has 7681 states and 10806 transitions. [2019-09-10 08:07:36,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:07:36,874 INFO L276 IsEmpty]: Start isEmpty. Operand 7681 states and 10806 transitions. [2019-09-10 08:07:36,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 08:07:36,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:36,876 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] [2019-09-10 08:07:36,876 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:36,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:36,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1588867289, now seen corresponding path program 1 times [2019-09-10 08:07:36,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:36,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:36,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:36,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:36,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:36,956 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:07:36,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:36,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:07:36,957 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:36,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:07:36,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:07:36,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:07:36,958 INFO L87 Difference]: Start difference. First operand 7681 states and 10806 transitions. Second operand 3 states. [2019-09-10 08:07:37,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:37,001 INFO L93 Difference]: Finished difference Result 12275 states and 17223 transitions. [2019-09-10 08:07:37,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:07:37,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-10 08:07:37,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:37,019 INFO L225 Difference]: With dead ends: 12275 [2019-09-10 08:07:37,019 INFO L226 Difference]: Without dead ends: 12275 [2019-09-10 08:07:37,020 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:07:37,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12275 states. [2019-09-10 08:07:37,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12275 to 8929. [2019-09-10 08:07:37,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8929 states. [2019-09-10 08:07:37,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8929 states to 8929 states and 12586 transitions. [2019-09-10 08:07:37,209 INFO L78 Accepts]: Start accepts. Automaton has 8929 states and 12586 transitions. Word has length 120 [2019-09-10 08:07:37,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:37,210 INFO L475 AbstractCegarLoop]: Abstraction has 8929 states and 12586 transitions. [2019-09-10 08:07:37,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:07:37,210 INFO L276 IsEmpty]: Start isEmpty. Operand 8929 states and 12586 transitions. [2019-09-10 08:07:37,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-10 08:07:37,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:37,211 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] [2019-09-10 08:07:37,212 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:37,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:37,212 INFO L82 PathProgramCache]: Analyzing trace with hash 852693951, now seen corresponding path program 1 times [2019-09-10 08:07:37,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:37,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:37,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:37,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:37,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:37,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:07:37,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:37,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:07:37,286 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:37,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:07:37,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:07:37,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:07:37,287 INFO L87 Difference]: Start difference. First operand 8929 states and 12586 transitions. Second operand 3 states. [2019-09-10 08:07:37,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:37,321 INFO L93 Difference]: Finished difference Result 8511 states and 11915 transitions. [2019-09-10 08:07:37,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:07:37,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-10 08:07:37,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:37,336 INFO L225 Difference]: With dead ends: 8511 [2019-09-10 08:07:37,336 INFO L226 Difference]: Without dead ends: 8511 [2019-09-10 08:07:37,336 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:07:37,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8511 states. [2019-09-10 08:07:37,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8511 to 8509. [2019-09-10 08:07:37,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8509 states. [2019-09-10 08:07:37,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8509 states to 8509 states and 11914 transitions. [2019-09-10 08:07:37,439 INFO L78 Accepts]: Start accepts. Automaton has 8509 states and 11914 transitions. Word has length 121 [2019-09-10 08:07:37,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:37,439 INFO L475 AbstractCegarLoop]: Abstraction has 8509 states and 11914 transitions. [2019-09-10 08:07:37,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:07:37,439 INFO L276 IsEmpty]: Start isEmpty. Operand 8509 states and 11914 transitions. [2019-09-10 08:07:37,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 08:07:37,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:37,445 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:37,445 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:37,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:37,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1840940587, now seen corresponding path program 1 times [2019-09-10 08:07:37,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:37,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:37,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:37,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:37,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:37,535 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:07:37,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:37,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:07:37,535 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:37,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:07:37,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:07:37,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:07:37,536 INFO L87 Difference]: Start difference. First operand 8509 states and 11914 transitions. Second operand 3 states. [2019-09-10 08:07:37,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:37,575 INFO L93 Difference]: Finished difference Result 10475 states and 14463 transitions. [2019-09-10 08:07:37,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:07:37,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-09-10 08:07:37,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:37,589 INFO L225 Difference]: With dead ends: 10475 [2019-09-10 08:07:37,590 INFO L226 Difference]: Without dead ends: 10475 [2019-09-10 08:07:37,590 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:07:37,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10475 states. [2019-09-10 08:07:37,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10475 to 7789. [2019-09-10 08:07:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7789 states. [2019-09-10 08:07:37,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7789 states to 7789 states and 10762 transitions. [2019-09-10 08:07:37,691 INFO L78 Accepts]: Start accepts. Automaton has 7789 states and 10762 transitions. Word has length 149 [2019-09-10 08:07:37,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:37,692 INFO L475 AbstractCegarLoop]: Abstraction has 7789 states and 10762 transitions. [2019-09-10 08:07:37,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:07:37,692 INFO L276 IsEmpty]: Start isEmpty. Operand 7789 states and 10762 transitions. [2019-09-10 08:07:37,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-10 08:07:37,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:37,695 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:07:37,695 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:37,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:37,696 INFO L82 PathProgramCache]: Analyzing trace with hash -179680522, now seen corresponding path program 1 times [2019-09-10 08:07:37,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:37,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:37,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:37,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:37,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:37,788 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:07:37,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:37,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:07:37,788 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:37,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:07:37,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:07:37,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:07:37,789 INFO L87 Difference]: Start difference. First operand 7789 states and 10762 transitions. Second operand 3 states. [2019-09-10 08:07:37,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:37,826 INFO L93 Difference]: Finished difference Result 7161 states and 9713 transitions. [2019-09-10 08:07:37,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:07:37,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-10 08:07:37,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:37,837 INFO L225 Difference]: With dead ends: 7161 [2019-09-10 08:07:37,837 INFO L226 Difference]: Without dead ends: 7161 [2019-09-10 08:07:37,837 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:07:37,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7161 states. [2019-09-10 08:07:37,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7161 to 6979. [2019-09-10 08:07:37,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6979 states. [2019-09-10 08:07:37,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6979 states to 6979 states and 9502 transitions. [2019-09-10 08:07:37,914 INFO L78 Accepts]: Start accepts. Automaton has 6979 states and 9502 transitions. Word has length 150 [2019-09-10 08:07:37,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:37,914 INFO L475 AbstractCegarLoop]: Abstraction has 6979 states and 9502 transitions. [2019-09-10 08:07:37,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:07:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 6979 states and 9502 transitions. [2019-09-10 08:07:37,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 08:07:37,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:37,917 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:07:37,919 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:37,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:37,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1022567355, now seen corresponding path program 1 times [2019-09-10 08:07:37,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:37,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:37,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:37,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:37,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 08:07:38,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:38,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:07:38,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:38,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:07:38,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:07:38,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:07:38,037 INFO L87 Difference]: Start difference. First operand 6979 states and 9502 transitions. Second operand 5 states. [2019-09-10 08:07:38,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:38,153 INFO L93 Difference]: Finished difference Result 18799 states and 25574 transitions. [2019-09-10 08:07:38,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:07:38,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-09-10 08:07:38,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:38,169 INFO L225 Difference]: With dead ends: 18799 [2019-09-10 08:07:38,169 INFO L226 Difference]: Without dead ends: 18799 [2019-09-10 08:07:38,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:07:38,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18799 states. [2019-09-10 08:07:38,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18799 to 18217. [2019-09-10 08:07:38,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18217 states. [2019-09-10 08:07:38,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18217 states to 18217 states and 24782 transitions. [2019-09-10 08:07:38,324 INFO L78 Accepts]: Start accepts. Automaton has 18217 states and 24782 transitions. Word has length 151 [2019-09-10 08:07:38,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:38,324 INFO L475 AbstractCegarLoop]: Abstraction has 18217 states and 24782 transitions. [2019-09-10 08:07:38,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:07:38,324 INFO L276 IsEmpty]: Start isEmpty. Operand 18217 states and 24782 transitions. [2019-09-10 08:07:38,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 08:07:38,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:38,327 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] [2019-09-10 08:07:38,327 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:38,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:38,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1960475071, now seen corresponding path program 1 times [2019-09-10 08:07:38,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:38,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:38,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:38,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:38,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:38,900 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:07:38,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:38,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:07:38,901 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:38,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:07:38,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:07:38,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:07:38,902 INFO L87 Difference]: Start difference. First operand 18217 states and 24782 transitions. Second operand 3 states. [2019-09-10 08:07:38,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:38,965 INFO L93 Difference]: Finished difference Result 22075 states and 29543 transitions. [2019-09-10 08:07:38,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:07:38,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-09-10 08:07:38,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:38,991 INFO L225 Difference]: With dead ends: 22075 [2019-09-10 08:07:38,991 INFO L226 Difference]: Without dead ends: 22075 [2019-09-10 08:07:38,991 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:07:39,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22075 states. [2019-09-10 08:07:39,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22075 to 21033. [2019-09-10 08:07:39,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21033 states. [2019-09-10 08:07:39,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21033 states to 21033 states and 28294 transitions. [2019-09-10 08:07:39,243 INFO L78 Accepts]: Start accepts. Automaton has 21033 states and 28294 transitions. Word has length 151 [2019-09-10 08:07:39,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:39,244 INFO L475 AbstractCegarLoop]: Abstraction has 21033 states and 28294 transitions. [2019-09-10 08:07:39,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:07:39,244 INFO L276 IsEmpty]: Start isEmpty. Operand 21033 states and 28294 transitions. [2019-09-10 08:07:39,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-10 08:07:39,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:39,247 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] [2019-09-10 08:07:39,248 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:39,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:39,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1790644147, now seen corresponding path program 1 times [2019-09-10 08:07:39,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:39,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:39,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:39,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:39,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:39,332 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:07:39,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:39,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:07:39,333 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:39,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:07:39,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:07:39,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:07:39,334 INFO L87 Difference]: Start difference. First operand 21033 states and 28294 transitions. Second operand 3 states. [2019-09-10 08:07:39,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:39,401 INFO L93 Difference]: Finished difference Result 18343 states and 24115 transitions. [2019-09-10 08:07:39,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:07:39,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-09-10 08:07:39,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:39,426 INFO L225 Difference]: With dead ends: 18343 [2019-09-10 08:07:39,426 INFO L226 Difference]: Without dead ends: 18343 [2019-09-10 08:07:39,426 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:07:39,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18343 states. [2019-09-10 08:07:39,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18343 to 18201. [2019-09-10 08:07:39,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18201 states. [2019-09-10 08:07:39,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18201 states to 18201 states and 23946 transitions. [2019-09-10 08:07:39,637 INFO L78 Accepts]: Start accepts. Automaton has 18201 states and 23946 transitions. Word has length 152 [2019-09-10 08:07:39,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:39,637 INFO L475 AbstractCegarLoop]: Abstraction has 18201 states and 23946 transitions. [2019-09-10 08:07:39,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:07:39,637 INFO L276 IsEmpty]: Start isEmpty. Operand 18201 states and 23946 transitions. [2019-09-10 08:07:39,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 08:07:39,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:39,639 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:07:39,639 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:39,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:39,639 INFO L82 PathProgramCache]: Analyzing trace with hash -119430980, now seen corresponding path program 1 times [2019-09-10 08:07:39,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:39,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:39,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:39,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:39,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:39,756 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:07:39,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:39,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:07:39,756 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:39,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:07:39,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:07:39,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:07:39,757 INFO L87 Difference]: Start difference. First operand 18201 states and 23946 transitions. Second operand 5 states. [2019-09-10 08:07:39,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:39,883 INFO L93 Difference]: Finished difference Result 28633 states and 37580 transitions. [2019-09-10 08:07:39,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:07:39,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-09-10 08:07:39,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:39,908 INFO L225 Difference]: With dead ends: 28633 [2019-09-10 08:07:39,908 INFO L226 Difference]: Without dead ends: 28633 [2019-09-10 08:07:39,908 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:07:39,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28633 states. [2019-09-10 08:07:40,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28633 to 23041. [2019-09-10 08:07:40,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23041 states. [2019-09-10 08:07:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23041 states to 23041 states and 30346 transitions. [2019-09-10 08:07:40,196 INFO L78 Accepts]: Start accepts. Automaton has 23041 states and 30346 transitions. Word has length 153 [2019-09-10 08:07:40,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:40,197 INFO L475 AbstractCegarLoop]: Abstraction has 23041 states and 30346 transitions. [2019-09-10 08:07:40,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:07:40,197 INFO L276 IsEmpty]: Start isEmpty. Operand 23041 states and 30346 transitions. [2019-09-10 08:07:40,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 08:07:40,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:40,199 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:07:40,199 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:40,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:40,199 INFO L82 PathProgramCache]: Analyzing trace with hash 463682632, now seen corresponding path program 1 times [2019-09-10 08:07:40,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:40,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:40,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:40,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:40,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:40,483 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:07:40,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:07:40,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:07:40,484 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 154 with the following transitions: [2019-09-10 08:07:40,486 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], [100], [103], [106], [110], [113], [116], [120], [123], [126], [130], [133], [136], [140], [143], [146], [149], [153], [156], [159], [163], [165], [168], [172], [175], [178], [180], [182], [185], [188], [191], [193], [195], [198], [201], [204], [206], [208], [211], [214], [217], [219], [221], [224], [234], [237], [241], [244], [247], [251], [253], [256], [261], [269], [271], [274], [282], [284], [287], [295], [297], [300], [308], [310], [313], [316], [321], [323], [325], [328], [335], [337], [339], [342], [343], [345], [355], [358], [362], [364], [367], [373], [376], [379], [381], [396], [398], [401], [404], [406], [421], [423], [426], [429], [431], [446], [448], [451], [454], [456], [471], [473], [475], [478], [481], [483], [518], [2371], [2372], [2376], [2377], [2378] [2019-09-10 08:07:40,529 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:07:40,530 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:07:40,716 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:07:41,777 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:07:41,780 INFO L272 AbstractInterpreter]: Visited 144 different actions 766 times. Merged at 56 different actions 541 times. Widened at 23 different actions 94 times. Performed 2676 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2676 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 60 fixpoints after 17 different actions. Largest state had 268 variables. [2019-09-10 08:07:41,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:41,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:07:41,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:07:41,788 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:07:41,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:41,818 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:07:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:42,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 1514 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 08:07:42,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:07:42,301 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:07:42,302 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:07:42,468 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 08:07:42,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:07:42,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [12, 7] total 21 [2019-09-10 08:07:42,483 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:42,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:07:42,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:07:42,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:07:42,486 INFO L87 Difference]: Start difference. First operand 23041 states and 30346 transitions. Second operand 7 states. [2019-09-10 08:07:42,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:42,754 INFO L93 Difference]: Finished difference Result 57321 states and 75446 transitions. [2019-09-10 08:07:42,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:07:42,754 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 153 [2019-09-10 08:07:42,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:42,897 INFO L225 Difference]: With dead ends: 57321 [2019-09-10 08:07:42,898 INFO L226 Difference]: Without dead ends: 57321 [2019-09-10 08:07:42,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 297 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:07:42,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57321 states. [2019-09-10 08:07:43,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57321 to 27817. [2019-09-10 08:07:43,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27817 states. [2019-09-10 08:07:43,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27817 states to 27817 states and 36586 transitions. [2019-09-10 08:07:43,879 INFO L78 Accepts]: Start accepts. Automaton has 27817 states and 36586 transitions. Word has length 153 [2019-09-10 08:07:43,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:43,879 INFO L475 AbstractCegarLoop]: Abstraction has 27817 states and 36586 transitions. [2019-09-10 08:07:43,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:07:43,880 INFO L276 IsEmpty]: Start isEmpty. Operand 27817 states and 36586 transitions. [2019-09-10 08:07:43,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 08:07:43,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:43,886 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:07:43,886 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:43,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:43,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1454262978, now seen corresponding path program 1 times [2019-09-10 08:07:43,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:43,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:43,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:43,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:43,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:44,014 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:07:44,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:07:44,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:07:44,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:44,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:07:44,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:07:44,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:07:44,016 INFO L87 Difference]: Start difference. First operand 27817 states and 36586 transitions. Second operand 5 states. [2019-09-10 08:07:44,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:44,250 INFO L93 Difference]: Finished difference Result 37853 states and 49668 transitions. [2019-09-10 08:07:44,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:07:44,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-09-10 08:07:44,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:44,313 INFO L225 Difference]: With dead ends: 37853 [2019-09-10 08:07:44,313 INFO L226 Difference]: Without dead ends: 37853 [2019-09-10 08:07:44,313 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:07:44,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37853 states. [2019-09-10 08:07:44,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37853 to 32657. [2019-09-10 08:07:44,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32657 states. [2019-09-10 08:07:45,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32657 states to 32657 states and 42986 transitions. [2019-09-10 08:07:45,900 INFO L78 Accepts]: Start accepts. Automaton has 32657 states and 42986 transitions. Word has length 153 [2019-09-10 08:07:45,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:45,901 INFO L475 AbstractCegarLoop]: Abstraction has 32657 states and 42986 transitions. [2019-09-10 08:07:45,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:07:45,901 INFO L276 IsEmpty]: Start isEmpty. Operand 32657 states and 42986 transitions. [2019-09-10 08:07:45,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 08:07:45,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:45,907 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:07:45,907 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:45,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:45,908 INFO L82 PathProgramCache]: Analyzing trace with hash -995548368, now seen corresponding path program 1 times [2019-09-10 08:07:45,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:45,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:45,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:45,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:45,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:46,292 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:07:46,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:07:46,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:07:46,293 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 154 with the following transitions: [2019-09-10 08:07:46,296 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], [100], [103], [106], [110], [113], [116], [120], [123], [126], [130], [133], [136], [140], [143], [146], [149], [153], [156], [159], [163], [165], [168], [172], [175], [178], [180], [182], [185], [188], [191], [193], [195], [198], [201], [204], [206], [208], [211], [214], [217], [219], [221], [224], [234], [237], [241], [244], [247], [251], [253], [256], [261], [264], [269], [271], [274], [282], [284], [287], [295], [297], [300], [308], [310], [313], [321], [323], [325], [328], [335], [337], [339], [342], [343], [345], [355], [358], [362], [371], [373], [376], [379], [381], [396], [398], [401], [404], [406], [421], [423], [426], [429], [431], [446], [448], [451], [454], [456], [464], [467], [473], [475], [478], [481], [483], [518], [2371], [2372], [2376], [2377], [2378] [2019-09-10 08:07:46,311 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:07:46,311 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:07:46,384 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:07:47,256 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:07:47,258 INFO L272 AbstractInterpreter]: Visited 144 different actions 827 times. Merged at 56 different actions 594 times. Widened at 24 different actions 109 times. Performed 2969 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2969 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 73 fixpoints after 15 different actions. Largest state had 268 variables. [2019-09-10 08:07:47,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:47,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:07:47,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:07:47,259 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) [2019-09-10 08:07:47,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:47,291 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:07:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:47,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 1514 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 08:07:47,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:07:47,725 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:07:47,726 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:07:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:07:47,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:07:47,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [12, 7] total 21 [2019-09-10 08:07:47,900 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:07:47,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:07:47,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:07:47,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:07:47,901 INFO L87 Difference]: Start difference. First operand 32657 states and 42986 transitions. Second operand 7 states. [2019-09-10 08:07:48,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:07:48,209 INFO L93 Difference]: Finished difference Result 55331 states and 72775 transitions. [2019-09-10 08:07:48,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 08:07:48,209 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 153 [2019-09-10 08:07:48,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:07:48,289 INFO L225 Difference]: With dead ends: 55331 [2019-09-10 08:07:48,289 INFO L226 Difference]: Without dead ends: 55331 [2019-09-10 08:07:48,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 297 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:07:48,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55331 states. [2019-09-10 08:07:48,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55331 to 39789. [2019-09-10 08:07:48,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39789 states. [2019-09-10 08:07:49,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39789 states to 39789 states and 52266 transitions. [2019-09-10 08:07:49,031 INFO L78 Accepts]: Start accepts. Automaton has 39789 states and 52266 transitions. Word has length 153 [2019-09-10 08:07:49,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:07:49,031 INFO L475 AbstractCegarLoop]: Abstraction has 39789 states and 52266 transitions. [2019-09-10 08:07:49,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:07:49,031 INFO L276 IsEmpty]: Start isEmpty. Operand 39789 states and 52266 transitions. [2019-09-10 08:07:49,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-10 08:07:49,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:07:49,035 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:07:49,036 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:07:49,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:49,036 INFO L82 PathProgramCache]: Analyzing trace with hash 2143226076, now seen corresponding path program 1 times [2019-09-10 08:07:49,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:07:49,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:49,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:49,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:07:49,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:07:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:49,327 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:07:49,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:07:49,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:07:49,327 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 155 with the following transitions: [2019-09-10 08:07:49,328 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], [100], [103], [106], [110], [113], [116], [120], [123], [126], [130], [133], [136], [140], [143], [146], [149], [153], [156], [159], [163], [165], [168], [172], [175], [178], [180], [182], [185], [188], [191], [193], [195], [198], [201], [204], [206], [208], [211], [214], [217], [219], [221], [224], [234], [237], [241], [244], [247], [251], [253], [256], [261], [269], [271], [274], [282], [284], [287], [295], [297], [300], [308], [310], [313], [321], [323], [325], [328], [331], [335], [337], [339], [342], [343], [345], [348], [353], [355], [358], [371], [373], [376], [379], [381], [396], [398], [401], [404], [406], [421], [423], [426], [429], [431], [446], [448], [451], [454], [456], [471], [473], [475], [478], [481], [483], [518], [2371], [2372], [2376], [2377], [2378] [2019-09-10 08:07:49,332 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:07:49,333 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:07:49,378 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:07:49,968 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:07:49,969 INFO L272 AbstractInterpreter]: Visited 144 different actions 882 times. Merged at 55 different actions 637 times. Widened at 24 different actions 110 times. Performed 3080 root evaluator evaluations with a maximum evaluation depth of 7. Performed 3080 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 104 fixpoints after 19 different actions. Largest state had 268 variables. [2019-09-10 08:07:49,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:07:49,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:07:49,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:07:49,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:07:49,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:07:49,990 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:07:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:07:50,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 1513 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 08:07:50,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:07:50,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:50,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:50,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:50,693 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:07:50,694 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:07:50,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:50,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:50,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:50,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:50,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:54,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:07:54,764 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:07:54,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:07:54,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 30 [2019-09-10 08:07:54,779 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:07:54,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:07:54,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:07:54,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:07:54,780 INFO L87 Difference]: Start difference. First operand 39789 states and 52266 transitions. Second operand 21 states. [2019-09-10 08:07:57,511 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:07:57,763 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:07:58,619 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:07:58,921 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:07:59,394 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:07:59,533 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:07:59,678 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:07:59,930 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 08:08:00,075 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:08:00,602 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:08:00,746 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:08:00,916 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 08:08:01,067 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:08:01,537 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 08:08:01,749 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:08:02,942 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:08:03,567 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:08:04,215 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:08:04,407 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:08:04,552 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:08:04,709 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-10 08:08:04,889 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:08:05,226 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:08:05,380 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:08:05,925 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:08:06,122 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:08:06,296 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:08:06,452 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:08:06,627 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:08:06,784 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:08:07,053 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2019-09-10 08:08:07,488 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:08:07,660 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 08:08:07,835 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:08:08,715 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:08:08,885 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 08:08:09,098 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:08:09,300 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:08:09,469 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 08:08:09,639 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:08:09,803 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:08:09,961 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:08:10,279 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 08:08:10,442 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 08:08:11,263 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:08:11,426 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:08:11,617 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:08:11,959 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:08:12,165 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:08:12,643 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 08:08:12,779 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:08:12,945 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:08:13,749 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:08:14,293 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:08:14,449 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:08:15,722 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:08:18,958 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:08:19,151 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:08:19,358 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:08:19,549 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:08:19,848 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:08:20,322 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:08:20,768 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:08:20,990 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:08:21,173 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:08:21,661 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:08:21,855 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:08:22,081 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:08:22,284 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:08:22,521 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:08:22,871 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:08:23,038 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:08:23,200 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:08:23,409 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:08:23,619 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:08:23,782 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-09-10 08:08:23,964 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:08:24,253 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 08:08:24,515 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:08:24,700 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:08:24,912 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:08:25,077 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:08:25,251 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:08:25,453 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:08:25,819 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:08:25,970 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:08:26,119 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:08:26,293 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:08:26,793 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-09-10 08:08:26,979 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:08:27,212 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-09-10 08:08:27,422 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:08:27,737 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:08:27,897 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:08:28,086 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:08:28,257 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:08:28,448 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:08:28,811 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:08:29,037 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:08:29,269 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:08:29,432 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:08:29,590 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:08:29,773 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:08:30,085 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:08:30,392 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:08:30,570 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:08:30,881 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:08:31,054 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:08:31,290 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:08:31,478 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:08:31,653 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:08:31,822 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:08:32,034 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:08:32,225 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:08:32,919 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-09-10 08:08:33,234 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:08:33,368 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:08:33,722 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:08:33,951 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-10 08:08:34,116 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:08:34,305 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:08:34,471 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:08:34,808 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:08:34,993 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:08:35,171 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:08:35,323 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:08:35,485 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:08:35,650 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:08:35,830 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:08:35,991 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:08:36,155 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:08:36,346 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:08:36,503 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:08:37,233 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:08:37,588 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:08:37,756 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:08:37,921 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:08:38,244 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 08:08:38,664 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:08:39,002 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:08:39,331 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 08:08:40,743 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:08:41,093 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 08:08:41,259 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:08:41,603 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:08:42,523 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:08:42,828 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:08:43,165 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:08:43,338 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:08:44,377 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:08:44,773 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:08:44,976 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-09-10 08:08:45,195 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:08:45,523 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:08:45,825 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:08:46,427 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:08:46,956 WARN L188 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:08:47,274 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:08:47,454 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:08:47,783 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-10 08:08:47,976 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:08:48,169 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:08:48,479 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:08:48,664 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:08:49,032 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:08:50,714 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:08:50,879 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:08:51,194 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:08:51,378 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:08:51,900 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:08:52,303 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:08:53,102 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:08:53,242 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:08:53,449 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:08:53,655 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:08:53,823 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:08:54,137 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:08:54,303 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:08:54,777 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:08:54,979 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:08:55,464 WARN L188 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:08:55,673 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-10 08:08:55,860 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:08:56,147 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:08:56,311 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:08:56,611 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:08:56,837 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-10 08:08:57,053 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:08:57,236 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:08:57,573 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:08:57,873 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:08:58,083 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:08:58,339 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:08:58,803 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:08:59,087 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:08:59,281 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:08:59,470 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:08:59,811 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:09:00,193 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:09:00,681 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:09:00,892 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:09:01,083 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:09:01,233 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:09:01,437 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:09:01,623 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:09:01,934 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:09:02,102 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-10 08:09:02,269 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:09:02,619 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 08:09:02,800 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:09:02,968 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:09:03,131 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 50 [2019-09-10 08:09:03,810 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:09:04,032 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:09:04,787 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-10 08:09:04,946 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 08:09:05,475 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-09-10 08:09:05,697 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:09:05,910 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-09-10 08:09:06,093 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:09:06,661 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-10 08:09:06,961 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 64 [2019-09-10 08:09:07,157 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:09:08,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:09:08,320 INFO L93 Difference]: Finished difference Result 958423 states and 1240847 transitions. [2019-09-10 08:09:08,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 397 states. [2019-09-10 08:09:08,320 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 154 [2019-09-10 08:09:08,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:09:15,121 INFO L225 Difference]: With dead ends: 958423 [2019-09-10 08:09:15,122 INFO L226 Difference]: Without dead ends: 958423 [2019-09-10 08:09:15,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 714 GetRequests, 247 SyntacticMatches, 44 SemanticMatches, 423 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76520 ImplicationChecksByTransitivity, 64.0s TimeCoverageRelationStatistics Valid=21758, Invalid=158442, Unknown=0, NotChecked=0, Total=180200 [2019-09-10 08:09:15,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958423 states. [2019-09-10 08:09:21,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958423 to 195684. [2019-09-10 08:09:21,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195684 states. [2019-09-10 08:09:21,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195684 states to 195684 states and 255228 transitions. [2019-09-10 08:09:21,375 INFO L78 Accepts]: Start accepts. Automaton has 195684 states and 255228 transitions. Word has length 154 [2019-09-10 08:09:21,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:09:21,376 INFO L475 AbstractCegarLoop]: Abstraction has 195684 states and 255228 transitions. [2019-09-10 08:09:21,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:09:21,376 INFO L276 IsEmpty]: Start isEmpty. Operand 195684 states and 255228 transitions. [2019-09-10 08:09:21,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 08:09:21,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:09:21,390 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:09:21,390 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:09:21,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:09:21,391 INFO L82 PathProgramCache]: Analyzing trace with hash -514705104, now seen corresponding path program 1 times [2019-09-10 08:09:21,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:09:21,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:09:21,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:09:21,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:09:21,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:09:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:09:21,550 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 08:09:21,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:09:21,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:09:21,550 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:09:21,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:09:21,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:09:21,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:09:21,552 INFO L87 Difference]: Start difference. First operand 195684 states and 255228 transitions. Second operand 9 states. [2019-09-10 08:09:24,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:09:24,109 INFO L93 Difference]: Finished difference Result 396728 states and 515797 transitions. [2019-09-10 08:09:24,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:09:24,110 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 155 [2019-09-10 08:09:24,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:09:24,582 INFO L225 Difference]: With dead ends: 396728 [2019-09-10 08:09:24,582 INFO L226 Difference]: Without dead ends: 396728 [2019-09-10 08:09:24,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:09:24,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396728 states. [2019-09-10 08:09:32,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396728 to 195684. [2019-09-10 08:09:32,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195684 states. [2019-09-10 08:09:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195684 states to 195684 states and 255224 transitions. [2019-09-10 08:09:32,398 INFO L78 Accepts]: Start accepts. Automaton has 195684 states and 255224 transitions. Word has length 155 [2019-09-10 08:09:32,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:09:32,398 INFO L475 AbstractCegarLoop]: Abstraction has 195684 states and 255224 transitions. [2019-09-10 08:09:32,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:09:32,398 INFO L276 IsEmpty]: Start isEmpty. Operand 195684 states and 255224 transitions. [2019-09-10 08:09:32,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 08:09:32,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:09:32,410 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:32,411 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:09:32,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:09:32,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1601082796, now seen corresponding path program 1 times [2019-09-10 08:09:32,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:09:32,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:09:32,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:09:32,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:09:32,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:09:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:09:32,758 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:09:32,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:09:32,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:09:32,759 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 158 with the following transitions: [2019-09-10 08:09:32,760 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], [100], [103], [106], [110], [113], [116], [120], [123], [126], [130], [133], [136], [140], [143], [146], [149], [153], [156], [159], [163], [165], [168], [172], [175], [178], [180], [182], [185], [188], [193], [195], [198], [201], [204], [206], [208], [211], [214], [217], [219], [221], [224], [227], [230], [232], [234], [237], [241], [244], [247], [251], [253], [256], [261], [269], [271], [274], [282], [284], [287], [295], [297], [300], [308], [310], [313], [321], [323], [325], [328], [331], [335], [337], [339], [342], [343], [345], [348], [353], [355], [358], [371], [373], [376], [379], [381], [396], [398], [401], [404], [406], [421], [423], [426], [429], [431], [446], [448], [451], [454], [456], [471], [473], [475], [478], [481], [483], [701], [923], [2371], [2372], [2376], [2377], [2378] [2019-09-10 08:09:32,763 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:09:32,763 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:09:32,815 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:09:34,165 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:09:34,166 INFO L272 AbstractInterpreter]: Visited 147 different actions 973 times. Merged at 55 different actions 715 times. Widened at 24 different actions 127 times. Performed 3399 root evaluator evaluations with a maximum evaluation depth of 7. Performed 3399 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 114 fixpoints after 22 different actions. Largest state had 268 variables. [2019-09-10 08:09:34,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:09:34,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:09:34,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:09:34,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:09:34,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:09:34,185 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:09:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:09:34,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 1514 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 08:09:34,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:09:34,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:34,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:34,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:34,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:34,892 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:09:34,893 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:09:34,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:35,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:35,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:35,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:35,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:36,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:09:36,736 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 08:09:36,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:09:36,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2019-09-10 08:09:36,744 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:09:36,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:09:36,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:09:36,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:09:36,745 INFO L87 Difference]: Start difference. First operand 195684 states and 255224 transitions. Second operand 22 states. [2019-09-10 08:09:39,537 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-09-10 08:09:40,046 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:09:41,087 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-09-10 08:09:42,169 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:09:42,499 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:09:43,063 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:09:43,781 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 43 [2019-09-10 08:09:43,932 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:09:44,371 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:09:44,536 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2019-09-10 08:09:46,720 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-09-10 08:09:47,577 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-09-10 08:09:47,857 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:09:48,015 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-09-10 08:09:48,498 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 48 [2019-09-10 08:09:49,382 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:09:49,541 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:09:50,237 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-09-10 08:09:50,457 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:09:50,915 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:09:51,532 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:09:52,315 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:09:52,604 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-09-10 08:09:52,875 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:09:53,065 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:09:53,261 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 48 [2019-09-10 08:09:53,730 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:09:54,288 WARN L188 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2019-09-10 08:09:54,881 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:09:55,085 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:09:55,234 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-09-10 08:09:55,400 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:09:55,870 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 43 [2019-09-10 08:09:56,054 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-09-10 08:09:57,329 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:09:57,535 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2019-09-10 08:09:57,702 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:09:58,136 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:09:58,524 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:10:00,894 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 43 [2019-09-10 08:10:04,777 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 39 [2019-09-10 08:10:05,216 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 42 [2019-09-10 08:10:06,473 WARN L188 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-09-10 08:10:06,795 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 48 [2019-09-10 08:10:06,960 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-09-10 08:10:07,112 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 43 [2019-09-10 08:10:08,005 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-09-10 08:10:09,018 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2019-09-10 08:10:09,196 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-09-10 08:10:10,235 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 43 [2019-09-10 08:10:12,737 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2019-09-10 08:10:14,058 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 48 [2019-09-10 08:10:14,543 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-09-10 08:10:15,888 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 39 [2019-09-10 08:10:19,205 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:10:19,411 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-09-10 08:10:19,579 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 48 [2019-09-10 08:10:19,758 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-09-10 08:10:19,919 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 43 [2019-09-10 08:10:20,094 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 42 [2019-09-10 08:10:20,507 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-10 08:10:20,767 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:10:20,948 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:10:21,693 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:10:21,881 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:10:22,169 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 08:10:22,490 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:10:22,664 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:10:22,863 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:10:23,055 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-09-10 08:10:23,516 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:10:23,700 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 43 [2019-09-10 08:10:25,447 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:10:26,377 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-10 08:10:26,537 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:10:27,092 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:10:27,405 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 46 [2019-09-10 08:10:27,558 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:10:27,846 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-09-10 08:10:28,163 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:10:28,348 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 08:10:28,655 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:10:28,819 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 08:10:29,166 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2019-09-10 08:10:29,476 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:10:29,804 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 08:10:31,993 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:10:32,172 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2019-09-10 08:10:36,307 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-09-10 08:10:36,769 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:10:37,514 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2019-09-10 08:10:37,736 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-09-10 08:10:38,070 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 48 [2019-09-10 08:10:39,031 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-09-10 08:10:39,245 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 32 [2019-09-10 08:10:39,435 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 48 [2019-09-10 08:10:39,855 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:10:40,026 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 49 [2019-09-10 08:10:40,246 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 51 [2019-09-10 08:10:41,459 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 51 [2019-09-10 08:10:42,756 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:10:43,412 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:10:43,595 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 44 [2019-09-10 08:10:44,091 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 44 [2019-09-10 08:10:44,482 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:10:44,713 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:10:48,755 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:10:49,352 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:10:49,788 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:10:50,099 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:10:50,577 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:10:51,414 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:10:52,529 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:10:57,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:10:57,533 INFO L93 Difference]: Finished difference Result 2479530 states and 3179261 transitions. [2019-09-10 08:10:57,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 413 states. [2019-09-10 08:10:57,533 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 157 [2019-09-10 08:10:57,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:11:13,176 INFO L225 Difference]: With dead ends: 2479530 [2019-09-10 08:11:13,177 INFO L226 Difference]: Without dead ends: 2479530 [2019-09-10 08:11:13,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 268 SyntacticMatches, 27 SemanticMatches, 441 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83137 ImplicationChecksByTransitivity, 59.0s TimeCoverageRelationStatistics Valid=20631, Invalid=175175, Unknown=0, NotChecked=0, Total=195806 [2019-09-10 08:11:14,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2479530 states. [2019-09-10 08:11:50,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2479530 to 468810. [2019-09-10 08:11:50,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468810 states. [2019-09-10 08:11:51,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468810 states to 468810 states and 611069 transitions. [2019-09-10 08:11:51,601 INFO L78 Accepts]: Start accepts. Automaton has 468810 states and 611069 transitions. Word has length 157 [2019-09-10 08:11:51,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:11:51,601 INFO L475 AbstractCegarLoop]: Abstraction has 468810 states and 611069 transitions. [2019-09-10 08:11:51,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:11:51,601 INFO L276 IsEmpty]: Start isEmpty. Operand 468810 states and 611069 transitions. [2019-09-10 08:11:51,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 08:11:51,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:11:51,629 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,630 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:11:51,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:51,630 INFO L82 PathProgramCache]: Analyzing trace with hash -469307645, now seen corresponding path program 1 times [2019-09-10 08:11:51,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:11:51,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:51,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:51,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:11:51,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:11:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:51,964 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:51,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:11:51,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:11:51,965 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 158 with the following transitions: [2019-09-10 08:11:51,965 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], [100], [103], [106], [110], [113], [116], [120], [123], [126], [130], [133], [136], [140], [143], [146], [149], [153], [156], [159], [163], [165], [168], [172], [175], [178], [180], [182], [185], [188], [191], [193], [195], [198], [201], [204], [206], [208], [211], [214], [217], [219], [221], [224], [227], [230], [232], [234], [237], [241], [244], [247], [251], [253], [256], [261], [269], [271], [274], [282], [284], [287], [290], [295], [297], [300], [303], [308], [310], [313], [321], [323], [325], [328], [335], [337], [339], [342], [343], [345], [355], [358], [362], [371], [373], [376], [379], [381], [389], [392], [398], [401], [404], [406], [414], [417], [423], [426], [429], [431], [446], [448], [451], [454], [456], [471], [473], [475], [478], [481], [483], [2371], [2372], [2376], [2377], [2378] [2019-09-10 08:11:51,969 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:11:51,969 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:11:52,051 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:11:57,742 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:11:57,743 INFO L272 AbstractInterpreter]: Visited 148 different actions 797 times. Merged at 58 different actions 573 times. Widened at 23 different actions 86 times. Performed 2964 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2964 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 62 fixpoints after 15 different actions. Largest state had 268 variables. [2019-09-10 08:11:57,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:11:57,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:11:57,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:11:57,744 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:11:57,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:11:57,762 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:11:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:11:57,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 1520 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-10 08:11:57,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:11:58,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:11:58,500 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:11:58,501 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:11:58,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:11:58,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:11:58,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:11:58,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:12:01,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:12:01,792 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:12:01,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:12:01,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2019-09-10 08:12:01,798 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:12:01,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 08:12:01,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 08:12:01,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2019-09-10 08:12:01,799 INFO L87 Difference]: Start difference. First operand 468810 states and 611069 transitions. Second operand 18 states. [2019-09-10 08:12:11,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:12:11,702 INFO L93 Difference]: Finished difference Result 2013001 states and 2607275 transitions. [2019-09-10 08:12:11,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 08:12:11,703 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 157 [2019-09-10 08:12:11,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:12:16,650 INFO L225 Difference]: With dead ends: 2013001 [2019-09-10 08:12:16,651 INFO L226 Difference]: Without dead ends: 2013001 [2019-09-10 08:12:16,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 250 SyntacticMatches, 53 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1353 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=712, Invalid=2480, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 08:12:17,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013001 states. [2019-09-10 08:12:59,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013001 to 1127521. [2019-09-10 08:12:59,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1127521 states. [2019-09-10 08:13:15,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127521 states to 1127521 states and 1466826 transitions. [2019-09-10 08:13:15,815 INFO L78 Accepts]: Start accepts. Automaton has 1127521 states and 1466826 transitions. Word has length 157 [2019-09-10 08:13:15,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:13:15,815 INFO L475 AbstractCegarLoop]: Abstraction has 1127521 states and 1466826 transitions. [2019-09-10 08:13:15,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 08:13:15,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1127521 states and 1466826 transitions. [2019-09-10 08:13:15,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 08:13:15,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:13:15,843 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,844 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:13:15,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:15,844 INFO L82 PathProgramCache]: Analyzing trace with hash -423595302, now seen corresponding path program 1 times [2019-09-10 08:13:15,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:13:15,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:15,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:15,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:13:15,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:13:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:16,147 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:16,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:13:16,148 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:13:16,148 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 159 with the following transitions: [2019-09-10 08:13:16,149 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], [100], [103], [106], [110], [113], [116], [120], [123], [126], [130], [133], [136], [140], [143], [146], [149], [153], [156], [159], [163], [165], [168], [172], [175], [180], [182], [185], [188], [191], [193], [195], [198], [201], [204], [206], [208], [211], [214], [217], [219], [221], [224], [227], [230], [232], [234], [237], [241], [244], [247], [251], [253], [256], [261], [269], [271], [274], [282], [284], [287], [290], [295], [297], [300], [303], [308], [310], [313], [321], [323], [325], [328], [335], [337], [339], [342], [343], [345], [355], [358], [362], [371], [373], [376], [379], [381], [389], [392], [398], [401], [404], [406], [414], [417], [423], [426], [429], [431], [446], [448], [451], [454], [456], [471], [473], [475], [478], [481], [483], [928], [1357], [2371], [2372], [2376], [2377], [2378] [2019-09-10 08:13:16,152 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:13:16,152 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:13:16,236 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:13:16,941 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:13:16,941 INFO L272 AbstractInterpreter]: Visited 149 different actions 834 times. Merged at 58 different actions 605 times. Widened at 22 different actions 86 times. Performed 2917 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2917 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 66 fixpoints after 16 different actions. Largest state had 268 variables. [2019-09-10 08:13:16,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:13:16,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:13:16,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:13:16,942 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:13:16,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:13:16,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:13:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:13:17,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 08:13:17,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:13:17,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:17,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:17,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:17,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:17,638 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:17,638 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:13:17,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:17,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:17,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:17,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:17,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:19,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:13:19,759 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:13:19,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:13:19,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2019-09-10 08:13:19,767 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:13:19,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:13:19,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:13:19,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=757, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:13:19,770 INFO L87 Difference]: Start difference. First operand 1127521 states and 1466826 transitions. Second operand 20 states. [2019-09-10 08:13:33,857 WARN L188 SmtUtils]: Spent 5.08 s on a formula simplification. DAG size of input: 51 DAG size of output: 36 [2019-09-10 08:13:54,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:13:54,809 INFO L93 Difference]: Finished difference Result 2903219 states and 3769962 transitions. [2019-09-10 08:13:54,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-10 08:13:54,810 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 158 [2019-09-10 08:13:54,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:14:00,507 INFO L225 Difference]: With dead ends: 2903219 [2019-09-10 08:14:00,507 INFO L226 Difference]: Without dead ends: 2903219 [2019-09-10 08:14:00,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 269 SyntacticMatches, 28 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3031 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=1675, Invalid=6881, Unknown=0, NotChecked=0, Total=8556 [2019-09-10 08:14:03,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903219 states. [2019-09-10 08:14:53,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903219 to 1127500. [2019-09-10 08:14:53,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1127500 states.