java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:52:15,300 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:52:15,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:52:15,321 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:52:15,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:52:15,323 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:52:15,326 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:52:15,338 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:52:15,340 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:52:15,342 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:52:15,343 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:52:15,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:52:15,344 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:52:15,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:52:15,346 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:52:15,347 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:52:15,348 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:52:15,349 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:52:15,350 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:52:15,354 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:52:15,356 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:52:15,359 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:52:15,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:52:15,361 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:52:15,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:52:15,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:52:15,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:52:15,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:52:15,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:52:15,371 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:52:15,371 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:52:15,372 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:52:15,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:52:15,373 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:52:15,375 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:52:15,376 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:52:15,377 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:52:15,377 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:52:15,377 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:52:15,378 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:52:15,379 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:52:15,380 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 04:52:15,407 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:52:15,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:52:15,407 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:52:15,408 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:52:15,408 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:52:15,408 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:52:15,409 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:52:15,409 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:52:15,409 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:52:15,409 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:52:15,410 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:52:15,410 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:52:15,410 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:52:15,411 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:52:15,411 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:52:15,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:52:15,411 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:52:15,411 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:52:15,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:52:15,412 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:52:15,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:52:15,412 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:52:15,412 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:52:15,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:52:15,413 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:52:15,413 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:52:15,413 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:52:15,413 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:52:15,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:52:15,414 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:52:15,443 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:52:15,456 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:52:15,460 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:52:15,461 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:52:15,462 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:52:15,463 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c [2019-09-10 04:52:15,524 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5cf8c270/c1605afb45f940518104bb3038484ba1/FLAGae436ab15 [2019-09-10 04:52:16,065 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:52:16,066 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c [2019-09-10 04:52:16,084 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5cf8c270/c1605afb45f940518104bb3038484ba1/FLAGae436ab15 [2019-09-10 04:52:16,302 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5cf8c270/c1605afb45f940518104bb3038484ba1 [2019-09-10 04:52:16,312 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:52:16,313 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:52:16,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:52:16,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:52:16,318 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:52:16,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:52:16" (1/1) ... [2019-09-10 04:52:16,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7904412f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:52:16, skipping insertion in model container [2019-09-10 04:52:16,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:52:16" (1/1) ... [2019-09-10 04:52:16,328 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:52:16,371 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:52:16,739 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:52:16,756 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:52:16,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:52:16,843 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:52:16,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:52:16 WrapperNode [2019-09-10 04:52:16,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:52:16,844 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:52:16,844 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:52:16,844 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:52:16,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:52:16" (1/1) ... [2019-09-10 04:52:16,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:52:16" (1/1) ... [2019-09-10 04:52:16,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:52:16" (1/1) ... [2019-09-10 04:52:16,882 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:52:16" (1/1) ... [2019-09-10 04:52:16,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:52:16" (1/1) ... [2019-09-10 04:52:16,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:52:16" (1/1) ... [2019-09-10 04:52:16,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:52:16" (1/1) ... [2019-09-10 04:52:16,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:52:16,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:52:16,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:52:16,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:52:16,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:52:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:52:16,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:52:16,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:52:16,996 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:52:16,997 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:52:16,997 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:52:16,999 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:52:17,000 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:52:17,000 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:52:17,001 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:52:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:52:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:52:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:52:17,002 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:52:17,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:52:17,003 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:52:17,005 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:52:17,005 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:52:17,005 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:52:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:52:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:52:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:52:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:52:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:52:17,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:52:17,823 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:52:17,824 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:52:17,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:52:17 BoogieIcfgContainer [2019-09-10 04:52:17,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:52:17,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:52:17,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:52:17,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:52:17,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:52:16" (1/3) ... [2019-09-10 04:52:17,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79ddf6d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:52:17, skipping insertion in model container [2019-09-10 04:52:17,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:52:16" (2/3) ... [2019-09-10 04:52:17,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79ddf6d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:52:17, skipping insertion in model container [2019-09-10 04:52:17,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:52:17" (3/3) ... [2019-09-10 04:52:17,834 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c [2019-09-10 04:52:17,842 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:52:17,850 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:52:17,867 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:52:17,894 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:52:17,895 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:52:17,895 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:52:17,895 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:52:17,896 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:52:17,896 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:52:17,897 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:52:17,897 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:52:17,925 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states. [2019-09-10 04:52:17,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 04:52:17,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:52:17,942 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] [2019-09-10 04:52:17,944 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:52:17,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:52:17,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1106693626, now seen corresponding path program 1 times [2019-09-10 04:52:17,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:52:17,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:17,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:52:17,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:18,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:52:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:52:18,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:52:18,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:52:18,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:52:18,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:52:18,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:52:18,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:52:18,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:52:18,409 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 5 states. [2019-09-10 04:52:18,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:52:18,569 INFO L93 Difference]: Finished difference Result 172 states and 273 transitions. [2019-09-10 04:52:18,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:52:18,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-10 04:52:18,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:52:18,588 INFO L225 Difference]: With dead ends: 172 [2019-09-10 04:52:18,588 INFO L226 Difference]: Without dead ends: 163 [2019-09-10 04:52:18,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:52:18,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-10 04:52:18,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-09-10 04:52:18,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-10 04:52:18,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 235 transitions. [2019-09-10 04:52:18,651 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 235 transitions. Word has length 59 [2019-09-10 04:52:18,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:52:18,651 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 235 transitions. [2019-09-10 04:52:18,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:52:18,652 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 235 transitions. [2019-09-10 04:52:18,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 04:52:18,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:52:18,656 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:52:18,656 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:52:18,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:52:18,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1798610632, now seen corresponding path program 1 times [2019-09-10 04:52:18,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:52:18,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:18,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:52:18,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:18,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:52:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:52:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:52:18,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:52:18,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:52:18,912 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:52:18,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:52:18,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:52:18,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:52:18,917 INFO L87 Difference]: Start difference. First operand 163 states and 235 transitions. Second operand 5 states. [2019-09-10 04:52:19,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:52:19,622 INFO L93 Difference]: Finished difference Result 261 states and 375 transitions. [2019-09-10 04:52:19,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:52:19,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-09-10 04:52:19,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:52:19,629 INFO L225 Difference]: With dead ends: 261 [2019-09-10 04:52:19,629 INFO L226 Difference]: Without dead ends: 261 [2019-09-10 04:52:19,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:52:19,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-09-10 04:52:19,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 253. [2019-09-10 04:52:19,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-09-10 04:52:19,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 368 transitions. [2019-09-10 04:52:19,687 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 368 transitions. Word has length 88 [2019-09-10 04:52:19,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:52:19,688 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 368 transitions. [2019-09-10 04:52:19,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:52:19,688 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 368 transitions. [2019-09-10 04:52:19,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 04:52:19,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:52:19,696 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 04:52:19,697 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:52:19,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:52:19,698 INFO L82 PathProgramCache]: Analyzing trace with hash -704489299, now seen corresponding path program 1 times [2019-09-10 04:52:19,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:52:19,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:19,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:52:19,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:19,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:52:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:52:19,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:52:19,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:52:19,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:52:19,880 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:52:19,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:52:19,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:52:19,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:52:19,882 INFO L87 Difference]: Start difference. First operand 253 states and 368 transitions. Second operand 5 states. [2019-09-10 04:52:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:52:20,401 INFO L93 Difference]: Finished difference Result 434 states and 634 transitions. [2019-09-10 04:52:20,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:52:20,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-10 04:52:20,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:52:20,406 INFO L225 Difference]: With dead ends: 434 [2019-09-10 04:52:20,406 INFO L226 Difference]: Without dead ends: 434 [2019-09-10 04:52:20,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:52:20,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-09-10 04:52:20,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 426. [2019-09-10 04:52:20,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-09-10 04:52:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 627 transitions. [2019-09-10 04:52:20,439 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 627 transitions. Word has length 90 [2019-09-10 04:52:20,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:52:20,440 INFO L475 AbstractCegarLoop]: Abstraction has 426 states and 627 transitions. [2019-09-10 04:52:20,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:52:20,440 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 627 transitions. [2019-09-10 04:52:20,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 04:52:20,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:52:20,447 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:52:20,447 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:52:20,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:52:20,448 INFO L82 PathProgramCache]: Analyzing trace with hash 812819256, now seen corresponding path program 1 times [2019-09-10 04:52:20,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:52:20,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:20,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:52:20,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:20,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:52:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:52:20,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:52:20,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:52:20,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:52:20,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:52:20,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:52:20,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:52:20,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:52:20,578 INFO L87 Difference]: Start difference. First operand 426 states and 627 transitions. Second operand 5 states. [2019-09-10 04:52:21,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:52:21,137 INFO L93 Difference]: Finished difference Result 774 states and 1134 transitions. [2019-09-10 04:52:21,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:52:21,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-10 04:52:21,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:52:21,143 INFO L225 Difference]: With dead ends: 774 [2019-09-10 04:52:21,144 INFO L226 Difference]: Without dead ends: 774 [2019-09-10 04:52:21,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:52:21,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-09-10 04:52:21,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 760. [2019-09-10 04:52:21,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-09-10 04:52:21,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1121 transitions. [2019-09-10 04:52:21,179 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1121 transitions. Word has length 92 [2019-09-10 04:52:21,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:52:21,180 INFO L475 AbstractCegarLoop]: Abstraction has 760 states and 1121 transitions. [2019-09-10 04:52:21,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:52:21,180 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1121 transitions. [2019-09-10 04:52:21,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 04:52:21,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:52:21,182 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:52:21,183 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:52:21,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:52:21,183 INFO L82 PathProgramCache]: Analyzing trace with hash 735799213, now seen corresponding path program 1 times [2019-09-10 04:52:21,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:52:21,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:21,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:52:21,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:21,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:52:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:52:21,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:52:21,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:52:21,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:52:21,335 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:52:21,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:52:21,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:52:21,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:52:21,338 INFO L87 Difference]: Start difference. First operand 760 states and 1121 transitions. Second operand 9 states. [2019-09-10 04:52:24,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:52:24,378 INFO L93 Difference]: Finished difference Result 3591 states and 5393 transitions. [2019-09-10 04:52:24,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 04:52:24,380 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-09-10 04:52:24,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:52:24,410 INFO L225 Difference]: With dead ends: 3591 [2019-09-10 04:52:24,410 INFO L226 Difference]: Without dead ends: 3591 [2019-09-10 04:52:24,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2019-09-10 04:52:24,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3591 states. [2019-09-10 04:52:24,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3591 to 3511. [2019-09-10 04:52:24,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3511 states. [2019-09-10 04:52:24,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3511 states to 3511 states and 5321 transitions. [2019-09-10 04:52:24,606 INFO L78 Accepts]: Start accepts. Automaton has 3511 states and 5321 transitions. Word has length 94 [2019-09-10 04:52:24,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:52:24,607 INFO L475 AbstractCegarLoop]: Abstraction has 3511 states and 5321 transitions. [2019-09-10 04:52:24,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:52:24,608 INFO L276 IsEmpty]: Start isEmpty. Operand 3511 states and 5321 transitions. [2019-09-10 04:52:24,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 04:52:24,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:52:24,611 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:52:24,612 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:52:24,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:52:24,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1111632109, now seen corresponding path program 1 times [2019-09-10 04:52:24,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:52:24,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:24,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:52:24,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:24,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:52:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:52:24,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:52:24,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:52:24,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:52:24,763 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:52:24,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:52:24,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:52:24,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:52:24,764 INFO L87 Difference]: Start difference. First operand 3511 states and 5321 transitions. Second operand 6 states. [2019-09-10 04:52:25,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:52:25,821 INFO L93 Difference]: Finished difference Result 5939 states and 9008 transitions. [2019-09-10 04:52:25,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:52:25,822 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-09-10 04:52:25,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:52:25,868 INFO L225 Difference]: With dead ends: 5939 [2019-09-10 04:52:25,869 INFO L226 Difference]: Without dead ends: 5939 [2019-09-10 04:52:25,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:52:25,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5939 states. [2019-09-10 04:52:26,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5939 to 4829. [2019-09-10 04:52:26,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4829 states. [2019-09-10 04:52:26,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4829 states to 4829 states and 7325 transitions. [2019-09-10 04:52:26,116 INFO L78 Accepts]: Start accepts. Automaton has 4829 states and 7325 transitions. Word has length 95 [2019-09-10 04:52:26,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:52:26,116 INFO L475 AbstractCegarLoop]: Abstraction has 4829 states and 7325 transitions. [2019-09-10 04:52:26,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:52:26,117 INFO L276 IsEmpty]: Start isEmpty. Operand 4829 states and 7325 transitions. [2019-09-10 04:52:26,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 04:52:26,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:52:26,121 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:52:26,121 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:52:26,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:52:26,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1166847690, now seen corresponding path program 1 times [2019-09-10 04:52:26,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:52:26,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:26,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:52:26,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:26,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:52:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:52:26,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:52:26,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:52:26,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:52:26,279 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:52:26,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:52:26,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:52:26,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:52:26,280 INFO L87 Difference]: Start difference. First operand 4829 states and 7325 transitions. Second operand 9 states. [2019-09-10 04:52:29,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:52:29,914 INFO L93 Difference]: Finished difference Result 7935 states and 12047 transitions. [2019-09-10 04:52:29,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 04:52:29,915 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 04:52:29,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:52:29,966 INFO L225 Difference]: With dead ends: 7935 [2019-09-10 04:52:29,966 INFO L226 Difference]: Without dead ends: 7935 [2019-09-10 04:52:29,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 04:52:29,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7935 states. [2019-09-10 04:52:30,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7935 to 7001. [2019-09-10 04:52:30,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7001 states. [2019-09-10 04:52:30,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7001 states to 7001 states and 10647 transitions. [2019-09-10 04:52:30,224 INFO L78 Accepts]: Start accepts. Automaton has 7001 states and 10647 transitions. Word has length 96 [2019-09-10 04:52:30,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:52:30,225 INFO L475 AbstractCegarLoop]: Abstraction has 7001 states and 10647 transitions. [2019-09-10 04:52:30,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:52:30,225 INFO L276 IsEmpty]: Start isEmpty. Operand 7001 states and 10647 transitions. [2019-09-10 04:52:30,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 04:52:30,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:52:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:52:30,231 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:52:30,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:52:30,231 INFO L82 PathProgramCache]: Analyzing trace with hash -434937692, now seen corresponding path program 1 times [2019-09-10 04:52:30,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:52:30,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:30,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:52:30,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:30,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:52:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:52:30,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:52:30,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:52:30,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:52:30,407 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:52:30,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:52:30,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:52:30,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:52:30,410 INFO L87 Difference]: Start difference. First operand 7001 states and 10647 transitions. Second operand 9 states. [2019-09-10 04:52:33,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:52:33,266 INFO L93 Difference]: Finished difference Result 10767 states and 16381 transitions. [2019-09-10 04:52:33,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 04:52:33,267 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 04:52:33,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:52:33,326 INFO L225 Difference]: With dead ends: 10767 [2019-09-10 04:52:33,326 INFO L226 Difference]: Without dead ends: 10767 [2019-09-10 04:52:33,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=238, Invalid=884, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 04:52:33,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10767 states. [2019-09-10 04:52:33,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10767 to 9381. [2019-09-10 04:52:33,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9381 states. [2019-09-10 04:52:33,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9381 states to 9381 states and 14281 transitions. [2019-09-10 04:52:33,868 INFO L78 Accepts]: Start accepts. Automaton has 9381 states and 14281 transitions. Word has length 96 [2019-09-10 04:52:33,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:52:33,869 INFO L475 AbstractCegarLoop]: Abstraction has 9381 states and 14281 transitions. [2019-09-10 04:52:33,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:52:33,869 INFO L276 IsEmpty]: Start isEmpty. Operand 9381 states and 14281 transitions. [2019-09-10 04:52:33,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 04:52:33,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:52:33,877 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:52:33,877 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:52:33,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:52:33,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1695854116, now seen corresponding path program 1 times [2019-09-10 04:52:33,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:52:33,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:33,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:52:33,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:33,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:52:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:52:34,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:52:34,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:52:34,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:52:34,065 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:52:34,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:52:34,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:52:34,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:52:34,067 INFO L87 Difference]: Start difference. First operand 9381 states and 14281 transitions. Second operand 6 states. [2019-09-10 04:52:35,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:52:35,732 INFO L93 Difference]: Finished difference Result 18461 states and 28025 transitions. [2019-09-10 04:52:35,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:52:35,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-09-10 04:52:35,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:52:35,859 INFO L225 Difference]: With dead ends: 18461 [2019-09-10 04:52:35,859 INFO L226 Difference]: Without dead ends: 18461 [2019-09-10 04:52:35,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:52:35,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18461 states. [2019-09-10 04:52:36,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18461 to 18268. [2019-09-10 04:52:36,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18268 states. [2019-09-10 04:52:36,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18268 states to 18268 states and 27763 transitions. [2019-09-10 04:52:36,465 INFO L78 Accepts]: Start accepts. Automaton has 18268 states and 27763 transitions. Word has length 96 [2019-09-10 04:52:36,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:52:36,466 INFO L475 AbstractCegarLoop]: Abstraction has 18268 states and 27763 transitions. [2019-09-10 04:52:36,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:52:36,466 INFO L276 IsEmpty]: Start isEmpty. Operand 18268 states and 27763 transitions. [2019-09-10 04:52:36,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 04:52:36,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:52:36,471 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:52:36,471 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:52:36,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:52:36,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1703080734, now seen corresponding path program 1 times [2019-09-10 04:52:36,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:52:36,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:36,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:52:36,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:36,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:52:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:52:36,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:52:36,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:52:36,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:52:36,581 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:52:36,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:52:36,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:52:36,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:52:36,587 INFO L87 Difference]: Start difference. First operand 18268 states and 27763 transitions. Second operand 5 states. [2019-09-10 04:52:37,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:52:37,196 INFO L93 Difference]: Finished difference Result 33648 states and 51578 transitions. [2019-09-10 04:52:37,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:52:37,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-09-10 04:52:37,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:52:37,323 INFO L225 Difference]: With dead ends: 33648 [2019-09-10 04:52:37,323 INFO L226 Difference]: Without dead ends: 33648 [2019-09-10 04:52:37,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:52:37,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33648 states. [2019-09-10 04:52:38,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33648 to 33208. [2019-09-10 04:52:38,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33208 states. [2019-09-10 04:52:38,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33208 states to 33208 states and 50901 transitions. [2019-09-10 04:52:38,814 INFO L78 Accepts]: Start accepts. Automaton has 33208 states and 50901 transitions. Word has length 96 [2019-09-10 04:52:38,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:52:38,815 INFO L475 AbstractCegarLoop]: Abstraction has 33208 states and 50901 transitions. [2019-09-10 04:52:38,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:52:38,815 INFO L276 IsEmpty]: Start isEmpty. Operand 33208 states and 50901 transitions. [2019-09-10 04:52:38,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 04:52:38,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:52:38,824 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:52:38,824 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:52:38,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:52:38,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1518071062, now seen corresponding path program 1 times [2019-09-10 04:52:38,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:52:38,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:38,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:52:38,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:38,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:52:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:52:38,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:52:38,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:52:38,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:52:38,947 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:52:38,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:52:38,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:52:38,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:52:38,948 INFO L87 Difference]: Start difference. First operand 33208 states and 50901 transitions. Second operand 6 states. [2019-09-10 04:52:40,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:52:40,554 INFO L93 Difference]: Finished difference Result 66970 states and 102603 transitions. [2019-09-10 04:52:40,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:52:40,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-09-10 04:52:40,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:52:40,913 INFO L225 Difference]: With dead ends: 66970 [2019-09-10 04:52:40,913 INFO L226 Difference]: Without dead ends: 66970 [2019-09-10 04:52:40,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:52:40,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66970 states. [2019-09-10 04:52:42,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66970 to 66284. [2019-09-10 04:52:42,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66284 states. [2019-09-10 04:52:42,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66284 states to 66284 states and 101643 transitions. [2019-09-10 04:52:42,546 INFO L78 Accepts]: Start accepts. Automaton has 66284 states and 101643 transitions. Word has length 97 [2019-09-10 04:52:42,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:52:42,546 INFO L475 AbstractCegarLoop]: Abstraction has 66284 states and 101643 transitions. [2019-09-10 04:52:42,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:52:42,547 INFO L276 IsEmpty]: Start isEmpty. Operand 66284 states and 101643 transitions. [2019-09-10 04:52:42,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 04:52:42,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:52:42,554 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:52:42,554 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:52:42,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:52:42,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1436506364, now seen corresponding path program 1 times [2019-09-10 04:52:42,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:52:42,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:42,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:52:42,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:42,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:52:42,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:52:42,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:52:42,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:52:42,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 04:52:42,657 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:52:42,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 04:52:42,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 04:52:42,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:52:42,658 INFO L87 Difference]: Start difference. First operand 66284 states and 101643 transitions. Second operand 7 states. [2019-09-10 04:52:45,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:52:45,125 INFO L93 Difference]: Finished difference Result 87622 states and 134650 transitions. [2019-09-10 04:52:45,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:52:45,125 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-09-10 04:52:45,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:52:45,437 INFO L225 Difference]: With dead ends: 87622 [2019-09-10 04:52:45,438 INFO L226 Difference]: Without dead ends: 87622 [2019-09-10 04:52:45,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 04:52:45,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87622 states. [2019-09-10 04:52:47,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87622 to 79752. [2019-09-10 04:52:47,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79752 states. [2019-09-10 04:52:47,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79752 states to 79752 states and 122335 transitions. [2019-09-10 04:52:47,237 INFO L78 Accepts]: Start accepts. Automaton has 79752 states and 122335 transitions. Word has length 97 [2019-09-10 04:52:47,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:52:47,238 INFO L475 AbstractCegarLoop]: Abstraction has 79752 states and 122335 transitions. [2019-09-10 04:52:47,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 04:52:47,238 INFO L276 IsEmpty]: Start isEmpty. Operand 79752 states and 122335 transitions. [2019-09-10 04:52:47,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 04:52:47,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:52:47,246 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:52:47,246 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:52:47,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:52:47,246 INFO L82 PathProgramCache]: Analyzing trace with hash 882269751, now seen corresponding path program 1 times [2019-09-10 04:52:47,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:52:47,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:47,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:52:47,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:47,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:52:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:52:47,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:52:47,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:52:47,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 04:52:47,309 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:52:47,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 04:52:47,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 04:52:47,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:52:47,310 INFO L87 Difference]: Start difference. First operand 79752 states and 122335 transitions. Second operand 4 states. [2019-09-10 04:52:49,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:52:49,332 INFO L93 Difference]: Finished difference Result 162319 states and 244621 transitions. [2019-09-10 04:52:49,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 04:52:49,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-10 04:52:49,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:52:49,940 INFO L225 Difference]: With dead ends: 162319 [2019-09-10 04:52:49,940 INFO L226 Difference]: Without dead ends: 162319 [2019-09-10 04:52:49,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:52:50,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162319 states. [2019-09-10 04:52:52,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162319 to 162299. [2019-09-10 04:52:52,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162299 states. [2019-09-10 04:52:52,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162299 states to 162299 states and 244603 transitions. [2019-09-10 04:52:52,834 INFO L78 Accepts]: Start accepts. Automaton has 162299 states and 244603 transitions. Word has length 97 [2019-09-10 04:52:52,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:52:52,835 INFO L475 AbstractCegarLoop]: Abstraction has 162299 states and 244603 transitions. [2019-09-10 04:52:52,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 04:52:52,835 INFO L276 IsEmpty]: Start isEmpty. Operand 162299 states and 244603 transitions. [2019-09-10 04:52:52,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 04:52:52,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:52:52,851 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:52:52,851 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:52:52,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:52:52,852 INFO L82 PathProgramCache]: Analyzing trace with hash -487701475, now seen corresponding path program 1 times [2019-09-10 04:52:52,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:52:52,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:52,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:52:52,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:52:52,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:52:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:52:52,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:52:52,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:52:52,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 04:52:52,920 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:52:52,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 04:52:52,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 04:52:52,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:52:52,921 INFO L87 Difference]: Start difference. First operand 162299 states and 244603 transitions. Second operand 4 states. [2019-09-10 04:52:57,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:52:57,288 INFO L93 Difference]: Finished difference Result 285009 states and 424384 transitions. [2019-09-10 04:52:57,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 04:52:57,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-10 04:52:57,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:52:58,088 INFO L225 Difference]: With dead ends: 285009 [2019-09-10 04:52:58,088 INFO L226 Difference]: Without dead ends: 285009 [2019-09-10 04:52:58,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:52:58,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285009 states. [2019-09-10 04:53:06,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285009 to 284939. [2019-09-10 04:53:06,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284939 states. [2019-09-10 04:53:07,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284939 states to 284939 states and 424316 transitions. [2019-09-10 04:53:07,307 INFO L78 Accepts]: Start accepts. Automaton has 284939 states and 424316 transitions. Word has length 97 [2019-09-10 04:53:07,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:53:07,307 INFO L475 AbstractCegarLoop]: Abstraction has 284939 states and 424316 transitions. [2019-09-10 04:53:07,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 04:53:07,307 INFO L276 IsEmpty]: Start isEmpty. Operand 284939 states and 424316 transitions. [2019-09-10 04:53:07,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 04:53:07,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:53:07,348 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:53:07,348 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:53:07,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:53:07,349 INFO L82 PathProgramCache]: Analyzing trace with hash 777456621, now seen corresponding path program 1 times [2019-09-10 04:53:07,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:53:07,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:53:07,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:53:07,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:53:07,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:53:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:53:07,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:53:07,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:53:07,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:53:07,552 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:53:07,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:53:07,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:53:07,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:53:07,553 INFO L87 Difference]: Start difference. First operand 284939 states and 424316 transitions. Second operand 6 states. [2019-09-10 04:53:14,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:53:14,848 INFO L93 Difference]: Finished difference Result 293727 states and 439307 transitions. [2019-09-10 04:53:14,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:53:14,849 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-09-10 04:53:14,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:53:16,011 INFO L225 Difference]: With dead ends: 293727 [2019-09-10 04:53:16,012 INFO L226 Difference]: Without dead ends: 293706 [2019-09-10 04:53:16,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:53:16,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293706 states. [2019-09-10 04:53:20,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293706 to 285652. [2019-09-10 04:53:20,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285652 states. [2019-09-10 04:53:20,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285652 states to 285652 states and 424057 transitions. [2019-09-10 04:53:20,809 INFO L78 Accepts]: Start accepts. Automaton has 285652 states and 424057 transitions. Word has length 98 [2019-09-10 04:53:20,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:53:20,809 INFO L475 AbstractCegarLoop]: Abstraction has 285652 states and 424057 transitions. [2019-09-10 04:53:20,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:53:20,810 INFO L276 IsEmpty]: Start isEmpty. Operand 285652 states and 424057 transitions. [2019-09-10 04:53:20,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 04:53:20,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:53:20,824 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:53:20,824 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:53:20,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:53:20,824 INFO L82 PathProgramCache]: Analyzing trace with hash -651811160, now seen corresponding path program 1 times [2019-09-10 04:53:20,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:53:20,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:53:20,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:53:20,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:53:20,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:53:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:53:20,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:53:20,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:53:20,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:53:20,962 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:53:20,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:53:20,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:53:20,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:53:20,963 INFO L87 Difference]: Start difference. First operand 285652 states and 424057 transitions. Second operand 11 states. [2019-09-10 04:53:24,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:53:24,844 INFO L93 Difference]: Finished difference Result 364664 states and 547182 transitions. [2019-09-10 04:53:24,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 04:53:24,845 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2019-09-10 04:53:24,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:53:25,901 INFO L225 Difference]: With dead ends: 364664 [2019-09-10 04:53:25,901 INFO L226 Difference]: Without dead ends: 364580 [2019-09-10 04:53:25,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-10 04:53:26,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364580 states. [2019-09-10 04:53:36,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364580 to 292182. [2019-09-10 04:53:36,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292182 states. [2019-09-10 04:53:36,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292182 states to 292182 states and 433843 transitions. [2019-09-10 04:53:36,835 INFO L78 Accepts]: Start accepts. Automaton has 292182 states and 433843 transitions. Word has length 98 [2019-09-10 04:53:36,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:53:36,836 INFO L475 AbstractCegarLoop]: Abstraction has 292182 states and 433843 transitions. [2019-09-10 04:53:36,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:53:36,836 INFO L276 IsEmpty]: Start isEmpty. Operand 292182 states and 433843 transitions. [2019-09-10 04:53:36,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 04:53:36,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:53:36,847 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:53:36,848 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:53:36,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:53:36,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1294133123, now seen corresponding path program 1 times [2019-09-10 04:53:36,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:53:36,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:53:36,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:53:36,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:53:36,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:53:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:53:36,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:53:36,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:53:36,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:53:36,996 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:53:36,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:53:36,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:53:36,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:53:36,997 INFO L87 Difference]: Start difference. First operand 292182 states and 433843 transitions. Second operand 11 states. [2019-09-10 04:53:40,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:53:40,844 INFO L93 Difference]: Finished difference Result 366428 states and 549311 transitions. [2019-09-10 04:53:40,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 04:53:40,845 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2019-09-10 04:53:40,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:53:41,878 INFO L225 Difference]: With dead ends: 366428 [2019-09-10 04:53:41,878 INFO L226 Difference]: Without dead ends: 366388 [2019-09-10 04:53:41,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-10 04:53:42,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366388 states. [2019-09-10 04:53:55,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366388 to 294874. [2019-09-10 04:53:55,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294874 states. [2019-09-10 04:53:56,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294874 states to 294874 states and 437915 transitions. [2019-09-10 04:53:56,634 INFO L78 Accepts]: Start accepts. Automaton has 294874 states and 437915 transitions. Word has length 98 [2019-09-10 04:53:56,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:53:56,634 INFO L475 AbstractCegarLoop]: Abstraction has 294874 states and 437915 transitions. [2019-09-10 04:53:56,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:53:56,634 INFO L276 IsEmpty]: Start isEmpty. Operand 294874 states and 437915 transitions. [2019-09-10 04:53:56,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 04:53:56,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:53:56,641 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:53:56,641 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:53:56,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:53:56,642 INFO L82 PathProgramCache]: Analyzing trace with hash 488202899, now seen corresponding path program 1 times [2019-09-10 04:53:56,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:53:56,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:53:56,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:53:56,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:53:56,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:53:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:53:56,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:53:56,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:53:56,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 04:53:56,768 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:53:56,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 04:53:56,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 04:53:56,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 04:53:56,769 INFO L87 Difference]: Start difference. First operand 294874 states and 437915 transitions. Second operand 10 states. [2019-09-10 04:54:04,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:54:04,712 INFO L93 Difference]: Finished difference Result 435368 states and 649877 transitions. [2019-09-10 04:54:04,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 04:54:04,713 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 99 [2019-09-10 04:54:04,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:54:06,704 INFO L225 Difference]: With dead ends: 435368 [2019-09-10 04:54:06,705 INFO L226 Difference]: Without dead ends: 435349 [2019-09-10 04:54:06,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=308, Invalid=952, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 04:54:06,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435349 states. [2019-09-10 04:54:16,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435349 to 418001. [2019-09-10 04:54:16,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418001 states. [2019-09-10 04:54:19,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418001 states to 418001 states and 623699 transitions. [2019-09-10 04:54:19,125 INFO L78 Accepts]: Start accepts. Automaton has 418001 states and 623699 transitions. Word has length 99 [2019-09-10 04:54:19,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:54:19,125 INFO L475 AbstractCegarLoop]: Abstraction has 418001 states and 623699 transitions. [2019-09-10 04:54:19,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 04:54:19,125 INFO L276 IsEmpty]: Start isEmpty. Operand 418001 states and 623699 transitions. [2019-09-10 04:54:19,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 04:54:19,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:54:19,131 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:54:19,132 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:54:19,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:54:19,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1200740843, now seen corresponding path program 1 times [2019-09-10 04:54:19,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:54:19,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:54:19,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:54:19,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:54:19,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:54:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:54:19,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:54:19,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:54:19,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:54:19,199 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:54:19,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:54:19,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:54:19,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:54:19,202 INFO L87 Difference]: Start difference. First operand 418001 states and 623699 transitions. Second operand 5 states. [2019-09-10 04:54:30,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:54:30,393 INFO L93 Difference]: Finished difference Result 726879 states and 1096992 transitions. [2019-09-10 04:54:30,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:54:30,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-10 04:54:30,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:54:32,329 INFO L225 Difference]: With dead ends: 726879 [2019-09-10 04:54:32,330 INFO L226 Difference]: Without dead ends: 726879 [2019-09-10 04:54:32,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:54:33,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726879 states. [2019-09-10 04:54:50,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726879 to 716612. [2019-09-10 04:54:50,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716612 states. [2019-09-10 04:54:54,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716612 states to 716612 states and 1079506 transitions. [2019-09-10 04:54:54,389 INFO L78 Accepts]: Start accepts. Automaton has 716612 states and 1079506 transitions. Word has length 99 [2019-09-10 04:54:54,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:54:54,389 INFO L475 AbstractCegarLoop]: Abstraction has 716612 states and 1079506 transitions. [2019-09-10 04:54:54,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:54:54,389 INFO L276 IsEmpty]: Start isEmpty. Operand 716612 states and 1079506 transitions. [2019-09-10 04:54:54,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 04:54:54,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:54:54,396 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:54:54,396 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:54:54,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:54:54,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1797172734, now seen corresponding path program 1 times [2019-09-10 04:54:54,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:54:54,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:54:54,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:54:54,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:54:54,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:54:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:54:54,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:54:54,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:54:54,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:54:54,514 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:54:54,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:54:54,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:54:54,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:54:54,516 INFO L87 Difference]: Start difference. First operand 716612 states and 1079506 transitions. Second operand 5 states. [2019-09-10 04:55:17,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:55:17,884 INFO L93 Difference]: Finished difference Result 1404986 states and 2082077 transitions. [2019-09-10 04:55:17,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:55:17,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-10 04:55:17,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:55:22,268 INFO L225 Difference]: With dead ends: 1404986 [2019-09-10 04:55:22,268 INFO L226 Difference]: Without dead ends: 1404986 [2019-09-10 04:55:22,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:55:23,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404986 states. [2019-09-10 04:56:02,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404986 to 1404984. [2019-09-10 04:56:02,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1404984 states. [2019-09-10 04:56:26,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404984 states to 1404984 states and 2082076 transitions. [2019-09-10 04:56:26,023 INFO L78 Accepts]: Start accepts. Automaton has 1404984 states and 2082076 transitions. Word has length 99 [2019-09-10 04:56:26,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:56:26,024 INFO L475 AbstractCegarLoop]: Abstraction has 1404984 states and 2082076 transitions. [2019-09-10 04:56:26,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:56:26,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1404984 states and 2082076 transitions. [2019-09-10 04:56:26,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 04:56:26,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:56:26,037 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:56:26,037 INFO L418 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:56:26,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:56:26,037 INFO L82 PathProgramCache]: Analyzing trace with hash -171155334, now seen corresponding path program 1 times [2019-09-10 04:56:26,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:56:26,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:56:26,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:56:26,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:56:26,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:56:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:56:26,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:56:26,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:56:26,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:56:26,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:56:26,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:56:26,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:56:26,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:56:26,137 INFO L87 Difference]: Start difference. First operand 1404984 states and 2082076 transitions. Second operand 5 states. [2019-09-10 04:56:51,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:56:51,440 INFO L93 Difference]: Finished difference Result 2396259 states and 3529440 transitions. [2019-09-10 04:56:51,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 04:56:51,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-09-10 04:56:51,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:57:20,661 INFO L225 Difference]: With dead ends: 2396259 [2019-09-10 04:57:20,661 INFO L226 Difference]: Without dead ends: 2396259 [2019-09-10 04:57:20,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:57:22,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396259 states.