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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec9_product09.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:11:09,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:11:09,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:11:09,367 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:11:09,367 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:11:09,368 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:11:09,370 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:11:09,372 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:11:09,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:11:09,374 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:11:09,375 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:11:09,376 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:11:09,377 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:11:09,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:11:09,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:11:09,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:11:09,381 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:11:09,382 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:11:09,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:11:09,386 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:11:09,387 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:11:09,388 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:11:09,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:11:09,390 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:11:09,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:11:09,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:11:09,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:11:09,394 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:11:09,395 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:11:09,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:11:09,396 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:11:09,396 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:11:09,397 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:11:09,398 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:11:09,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:11:09,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:11:09,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:11:09,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:11:09,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:11:09,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:11:09,402 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:11:09,403 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:11:09,418 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:11:09,418 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:11:09,419 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:11:09,419 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:11:09,420 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:11:09,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:11:09,420 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:11:09,420 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:11:09,420 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:11:09,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:11:09,421 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:11:09,421 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:11:09,421 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:11:09,421 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:11:09,422 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:11:09,422 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:11:09,422 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:11:09,422 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:11:09,422 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:11:09,423 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:11:09,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:11:09,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:11:09,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:11:09,423 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:11:09,424 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:11:09,424 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:11:09,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:11:09,424 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:11:09,424 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:11:09,714 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:11:09,731 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:11:09,735 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:11:09,736 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:11:09,736 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:11:09,737 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product09.cil.c [2019-10-15 01:11:09,815 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd8fb239a/1a6af57f5ed942b0956c7654a6b8cd3f/FLAGfc3eeaff1 [2019-10-15 01:11:10,514 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:11:10,517 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product09.cil.c [2019-10-15 01:11:10,539 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd8fb239a/1a6af57f5ed942b0956c7654a6b8cd3f/FLAGfc3eeaff1 [2019-10-15 01:11:10,674 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd8fb239a/1a6af57f5ed942b0956c7654a6b8cd3f [2019-10-15 01:11:10,685 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:11:10,686 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:11:10,687 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:11:10,687 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:11:10,690 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:11:10,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:11:10" (1/1) ... [2019-10-15 01:11:10,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cf918b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:10, skipping insertion in model container [2019-10-15 01:11:10,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:11:10" (1/1) ... [2019-10-15 01:11:10,701 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:11:10,782 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:11:11,440 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:11:11,467 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:11:11,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:11:11,677 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:11:11,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:11 WrapperNode [2019-10-15 01:11:11,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:11:11,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:11:11,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:11:11,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:11:11,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:11" (1/1) ... [2019-10-15 01:11:11,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:11" (1/1) ... [2019-10-15 01:11:11,730 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:11" (1/1) ... [2019-10-15 01:11:11,731 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:11" (1/1) ... [2019-10-15 01:11:11,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:11" (1/1) ... [2019-10-15 01:11:11,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:11" (1/1) ... [2019-10-15 01:11:11,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:11" (1/1) ... [2019-10-15 01:11:11,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:11:11,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:11:11,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:11:11,908 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:11:11,909 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:11:11,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:11:11,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:11:11,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:11:11,982 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:11:11,982 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:11:11,983 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:11:11,983 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:11:11,983 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:11:11,983 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:11:11,984 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:11:11,984 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:11:11,984 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:11:11,985 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:11:11,986 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:11:11,986 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:11:11,986 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:11:11,988 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:11:11,989 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:11:11,989 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:11:11,989 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:11:11,990 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:11:11,990 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:11:11,990 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:11:11,990 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:11:11,991 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:11:11,991 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:11:11,991 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:11:11,991 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:11:11,991 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:11:11,992 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:11:11,992 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:11:11,992 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:11:11,992 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:11:11,993 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-15 01:11:11,993 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:11:11,993 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:11:11,994 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:11:11,994 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:11:11,994 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:11:11,994 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:11:11,994 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:11:11,994 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:11:11,995 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:11:11,995 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:11:11,995 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:11:11,995 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:11:11,995 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:11:11,995 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:11:11,996 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:11:11,996 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:11:11,996 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:11:11,996 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:11:11,996 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:11:11,997 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:11:11,997 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:11:11,997 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:11:11,997 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:11:11,997 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:11:11,997 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:11:11,998 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-10-15 01:11:11,998 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-10-15 01:11:11,998 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-10-15 01:11:11,998 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-10-15 01:11:11,999 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:11:11,999 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:11:11,999 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:11:12,000 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:11:12,000 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:11:12,000 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:11:12,001 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:11:12,001 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:11:12,001 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:11:12,001 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:11:12,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:11:12,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:11:12,002 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:11:12,003 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:11:12,003 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:11:12,003 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:11:12,004 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:11:12,004 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:11:12,004 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:11:12,004 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:11:12,005 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:11:12,005 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:11:12,006 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:11:12,006 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:11:12,007 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:11:12,007 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:11:12,007 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:11:12,007 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:11:12,007 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:11:12,008 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:11:12,008 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:11:12,008 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:11:12,008 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:11:12,008 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:11:12,009 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:11:12,009 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:11:12,009 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:11:12,009 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:11:12,009 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:11:12,009 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:11:12,010 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:11:12,010 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:11:12,010 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:11:12,010 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-10-15 01:11:12,010 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-10-15 01:11:12,011 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:11:12,011 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:11:12,011 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:11:12,011 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:11:12,011 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:11:12,012 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:11:12,012 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:11:12,012 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:11:12,012 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:11:12,013 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:11:12,013 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:11:12,013 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:11:12,014 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:11:12,014 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:11:12,014 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-15 01:11:12,014 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:11:12,016 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-10-15 01:11:12,016 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:11:12,016 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:11:12,016 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:11:12,017 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:11:12,017 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:11:12,017 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:11:12,018 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:11:12,018 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:11:12,018 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:11:12,018 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-10-15 01:11:12,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:11:12,019 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:11:12,022 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:11:12,023 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:11:12,023 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:11:12,024 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:11:12,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:11:12,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:11:12,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:11:12,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:11:12,031 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:11:12,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:11:12,031 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:11:12,031 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:11:12,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:11:12,032 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:11:12,032 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:11:12,034 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:11:12,034 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:11:12,034 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:11:12,034 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:11:12,034 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:11:12,034 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:11:12,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:11:12,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:11:12,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:11:14,163 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:11:14,164 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:11:14,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:11:14 BoogieIcfgContainer [2019-10-15 01:11:14,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:11:14,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:11:14,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:11:14,171 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:11:14,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:11:10" (1/3) ... [2019-10-15 01:11:14,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ade922a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:11:14, skipping insertion in model container [2019-10-15 01:11:14,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:11:11" (2/3) ... [2019-10-15 01:11:14,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ade922a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:11:14, skipping insertion in model container [2019-10-15 01:11:14,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:11:14" (3/3) ... [2019-10-15 01:11:14,174 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product09.cil.c [2019-10-15 01:11:14,184 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:11:14,197 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:11:14,209 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:11:14,255 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:11:14,255 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:11:14,256 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:11:14,256 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:11:14,256 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:11:14,256 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:11:14,256 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:11:14,256 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:11:14,301 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states. [2019-10-15 01:11:14,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-15 01:11:14,328 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:14,331 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:14,335 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:14,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:14,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1110601002, now seen corresponding path program 1 times [2019-10-15 01:11:14,353 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:14,353 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227534797] [2019-10-15 01:11:14,354 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:14,354 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:14,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:14,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:14,992 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227534797] [2019-10-15 01:11:14,993 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:14,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:14,994 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912203175] [2019-10-15 01:11:14,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:15,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:15,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:15,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:15,020 INFO L87 Difference]: Start difference. First operand 728 states. Second operand 4 states. [2019-10-15 01:11:15,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:15,273 INFO L93 Difference]: Finished difference Result 1119 states and 1831 transitions. [2019-10-15 01:11:15,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:15,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-10-15 01:11:15,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:15,311 INFO L225 Difference]: With dead ends: 1119 [2019-10-15 01:11:15,312 INFO L226 Difference]: Without dead ends: 568 [2019-10-15 01:11:15,324 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:15,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-15 01:11:15,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-10-15 01:11:15,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-15 01:11:15,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 917 transitions. [2019-10-15 01:11:15,456 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 917 transitions. Word has length 109 [2019-10-15 01:11:15,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:15,457 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 917 transitions. [2019-10-15 01:11:15,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:15,457 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 917 transitions. [2019-10-15 01:11:15,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-15 01:11:15,465 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:15,466 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:15,466 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:15,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:15,467 INFO L82 PathProgramCache]: Analyzing trace with hash 513878495, now seen corresponding path program 1 times [2019-10-15 01:11:15,467 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:15,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618787702] [2019-10-15 01:11:15,468 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:15,468 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:15,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:15,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:15,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618787702] [2019-10-15 01:11:15,666 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:15,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:15,666 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576705055] [2019-10-15 01:11:15,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:15,675 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:15,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:15,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:15,676 INFO L87 Difference]: Start difference. First operand 568 states and 917 transitions. Second operand 4 states. [2019-10-15 01:11:15,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:15,780 INFO L93 Difference]: Finished difference Result 1099 states and 1792 transitions. [2019-10-15 01:11:15,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:15,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-15 01:11:15,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:15,788 INFO L225 Difference]: With dead ends: 1099 [2019-10-15 01:11:15,789 INFO L226 Difference]: Without dead ends: 568 [2019-10-15 01:11:15,798 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:15,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-15 01:11:15,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-10-15 01:11:15,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-15 01:11:15,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 916 transitions. [2019-10-15 01:11:15,841 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 916 transitions. Word has length 112 [2019-10-15 01:11:15,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:15,843 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 916 transitions. [2019-10-15 01:11:15,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:15,844 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 916 transitions. [2019-10-15 01:11:15,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-15 01:11:15,861 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:15,861 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:15,862 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:15,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:15,862 INFO L82 PathProgramCache]: Analyzing trace with hash -899322139, now seen corresponding path program 1 times [2019-10-15 01:11:15,862 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:15,863 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873827229] [2019-10-15 01:11:15,866 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:15,866 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:15,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:16,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873827229] [2019-10-15 01:11:16,032 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:16,032 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:16,033 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920797363] [2019-10-15 01:11:16,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:16,034 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:16,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:16,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:16,034 INFO L87 Difference]: Start difference. First operand 568 states and 916 transitions. Second operand 4 states. [2019-10-15 01:11:16,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:16,115 INFO L93 Difference]: Finished difference Result 1099 states and 1791 transitions. [2019-10-15 01:11:16,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:16,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-15 01:11:16,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:16,124 INFO L225 Difference]: With dead ends: 1099 [2019-10-15 01:11:16,124 INFO L226 Difference]: Without dead ends: 568 [2019-10-15 01:11:16,127 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:16,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-15 01:11:16,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-10-15 01:11:16,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-15 01:11:16,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 915 transitions. [2019-10-15 01:11:16,192 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 915 transitions. Word has length 113 [2019-10-15 01:11:16,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:16,192 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 915 transitions. [2019-10-15 01:11:16,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:16,192 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 915 transitions. [2019-10-15 01:11:16,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-15 01:11:16,196 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:16,197 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:16,197 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:16,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:16,197 INFO L82 PathProgramCache]: Analyzing trace with hash 251093531, now seen corresponding path program 1 times [2019-10-15 01:11:16,198 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:16,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721245689] [2019-10-15 01:11:16,198 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:16,198 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:16,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:16,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:16,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721245689] [2019-10-15 01:11:16,355 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:16,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:16,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293194422] [2019-10-15 01:11:16,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:16,358 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:16,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:16,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:16,358 INFO L87 Difference]: Start difference. First operand 568 states and 915 transitions. Second operand 4 states. [2019-10-15 01:11:16,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:16,433 INFO L93 Difference]: Finished difference Result 1099 states and 1790 transitions. [2019-10-15 01:11:16,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:16,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-15 01:11:16,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:16,441 INFO L225 Difference]: With dead ends: 1099 [2019-10-15 01:11:16,441 INFO L226 Difference]: Without dead ends: 568 [2019-10-15 01:11:16,444 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:16,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-15 01:11:16,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-10-15 01:11:16,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-15 01:11:16,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 914 transitions. [2019-10-15 01:11:16,475 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 914 transitions. Word has length 114 [2019-10-15 01:11:16,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:16,477 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 914 transitions. [2019-10-15 01:11:16,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:16,477 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 914 transitions. [2019-10-15 01:11:16,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-15 01:11:16,482 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:16,483 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:16,483 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:16,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:16,483 INFO L82 PathProgramCache]: Analyzing trace with hash -730763999, now seen corresponding path program 1 times [2019-10-15 01:11:16,484 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:16,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147097907] [2019-10-15 01:11:16,485 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:16,485 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:16,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:16,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:16,663 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147097907] [2019-10-15 01:11:16,664 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:16,664 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:16,664 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843544257] [2019-10-15 01:11:16,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:16,665 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:16,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:16,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:16,666 INFO L87 Difference]: Start difference. First operand 568 states and 914 transitions. Second operand 4 states. [2019-10-15 01:11:16,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:16,736 INFO L93 Difference]: Finished difference Result 1099 states and 1789 transitions. [2019-10-15 01:11:16,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:16,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-10-15 01:11:16,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:16,748 INFO L225 Difference]: With dead ends: 1099 [2019-10-15 01:11:16,748 INFO L226 Difference]: Without dead ends: 568 [2019-10-15 01:11:16,752 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:16,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-15 01:11:16,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-10-15 01:11:16,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-15 01:11:16,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 913 transitions. [2019-10-15 01:11:16,775 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 913 transitions. Word has length 115 [2019-10-15 01:11:16,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:16,776 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 913 transitions. [2019-10-15 01:11:16,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:16,776 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 913 transitions. [2019-10-15 01:11:16,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-15 01:11:16,780 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:16,780 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:16,781 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:16,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:16,781 INFO L82 PathProgramCache]: Analyzing trace with hash 906386007, now seen corresponding path program 1 times [2019-10-15 01:11:16,781 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:16,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779887142] [2019-10-15 01:11:16,782 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:16,782 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:16,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:16,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:16,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779887142] [2019-10-15 01:11:16,966 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:16,966 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:11:16,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189462994] [2019-10-15 01:11:16,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:11:16,967 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:16,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:11:16,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:11:16,968 INFO L87 Difference]: Start difference. First operand 568 states and 913 transitions. Second operand 10 states. [2019-10-15 01:11:17,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:17,180 INFO L93 Difference]: Finished difference Result 1057 states and 1709 transitions. [2019-10-15 01:11:17,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:11:17,181 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 116 [2019-10-15 01:11:17,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:17,186 INFO L225 Difference]: With dead ends: 1057 [2019-10-15 01:11:17,186 INFO L226 Difference]: Without dead ends: 577 [2019-10-15 01:11:17,189 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:11:17,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-15 01:11:17,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 575. [2019-10-15 01:11:17,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-10-15 01:11:17,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 922 transitions. [2019-10-15 01:11:17,219 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 922 transitions. Word has length 116 [2019-10-15 01:11:17,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:17,219 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 922 transitions. [2019-10-15 01:11:17,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:11:17,220 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 922 transitions. [2019-10-15 01:11:17,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-15 01:11:17,225 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:17,225 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:17,226 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:17,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:17,226 INFO L82 PathProgramCache]: Analyzing trace with hash 335134774, now seen corresponding path program 1 times [2019-10-15 01:11:17,226 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:17,227 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309602377] [2019-10-15 01:11:17,227 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:17,227 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:17,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:17,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:17,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309602377] [2019-10-15 01:11:17,354 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:17,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:17,354 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610272735] [2019-10-15 01:11:17,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:17,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:17,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:17,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:17,356 INFO L87 Difference]: Start difference. First operand 575 states and 922 transitions. Second operand 4 states. [2019-10-15 01:11:17,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:17,420 INFO L93 Difference]: Finished difference Result 1105 states and 1795 transitions. [2019-10-15 01:11:17,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:11:17,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-10-15 01:11:17,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:17,428 INFO L225 Difference]: With dead ends: 1105 [2019-10-15 01:11:17,428 INFO L226 Difference]: Without dead ends: 562 [2019-10-15 01:11:17,431 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:17,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-15 01:11:17,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-15 01:11:17,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-15 01:11:17,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 899 transitions. [2019-10-15 01:11:17,458 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 899 transitions. Word has length 116 [2019-10-15 01:11:17,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:17,459 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 899 transitions. [2019-10-15 01:11:17,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:11:17,459 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 899 transitions. [2019-10-15 01:11:17,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-15 01:11:17,463 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:17,463 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:17,463 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:17,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:17,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1313046375, now seen corresponding path program 1 times [2019-10-15 01:11:17,464 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:17,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107975192] [2019-10-15 01:11:17,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:17,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:17,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:17,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:17,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107975192] [2019-10-15 01:11:17,615 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:17,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:17,616 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019918922] [2019-10-15 01:11:17,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:17,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:17,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:17,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:17,617 INFO L87 Difference]: Start difference. First operand 562 states and 899 transitions. Second operand 6 states. [2019-10-15 01:11:17,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:17,839 INFO L93 Difference]: Finished difference Result 1045 states and 1687 transitions. [2019-10-15 01:11:17,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:17,840 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-10-15 01:11:17,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:17,846 INFO L225 Difference]: With dead ends: 1045 [2019-10-15 01:11:17,847 INFO L226 Difference]: Without dead ends: 562 [2019-10-15 01:11:17,853 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:17,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-15 01:11:17,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-15 01:11:17,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-15 01:11:17,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 895 transitions. [2019-10-15 01:11:17,876 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 895 transitions. Word has length 117 [2019-10-15 01:11:17,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:17,878 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 895 transitions. [2019-10-15 01:11:17,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:17,878 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 895 transitions. [2019-10-15 01:11:17,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-15 01:11:17,882 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:17,882 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:17,882 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:17,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:17,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1293617158, now seen corresponding path program 1 times [2019-10-15 01:11:17,883 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:17,883 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841227126] [2019-10-15 01:11:17,887 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:17,887 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:17,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:18,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:18,088 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841227126] [2019-10-15 01:11:18,089 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:18,089 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:18,090 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588778416] [2019-10-15 01:11:18,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:18,092 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:18,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:18,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:18,092 INFO L87 Difference]: Start difference. First operand 562 states and 895 transitions. Second operand 6 states. [2019-10-15 01:11:18,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:18,305 INFO L93 Difference]: Finished difference Result 1045 states and 1683 transitions. [2019-10-15 01:11:18,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:18,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-10-15 01:11:18,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:18,312 INFO L225 Difference]: With dead ends: 1045 [2019-10-15 01:11:18,312 INFO L226 Difference]: Without dead ends: 562 [2019-10-15 01:11:18,315 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:18,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-15 01:11:18,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-15 01:11:18,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-15 01:11:18,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 891 transitions. [2019-10-15 01:11:18,347 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 891 transitions. Word has length 118 [2019-10-15 01:11:18,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:18,348 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 891 transitions. [2019-10-15 01:11:18,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:18,348 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 891 transitions. [2019-10-15 01:11:18,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-15 01:11:18,352 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:18,352 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:18,352 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:18,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:18,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1173950530, now seen corresponding path program 1 times [2019-10-15 01:11:18,353 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:18,353 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517310026] [2019-10-15 01:11:18,353 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:18,353 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:18,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:18,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:18,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517310026] [2019-10-15 01:11:18,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:18,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:18,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074742994] [2019-10-15 01:11:18,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:18,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:18,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:18,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:18,495 INFO L87 Difference]: Start difference. First operand 562 states and 891 transitions. Second operand 6 states. [2019-10-15 01:11:18,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:18,743 INFO L93 Difference]: Finished difference Result 1045 states and 1679 transitions. [2019-10-15 01:11:18,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:18,744 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-10-15 01:11:18,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:18,751 INFO L225 Difference]: With dead ends: 1045 [2019-10-15 01:11:18,751 INFO L226 Difference]: Without dead ends: 562 [2019-10-15 01:11:18,762 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:18,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-15 01:11:18,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-15 01:11:18,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-15 01:11:18,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 887 transitions. [2019-10-15 01:11:18,795 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 887 transitions. Word has length 119 [2019-10-15 01:11:18,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:18,796 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 887 transitions. [2019-10-15 01:11:18,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:18,797 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 887 transitions. [2019-10-15 01:11:18,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-15 01:11:18,802 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:18,803 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:18,803 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:18,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:18,804 INFO L82 PathProgramCache]: Analyzing trace with hash -2140246978, now seen corresponding path program 1 times [2019-10-15 01:11:18,804 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:18,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850669604] [2019-10-15 01:11:18,805 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:18,805 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:18,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:18,992 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850669604] [2019-10-15 01:11:18,992 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:18,992 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:11:18,992 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549395559] [2019-10-15 01:11:18,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:11:18,993 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:18,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:11:18,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:18,994 INFO L87 Difference]: Start difference. First operand 562 states and 887 transitions. Second operand 7 states. [2019-10-15 01:11:19,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:19,092 INFO L93 Difference]: Finished difference Result 1045 states and 1675 transitions. [2019-10-15 01:11:19,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:11:19,093 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2019-10-15 01:11:19,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:19,098 INFO L225 Difference]: With dead ends: 1045 [2019-10-15 01:11:19,099 INFO L226 Difference]: Without dead ends: 541 [2019-10-15 01:11:19,102 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:19,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-10-15 01:11:19,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2019-10-15 01:11:19,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-10-15 01:11:19,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 853 transitions. [2019-10-15 01:11:19,124 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 853 transitions. Word has length 119 [2019-10-15 01:11:19,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:19,125 INFO L462 AbstractCegarLoop]: Abstraction has 541 states and 853 transitions. [2019-10-15 01:11:19,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:11:19,125 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 853 transitions. [2019-10-15 01:11:19,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:11:19,128 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:19,129 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:19,129 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:19,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:19,129 INFO L82 PathProgramCache]: Analyzing trace with hash 2053075839, now seen corresponding path program 1 times [2019-10-15 01:11:19,129 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:19,130 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730213388] [2019-10-15 01:11:19,130 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:19,130 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:19,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:19,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:19,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730213388] [2019-10-15 01:11:19,326 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:19,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:19,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452571849] [2019-10-15 01:11:19,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:19,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:19,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:19,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:19,328 INFO L87 Difference]: Start difference. First operand 541 states and 853 transitions. Second operand 6 states. [2019-10-15 01:11:19,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:19,428 INFO L93 Difference]: Finished difference Result 1024 states and 1641 transitions. [2019-10-15 01:11:19,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:19,429 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-10-15 01:11:19,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:19,433 INFO L225 Difference]: With dead ends: 1024 [2019-10-15 01:11:19,434 INFO L226 Difference]: Without dead ends: 541 [2019-10-15 01:11:19,437 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:19,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-10-15 01:11:19,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2019-10-15 01:11:19,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-10-15 01:11:19,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 852 transitions. [2019-10-15 01:11:19,457 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 852 transitions. Word has length 120 [2019-10-15 01:11:19,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:19,459 INFO L462 AbstractCegarLoop]: Abstraction has 541 states and 852 transitions. [2019-10-15 01:11:19,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:19,459 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 852 transitions. [2019-10-15 01:11:19,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-15 01:11:19,464 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:19,464 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:19,464 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:19,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:19,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1470960925, now seen corresponding path program 1 times [2019-10-15 01:11:19,465 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:19,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642889462] [2019-10-15 01:11:19,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:19,466 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:19,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:19,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:19,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642889462] [2019-10-15 01:11:19,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:19,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:19,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496965767] [2019-10-15 01:11:19,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:19,613 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:19,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:19,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:19,614 INFO L87 Difference]: Start difference. First operand 541 states and 852 transitions. Second operand 6 states. [2019-10-15 01:11:19,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:19,713 INFO L93 Difference]: Finished difference Result 1024 states and 1640 transitions. [2019-10-15 01:11:19,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:19,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-10-15 01:11:19,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:19,718 INFO L225 Difference]: With dead ends: 1024 [2019-10-15 01:11:19,718 INFO L226 Difference]: Without dead ends: 541 [2019-10-15 01:11:19,721 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:19,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-10-15 01:11:19,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2019-10-15 01:11:19,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-10-15 01:11:19,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 851 transitions. [2019-10-15 01:11:19,749 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 851 transitions. Word has length 121 [2019-10-15 01:11:19,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:19,751 INFO L462 AbstractCegarLoop]: Abstraction has 541 states and 851 transitions. [2019-10-15 01:11:19,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:19,751 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 851 transitions. [2019-10-15 01:11:19,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-15 01:11:19,755 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:19,755 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:19,755 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:19,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:19,756 INFO L82 PathProgramCache]: Analyzing trace with hash 470409988, now seen corresponding path program 1 times [2019-10-15 01:11:19,756 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:19,756 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612823269] [2019-10-15 01:11:19,756 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:19,756 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:19,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:19,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:19,948 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612823269] [2019-10-15 01:11:19,948 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:19,948 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:11:19,948 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211669570] [2019-10-15 01:11:19,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:11:19,949 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:19,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:11:19,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:11:19,950 INFO L87 Difference]: Start difference. First operand 541 states and 851 transitions. Second operand 12 states. [2019-10-15 01:11:20,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:20,122 INFO L93 Difference]: Finished difference Result 1025 states and 1639 transitions. [2019-10-15 01:11:20,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:11:20,123 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 122 [2019-10-15 01:11:20,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:20,128 INFO L225 Difference]: With dead ends: 1025 [2019-10-15 01:11:20,128 INFO L226 Difference]: Without dead ends: 541 [2019-10-15 01:11:20,132 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:11:20,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-10-15 01:11:20,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2019-10-15 01:11:20,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-10-15 01:11:20,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 850 transitions. [2019-10-15 01:11:20,156 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 850 transitions. Word has length 122 [2019-10-15 01:11:20,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:20,156 INFO L462 AbstractCegarLoop]: Abstraction has 541 states and 850 transitions. [2019-10-15 01:11:20,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:11:20,156 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 850 transitions. [2019-10-15 01:11:20,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-15 01:11:20,160 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:20,160 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:20,160 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:20,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:20,160 INFO L82 PathProgramCache]: Analyzing trace with hash 213763234, now seen corresponding path program 1 times [2019-10-15 01:11:20,161 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:20,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417038582] [2019-10-15 01:11:20,161 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:20,161 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:20,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:20,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:20,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417038582] [2019-10-15 01:11:20,409 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:20,409 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:11:20,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930795421] [2019-10-15 01:11:20,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:11:20,410 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:20,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:11:20,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:11:20,411 INFO L87 Difference]: Start difference. First operand 541 states and 850 transitions. Second operand 9 states. [2019-10-15 01:11:24,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:24,352 INFO L93 Difference]: Finished difference Result 1022 states and 1653 transitions. [2019-10-15 01:11:24,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:11:24,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-10-15 01:11:24,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:24,358 INFO L225 Difference]: With dead ends: 1022 [2019-10-15 01:11:24,358 INFO L226 Difference]: Without dead ends: 547 [2019-10-15 01:11:24,361 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:11:24,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-10-15 01:11:24,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2019-10-15 01:11:24,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-10-15 01:11:24,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 869 transitions. [2019-10-15 01:11:24,396 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 869 transitions. Word has length 123 [2019-10-15 01:11:24,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:24,396 INFO L462 AbstractCegarLoop]: Abstraction has 545 states and 869 transitions. [2019-10-15 01:11:24,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:11:24,397 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 869 transitions. [2019-10-15 01:11:24,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-15 01:11:24,400 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:24,401 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:24,401 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:24,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:24,401 INFO L82 PathProgramCache]: Analyzing trace with hash 121735372, now seen corresponding path program 1 times [2019-10-15 01:11:24,402 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:24,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101696623] [2019-10-15 01:11:24,402 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:24,402 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:24,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:24,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:24,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101696623] [2019-10-15 01:11:24,597 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:24,597 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:11:24,598 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018684123] [2019-10-15 01:11:24,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:11:24,599 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:24,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:11:24,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:24,600 INFO L87 Difference]: Start difference. First operand 545 states and 869 transitions. Second operand 8 states. [2019-10-15 01:11:30,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:30,486 INFO L93 Difference]: Finished difference Result 1906 states and 3168 transitions. [2019-10-15 01:11:30,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:11:30,487 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 124 [2019-10-15 01:11:30,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:30,504 INFO L225 Difference]: With dead ends: 1906 [2019-10-15 01:11:30,504 INFO L226 Difference]: Without dead ends: 1427 [2019-10-15 01:11:30,512 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:11:30,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2019-10-15 01:11:30,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1388. [2019-10-15 01:11:30,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1388 states. [2019-10-15 01:11:30,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 2236 transitions. [2019-10-15 01:11:30,600 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 2236 transitions. Word has length 124 [2019-10-15 01:11:30,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:30,601 INFO L462 AbstractCegarLoop]: Abstraction has 1388 states and 2236 transitions. [2019-10-15 01:11:30,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:11:30,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 2236 transitions. [2019-10-15 01:11:30,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-15 01:11:30,606 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:30,606 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:30,606 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:30,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:30,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1651184340, now seen corresponding path program 1 times [2019-10-15 01:11:30,607 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:30,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215204158] [2019-10-15 01:11:30,608 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:30,608 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:30,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:30,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:30,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215204158] [2019-10-15 01:11:30,902 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:30,902 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:11:30,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309664295] [2019-10-15 01:11:30,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:11:30,904 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:30,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:11:30,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:30,905 INFO L87 Difference]: Start difference. First operand 1388 states and 2236 transitions. Second operand 7 states. [2019-10-15 01:11:34,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:34,896 INFO L93 Difference]: Finished difference Result 3556 states and 5866 transitions. [2019-10-15 01:11:34,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 01:11:34,897 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2019-10-15 01:11:34,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:34,919 INFO L225 Difference]: With dead ends: 3556 [2019-10-15 01:11:34,919 INFO L226 Difference]: Without dead ends: 2572 [2019-10-15 01:11:34,925 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-10-15 01:11:34,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2019-10-15 01:11:35,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2516. [2019-10-15 01:11:35,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2516 states. [2019-10-15 01:11:35,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2516 states to 2516 states and 4112 transitions. [2019-10-15 01:11:35,040 INFO L78 Accepts]: Start accepts. Automaton has 2516 states and 4112 transitions. Word has length 130 [2019-10-15 01:11:35,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:35,041 INFO L462 AbstractCegarLoop]: Abstraction has 2516 states and 4112 transitions. [2019-10-15 01:11:35,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:11:35,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2516 states and 4112 transitions. [2019-10-15 01:11:35,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:11:35,044 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:35,044 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:35,045 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:35,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:35,045 INFO L82 PathProgramCache]: Analyzing trace with hash -220068901, now seen corresponding path program 1 times [2019-10-15 01:11:35,045 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:35,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520025158] [2019-10-15 01:11:35,046 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:35,046 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:35,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:35,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:35,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520025158] [2019-10-15 01:11:35,164 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:35,164 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:11:35,165 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198400110] [2019-10-15 01:11:35,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:11:35,165 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:35,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:11:35,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:35,166 INFO L87 Difference]: Start difference. First operand 2516 states and 4112 transitions. Second operand 5 states. [2019-10-15 01:11:35,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:35,293 INFO L93 Difference]: Finished difference Result 4632 states and 7632 transitions. [2019-10-15 01:11:35,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:11:35,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-15 01:11:35,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:35,316 INFO L225 Difference]: With dead ends: 4632 [2019-10-15 01:11:35,317 INFO L226 Difference]: Without dead ends: 2575 [2019-10-15 01:11:35,327 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:11:35,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2019-10-15 01:11:35,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 2542. [2019-10-15 01:11:35,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2542 states. [2019-10-15 01:11:35,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2542 states and 4149 transitions. [2019-10-15 01:11:35,470 INFO L78 Accepts]: Start accepts. Automaton has 2542 states and 4149 transitions. Word has length 135 [2019-10-15 01:11:35,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:35,470 INFO L462 AbstractCegarLoop]: Abstraction has 2542 states and 4149 transitions. [2019-10-15 01:11:35,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:11:35,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 4149 transitions. [2019-10-15 01:11:35,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-15 01:11:35,475 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:35,475 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:35,475 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:35,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:35,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1523775240, now seen corresponding path program 1 times [2019-10-15 01:11:35,476 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:35,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216421897] [2019-10-15 01:11:35,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:35,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:35,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:35,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:11:35,670 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216421897] [2019-10-15 01:11:35,670 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:35,670 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:11:35,670 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115672569] [2019-10-15 01:11:35,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:11:35,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:35,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:11:35,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:35,673 INFO L87 Difference]: Start difference. First operand 2542 states and 4149 transitions. Second operand 7 states. [2019-10-15 01:11:35,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:35,957 INFO L93 Difference]: Finished difference Result 4920 states and 8196 transitions. [2019-10-15 01:11:35,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:11:35,957 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 142 [2019-10-15 01:11:35,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:35,975 INFO L225 Difference]: With dead ends: 4920 [2019-10-15 01:11:35,976 INFO L226 Difference]: Without dead ends: 2542 [2019-10-15 01:11:35,988 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:11:35,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2019-10-15 01:11:36,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2542. [2019-10-15 01:11:36,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2542 states. [2019-10-15 01:11:36,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2542 states and 4103 transitions. [2019-10-15 01:11:36,103 INFO L78 Accepts]: Start accepts. Automaton has 2542 states and 4103 transitions. Word has length 142 [2019-10-15 01:11:36,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:36,106 INFO L462 AbstractCegarLoop]: Abstraction has 2542 states and 4103 transitions. [2019-10-15 01:11:36,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:11:36,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 4103 transitions. [2019-10-15 01:11:36,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 01:11:36,110 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:36,110 INFO L380 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-10-15 01:11:36,110 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:36,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:36,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1238042262, now seen corresponding path program 1 times [2019-10-15 01:11:36,111 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:36,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002186316] [2019-10-15 01:11:36,111 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:36,111 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:36,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:36,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:11:36,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002186316] [2019-10-15 01:11:36,250 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:36,250 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:11:36,251 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922943389] [2019-10-15 01:11:36,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:11:36,251 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:36,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:11:36,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:11:36,252 INFO L87 Difference]: Start difference. First operand 2542 states and 4103 transitions. Second operand 7 states. [2019-10-15 01:11:40,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:40,213 INFO L93 Difference]: Finished difference Result 4799 states and 7785 transitions. [2019-10-15 01:11:40,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 01:11:40,213 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 147 [2019-10-15 01:11:40,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:40,233 INFO L225 Difference]: With dead ends: 4799 [2019-10-15 01:11:40,233 INFO L226 Difference]: Without dead ends: 2725 [2019-10-15 01:11:40,245 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:11:40,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2725 states. [2019-10-15 01:11:40,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2725 to 2658. [2019-10-15 01:11:40,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2658 states. [2019-10-15 01:11:40,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 4259 transitions. [2019-10-15 01:11:40,362 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 4259 transitions. Word has length 147 [2019-10-15 01:11:40,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:40,363 INFO L462 AbstractCegarLoop]: Abstraction has 2658 states and 4259 transitions. [2019-10-15 01:11:40,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:11:40,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 4259 transitions. [2019-10-15 01:11:40,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-15 01:11:40,367 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:40,367 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:40,368 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:40,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:40,368 INFO L82 PathProgramCache]: Analyzing trace with hash 115535751, now seen corresponding path program 1 times [2019-10-15 01:11:40,368 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:40,369 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928849937] [2019-10-15 01:11:40,369 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:40,369 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:40,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:40,496 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-15 01:11:40,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928849937] [2019-10-15 01:11:40,496 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:40,497 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:11:40,497 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167349899] [2019-10-15 01:11:40,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:11:40,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:40,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:11:40,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:11:40,498 INFO L87 Difference]: Start difference. First operand 2658 states and 4259 transitions. Second operand 6 states. [2019-10-15 01:11:40,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:40,706 INFO L93 Difference]: Finished difference Result 5948 states and 9653 transitions. [2019-10-15 01:11:40,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:11:40,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2019-10-15 01:11:40,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:40,745 INFO L225 Difference]: With dead ends: 5948 [2019-10-15 01:11:40,745 INFO L226 Difference]: Without dead ends: 3758 [2019-10-15 01:11:40,758 INFO L600 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-10-15 01:11:40,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3758 states. [2019-10-15 01:11:40,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3758 to 3524. [2019-10-15 01:11:40,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3524 states. [2019-10-15 01:11:40,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3524 states to 3524 states and 5688 transitions. [2019-10-15 01:11:40,931 INFO L78 Accepts]: Start accepts. Automaton has 3524 states and 5688 transitions. Word has length 152 [2019-10-15 01:11:40,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:40,932 INFO L462 AbstractCegarLoop]: Abstraction has 3524 states and 5688 transitions. [2019-10-15 01:11:40,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:11:40,932 INFO L276 IsEmpty]: Start isEmpty. Operand 3524 states and 5688 transitions. [2019-10-15 01:11:40,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-15 01:11:40,935 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:40,936 INFO L380 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] [2019-10-15 01:11:40,936 INFO L410 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:40,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:40,936 INFO L82 PathProgramCache]: Analyzing trace with hash 799851757, now seen corresponding path program 1 times [2019-10-15 01:11:40,936 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:40,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033618764] [2019-10-15 01:11:40,937 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:40,937 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:40,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:41,116 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-15 01:11:41,116 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033618764] [2019-10-15 01:11:41,116 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:41,117 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 01:11:41,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679768885] [2019-10-15 01:11:41,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 01:11:41,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:41,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 01:11:41,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:11:41,119 INFO L87 Difference]: Start difference. First operand 3524 states and 5688 transitions. Second operand 11 states.