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/product-lines/elevator_spec2_product09.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:40:54,386 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:40:54,388 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:40:54,400 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:40:54,400 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:40:54,401 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:40:54,403 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:40:54,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:40:54,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:40:54,407 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:40:54,408 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:40:54,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:40:54,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:40:54,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:40:54,412 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:40:54,413 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:40:54,414 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:40:54,415 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:40:54,417 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:40:54,419 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:40:54,420 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:40:54,421 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:40:54,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:40:54,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:40:54,426 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:40:54,426 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:40:54,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:40:54,427 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:40:54,428 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:40:54,429 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:40:54,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:40:54,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:40:54,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:40:54,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:40:54,433 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:40:54,433 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:40:54,434 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:40:54,434 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:40:54,434 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:40:54,435 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:40:54,436 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:40:54,437 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-10-03 02:40:54,452 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:40:54,454 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:40:54,454 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:40:54,455 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:40:54,456 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:40:54,456 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:40:54,456 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:40:54,456 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:40:54,456 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:40:54,457 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:40:54,457 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:40:54,458 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:40:54,458 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:40:54,458 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:40:54,459 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:40:54,459 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:40:54,459 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:40:54,460 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:40:54,460 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:40:54,460 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:40:54,460 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:40:54,460 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:40:54,461 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:40:54,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:40:54,461 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:40:54,462 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:40:54,462 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:40:54,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:40:54,462 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:40:54,462 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:40:54,515 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:40:54,535 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:40:54,538 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:40:54,541 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:40:54,542 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:40:54,543 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product09.cil.c [2019-10-03 02:40:54,615 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1adc3c8/3908b422411e4d2e9362a5f9c85abc8f/FLAGe7070cb08 [2019-10-03 02:40:55,238 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:40:55,239 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product09.cil.c [2019-10-03 02:40:55,260 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1adc3c8/3908b422411e4d2e9362a5f9c85abc8f/FLAGe7070cb08 [2019-10-03 02:40:55,460 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1adc3c8/3908b422411e4d2e9362a5f9c85abc8f [2019-10-03 02:40:55,469 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:40:55,470 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:40:55,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:40:55,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:40:55,475 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:40:55,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:40:55" (1/1) ... [2019-10-03 02:40:55,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9515a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:55, skipping insertion in model container [2019-10-03 02:40:55,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:40:55" (1/1) ... [2019-10-03 02:40:55,487 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:40:55,580 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:40:56,302 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:40:56,327 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:40:56,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:40:56,511 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:40:56,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:56 WrapperNode [2019-10-03 02:40:56,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:40:56,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:40:56,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:40:56,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:40:56,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:56" (1/1) ... [2019-10-03 02:40:56,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:56" (1/1) ... [2019-10-03 02:40:56,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:56" (1/1) ... [2019-10-03 02:40:56,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:56" (1/1) ... [2019-10-03 02:40:56,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:56" (1/1) ... [2019-10-03 02:40:56,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:56" (1/1) ... [2019-10-03 02:40:56,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:56" (1/1) ... [2019-10-03 02:40:56,702 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:40:56,702 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:40:56,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:40:56,703 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:40:56,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:56" (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-10-03 02:40:56,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:40:56,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:40:56,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:40:56,795 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-03 02:40:56,795 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-03 02:40:56,795 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-03 02:40:56,796 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-03 02:40:56,796 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-03 02:40:56,796 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-03 02:40:56,796 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-03 02:40:56,797 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-03 02:40:56,797 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-03 02:40:56,797 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-03 02:40:56,798 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-03 02:40:56,799 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-03 02:40:56,799 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-03 02:40:56,800 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-03 02:40:56,800 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:40:56,800 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-03 02:40:56,800 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:40:56,801 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-03 02:40:56,801 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-03 02:40:56,801 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-03 02:40:56,801 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-03 02:40:56,801 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-03 02:40:56,802 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-03 02:40:56,802 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-03 02:40:56,803 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-03 02:40:56,803 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-03 02:40:56,803 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-03 02:40:56,803 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-03 02:40:56,803 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-03 02:40:56,803 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-03 02:40:56,804 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-03 02:40:56,804 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-03 02:40:56,804 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:40:56,804 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:40:56,804 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:40:56,804 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:40:56,804 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:40:56,805 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-03 02:40:56,805 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-03 02:40:56,806 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-03 02:40:56,806 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-03 02:40:56,806 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-03 02:40:56,806 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-03 02:40:56,807 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-03 02:40:56,807 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-03 02:40:56,807 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-03 02:40:56,807 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-03 02:40:56,807 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-03 02:40:56,808 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-03 02:40:56,808 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-03 02:40:56,808 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-03 02:40:56,808 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-03 02:40:56,808 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-03 02:40:56,809 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-03 02:40:56,809 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-03 02:40:56,809 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-03 02:40:56,810 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-03 02:40:56,810 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-03 02:40:56,810 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-03 02:40:56,811 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-03 02:40:56,811 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-03 02:40:56,811 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:40:56,812 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:40:56,812 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:40:56,812 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:40:56,813 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:40:56,813 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:40:56,813 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:40:56,813 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-03 02:40:56,814 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-03 02:40:56,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:40:56,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:40:56,815 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-03 02:40:56,816 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-03 02:40:56,816 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-03 02:40:56,816 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-03 02:40:56,817 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-03 02:40:56,817 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-03 02:40:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-03 02:40:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-03 02:40:56,818 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-03 02:40:56,819 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-03 02:40:56,820 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-03 02:40:56,821 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-03 02:40:56,821 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-03 02:40:56,821 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-03 02:40:56,821 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-03 02:40:56,821 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-03 02:40:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-03 02:40:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-03 02:40:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-03 02:40:56,823 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-03 02:40:56,823 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-03 02:40:56,823 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-03 02:40:56,823 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:40:56,823 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-03 02:40:56,823 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-03 02:40:56,824 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:40:56,824 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-03 02:40:56,824 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:40:56,824 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:40:56,824 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:40:56,825 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:40:56,825 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-03 02:40:56,825 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-03 02:40:56,825 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:40:56,825 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-03 02:40:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-03 02:40:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-03 02:40:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-03 02:40:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-03 02:40:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-03 02:40:56,827 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-03 02:40:56,827 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-03 02:40:56,828 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-03 02:40:56,828 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-03 02:40:56,829 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-03 02:40:56,829 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:40:56,829 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:40:56,830 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-03 02:40:56,831 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-03 02:40:56,831 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-03 02:40:56,831 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-03 02:40:56,831 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-03 02:40:56,831 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-03 02:40:56,832 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-03 02:40:56,832 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-03 02:40:56,832 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-03 02:40:56,833 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-03 02:40:56,833 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-03 02:40:56,833 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-03 02:40:56,833 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-03 02:40:56,833 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-03 02:40:56,833 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-03 02:40:56,834 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-03 02:40:56,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:40:56,839 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-03 02:40:56,840 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:40:56,840 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:40:56,840 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:40:56,848 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:40:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:40:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:40:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:40:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:40:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:40:56,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:40:56,850 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:40:56,850 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:40:56,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:40:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:40:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:40:56,851 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:40:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-03 02:40:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-03 02:40:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:40:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:40:56,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:40:59,546 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:40:59,546 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-03 02:40:59,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:40:59 BoogieIcfgContainer [2019-10-03 02:40:59,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:40:59,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:40:59,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:40:59,555 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:40:59,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:40:55" (1/3) ... [2019-10-03 02:40:59,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58b1b76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:40:59, skipping insertion in model container [2019-10-03 02:40:59,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:56" (2/3) ... [2019-10-03 02:40:59,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58b1b76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:40:59, skipping insertion in model container [2019-10-03 02:40:59,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:40:59" (3/3) ... [2019-10-03 02:40:59,562 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product09.cil.c [2019-10-03 02:40:59,573 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:40:59,586 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:40:59,605 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:40:59,641 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:40:59,641 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:40:59,641 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:40:59,641 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:40:59,641 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:40:59,641 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:40:59,642 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:40:59,642 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:40:59,686 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states. [2019-10-03 02:40:59,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-03 02:40:59,731 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:59,732 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:59,736 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:59,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:59,741 INFO L82 PathProgramCache]: Analyzing trace with hash -943810912, now seen corresponding path program 1 times [2019-10-03 02:40:59,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:59,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:59,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:59,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:59,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:00,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:00,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:00,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:00,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:00,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:00,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:00,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:00,408 INFO L87 Difference]: Start difference. First operand 737 states. Second operand 4 states. [2019-10-03 02:41:00,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:00,556 INFO L93 Difference]: Finished difference Result 588 states and 944 transitions. [2019-10-03 02:41:00,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:41:00,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-10-03 02:41:00,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:00,596 INFO L225 Difference]: With dead ends: 588 [2019-10-03 02:41:00,596 INFO L226 Difference]: Without dead ends: 577 [2019-10-03 02:41:00,599 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:41:00,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-03 02:41:00,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-10-03 02:41:00,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-03 02:41:00,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 932 transitions. [2019-10-03 02:41:00,803 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 932 transitions. Word has length 107 [2019-10-03 02:41:00,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:00,804 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 932 transitions. [2019-10-03 02:41:00,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:00,804 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 932 transitions. [2019-10-03 02:41:00,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-03 02:41:00,810 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:00,811 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:00,811 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:00,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:00,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1793356700, now seen corresponding path program 1 times [2019-10-03 02:41:00,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:00,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:00,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:00,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:00,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:01,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:01,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:01,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:01,032 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:01,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:01,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:01,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:01,034 INFO L87 Difference]: Start difference. First operand 577 states and 932 transitions. Second operand 4 states. [2019-10-03 02:41:01,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:01,090 INFO L93 Difference]: Finished difference Result 579 states and 933 transitions. [2019-10-03 02:41:01,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:41:01,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-10-03 02:41:01,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:01,096 INFO L225 Difference]: With dead ends: 579 [2019-10-03 02:41:01,097 INFO L226 Difference]: Without dead ends: 577 [2019-10-03 02:41:01,098 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:41:01,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-03 02:41:01,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-10-03 02:41:01,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-03 02:41:01,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 931 transitions. [2019-10-03 02:41:01,128 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 931 transitions. Word has length 110 [2019-10-03 02:41:01,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:01,130 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 931 transitions. [2019-10-03 02:41:01,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:01,131 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 931 transitions. [2019-10-03 02:41:01,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-03 02:41:01,136 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:01,137 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:01,137 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:01,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:01,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1568343631, now seen corresponding path program 1 times [2019-10-03 02:41:01,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:01,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:01,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:01,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:01,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:01,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:01,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:01,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:01,311 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:01,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:01,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:01,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:01,313 INFO L87 Difference]: Start difference. First operand 577 states and 931 transitions. Second operand 4 states. [2019-10-03 02:41:01,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:01,372 INFO L93 Difference]: Finished difference Result 579 states and 932 transitions. [2019-10-03 02:41:01,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:41:01,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-10-03 02:41:01,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:01,380 INFO L225 Difference]: With dead ends: 579 [2019-10-03 02:41:01,380 INFO L226 Difference]: Without dead ends: 577 [2019-10-03 02:41:01,381 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:41:01,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-03 02:41:01,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-10-03 02:41:01,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-03 02:41:01,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 930 transitions. [2019-10-03 02:41:01,419 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 930 transitions. Word has length 111 [2019-10-03 02:41:01,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:01,419 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 930 transitions. [2019-10-03 02:41:01,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:01,419 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 930 transitions. [2019-10-03 02:41:01,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-03 02:41:01,428 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:01,428 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:01,429 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:01,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:01,429 INFO L82 PathProgramCache]: Analyzing trace with hash 84938816, now seen corresponding path program 1 times [2019-10-03 02:41:01,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:01,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:01,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:01,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:01,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:01,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:01,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:01,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:01,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:01,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:01,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:01,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:01,630 INFO L87 Difference]: Start difference. First operand 577 states and 930 transitions. Second operand 4 states. [2019-10-03 02:41:01,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:01,681 INFO L93 Difference]: Finished difference Result 579 states and 931 transitions. [2019-10-03 02:41:01,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:41:01,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-03 02:41:01,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:01,690 INFO L225 Difference]: With dead ends: 579 [2019-10-03 02:41:01,690 INFO L226 Difference]: Without dead ends: 577 [2019-10-03 02:41:01,691 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:41:01,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-03 02:41:01,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-10-03 02:41:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-03 02:41:01,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 929 transitions. [2019-10-03 02:41:01,718 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 929 transitions. Word has length 112 [2019-10-03 02:41:01,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:01,719 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 929 transitions. [2019-10-03 02:41:01,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:01,719 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 929 transitions. [2019-10-03 02:41:01,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-03 02:41:01,723 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:01,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:01,723 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:01,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:01,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1272870165, now seen corresponding path program 1 times [2019-10-03 02:41:01,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:01,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:01,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:01,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:01,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:01,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:01,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:01,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:01,882 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:01,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:01,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:01,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:01,885 INFO L87 Difference]: Start difference. First operand 577 states and 929 transitions. Second operand 4 states. [2019-10-03 02:41:01,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:01,940 INFO L93 Difference]: Finished difference Result 579 states and 930 transitions. [2019-10-03 02:41:01,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:41:01,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-03 02:41:01,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:01,953 INFO L225 Difference]: With dead ends: 579 [2019-10-03 02:41:01,953 INFO L226 Difference]: Without dead ends: 577 [2019-10-03 02:41:01,954 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:41:01,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-03 02:41:01,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-10-03 02:41:01,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-03 02:41:01,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 928 transitions. [2019-10-03 02:41:01,976 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 928 transitions. Word has length 113 [2019-10-03 02:41:01,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:01,977 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 928 transitions. [2019-10-03 02:41:01,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:01,977 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 928 transitions. [2019-10-03 02:41:01,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-03 02:41:01,981 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:01,981 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:01,981 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:01,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:01,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1262791708, now seen corresponding path program 1 times [2019-10-03 02:41:01,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:01,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:01,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:01,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:01,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:02,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:02,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:02,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:41:02,185 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:02,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:41:02,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:41:02,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:41:02,187 INFO L87 Difference]: Start difference. First operand 577 states and 928 transitions. Second operand 10 states. [2019-10-03 02:41:02,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:02,341 INFO L93 Difference]: Finished difference Result 586 states and 939 transitions. [2019-10-03 02:41:02,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:41:02,342 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2019-10-03 02:41:02,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:02,347 INFO L225 Difference]: With dead ends: 586 [2019-10-03 02:41:02,347 INFO L226 Difference]: Without dead ends: 586 [2019-10-03 02:41:02,348 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:41:02,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-03 02:41:02,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2019-10-03 02:41:02,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-03 02:41:02,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 937 transitions. [2019-10-03 02:41:02,373 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 937 transitions. Word has length 114 [2019-10-03 02:41:02,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:02,374 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 937 transitions. [2019-10-03 02:41:02,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:41:02,374 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 937 transitions. [2019-10-03 02:41:02,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-03 02:41:02,378 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:02,378 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:02,378 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:02,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:02,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1682308539, now seen corresponding path program 1 times [2019-10-03 02:41:02,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:02,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:02,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:02,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:02,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:02,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:02,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:02,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:02,490 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:02,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:02,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:02,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:02,492 INFO L87 Difference]: Start difference. First operand 584 states and 937 transitions. Second operand 4 states. [2019-10-03 02:41:02,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:02,546 INFO L93 Difference]: Finished difference Result 582 states and 932 transitions. [2019-10-03 02:41:02,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:41:02,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-03 02:41:02,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:02,552 INFO L225 Difference]: With dead ends: 582 [2019-10-03 02:41:02,552 INFO L226 Difference]: Without dead ends: 571 [2019-10-03 02:41:02,553 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:41:02,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-03 02:41:02,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-03 02:41:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-03 02:41:02,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 914 transitions. [2019-10-03 02:41:02,628 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 914 transitions. Word has length 114 [2019-10-03 02:41:02,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:02,628 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 914 transitions. [2019-10-03 02:41:02,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:02,629 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 914 transitions. [2019-10-03 02:41:02,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-03 02:41:02,632 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:02,632 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:02,633 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:02,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:02,633 INFO L82 PathProgramCache]: Analyzing trace with hash 441821781, now seen corresponding path program 1 times [2019-10-03 02:41:02,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:02,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:02,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:02,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:02,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:02,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:02,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:02,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:41:02,780 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:02,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:41:02,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:41:02,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:41:02,781 INFO L87 Difference]: Start difference. First operand 571 states and 914 transitions. Second operand 6 states. [2019-10-03 02:41:03,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:03,008 INFO L93 Difference]: Finished difference Result 574 states and 917 transitions. [2019-10-03 02:41:03,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:41:03,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-10-03 02:41:03,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:03,013 INFO L225 Difference]: With dead ends: 574 [2019-10-03 02:41:03,013 INFO L226 Difference]: Without dead ends: 571 [2019-10-03 02:41:03,014 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:41:03,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-03 02:41:03,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-03 02:41:03,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-03 02:41:03,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 910 transitions. [2019-10-03 02:41:03,035 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 910 transitions. Word has length 115 [2019-10-03 02:41:03,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:03,037 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 910 transitions. [2019-10-03 02:41:03,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:41:03,037 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 910 transitions. [2019-10-03 02:41:03,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-03 02:41:03,041 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:03,042 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:03,042 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:03,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:03,042 INFO L82 PathProgramCache]: Analyzing trace with hash 766133599, now seen corresponding path program 1 times [2019-10-03 02:41:03,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:03,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:03,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:03,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:03,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:03,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:03,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:03,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:41:03,184 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:03,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:41:03,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:41:03,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:41:03,185 INFO L87 Difference]: Start difference. First operand 571 states and 910 transitions. Second operand 6 states. [2019-10-03 02:41:03,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:03,394 INFO L93 Difference]: Finished difference Result 574 states and 913 transitions. [2019-10-03 02:41:03,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:41:03,395 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2019-10-03 02:41:03,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:03,400 INFO L225 Difference]: With dead ends: 574 [2019-10-03 02:41:03,400 INFO L226 Difference]: Without dead ends: 571 [2019-10-03 02:41:03,400 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:41:03,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-03 02:41:03,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-03 02:41:03,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-03 02:41:03,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 906 transitions. [2019-10-03 02:41:03,418 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 906 transitions. Word has length 116 [2019-10-03 02:41:03,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:03,418 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 906 transitions. [2019-10-03 02:41:03,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:41:03,418 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 906 transitions. [2019-10-03 02:41:03,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-03 02:41:03,422 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:03,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:03,422 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:03,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:03,423 INFO L82 PathProgramCache]: Analyzing trace with hash -188511270, now seen corresponding path program 1 times [2019-10-03 02:41:03,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:03,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:03,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:03,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:03,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:03,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:03,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:03,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:41:03,592 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:03,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:41:03,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:41:03,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:41:03,593 INFO L87 Difference]: Start difference. First operand 571 states and 906 transitions. Second operand 6 states. [2019-10-03 02:41:03,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:03,803 INFO L93 Difference]: Finished difference Result 574 states and 909 transitions. [2019-10-03 02:41:03,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:41:03,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-10-03 02:41:03,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:03,808 INFO L225 Difference]: With dead ends: 574 [2019-10-03 02:41:03,808 INFO L226 Difference]: Without dead ends: 571 [2019-10-03 02:41:03,809 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:41:03,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-03 02:41:03,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-03 02:41:03,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-03 02:41:03,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 902 transitions. [2019-10-03 02:41:03,827 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 902 transitions. Word has length 117 [2019-10-03 02:41:03,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:03,828 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 902 transitions. [2019-10-03 02:41:03,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:41:03,828 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 902 transitions. [2019-10-03 02:41:03,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-03 02:41:03,831 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:03,832 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:03,832 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:03,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:03,832 INFO L82 PathProgramCache]: Analyzing trace with hash 266348634, now seen corresponding path program 1 times [2019-10-03 02:41:03,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:03,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:03,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:03,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:03,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:03,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:03,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:03,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:41:03,956 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:03,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:41:03,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:41:03,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:41:03,958 INFO L87 Difference]: Start difference. First operand 571 states and 902 transitions. Second operand 7 states. [2019-10-03 02:41:04,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:04,033 INFO L93 Difference]: Finished difference Result 574 states and 905 transitions. [2019-10-03 02:41:04,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:41:04,034 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-10-03 02:41:04,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:04,039 INFO L225 Difference]: With dead ends: 574 [2019-10-03 02:41:04,039 INFO L226 Difference]: Without dead ends: 550 [2019-10-03 02:41:04,039 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:41:04,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-10-03 02:41:04,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2019-10-03 02:41:04,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-10-03 02:41:04,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 868 transitions. [2019-10-03 02:41:04,056 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 868 transitions. Word has length 117 [2019-10-03 02:41:04,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:04,056 INFO L475 AbstractCegarLoop]: Abstraction has 550 states and 868 transitions. [2019-10-03 02:41:04,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:41:04,057 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 868 transitions. [2019-10-03 02:41:04,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-03 02:41:04,060 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:04,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:04,060 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:04,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:04,061 INFO L82 PathProgramCache]: Analyzing trace with hash -2136107772, now seen corresponding path program 1 times [2019-10-03 02:41:04,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:04,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:04,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:04,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:04,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:04,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:04,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:04,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:41:04,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:04,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:41:04,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:41:04,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:41:04,187 INFO L87 Difference]: Start difference. First operand 550 states and 868 transitions. Second operand 6 states. [2019-10-03 02:41:04,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:04,308 INFO L93 Difference]: Finished difference Result 553 states and 871 transitions. [2019-10-03 02:41:04,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:41:04,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-10-03 02:41:04,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:04,315 INFO L225 Difference]: With dead ends: 553 [2019-10-03 02:41:04,316 INFO L226 Difference]: Without dead ends: 550 [2019-10-03 02:41:04,316 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:41:04,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-10-03 02:41:04,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2019-10-03 02:41:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-10-03 02:41:04,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 867 transitions. [2019-10-03 02:41:04,337 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 867 transitions. Word has length 118 [2019-10-03 02:41:04,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:04,338 INFO L475 AbstractCegarLoop]: Abstraction has 550 states and 867 transitions. [2019-10-03 02:41:04,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:41:04,339 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 867 transitions. [2019-10-03 02:41:04,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-03 02:41:04,343 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:04,343 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:04,344 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:04,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:04,344 INFO L82 PathProgramCache]: Analyzing trace with hash -505466529, now seen corresponding path program 1 times [2019-10-03 02:41:04,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:04,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:04,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:04,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:04,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:04,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:04,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:04,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:41:04,469 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:04,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:41:04,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:41:04,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:41:04,470 INFO L87 Difference]: Start difference. First operand 550 states and 867 transitions. Second operand 6 states. [2019-10-03 02:41:04,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:04,564 INFO L93 Difference]: Finished difference Result 553 states and 870 transitions. [2019-10-03 02:41:04,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:41:04,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-10-03 02:41:04,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:04,569 INFO L225 Difference]: With dead ends: 553 [2019-10-03 02:41:04,569 INFO L226 Difference]: Without dead ends: 550 [2019-10-03 02:41:04,570 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:41:04,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-10-03 02:41:04,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2019-10-03 02:41:04,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-10-03 02:41:04,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 866 transitions. [2019-10-03 02:41:04,587 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 866 transitions. Word has length 119 [2019-10-03 02:41:04,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:04,587 INFO L475 AbstractCegarLoop]: Abstraction has 550 states and 866 transitions. [2019-10-03 02:41:04,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:41:04,588 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 866 transitions. [2019-10-03 02:41:04,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-03 02:41:04,591 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:04,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:04,592 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:04,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:04,592 INFO L82 PathProgramCache]: Analyzing trace with hash -585955541, now seen corresponding path program 1 times [2019-10-03 02:41:04,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:04,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:04,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:04,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:04,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:04,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:04,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:04,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:04,740 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:04,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:04,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:04,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:04,741 INFO L87 Difference]: Start difference. First operand 550 states and 866 transitions. Second operand 4 states. [2019-10-03 02:41:04,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:04,790 INFO L93 Difference]: Finished difference Result 553 states and 869 transitions. [2019-10-03 02:41:04,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:41:04,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-10-03 02:41:04,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:04,795 INFO L225 Difference]: With dead ends: 553 [2019-10-03 02:41:04,795 INFO L226 Difference]: Without dead ends: 550 [2019-10-03 02:41:04,796 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:41:04,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-10-03 02:41:04,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2019-10-03 02:41:04,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-10-03 02:41:04,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 865 transitions. [2019-10-03 02:41:04,815 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 865 transitions. Word has length 120 [2019-10-03 02:41:04,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:04,815 INFO L475 AbstractCegarLoop]: Abstraction has 550 states and 865 transitions. [2019-10-03 02:41:04,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:04,815 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 865 transitions. [2019-10-03 02:41:04,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-03 02:41:04,819 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:04,819 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:04,819 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:04,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:04,820 INFO L82 PathProgramCache]: Analyzing trace with hash 381395113, now seen corresponding path program 1 times [2019-10-03 02:41:04,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:04,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:04,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:04,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:04,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:04,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:05,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:05,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:41:05,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:05,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:41:05,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:41:05,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:41:05,003 INFO L87 Difference]: Start difference. First operand 550 states and 865 transitions. Second operand 12 states. [2019-10-03 02:41:05,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:05,251 INFO L93 Difference]: Finished difference Result 554 states and 868 transitions. [2019-10-03 02:41:05,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:41:05,251 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 120 [2019-10-03 02:41:05,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:05,257 INFO L225 Difference]: With dead ends: 554 [2019-10-03 02:41:05,258 INFO L226 Difference]: Without dead ends: 550 [2019-10-03 02:41:05,260 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:41:05,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-10-03 02:41:05,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2019-10-03 02:41:05,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-10-03 02:41:05,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 864 transitions. [2019-10-03 02:41:05,291 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 864 transitions. Word has length 120 [2019-10-03 02:41:05,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:05,291 INFO L475 AbstractCegarLoop]: Abstraction has 550 states and 864 transitions. [2019-10-03 02:41:05,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:41:05,292 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 864 transitions. [2019-10-03 02:41:05,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-03 02:41:05,297 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:05,297 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:05,298 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:05,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:05,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1579499078, now seen corresponding path program 1 times [2019-10-03 02:41:05,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:05,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:05,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:05,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:05,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:05,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:05,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:05,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:41:05,583 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:05,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:41:05,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:41:05,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:41:05,584 INFO L87 Difference]: Start difference. First operand 550 states and 864 transitions. Second operand 9 states. [2019-10-03 02:41:09,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:09,297 INFO L93 Difference]: Finished difference Result 556 states and 885 transitions. [2019-10-03 02:41:09,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:41:09,298 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-10-03 02:41:09,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:09,304 INFO L225 Difference]: With dead ends: 556 [2019-10-03 02:41:09,304 INFO L226 Difference]: Without dead ends: 556 [2019-10-03 02:41:09,305 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:41:09,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-10-03 02:41:09,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 554. [2019-10-03 02:41:09,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-10-03 02:41:09,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 883 transitions. [2019-10-03 02:41:09,325 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 883 transitions. Word has length 121 [2019-10-03 02:41:09,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:09,325 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 883 transitions. [2019-10-03 02:41:09,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:41:09,325 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 883 transitions. [2019-10-03 02:41:09,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-03 02:41:09,329 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:09,329 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:09,329 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:09,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:09,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1625636341, now seen corresponding path program 1 times [2019-10-03 02:41:09,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:09,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:09,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:09,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:09,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:09,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:09,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:09,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:41:09,536 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:09,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:41:09,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:41:09,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:41:09,537 INFO L87 Difference]: Start difference. First operand 554 states and 883 transitions. Second operand 8 states. [2019-10-03 02:41:16,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:16,096 INFO L93 Difference]: Finished difference Result 1454 states and 2333 transitions. [2019-10-03 02:41:16,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-03 02:41:16,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-10-03 02:41:16,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:16,110 INFO L225 Difference]: With dead ends: 1454 [2019-10-03 02:41:16,110 INFO L226 Difference]: Without dead ends: 1454 [2019-10-03 02:41:16,111 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:41:16,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2019-10-03 02:41:16,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1415. [2019-10-03 02:41:16,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1415 states. [2019-10-03 02:41:16,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 2280 transitions. [2019-10-03 02:41:16,167 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 2280 transitions. Word has length 122 [2019-10-03 02:41:16,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:16,168 INFO L475 AbstractCegarLoop]: Abstraction has 1415 states and 2280 transitions. [2019-10-03 02:41:16,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:41:16,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 2280 transitions. [2019-10-03 02:41:16,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-03 02:41:16,171 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:16,171 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:16,171 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:16,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:16,172 INFO L82 PathProgramCache]: Analyzing trace with hash -430074642, now seen corresponding path program 1 times [2019-10-03 02:41:16,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:16,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:16,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:16,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:16,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:16,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:16,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:16,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:41:16,319 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:16,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:41:16,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:41:16,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:41:16,320 INFO L87 Difference]: Start difference. First operand 1415 states and 2280 transitions. Second operand 9 states. [2019-10-03 02:41:24,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:24,172 INFO L93 Difference]: Finished difference Result 3197 states and 5266 transitions. [2019-10-03 02:41:24,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 02:41:24,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-10-03 02:41:24,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:24,198 INFO L225 Difference]: With dead ends: 3197 [2019-10-03 02:41:24,199 INFO L226 Difference]: Without dead ends: 3197 [2019-10-03 02:41:24,199 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:41:24,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2019-10-03 02:41:24,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 2974. [2019-10-03 02:41:24,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2974 states. [2019-10-03 02:41:24,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2974 states and 4851 transitions. [2019-10-03 02:41:24,321 INFO L78 Accepts]: Start accepts. Automaton has 2974 states and 4851 transitions. Word has length 128 [2019-10-03 02:41:24,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:24,324 INFO L475 AbstractCegarLoop]: Abstraction has 2974 states and 4851 transitions. [2019-10-03 02:41:24,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:41:24,324 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 4851 transitions. [2019-10-03 02:41:24,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-03 02:41:24,327 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:24,327 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:24,327 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:24,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:24,328 INFO L82 PathProgramCache]: Analyzing trace with hash -437834001, now seen corresponding path program 1 times [2019-10-03 02:41:24,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:24,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:24,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:24,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:24,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:24,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:24,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:24,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:41:24,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:24,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:41:24,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:41:24,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:41:24,473 INFO L87 Difference]: Start difference. First operand 2974 states and 4851 transitions. Second operand 7 states. [2019-10-03 02:41:28,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:28,930 INFO L93 Difference]: Finished difference Result 5510 states and 9071 transitions. [2019-10-03 02:41:28,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:41:28,930 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2019-10-03 02:41:28,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:28,979 INFO L225 Difference]: With dead ends: 5510 [2019-10-03 02:41:28,980 INFO L226 Difference]: Without dead ends: 5510 [2019-10-03 02:41:28,981 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:41:28,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5510 states. [2019-10-03 02:41:29,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5510 to 5417. [2019-10-03 02:41:29,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5417 states. [2019-10-03 02:41:29,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5417 states to 5417 states and 8909 transitions. [2019-10-03 02:41:29,192 INFO L78 Accepts]: Start accepts. Automaton has 5417 states and 8909 transitions. Word has length 128 [2019-10-03 02:41:29,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:29,192 INFO L475 AbstractCegarLoop]: Abstraction has 5417 states and 8909 transitions. [2019-10-03 02:41:29,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:41:29,192 INFO L276 IsEmpty]: Start isEmpty. Operand 5417 states and 8909 transitions. [2019-10-03 02:41:29,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-03 02:41:29,197 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:29,198 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:29,198 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:29,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:29,200 INFO L82 PathProgramCache]: Analyzing trace with hash -630018540, now seen corresponding path program 1 times [2019-10-03 02:41:29,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:29,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:29,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:29,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:29,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:29,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:29,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:29,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:41:29,373 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:29,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:41:29,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:41:29,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:41:29,374 INFO L87 Difference]: Start difference. First operand 5417 states and 8909 transitions. Second operand 5 states. [2019-10-03 02:41:29,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:29,469 INFO L93 Difference]: Finished difference Result 5535 states and 9085 transitions. [2019-10-03 02:41:29,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:41:29,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-03 02:41:29,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:29,522 INFO L225 Difference]: With dead ends: 5535 [2019-10-03 02:41:29,522 INFO L226 Difference]: Without dead ends: 5535 [2019-10-03 02:41:29,523 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:41:29,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5535 states. [2019-10-03 02:41:29,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5535 to 5469. [2019-10-03 02:41:29,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5469 states. [2019-10-03 02:41:29,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5469 states to 5469 states and 8982 transitions. [2019-10-03 02:41:29,797 INFO L78 Accepts]: Start accepts. Automaton has 5469 states and 8982 transitions. Word has length 133 [2019-10-03 02:41:29,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:29,798 INFO L475 AbstractCegarLoop]: Abstraction has 5469 states and 8982 transitions. [2019-10-03 02:41:29,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:41:29,799 INFO L276 IsEmpty]: Start isEmpty. Operand 5469 states and 8982 transitions. [2019-10-03 02:41:29,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-03 02:41:29,804 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:29,805 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:29,805 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:29,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:29,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1275605709, now seen corresponding path program 1 times [2019-10-03 02:41:29,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:29,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:29,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:29,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:29,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:30,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:41:30,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:30,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:41:30,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:30,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:41:30,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:41:30,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:41:30,034 INFO L87 Difference]: Start difference. First operand 5469 states and 8982 transitions. Second operand 7 states. [2019-10-03 02:41:30,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:30,237 INFO L93 Difference]: Finished difference Result 5949 states and 9740 transitions. [2019-10-03 02:41:30,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:41:30,238 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2019-10-03 02:41:30,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:30,294 INFO L225 Difference]: With dead ends: 5949 [2019-10-03 02:41:30,294 INFO L226 Difference]: Without dead ends: 5469 [2019-10-03 02:41:30,295 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:41:30,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5469 states. [2019-10-03 02:41:30,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5469 to 5469. [2019-10-03 02:41:30,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5469 states. [2019-10-03 02:41:30,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5469 states to 5469 states and 8890 transitions. [2019-10-03 02:41:30,523 INFO L78 Accepts]: Start accepts. Automaton has 5469 states and 8890 transitions. Word has length 140 [2019-10-03 02:41:30,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:30,524 INFO L475 AbstractCegarLoop]: Abstraction has 5469 states and 8890 transitions. [2019-10-03 02:41:30,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:41:30,524 INFO L276 IsEmpty]: Start isEmpty. Operand 5469 states and 8890 transitions. [2019-10-03 02:41:30,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-03 02:41:30,531 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:30,531 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:30,531 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:30,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:30,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1809403985, now seen corresponding path program 1 times [2019-10-03 02:41:30,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:30,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:30,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:30,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:30,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:30,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-03 02:41:30,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:30,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:41:30,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:30,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:41:30,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:41:30,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:41:30,717 INFO L87 Difference]: Start difference. First operand 5469 states and 8890 transitions. Second operand 7 states. [2019-10-03 02:41:35,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:35,637 INFO L93 Difference]: Finished difference Result 5816 states and 9384 transitions. [2019-10-03 02:41:35,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 02:41:35,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2019-10-03 02:41:35,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:35,682 INFO L225 Difference]: With dead ends: 5816 [2019-10-03 02:41:35,683 INFO L226 Difference]: Without dead ends: 5816 [2019-10-03 02:41:35,685 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:41:35,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5816 states. [2019-10-03 02:41:35,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5816 to 5701. [2019-10-03 02:41:35,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5701 states. [2019-10-03 02:41:35,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5701 states to 5701 states and 9204 transitions. [2019-10-03 02:41:35,949 INFO L78 Accepts]: Start accepts. Automaton has 5701 states and 9204 transitions. Word has length 145 [2019-10-03 02:41:35,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:35,950 INFO L475 AbstractCegarLoop]: Abstraction has 5701 states and 9204 transitions. [2019-10-03 02:41:35,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:41:35,950 INFO L276 IsEmpty]: Start isEmpty. Operand 5701 states and 9204 transitions. [2019-10-03 02:41:35,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-03 02:41:35,958 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:35,958 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:35,959 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:35,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:35,960 INFO L82 PathProgramCache]: Analyzing trace with hash 364131353, now seen corresponding path program 1 times [2019-10-03 02:41:35,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:35,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:35,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:35,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:35,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:36,188 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:41:36,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:36,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:36,189 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:36,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:36,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:36,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:36,190 INFO L87 Difference]: Start difference. First operand 5701 states and 9204 transitions. Second operand 4 states. [2019-10-03 02:41:38,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:38,804 INFO L93 Difference]: Finished difference Result 12349 states and 20729 transitions. [2019-10-03 02:41:38,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:41:38,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-10-03 02:41:38,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:38,886 INFO L225 Difference]: With dead ends: 12349 [2019-10-03 02:41:38,887 INFO L226 Difference]: Without dead ends: 12349 [2019-10-03 02:41:38,888 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:41:38,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12349 states. [2019-10-03 02:41:39,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12349 to 12195. [2019-10-03 02:41:39,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12195 states. [2019-10-03 02:41:39,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12195 states to 12195 states and 20362 transitions. [2019-10-03 02:41:39,317 INFO L78 Accepts]: Start accepts. Automaton has 12195 states and 20362 transitions. Word has length 150 [2019-10-03 02:41:39,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:39,318 INFO L475 AbstractCegarLoop]: Abstraction has 12195 states and 20362 transitions. [2019-10-03 02:41:39,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:39,318 INFO L276 IsEmpty]: Start isEmpty. Operand 12195 states and 20362 transitions. [2019-10-03 02:41:39,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-03 02:41:39,324 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:39,324 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:39,324 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:39,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:39,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1434777126, now seen corresponding path program 1 times [2019-10-03 02:41:39,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:39,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:39,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:39,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:39,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:39,497 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:41:39,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:39,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:41:39,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:39,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:41:39,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:41:39,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:41:39,502 INFO L87 Difference]: Start difference. First operand 12195 states and 20362 transitions. Second operand 11 states. [2019-10-03 02:41:46,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:46,367 INFO L93 Difference]: Finished difference Result 14862 states and 24424 transitions. [2019-10-03 02:41:46,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-03 02:41:46,368 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 153 [2019-10-03 02:41:46,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:46,447 INFO L225 Difference]: With dead ends: 14862 [2019-10-03 02:41:46,448 INFO L226 Difference]: Without dead ends: 14838 [2019-10-03 02:41:46,448 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-10-03 02:41:46,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14838 states. [2019-10-03 02:41:46,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14838 to 14515. [2019-10-03 02:41:46,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14515 states. [2019-10-03 02:41:46,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14515 states to 14515 states and 23742 transitions. [2019-10-03 02:41:46,913 INFO L78 Accepts]: Start accepts. Automaton has 14515 states and 23742 transitions. Word has length 153 [2019-10-03 02:41:46,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:46,914 INFO L475 AbstractCegarLoop]: Abstraction has 14515 states and 23742 transitions. [2019-10-03 02:41:46,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:41:46,914 INFO L276 IsEmpty]: Start isEmpty. Operand 14515 states and 23742 transitions. [2019-10-03 02:41:46,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-03 02:41:46,921 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:46,921 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:46,922 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:46,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:46,922 INFO L82 PathProgramCache]: Analyzing trace with hash -490756185, now seen corresponding path program 1 times [2019-10-03 02:41:46,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:46,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:46,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:46,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:46,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:47,044 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:41:47,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:47,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:47,045 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:47,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:47,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:47,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:47,046 INFO L87 Difference]: Start difference. First operand 14515 states and 23742 transitions. Second operand 4 states. [2019-10-03 02:41:49,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:49,752 INFO L93 Difference]: Finished difference Result 31655 states and 55148 transitions. [2019-10-03 02:41:49,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:41:49,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-10-03 02:41:49,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:49,951 INFO L225 Difference]: With dead ends: 31655 [2019-10-03 02:41:49,952 INFO L226 Difference]: Without dead ends: 31655 [2019-10-03 02:41:49,952 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:41:49,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31655 states. [2019-10-03 02:41:50,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31655 to 31308. [2019-10-03 02:41:50,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31308 states. [2019-10-03 02:41:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31308 states to 31308 states and 53888 transitions. [2019-10-03 02:41:51,039 INFO L78 Accepts]: Start accepts. Automaton has 31308 states and 53888 transitions. Word has length 153 [2019-10-03 02:41:51,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:51,039 INFO L475 AbstractCegarLoop]: Abstraction has 31308 states and 53888 transitions. [2019-10-03 02:41:51,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:51,039 INFO L276 IsEmpty]: Start isEmpty. Operand 31308 states and 53888 transitions. [2019-10-03 02:41:51,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-03 02:41:51,047 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:51,047 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:51,048 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:51,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:51,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1996856827, now seen corresponding path program 1 times [2019-10-03 02:41:51,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:51,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:51,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:51,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:51,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:51,156 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:41:51,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:51,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:51,156 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:51,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:51,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:51,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:51,157 INFO L87 Difference]: Start difference. First operand 31308 states and 53888 transitions. Second operand 4 states. [2019-10-03 02:41:53,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:53,881 INFO L93 Difference]: Finished difference Result 69803 states and 134076 transitions. [2019-10-03 02:41:53,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:41:53,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-10-03 02:41:53,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:54,384 INFO L225 Difference]: With dead ends: 69803 [2019-10-03 02:41:54,385 INFO L226 Difference]: Without dead ends: 69803 [2019-10-03 02:41:54,385 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:41:54,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69803 states. [2019-10-03 02:41:57,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69803 to 68991. [2019-10-03 02:41:57,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68991 states. [2019-10-03 02:42:00,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68991 states to 68991 states and 129145 transitions. [2019-10-03 02:42:00,340 INFO L78 Accepts]: Start accepts. Automaton has 68991 states and 129145 transitions. Word has length 152 [2019-10-03 02:42:00,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:00,341 INFO L475 AbstractCegarLoop]: Abstraction has 68991 states and 129145 transitions. [2019-10-03 02:42:00,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:42:00,341 INFO L276 IsEmpty]: Start isEmpty. Operand 68991 states and 129145 transitions. [2019-10-03 02:42:00,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-03 02:42:00,349 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:00,350 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:00,350 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:00,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:00,351 INFO L82 PathProgramCache]: Analyzing trace with hash 788811337, now seen corresponding path program 1 times [2019-10-03 02:42:00,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:00,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:00,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:00,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:00,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:00,459 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:42:00,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:00,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:42:00,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:00,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:42:00,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:42:00,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:42:00,461 INFO L87 Difference]: Start difference. First operand 68991 states and 129145 transitions. Second operand 4 states. [2019-10-03 02:42:04,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:04,488 INFO L93 Difference]: Finished difference Result 157651 states and 353882 transitions. [2019-10-03 02:42:04,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:42:04,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-10-03 02:42:04,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:06,005 INFO L225 Difference]: With dead ends: 157651 [2019-10-03 02:42:06,005 INFO L226 Difference]: Without dead ends: 157651 [2019-10-03 02:42:06,005 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:42:06,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157651 states. [2019-10-03 02:42:13,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157651 to 155670. [2019-10-03 02:42:13,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155670 states. [2019-10-03 02:42:14,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155670 states to 155670 states and 332586 transitions. [2019-10-03 02:42:14,835 INFO L78 Accepts]: Start accepts. Automaton has 155670 states and 332586 transitions. Word has length 155 [2019-10-03 02:42:14,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:42:14,835 INFO L475 AbstractCegarLoop]: Abstraction has 155670 states and 332586 transitions. [2019-10-03 02:42:14,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:42:14,835 INFO L276 IsEmpty]: Start isEmpty. Operand 155670 states and 332586 transitions. [2019-10-03 02:42:14,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-03 02:42:14,846 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:42:14,846 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:42:14,847 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:42:14,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:42:14,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1317922684, now seen corresponding path program 1 times [2019-10-03 02:42:14,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:42:14,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:14,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:42:14,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:42:14,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:42:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:42:14,964 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-03 02:42:14,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:42:14,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:42:14,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:42:14,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:42:14,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:42:14,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:42:14,966 INFO L87 Difference]: Start difference. First operand 155670 states and 332586 transitions. Second operand 4 states. [2019-10-03 02:42:26,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:42:26,614 INFO L93 Difference]: Finished difference Result 365283 states and 1036571 transitions. [2019-10-03 02:42:26,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:42:26,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-10-03 02:42:26,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:42:30,305 INFO L225 Difference]: With dead ends: 365283 [2019-10-03 02:42:30,306 INFO L226 Difference]: Without dead ends: 365271 [2019-10-03 02:42:30,306 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:42:30,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365271 states. [2019-10-03 02:42:54,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365271 to 360235. [2019-10-03 02:42:54,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360235 states. [2019-10-03 02:43:09,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360235 states to 360235 states and 938631 transitions. [2019-10-03 02:43:09,685 INFO L78 Accepts]: Start accepts. Automaton has 360235 states and 938631 transitions. Word has length 156 [2019-10-03 02:43:09,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:43:09,685 INFO L475 AbstractCegarLoop]: Abstraction has 360235 states and 938631 transitions. [2019-10-03 02:43:09,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:43:09,685 INFO L276 IsEmpty]: Start isEmpty. Operand 360235 states and 938631 transitions. [2019-10-03 02:43:09,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-03 02:43:09,710 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:43:09,711 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:43:09,711 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:43:09,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:43:09,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1441985012, now seen corresponding path program 1 times [2019-10-03 02:43:09,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:43:09,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:09,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:43:09,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:43:09,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:43:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:43:09,825 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-03 02:43:09,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:43:09,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:43:09,826 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:43:09,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:43:09,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:43:09,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:43:09,827 INFO L87 Difference]: Start difference. First operand 360235 states and 938631 transitions. Second operand 5 states. [2019-10-03 02:43:24,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:43:24,612 INFO L93 Difference]: Finished difference Result 361835 states and 942111 transitions. [2019-10-03 02:43:24,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:43:24,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2019-10-03 02:43:24,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:43:27,032 INFO L225 Difference]: With dead ends: 361835 [2019-10-03 02:43:27,032 INFO L226 Difference]: Without dead ends: 361835 [2019-10-03 02:43:27,032 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:43:27,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361835 states. [2019-10-03 02:43:46,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361835 to 361515. [2019-10-03 02:43:46,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361515 states. [2019-10-03 02:44:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361515 states to 361515 states and 940039 transitions. [2019-10-03 02:44:12,905 INFO L78 Accepts]: Start accepts. Automaton has 361515 states and 940039 transitions. Word has length 212 [2019-10-03 02:44:12,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:44:12,906 INFO L475 AbstractCegarLoop]: Abstraction has 361515 states and 940039 transitions. [2019-10-03 02:44:12,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:44:12,906 INFO L276 IsEmpty]: Start isEmpty. Operand 361515 states and 940039 transitions. [2019-10-03 02:44:12,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-03 02:44:12,924 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:44:12,924 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:44:12,924 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:44:12,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:44:12,925 INFO L82 PathProgramCache]: Analyzing trace with hash -507768394, now seen corresponding path program 1 times [2019-10-03 02:44:12,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:44:12,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:12,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:44:12,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:44:12,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:44:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:44:13,087 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-03 02:44:13,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:44:13,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:44:13,088 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:44:13,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:44:13,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:44:13,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:44:13,089 INFO L87 Difference]: Start difference. First operand 361515 states and 940039 transitions. Second operand 8 states. [2019-10-03 02:44:27,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:44:27,413 INFO L93 Difference]: Finished difference Result 546278 states and 1517458 transitions. [2019-10-03 02:44:27,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:44:27,413 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 213 [2019-10-03 02:44:27,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted.