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_product29.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:32:12,580 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:32:12,583 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:32:12,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:32:12,603 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:32:12,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:32:12,608 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:32:12,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:32:12,623 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:32:12,625 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:32:12,626 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:32:12,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:32:12,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:32:12,632 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:32:12,635 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:32:12,637 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:32:12,638 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:32:12,641 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:32:12,643 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:32:12,649 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:32:12,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:32:12,656 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:32:12,660 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:32:12,660 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:32:12,663 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:32:12,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:32:12,663 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:32:12,666 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:32:12,667 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:32:12,668 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:32:12,669 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:32:12,670 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:32:12,670 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:32:12,671 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:32:12,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:32:12,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:32:12,674 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:32:12,674 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:32:12,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:32:12,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:32:12,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:32:12,679 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:32:12,706 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:32:12,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:32:12,707 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:32:12,707 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:32:12,708 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:32:12,708 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:32:12,708 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:32:12,708 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:32:12,709 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:32:12,709 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:32:12,711 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:32:12,712 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:32:12,712 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:32:12,713 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:32:12,713 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:32:12,713 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:32:12,713 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:32:12,713 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:32:12,714 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:32:12,714 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:32:12,714 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:32:12,714 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:32:12,714 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:32:12,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:32:12,715 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:32:12,715 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:32:12,715 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:32:12,716 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:32:12,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:32:12,716 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:32:12,767 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:32:12,786 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:32:12,789 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:32:12,791 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:32:12,792 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:32:12,793 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product29.cil.c [2019-09-10 02:32:12,868 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22038b6cf/6fbfb4e518df4f8fbe45f12b0102f92a/FLAGe581d1010 [2019-09-10 02:32:13,556 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:32:13,557 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product29.cil.c [2019-09-10 02:32:13,582 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22038b6cf/6fbfb4e518df4f8fbe45f12b0102f92a/FLAGe581d1010 [2019-09-10 02:32:13,783 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22038b6cf/6fbfb4e518df4f8fbe45f12b0102f92a [2019-09-10 02:32:13,791 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:32:13,793 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:32:13,794 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:32:13,794 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:32:13,798 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:32:13,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:32:13" (1/1) ... [2019-09-10 02:32:13,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2127733b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:13, skipping insertion in model container [2019-09-10 02:32:13,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:32:13" (1/1) ... [2019-09-10 02:32:13,809 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:32:13,886 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:32:14,548 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:32:14,575 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:32:14,759 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:32:14,824 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:32:14,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:14 WrapperNode [2019-09-10 02:32:14,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:32:14,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:32:14,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:32:14,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:32:14,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:14" (1/1) ... [2019-09-10 02:32:14,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:14" (1/1) ... [2019-09-10 02:32:14,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:14" (1/1) ... [2019-09-10 02:32:14,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:14" (1/1) ... [2019-09-10 02:32:14,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:14" (1/1) ... [2019-09-10 02:32:15,031 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:14" (1/1) ... [2019-09-10 02:32:15,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:14" (1/1) ... [2019-09-10 02:32:15,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:32:15,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:32:15,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:32:15,056 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:32:15,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:32:15,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:32:15,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:32:15,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:32:15,153 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-10 02:32:15,153 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-10 02:32:15,153 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-10 02:32:15,154 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-10 02:32:15,154 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-10 02:32:15,154 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-10 02:32:15,155 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-10 02:32:15,155 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-10 02:32:15,156 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:32:15,156 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:32:15,157 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-10 02:32:15,158 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-10 02:32:15,159 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-10 02:32:15,159 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-10 02:32:15,160 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-10 02:32:15,160 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-10 02:32:15,161 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-09-10 02:32:15,161 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-10 02:32:15,161 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-10 02:32:15,162 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-10 02:32:15,162 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-10 02:32:15,163 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-10 02:32:15,163 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-10 02:32:15,163 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-10 02:32:15,164 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-10 02:32:15,164 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-10 02:32:15,164 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-10 02:32:15,164 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-09-10 02:32:15,165 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-10 02:32:15,165 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-10 02:32:15,165 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-10 02:32:15,165 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-10 02:32:15,166 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-10 02:32:15,166 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-10 02:32:15,166 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-10 02:32:15,167 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-10 02:32:15,167 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-10 02:32:15,168 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-10 02:32:15,168 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:32:15,168 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:32:15,168 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:32:15,169 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:32:15,169 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:32:15,169 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:32:15,170 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-10 02:32:15,170 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-10 02:32:15,170 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-10 02:32:15,170 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-10 02:32:15,171 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-10 02:32:15,171 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-10 02:32:15,171 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-10 02:32:15,171 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-10 02:32:15,172 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-10 02:32:15,172 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-10 02:32:15,172 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-10 02:32:15,172 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-10 02:32:15,172 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-10 02:32:15,173 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-10 02:32:15,173 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:32:15,173 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-10 02:32:15,173 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:32:15,174 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-10 02:32:15,174 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-10 02:32:15,174 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-10 02:32:15,175 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-10 02:32:15,175 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-10 02:32:15,175 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-09-10 02:32:15,175 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-09-10 02:32:15,175 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-09-10 02:32:15,175 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-09-10 02:32:15,176 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:32:15,177 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:32:15,177 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:32:15,177 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:32:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:32:15,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:32:15,178 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-10 02:32:15,178 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-10 02:32:15,179 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-10 02:32:15,179 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-10 02:32:15,179 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-10 02:32:15,179 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-10 02:32:15,180 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-10 02:32:15,181 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-10 02:32:15,181 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:32:15,182 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-10 02:32:15,182 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-10 02:32:15,182 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:32:15,182 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:32:15,182 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-10 02:32:15,183 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-10 02:32:15,183 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-10 02:32:15,183 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-10 02:32:15,183 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-10 02:32:15,183 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-10 02:32:15,184 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-10 02:32:15,184 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-10 02:32:15,184 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-10 02:32:15,184 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-10 02:32:15,184 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-10 02:32:15,184 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-10 02:32:15,185 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-10 02:32:15,185 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-10 02:32:15,185 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-10 02:32:15,185 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-10 02:32:15,185 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-09-10 02:32:15,186 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-10 02:32:15,186 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-09-10 02:32:15,186 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-10 02:32:15,186 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-10 02:32:15,186 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-10 02:32:15,187 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-10 02:32:15,187 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-09-10 02:32:15,188 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-10 02:32:15,188 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-10 02:32:15,189 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-10 02:32:15,189 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-10 02:32:15,190 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-10 02:32:15,190 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-10 02:32:15,190 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-09-10 02:32:15,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:32:15,193 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-10 02:32:15,193 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:32:15,193 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:32:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:32:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:32:15,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:32:15,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:32:15,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:32:15,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:32:15,196 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:32:15,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:32:15,196 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:32:15,196 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:32:15,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:32:15,198 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:32:15,202 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:32:15,203 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:32:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-10 02:32:15,204 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-10 02:32:15,212 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-10 02:32:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-10 02:32:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-10 02:32:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-10 02:32:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-10 02:32:15,213 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-10 02:32:15,214 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-10 02:32:15,214 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-10 02:32:15,214 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-10 02:32:15,215 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-10 02:32:15,216 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-10 02:32:15,216 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-10 02:32:15,216 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:32:15,216 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-09-10 02:32:15,216 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-09-10 02:32:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-10 02:32:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:32:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:32:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:32:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:32:15,218 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-10 02:32:15,218 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-10 02:32:15,218 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:32:15,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:32:15,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:32:15,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:32:17,864 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:32:17,864 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-10 02:32:17,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:32:17 BoogieIcfgContainer [2019-09-10 02:32:17,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:32:17,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:32:17,867 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:32:17,873 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:32:17,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:32:13" (1/3) ... [2019-09-10 02:32:17,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c25a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:32:17, skipping insertion in model container [2019-09-10 02:32:17,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:32:14" (2/3) ... [2019-09-10 02:32:17,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c25a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:32:17, skipping insertion in model container [2019-09-10 02:32:17,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:32:17" (3/3) ... [2019-09-10 02:32:17,876 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product29.cil.c [2019-09-10 02:32:17,886 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:32:17,896 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:32:17,913 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:32:17,951 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:32:17,952 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:32:17,952 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:32:17,952 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:32:17,952 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:32:17,952 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:32:17,952 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:32:17,953 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:32:17,996 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states. [2019-09-10 02:32:18,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 02:32:18,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:18,041 INFO L399 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] [2019-09-10 02:32:18,046 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:18,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:18,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1653197611, now seen corresponding path program 1 times [2019-09-10 02:32:18,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:18,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:18,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:18,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:18,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:18,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:32:18,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:18,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:18,618 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:18,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:18,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:18,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:18,643 INFO L87 Difference]: Start difference. First operand 789 states. Second operand 4 states. [2019-09-10 02:32:18,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:18,838 INFO L93 Difference]: Finished difference Result 640 states and 1015 transitions. [2019-09-10 02:32:18,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:32:18,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-10 02:32:18,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:18,869 INFO L225 Difference]: With dead ends: 640 [2019-09-10 02:32:18,869 INFO L226 Difference]: Without dead ends: 629 [2019-09-10 02:32:18,871 INFO L628 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-09-10 02:32:18,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-09-10 02:32:18,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-09-10 02:32:18,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-09-10 02:32:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1003 transitions. [2019-09-10 02:32:18,970 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1003 transitions. Word has length 124 [2019-09-10 02:32:18,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:18,971 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 1003 transitions. [2019-09-10 02:32:18,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:18,971 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1003 transitions. [2019-09-10 02:32:18,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 02:32:18,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:18,978 INFO L399 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] [2019-09-10 02:32:18,979 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:18,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:18,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1610008943, now seen corresponding path program 1 times [2019-09-10 02:32:18,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:18,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:18,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:18,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:18,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:19,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:32:19,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:19,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:19,155 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:19,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:19,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:19,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:19,158 INFO L87 Difference]: Start difference. First operand 629 states and 1003 transitions. Second operand 4 states. [2019-09-10 02:32:19,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:19,229 INFO L93 Difference]: Finished difference Result 631 states and 1004 transitions. [2019-09-10 02:32:19,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:32:19,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-10 02:32:19,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:19,238 INFO L225 Difference]: With dead ends: 631 [2019-09-10 02:32:19,238 INFO L226 Difference]: Without dead ends: 629 [2019-09-10 02:32:19,239 INFO L628 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-09-10 02:32:19,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-09-10 02:32:19,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-09-10 02:32:19,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-09-10 02:32:19,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1002 transitions. [2019-09-10 02:32:19,297 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1002 transitions. Word has length 127 [2019-09-10 02:32:19,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:19,300 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 1002 transitions. [2019-09-10 02:32:19,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:19,304 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1002 transitions. [2019-09-10 02:32:19,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 02:32:19,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:19,315 INFO L399 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] [2019-09-10 02:32:19,316 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:19,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:19,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1101854388, now seen corresponding path program 1 times [2019-09-10 02:32:19,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:19,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:19,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:19,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:19,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:19,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:32:19,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:19,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:19,518 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:19,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:19,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:19,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:19,520 INFO L87 Difference]: Start difference. First operand 629 states and 1002 transitions. Second operand 4 states. [2019-09-10 02:32:19,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:19,580 INFO L93 Difference]: Finished difference Result 631 states and 1003 transitions. [2019-09-10 02:32:19,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:32:19,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-10 02:32:19,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:19,587 INFO L225 Difference]: With dead ends: 631 [2019-09-10 02:32:19,588 INFO L226 Difference]: Without dead ends: 629 [2019-09-10 02:32:19,588 INFO L628 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-09-10 02:32:19,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-09-10 02:32:19,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-09-10 02:32:19,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-09-10 02:32:19,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1001 transitions. [2019-09-10 02:32:19,614 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1001 transitions. Word has length 128 [2019-09-10 02:32:19,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:19,615 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 1001 transitions. [2019-09-10 02:32:19,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:19,615 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1001 transitions. [2019-09-10 02:32:19,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 02:32:19,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:19,620 INFO L399 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] [2019-09-10 02:32:19,620 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:19,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:19,621 INFO L82 PathProgramCache]: Analyzing trace with hash -862468589, now seen corresponding path program 1 times [2019-09-10 02:32:19,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:19,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:19,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:19,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:19,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:19,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:32:19,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:19,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:19,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:19,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:19,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:19,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:19,826 INFO L87 Difference]: Start difference. First operand 629 states and 1001 transitions. Second operand 4 states. [2019-09-10 02:32:19,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:19,882 INFO L93 Difference]: Finished difference Result 631 states and 1002 transitions. [2019-09-10 02:32:19,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:32:19,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-10 02:32:19,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:19,889 INFO L225 Difference]: With dead ends: 631 [2019-09-10 02:32:19,889 INFO L226 Difference]: Without dead ends: 629 [2019-09-10 02:32:19,890 INFO L628 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-09-10 02:32:19,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-09-10 02:32:19,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-09-10 02:32:19,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-09-10 02:32:19,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1000 transitions. [2019-09-10 02:32:19,917 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1000 transitions. Word has length 129 [2019-09-10 02:32:19,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:19,917 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 1000 transitions. [2019-09-10 02:32:19,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:19,917 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1000 transitions. [2019-09-10 02:32:19,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 02:32:19,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:19,923 INFO L399 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] [2019-09-10 02:32:19,923 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:19,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:19,924 INFO L82 PathProgramCache]: Analyzing trace with hash 671327024, now seen corresponding path program 1 times [2019-09-10 02:32:19,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:19,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:19,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:19,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:19,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:32:20,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:20,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:20,057 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:20,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:20,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:20,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:20,059 INFO L87 Difference]: Start difference. First operand 629 states and 1000 transitions. Second operand 4 states. [2019-09-10 02:32:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:20,109 INFO L93 Difference]: Finished difference Result 631 states and 1001 transitions. [2019-09-10 02:32:20,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:32:20,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-10 02:32:20,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:20,115 INFO L225 Difference]: With dead ends: 631 [2019-09-10 02:32:20,115 INFO L226 Difference]: Without dead ends: 629 [2019-09-10 02:32:20,116 INFO L628 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-09-10 02:32:20,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-09-10 02:32:20,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-09-10 02:32:20,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-09-10 02:32:20,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 999 transitions. [2019-09-10 02:32:20,141 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 999 transitions. Word has length 130 [2019-09-10 02:32:20,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:20,142 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 999 transitions. [2019-09-10 02:32:20,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:20,142 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 999 transitions. [2019-09-10 02:32:20,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 02:32:20,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:20,150 INFO L399 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] [2019-09-10 02:32:20,150 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:20,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:20,151 INFO L82 PathProgramCache]: Analyzing trace with hash -617846089, now seen corresponding path program 1 times [2019-09-10 02:32:20,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:20,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:20,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:20,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:20,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:20,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:32:20,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:20,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:32:20,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:20,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:32:20,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:32:20,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:32:20,366 INFO L87 Difference]: Start difference. First operand 629 states and 999 transitions. Second operand 10 states. [2019-09-10 02:32:20,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:20,573 INFO L93 Difference]: Finished difference Result 638 states and 1010 transitions. [2019-09-10 02:32:20,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:32:20,574 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 131 [2019-09-10 02:32:20,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:20,583 INFO L225 Difference]: With dead ends: 638 [2019-09-10 02:32:20,583 INFO L226 Difference]: Without dead ends: 638 [2019-09-10 02:32:20,585 INFO L628 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-09-10 02:32:20,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-09-10 02:32:20,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 636. [2019-09-10 02:32:20,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-09-10 02:32:20,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1008 transitions. [2019-09-10 02:32:20,628 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1008 transitions. Word has length 131 [2019-09-10 02:32:20,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:20,632 INFO L475 AbstractCegarLoop]: Abstraction has 636 states and 1008 transitions. [2019-09-10 02:32:20,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:32:20,633 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1008 transitions. [2019-09-10 02:32:20,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-10 02:32:20,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:20,643 INFO L399 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] [2019-09-10 02:32:20,643 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:20,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:20,644 INFO L82 PathProgramCache]: Analyzing trace with hash 57846520, now seen corresponding path program 1 times [2019-09-10 02:32:20,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:20,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:20,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:20,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:20,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:20,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:32:20,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:20,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:32:20,900 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:20,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:32:20,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:32:20,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:32:20,902 INFO L87 Difference]: Start difference. First operand 636 states and 1008 transitions. Second operand 4 states. [2019-09-10 02:32:20,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:20,959 INFO L93 Difference]: Finished difference Result 634 states and 1003 transitions. [2019-09-10 02:32:20,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 02:32:20,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-09-10 02:32:20,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:20,967 INFO L225 Difference]: With dead ends: 634 [2019-09-10 02:32:20,967 INFO L226 Difference]: Without dead ends: 623 [2019-09-10 02:32:20,968 INFO L628 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-09-10 02:32:20,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-09-10 02:32:20,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-09-10 02:32:20,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-10 02:32:20,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 985 transitions. [2019-09-10 02:32:20,996 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 985 transitions. Word has length 131 [2019-09-10 02:32:20,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:20,997 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 985 transitions. [2019-09-10 02:32:20,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:32:20,997 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 985 transitions. [2019-09-10 02:32:21,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 02:32:21,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:21,002 INFO L399 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] [2019-09-10 02:32:21,002 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:21,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:21,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1033600176, now seen corresponding path program 1 times [2019-09-10 02:32:21,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:21,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:21,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:21,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:21,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:21,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:32:21,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:21,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:32:21,177 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:21,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:32:21,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:32:21,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:32:21,179 INFO L87 Difference]: Start difference. First operand 623 states and 985 transitions. Second operand 6 states. [2019-09-10 02:32:21,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:21,389 INFO L93 Difference]: Finished difference Result 626 states and 988 transitions. [2019-09-10 02:32:21,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:32:21,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-09-10 02:32:21,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:21,395 INFO L225 Difference]: With dead ends: 626 [2019-09-10 02:32:21,395 INFO L226 Difference]: Without dead ends: 623 [2019-09-10 02:32:21,395 INFO L628 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-09-10 02:32:21,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-09-10 02:32:21,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-09-10 02:32:21,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-10 02:32:21,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 981 transitions. [2019-09-10 02:32:21,423 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 981 transitions. Word has length 132 [2019-09-10 02:32:21,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:21,425 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 981 transitions. [2019-09-10 02:32:21,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:32:21,429 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 981 transitions. [2019-09-10 02:32:21,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 02:32:21,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:21,433 INFO L399 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] [2019-09-10 02:32:21,434 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:21,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:21,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1073337876, now seen corresponding path program 1 times [2019-09-10 02:32:21,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:21,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:21,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:21,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:21,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:21,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:32:21,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:21,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:32:21,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:21,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:32:21,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:32:21,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:32:21,578 INFO L87 Difference]: Start difference. First operand 623 states and 981 transitions. Second operand 6 states. [2019-09-10 02:32:21,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:21,860 INFO L93 Difference]: Finished difference Result 626 states and 984 transitions. [2019-09-10 02:32:21,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:32:21,861 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2019-09-10 02:32:21,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:21,867 INFO L225 Difference]: With dead ends: 626 [2019-09-10 02:32:21,867 INFO L226 Difference]: Without dead ends: 623 [2019-09-10 02:32:21,868 INFO L628 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-09-10 02:32:21,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-09-10 02:32:21,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-09-10 02:32:21,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-10 02:32:21,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 977 transitions. [2019-09-10 02:32:21,890 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 977 transitions. Word has length 133 [2019-09-10 02:32:21,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:21,891 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 977 transitions. [2019-09-10 02:32:21,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:32:21,891 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 977 transitions. [2019-09-10 02:32:21,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 02:32:21,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:21,897 INFO L399 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] [2019-09-10 02:32:21,897 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:21,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:21,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1624657451, now seen corresponding path program 1 times [2019-09-10 02:32:21,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:21,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:21,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:21,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:21,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:22,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:32:22,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:22,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:32:22,026 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:22,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:32:22,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:32:22,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:32:22,028 INFO L87 Difference]: Start difference. First operand 623 states and 977 transitions. Second operand 6 states. [2019-09-10 02:32:22,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:22,223 INFO L93 Difference]: Finished difference Result 626 states and 980 transitions. [2019-09-10 02:32:22,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:32:22,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-09-10 02:32:22,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:22,229 INFO L225 Difference]: With dead ends: 626 [2019-09-10 02:32:22,230 INFO L226 Difference]: Without dead ends: 623 [2019-09-10 02:32:22,230 INFO L628 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-09-10 02:32:22,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-09-10 02:32:22,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-09-10 02:32:22,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-10 02:32:22,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 973 transitions. [2019-09-10 02:32:22,253 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 973 transitions. Word has length 134 [2019-09-10 02:32:22,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:22,254 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 973 transitions. [2019-09-10 02:32:22,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:32:22,254 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 973 transitions. [2019-09-10 02:32:22,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 02:32:22,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:22,259 INFO L399 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] [2019-09-10 02:32:22,259 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:22,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:22,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1879686741, now seen corresponding path program 1 times [2019-09-10 02:32:22,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:22,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:22,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:22,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:22,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:22,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:32:22,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:22,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:32:22,397 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:22,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:32:22,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:32:22,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:32:22,398 INFO L87 Difference]: Start difference. First operand 623 states and 973 transitions. Second operand 7 states. [2019-09-10 02:32:22,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:22,558 INFO L93 Difference]: Finished difference Result 626 states and 976 transitions. [2019-09-10 02:32:22,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:32:22,559 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 134 [2019-09-10 02:32:22,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:22,565 INFO L225 Difference]: With dead ends: 626 [2019-09-10 02:32:22,565 INFO L226 Difference]: Without dead ends: 602 [2019-09-10 02:32:22,565 INFO L628 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-09-10 02:32:22,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-09-10 02:32:22,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-09-10 02:32:22,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-09-10 02:32:22,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 939 transitions. [2019-09-10 02:32:22,587 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 939 transitions. Word has length 134 [2019-09-10 02:32:22,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:22,587 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 939 transitions. [2019-09-10 02:32:22,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:32:22,588 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 939 transitions. [2019-09-10 02:32:22,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 02:32:22,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:22,593 INFO L399 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] [2019-09-10 02:32:22,593 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:22,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:22,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1196444495, now seen corresponding path program 1 times [2019-09-10 02:32:22,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:22,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:22,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:22,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:22,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:22,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:32:22,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:22,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:32:22,727 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:22,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:32:22,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:32:22,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:32:22,729 INFO L87 Difference]: Start difference. First operand 602 states and 939 transitions. Second operand 6 states. [2019-09-10 02:32:22,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:22,821 INFO L93 Difference]: Finished difference Result 605 states and 942 transitions. [2019-09-10 02:32:22,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:32:22,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2019-09-10 02:32:22,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:22,826 INFO L225 Difference]: With dead ends: 605 [2019-09-10 02:32:22,826 INFO L226 Difference]: Without dead ends: 602 [2019-09-10 02:32:22,827 INFO L628 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-09-10 02:32:22,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-09-10 02:32:22,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-09-10 02:32:22,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-09-10 02:32:22,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 938 transitions. [2019-09-10 02:32:22,852 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 938 transitions. Word has length 135 [2019-09-10 02:32:22,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:22,855 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 938 transitions. [2019-09-10 02:32:22,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:32:22,855 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 938 transitions. [2019-09-10 02:32:22,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 02:32:22,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:22,862 INFO L399 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] [2019-09-10 02:32:22,862 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:22,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:22,862 INFO L82 PathProgramCache]: Analyzing trace with hash 467494150, now seen corresponding path program 1 times [2019-09-10 02:32:22,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:22,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:22,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:22,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:22,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:23,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:32:23,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:23,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:32:23,078 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:23,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:32:23,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:32:23,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:32:23,079 INFO L87 Difference]: Start difference. First operand 602 states and 938 transitions. Second operand 6 states. [2019-09-10 02:32:23,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:23,169 INFO L93 Difference]: Finished difference Result 605 states and 941 transitions. [2019-09-10 02:32:23,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:32:23,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2019-09-10 02:32:23,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:23,175 INFO L225 Difference]: With dead ends: 605 [2019-09-10 02:32:23,175 INFO L226 Difference]: Without dead ends: 602 [2019-09-10 02:32:23,175 INFO L628 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-09-10 02:32:23,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-09-10 02:32:23,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-09-10 02:32:23,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-09-10 02:32:23,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 937 transitions. [2019-09-10 02:32:23,203 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 937 transitions. Word has length 136 [2019-09-10 02:32:23,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:23,205 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 937 transitions. [2019-09-10 02:32:23,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:32:23,206 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 937 transitions. [2019-09-10 02:32:23,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 02:32:23,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:23,210 INFO L399 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] [2019-09-10 02:32:23,210 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:23,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:23,211 INFO L82 PathProgramCache]: Analyzing trace with hash -994380662, now seen corresponding path program 1 times [2019-09-10 02:32:23,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:23,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:23,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:23,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:23,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:23,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:32:23,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:23,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 02:32:23,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:23,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 02:32:23,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 02:32:23,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:32:23,419 INFO L87 Difference]: Start difference. First operand 602 states and 937 transitions. Second operand 12 states. [2019-09-10 02:32:23,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:23,591 INFO L93 Difference]: Finished difference Result 606 states and 940 transitions. [2019-09-10 02:32:23,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:32:23,592 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 137 [2019-09-10 02:32:23,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:23,597 INFO L225 Difference]: With dead ends: 606 [2019-09-10 02:32:23,597 INFO L226 Difference]: Without dead ends: 602 [2019-09-10 02:32:23,599 INFO L628 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-09-10 02:32:23,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-09-10 02:32:23,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-09-10 02:32:23,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-09-10 02:32:23,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 936 transitions. [2019-09-10 02:32:23,629 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 936 transitions. Word has length 137 [2019-09-10 02:32:23,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:23,630 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 936 transitions. [2019-09-10 02:32:23,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 02:32:23,630 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 936 transitions. [2019-09-10 02:32:23,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 02:32:23,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:23,635 INFO L399 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] [2019-09-10 02:32:23,635 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:23,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:23,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1158171471, now seen corresponding path program 1 times [2019-09-10 02:32:23,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:23,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:23,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:23,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:23,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:32:23,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:23,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:32:23,791 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:23,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:32:23,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:32:23,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:32:23,793 INFO L87 Difference]: Start difference. First operand 602 states and 936 transitions. Second operand 5 states. [2019-09-10 02:32:26,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:26,627 INFO L93 Difference]: Finished difference Result 974 states and 1517 transitions. [2019-09-10 02:32:26,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:32:26,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-09-10 02:32:26,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:26,638 INFO L225 Difference]: With dead ends: 974 [2019-09-10 02:32:26,638 INFO L226 Difference]: Without dead ends: 974 [2019-09-10 02:32:26,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:32:26,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-09-10 02:32:26,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 944. [2019-09-10 02:32:26,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 944 states. [2019-09-10 02:32:26,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1477 transitions. [2019-09-10 02:32:26,678 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1477 transitions. Word has length 138 [2019-09-10 02:32:26,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:26,679 INFO L475 AbstractCegarLoop]: Abstraction has 944 states and 1477 transitions. [2019-09-10 02:32:26,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:32:26,679 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1477 transitions. [2019-09-10 02:32:26,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-10 02:32:26,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:26,684 INFO L399 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] [2019-09-10 02:32:26,684 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:26,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:26,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1117496721, now seen corresponding path program 1 times [2019-09-10 02:32:26,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:26,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:26,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:26,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:26,686 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:26,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:32:26,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:26,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:32:26,881 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:26,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:32:26,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:32:26,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:32:26,883 INFO L87 Difference]: Start difference. First operand 944 states and 1477 transitions. Second operand 6 states. [2019-09-10 02:32:31,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:31,439 INFO L93 Difference]: Finished difference Result 1983 states and 3175 transitions. [2019-09-10 02:32:31,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:32:31,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2019-09-10 02:32:31,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:31,455 INFO L225 Difference]: With dead ends: 1983 [2019-09-10 02:32:31,455 INFO L226 Difference]: Without dead ends: 1983 [2019-09-10 02:32:31,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:32:31,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2019-09-10 02:32:31,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1882. [2019-09-10 02:32:31,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1882 states. [2019-09-10 02:32:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2995 transitions. [2019-09-10 02:32:31,543 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2995 transitions. Word has length 138 [2019-09-10 02:32:31,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:31,544 INFO L475 AbstractCegarLoop]: Abstraction has 1882 states and 2995 transitions. [2019-09-10 02:32:31,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:32:31,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2995 transitions. [2019-09-10 02:32:31,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 02:32:31,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:31,549 INFO L399 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] [2019-09-10 02:32:31,549 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:31,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:31,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1503869869, now seen corresponding path program 1 times [2019-09-10 02:32:31,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:31,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:31,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:31,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:31,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:31,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:32:31,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:31,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:32:31,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:31,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:32:31,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:32:31,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:32:31,759 INFO L87 Difference]: Start difference. First operand 1882 states and 2995 transitions. Second operand 6 states. [2019-09-10 02:32:36,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:36,253 INFO L93 Difference]: Finished difference Result 4145 states and 6776 transitions. [2019-09-10 02:32:36,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:32:36,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2019-09-10 02:32:36,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:36,280 INFO L225 Difference]: With dead ends: 4145 [2019-09-10 02:32:36,280 INFO L226 Difference]: Without dead ends: 4145 [2019-09-10 02:32:36,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:32:36,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4145 states. [2019-09-10 02:32:36,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4145 to 3900. [2019-09-10 02:32:36,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3900 states. [2019-09-10 02:32:36,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3900 states to 3900 states and 6303 transitions. [2019-09-10 02:32:36,431 INFO L78 Accepts]: Start accepts. Automaton has 3900 states and 6303 transitions. Word has length 139 [2019-09-10 02:32:36,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:36,431 INFO L475 AbstractCegarLoop]: Abstraction has 3900 states and 6303 transitions. [2019-09-10 02:32:36,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:32:36,432 INFO L276 IsEmpty]: Start isEmpty. Operand 3900 states and 6303 transitions. [2019-09-10 02:32:36,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 02:32:36,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:36,436 INFO L399 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] [2019-09-10 02:32:36,436 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:36,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:36,437 INFO L82 PathProgramCache]: Analyzing trace with hash 834330645, now seen corresponding path program 1 times [2019-09-10 02:32:36,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:36,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:36,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:36,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:36,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:36,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:32:36,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:36,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:32:36,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:36,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:32:36,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:32:36,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:32:36,577 INFO L87 Difference]: Start difference. First operand 3900 states and 6303 transitions. Second operand 6 states. [2019-09-10 02:32:41,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:41,205 INFO L93 Difference]: Finished difference Result 9037 states and 15166 transitions. [2019-09-10 02:32:41,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:32:41,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-09-10 02:32:41,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:41,311 INFO L225 Difference]: With dead ends: 9037 [2019-09-10 02:32:41,312 INFO L226 Difference]: Without dead ends: 9037 [2019-09-10 02:32:41,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:32:41,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9037 states. [2019-09-10 02:32:41,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9037 to 8370. [2019-09-10 02:32:41,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8370 states. [2019-09-10 02:32:41,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8370 states to 8370 states and 13811 transitions. [2019-09-10 02:32:41,772 INFO L78 Accepts]: Start accepts. Automaton has 8370 states and 13811 transitions. Word has length 140 [2019-09-10 02:32:41,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:41,772 INFO L475 AbstractCegarLoop]: Abstraction has 8370 states and 13811 transitions. [2019-09-10 02:32:41,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:32:41,773 INFO L276 IsEmpty]: Start isEmpty. Operand 8370 states and 13811 transitions. [2019-09-10 02:32:41,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 02:32:41,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:41,777 INFO L399 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] [2019-09-10 02:32:41,777 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:41,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:41,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1791246257, now seen corresponding path program 1 times [2019-09-10 02:32:41,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:41,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:41,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:41,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:41,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:42,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:32:42,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:42,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:32:42,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:42,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:32:42,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:32:42,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:32:42,008 INFO L87 Difference]: Start difference. First operand 8370 states and 13811 transitions. Second operand 6 states. [2019-09-10 02:32:47,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:47,401 INFO L93 Difference]: Finished difference Result 20673 states and 36030 transitions. [2019-09-10 02:32:47,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:32:47,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-09-10 02:32:47,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:47,564 INFO L225 Difference]: With dead ends: 20673 [2019-09-10 02:32:47,565 INFO L226 Difference]: Without dead ends: 20673 [2019-09-10 02:32:47,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:32:47,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20673 states. [2019-09-10 02:32:48,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20673 to 18728. [2019-09-10 02:32:48,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18728 states. [2019-09-10 02:32:48,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18728 states to 18728 states and 31945 transitions. [2019-09-10 02:32:48,476 INFO L78 Accepts]: Start accepts. Automaton has 18728 states and 31945 transitions. Word has length 141 [2019-09-10 02:32:48,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:48,480 INFO L475 AbstractCegarLoop]: Abstraction has 18728 states and 31945 transitions. [2019-09-10 02:32:48,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:32:48,480 INFO L276 IsEmpty]: Start isEmpty. Operand 18728 states and 31945 transitions. [2019-09-10 02:32:48,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 02:32:48,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:48,486 INFO L399 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] [2019-09-10 02:32:48,486 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:48,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:48,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1533122470, now seen corresponding path program 1 times [2019-09-10 02:32:48,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:48,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:48,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:48,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:48,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:48,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:32:48,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:48,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 02:32:48,674 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:48,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 02:32:48,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 02:32:48,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:32:48,675 INFO L87 Difference]: Start difference. First operand 18728 states and 31945 transitions. Second operand 9 states. [2019-09-10 02:32:55,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:55,995 INFO L93 Difference]: Finished difference Result 43166 states and 73549 transitions. [2019-09-10 02:32:55,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 02:32:55,996 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 142 [2019-09-10 02:32:55,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:56,332 INFO L225 Difference]: With dead ends: 43166 [2019-09-10 02:32:56,333 INFO L226 Difference]: Without dead ends: 43166 [2019-09-10 02:32:56,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-09-10 02:32:56,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43166 states. [2019-09-10 02:32:57,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43166 to 42443. [2019-09-10 02:32:57,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42443 states. [2019-09-10 02:32:57,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42443 states to 42443 states and 71943 transitions. [2019-09-10 02:32:57,879 INFO L78 Accepts]: Start accepts. Automaton has 42443 states and 71943 transitions. Word has length 142 [2019-09-10 02:32:57,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:32:57,880 INFO L475 AbstractCegarLoop]: Abstraction has 42443 states and 71943 transitions. [2019-09-10 02:32:57,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 02:32:57,880 INFO L276 IsEmpty]: Start isEmpty. Operand 42443 states and 71943 transitions. [2019-09-10 02:32:57,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 02:32:57,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:32:57,886 INFO L399 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, 1, 1, 1] [2019-09-10 02:32:57,886 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:32:57,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:32:57,887 INFO L82 PathProgramCache]: Analyzing trace with hash 586133833, now seen corresponding path program 1 times [2019-09-10 02:32:57,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:32:57,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:57,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:32:57,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:32:57,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:32:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:32:58,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:32:58,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:32:58,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:32:58,017 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:32:58,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:32:58,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:32:58,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:32:58,018 INFO L87 Difference]: Start difference. First operand 42443 states and 71943 transitions. Second operand 7 states. [2019-09-10 02:32:58,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:32:58,542 INFO L93 Difference]: Finished difference Result 43819 states and 73977 transitions. [2019-09-10 02:32:58,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:32:58,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 148 [2019-09-10 02:32:58,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:32:58,827 INFO L225 Difference]: With dead ends: 43819 [2019-09-10 02:32:58,827 INFO L226 Difference]: Without dead ends: 43819 [2019-09-10 02:32:58,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:32:58,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43819 states. [2019-09-10 02:33:01,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43819 to 43115. [2019-09-10 02:33:01,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43115 states. [2019-09-10 02:33:01,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43115 states to 43115 states and 72903 transitions. [2019-09-10 02:33:01,853 INFO L78 Accepts]: Start accepts. Automaton has 43115 states and 72903 transitions. Word has length 148 [2019-09-10 02:33:01,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:33:01,854 INFO L475 AbstractCegarLoop]: Abstraction has 43115 states and 72903 transitions. [2019-09-10 02:33:01,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:33:01,854 INFO L276 IsEmpty]: Start isEmpty. Operand 43115 states and 72903 transitions. [2019-09-10 02:33:01,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 02:33:01,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:33:01,861 INFO L399 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, 1, 1] [2019-09-10 02:33:01,861 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:33:01,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:33:01,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1803258839, now seen corresponding path program 1 times [2019-09-10 02:33:01,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:33:01,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:01,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:33:01,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:01,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:33:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:33:01,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:33:01,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:33:01,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:33:01,999 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:33:01,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:33:02,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:33:02,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:33:02,000 INFO L87 Difference]: Start difference. First operand 43115 states and 72903 transitions. Second operand 7 states. [2019-09-10 02:33:02,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:33:02,367 INFO L93 Difference]: Finished difference Result 44299 states and 74553 transitions. [2019-09-10 02:33:02,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:33:02,367 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 147 [2019-09-10 02:33:02,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:33:02,597 INFO L225 Difference]: With dead ends: 44299 [2019-09-10 02:33:02,597 INFO L226 Difference]: Without dead ends: 44299 [2019-09-10 02:33:02,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:33:02,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44299 states. [2019-09-10 02:33:03,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44299 to 43211. [2019-09-10 02:33:03,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43211 states. [2019-09-10 02:33:04,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43211 states to 43211 states and 72999 transitions. [2019-09-10 02:33:04,004 INFO L78 Accepts]: Start accepts. Automaton has 43211 states and 72999 transitions. Word has length 147 [2019-09-10 02:33:04,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:33:04,004 INFO L475 AbstractCegarLoop]: Abstraction has 43211 states and 72999 transitions. [2019-09-10 02:33:04,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:33:04,004 INFO L276 IsEmpty]: Start isEmpty. Operand 43211 states and 72999 transitions. [2019-09-10 02:33:04,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 02:33:04,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:33:04,008 INFO L399 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, 1, 1, 1] [2019-09-10 02:33:04,008 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:33:04,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:33:04,009 INFO L82 PathProgramCache]: Analyzing trace with hash -206209525, now seen corresponding path program 1 times [2019-09-10 02:33:04,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:33:04,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:04,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:33:04,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:04,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:33:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:33:04,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:33:04,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:33:04,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:33:04,114 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:33:04,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:33:04,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:33:04,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:33:04,116 INFO L87 Difference]: Start difference. First operand 43211 states and 72999 transitions. Second operand 5 states. [2019-09-10 02:33:04,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:33:04,644 INFO L93 Difference]: Finished difference Result 43775 states and 73777 transitions. [2019-09-10 02:33:04,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:33:04,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-09-10 02:33:04,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:33:05,015 INFO L225 Difference]: With dead ends: 43775 [2019-09-10 02:33:05,015 INFO L226 Difference]: Without dead ends: 43775 [2019-09-10 02:33:05,016 INFO L628 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-09-10 02:33:05,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43775 states. [2019-09-10 02:33:07,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43775 to 43241. [2019-09-10 02:33:07,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43241 states. [2019-09-10 02:33:07,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43241 states to 43241 states and 73035 transitions. [2019-09-10 02:33:07,794 INFO L78 Accepts]: Start accepts. Automaton has 43241 states and 73035 transitions. Word has length 148 [2019-09-10 02:33:07,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:33:07,794 INFO L475 AbstractCegarLoop]: Abstraction has 43241 states and 73035 transitions. [2019-09-10 02:33:07,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:33:07,794 INFO L276 IsEmpty]: Start isEmpty. Operand 43241 states and 73035 transitions. [2019-09-10 02:33:07,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 02:33:07,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:33:07,799 INFO L399 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, 1, 1, 1] [2019-09-10 02:33:07,799 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:33:07,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:33:07,800 INFO L82 PathProgramCache]: Analyzing trace with hash -836668150, now seen corresponding path program 1 times [2019-09-10 02:33:07,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:33:07,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:07,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:33:07,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:07,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:33:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:33:07,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:33:07,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:33:07,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:33:07,931 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:33:07,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:33:07,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:33:07,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:33:07,932 INFO L87 Difference]: Start difference. First operand 43241 states and 73035 transitions. Second operand 6 states. [2019-09-10 02:33:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:33:13,739 INFO L93 Difference]: Finished difference Result 112000 states and 202905 transitions. [2019-09-10 02:33:13,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:33:13,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-09-10 02:33:13,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:33:14,401 INFO L225 Difference]: With dead ends: 112000 [2019-09-10 02:33:14,401 INFO L226 Difference]: Without dead ends: 112000 [2019-09-10 02:33:14,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:33:14,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112000 states. [2019-09-10 02:33:19,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112000 to 100149. [2019-09-10 02:33:19,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100149 states. [2019-09-10 02:33:19,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100149 states to 100149 states and 177285 transitions. [2019-09-10 02:33:19,743 INFO L78 Accepts]: Start accepts. Automaton has 100149 states and 177285 transitions. Word has length 148 [2019-09-10 02:33:19,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:33:19,743 INFO L475 AbstractCegarLoop]: Abstraction has 100149 states and 177285 transitions. [2019-09-10 02:33:19,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:33:19,743 INFO L276 IsEmpty]: Start isEmpty. Operand 100149 states and 177285 transitions. [2019-09-10 02:33:19,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 02:33:19,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:33:19,750 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:33:19,750 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:33:19,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:33:19,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1203874242, now seen corresponding path program 1 times [2019-09-10 02:33:19,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:33:19,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:19,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:33:19,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:19,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:33:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:33:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:33:19,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:33:19,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:33:19,981 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:33:19,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:33:19,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:33:19,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:33:19,982 INFO L87 Difference]: Start difference. First operand 100149 states and 177285 transitions. Second operand 8 states. [2019-09-10 02:33:28,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:33:28,823 INFO L93 Difference]: Finished difference Result 221241 states and 394678 transitions. [2019-09-10 02:33:28,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:33:28,824 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 156 [2019-09-10 02:33:28,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:33:30,206 INFO L225 Difference]: With dead ends: 221241 [2019-09-10 02:33:30,206 INFO L226 Difference]: Without dead ends: 221241 [2019-09-10 02:33:30,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-10 02:33:30,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221241 states. [2019-09-10 02:33:35,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221241 to 221207. [2019-09-10 02:33:35,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221207 states. [2019-09-10 02:33:43,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221207 states to 221207 states and 394638 transitions. [2019-09-10 02:33:43,909 INFO L78 Accepts]: Start accepts. Automaton has 221207 states and 394638 transitions. Word has length 156 [2019-09-10 02:33:43,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:33:43,909 INFO L475 AbstractCegarLoop]: Abstraction has 221207 states and 394638 transitions. [2019-09-10 02:33:43,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:33:43,909 INFO L276 IsEmpty]: Start isEmpty. Operand 221207 states and 394638 transitions. [2019-09-10 02:33:43,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-10 02:33:43,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:33:43,916 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:33:43,916 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:33:43,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:33:43,917 INFO L82 PathProgramCache]: Analyzing trace with hash 2032942901, now seen corresponding path program 1 times [2019-09-10 02:33:43,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:33:43,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:43,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:33:43,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:33:43,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:33:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:33:44,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:33:44,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:33:44,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:33:44,047 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:33:44,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:33:44,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:33:44,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:33:44,049 INFO L87 Difference]: Start difference. First operand 221207 states and 394638 transitions. Second operand 7 states. [2019-09-10 02:33:52,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:33:52,828 INFO L93 Difference]: Finished difference Result 223191 states and 396334 transitions. [2019-09-10 02:33:52,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:33:52,829 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 158 [2019-09-10 02:33:52,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:33:54,293 INFO L225 Difference]: With dead ends: 223191 [2019-09-10 02:33:54,293 INFO L226 Difference]: Without dead ends: 222871 [2019-09-10 02:33:54,293 INFO L628 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-09-10 02:33:54,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222871 states. [2019-09-10 02:33:59,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222871 to 222871. [2019-09-10 02:33:59,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222871 states. [2019-09-10 02:34:02,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222871 states to 222871 states and 396014 transitions. [2019-09-10 02:34:02,473 INFO L78 Accepts]: Start accepts. Automaton has 222871 states and 396014 transitions. Word has length 158 [2019-09-10 02:34:02,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:34:02,473 INFO L475 AbstractCegarLoop]: Abstraction has 222871 states and 396014 transitions. [2019-09-10 02:34:02,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:34:02,473 INFO L276 IsEmpty]: Start isEmpty. Operand 222871 states and 396014 transitions. [2019-09-10 02:34:02,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 02:34:02,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:34:02,477 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:34:02,478 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:34:02,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:34:02,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1387337904, now seen corresponding path program 1 times [2019-09-10 02:34:02,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:34:02,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:02,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:34:02,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:02,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:34:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:34:02,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:34:02,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:34:02,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:34:02,612 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:34:02,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:34:02,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:34:02,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:34:02,614 INFO L87 Difference]: Start difference. First operand 222871 states and 396014 transitions. Second operand 7 states. [2019-09-10 02:34:14,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:34:14,508 INFO L93 Difference]: Finished difference Result 233386 states and 415552 transitions. [2019-09-10 02:34:14,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 02:34:14,509 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 159 [2019-09-10 02:34:14,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:34:16,508 INFO L225 Difference]: With dead ends: 233386 [2019-09-10 02:34:16,509 INFO L226 Difference]: Without dead ends: 233386 [2019-09-10 02:34:16,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-09-10 02:34:16,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233386 states. [2019-09-10 02:34:22,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233386 to 230295. [2019-09-10 02:34:22,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230295 states. [2019-09-10 02:34:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230295 states to 230295 states and 406092 transitions. [2019-09-10 02:34:24,753 INFO L78 Accepts]: Start accepts. Automaton has 230295 states and 406092 transitions. Word has length 159 [2019-09-10 02:34:24,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:34:24,754 INFO L475 AbstractCegarLoop]: Abstraction has 230295 states and 406092 transitions. [2019-09-10 02:34:24,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:34:24,754 INFO L276 IsEmpty]: Start isEmpty. Operand 230295 states and 406092 transitions. [2019-09-10 02:34:24,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 02:34:24,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:34:24,760 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:34:24,760 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:34:24,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:34:24,761 INFO L82 PathProgramCache]: Analyzing trace with hash -270482422, now seen corresponding path program 1 times [2019-09-10 02:34:24,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:34:24,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:24,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:34:24,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:24,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:34:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:34:24,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 02:34:24,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:34:24,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:34:24,875 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:34:24,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:34:24,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:34:24,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:34:24,876 INFO L87 Difference]: Start difference. First operand 230295 states and 406092 transitions. Second operand 6 states. [2019-09-10 02:34:33,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:34:33,827 INFO L93 Difference]: Finished difference Result 297800 states and 522278 transitions. [2019-09-10 02:34:33,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:34:33,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2019-09-10 02:34:33,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:34:35,393 INFO L225 Difference]: With dead ends: 297800 [2019-09-10 02:34:35,394 INFO L226 Difference]: Without dead ends: 297800 [2019-09-10 02:34:35,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:34:35,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297800 states. [2019-09-10 02:34:46,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297800 to 281421. [2019-09-10 02:34:46,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281421 states. [2019-09-10 02:34:49,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281421 states to 281421 states and 496566 transitions. [2019-09-10 02:34:49,461 INFO L78 Accepts]: Start accepts. Automaton has 281421 states and 496566 transitions. Word has length 164 [2019-09-10 02:34:49,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:34:49,462 INFO L475 AbstractCegarLoop]: Abstraction has 281421 states and 496566 transitions. [2019-09-10 02:34:49,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:34:49,462 INFO L276 IsEmpty]: Start isEmpty. Operand 281421 states and 496566 transitions. [2019-09-10 02:34:49,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-10 02:34:49,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:34:49,466 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:34:49,467 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:34:49,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:34:49,467 INFO L82 PathProgramCache]: Analyzing trace with hash 431117452, now seen corresponding path program 1 times [2019-09-10 02:34:49,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:34:49,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:49,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:34:49,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:34:49,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:34:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:34:49,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 02:34:49,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:34:49,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:34:49,604 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:34:49,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:34:49,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:34:49,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:34:49,606 INFO L87 Difference]: Start difference. First operand 281421 states and 496566 transitions. Second operand 4 states. [2019-09-10 02:35:17,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:35:17,255 INFO L93 Difference]: Finished difference Result 692839 states and 1426192 transitions. [2019-09-10 02:35:17,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:35:17,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-09-10 02:35:17,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:35:22,915 INFO L225 Difference]: With dead ends: 692839 [2019-09-10 02:35:22,915 INFO L226 Difference]: Without dead ends: 692839 [2019-09-10 02:35:22,915 INFO L628 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-09-10 02:35:23,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692839 states. [2019-09-10 02:35:52,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692839 to 666435. [2019-09-10 02:35:52,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666435 states. [2019-09-10 02:36:31,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666435 states to 666435 states and 1349517 transitions. [2019-09-10 02:36:31,906 INFO L78 Accepts]: Start accepts. Automaton has 666435 states and 1349517 transitions. Word has length 164 [2019-09-10 02:36:31,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:36:31,906 INFO L475 AbstractCegarLoop]: Abstraction has 666435 states and 1349517 transitions. [2019-09-10 02:36:31,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 02:36:31,906 INFO L276 IsEmpty]: Start isEmpty. Operand 666435 states and 1349517 transitions. [2019-09-10 02:36:31,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 02:36:31,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:36:31,916 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:36:31,916 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:36:31,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:36:31,916 INFO L82 PathProgramCache]: Analyzing trace with hash 94266847, now seen corresponding path program 1 times [2019-09-10 02:36:31,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:36:31,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:31,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:36:31,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:36:31,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:36:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:36:32,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 02:36:32,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:36:32,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 02:36:32,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:36:32,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 02:36:32,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 02:36:32,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 02:36:32,044 INFO L87 Difference]: Start difference. First operand 666435 states and 1349517 transitions. Second operand 4 states.