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_spec2_product25.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:09:58,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:09:58,640 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:09:58,658 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:09:58,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:09:58,660 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:09:58,662 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:09:58,671 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:09:58,675 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:09:58,679 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:09:58,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:09:58,681 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:09:58,682 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:09:58,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:09:58,686 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:09:58,687 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:09:58,689 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:09:58,689 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:09:58,691 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:09:58,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:09:58,699 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:09:58,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:09:58,704 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:09:58,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:09:58,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:09:58,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:09:58,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:09:58,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:09:58,710 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:09:58,711 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:09:58,711 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:09:58,713 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:09:58,714 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:09:58,715 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:09:58,716 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:09:58,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:09:58,717 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:09:58,717 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:09:58,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:09:58,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:09:58,719 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:09:58,720 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:09:58,750 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:09:58,750 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:09:58,751 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:09:58,752 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:09:58,752 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:09:58,752 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:09:58,757 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:09:58,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:09:58,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:09:58,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:09:58,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:09:58,758 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:09:58,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:09:58,758 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:09:58,758 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:09:58,758 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:09:58,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:09:58,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:09:58,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:09:58,759 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:09:58,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:09:58,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:09:58,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:09:58,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:09:58,760 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:09:58,761 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:09:58,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:09:58,761 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:09:58,761 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:09:59,014 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:09:59,032 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:09:59,035 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:09:59,037 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:09:59,037 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:09:59,038 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product25.cil.c [2019-10-15 01:09:59,103 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c7f9bf49/29d20fbcba684128a12241933b81f5a1/FLAG88b5009f6 [2019-10-15 01:09:59,718 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:09:59,720 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product25.cil.c [2019-10-15 01:09:59,753 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c7f9bf49/29d20fbcba684128a12241933b81f5a1/FLAG88b5009f6 [2019-10-15 01:09:59,988 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c7f9bf49/29d20fbcba684128a12241933b81f5a1 [2019-10-15 01:09:59,998 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:10:00,000 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:10:00,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:10:00,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:10:00,003 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:10:00,004 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:09:59" (1/1) ... [2019-10-15 01:10:00,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@243eae36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:00, skipping insertion in model container [2019-10-15 01:10:00,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:09:59" (1/1) ... [2019-10-15 01:10:00,017 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:10:00,106 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:10:00,778 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:10:00,793 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:10:00,966 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:10:01,048 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:10:01,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:01 WrapperNode [2019-10-15 01:10:01,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:10:01,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:10:01,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:10:01,050 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:10:01,065 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:01" (1/1) ... [2019-10-15 01:10:01,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:01" (1/1) ... [2019-10-15 01:10:01,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:01" (1/1) ... [2019-10-15 01:10:01,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:01" (1/1) ... [2019-10-15 01:10:01,159 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:01" (1/1) ... [2019-10-15 01:10:01,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:01" (1/1) ... [2019-10-15 01:10:01,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:01" (1/1) ... [2019-10-15 01:10:01,248 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:10:01,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:10:01,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:10:01,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:10:01,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:01" (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:10:01,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:10:01,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:10:01,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:10:01,311 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:10:01,311 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:10:01,311 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:10:01,312 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:10:01,312 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:10:01,313 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-15 01:10:01,313 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-15 01:10:01,314 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-15 01:10:01,314 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-15 01:10:01,314 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:10:01,315 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:10:01,315 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:10:01,315 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-15 01:10:01,317 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:10:01,317 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-15 01:10:01,318 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-15 01:10:01,318 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:10:01,318 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:10:01,318 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:10:01,319 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:10:01,319 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:10:01,319 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:10:01,319 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:10:01,320 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:10:01,320 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:10:01,320 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:10:01,321 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:10:01,321 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:10:01,322 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:10:01,322 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:10:01,322 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:10:01,322 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:10:01,322 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:10:01,323 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:10:01,323 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:10:01,323 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:10:01,323 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:10:01,324 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:10:01,324 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:10:01,324 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:10:01,324 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:10:01,324 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:10:01,324 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:10:01,325 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:10:01,325 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:10:01,325 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:10:01,325 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:10:01,325 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:10:01,325 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:10:01,326 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:10:01,326 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:10:01,326 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:10:01,326 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:10:01,326 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:10:01,326 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:10:01,327 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:10:01,327 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:10:01,327 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:10:01,327 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:10:01,328 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:10:01,328 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:10:01,328 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:10:01,328 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:10:01,329 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:10:01,329 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:10:01,329 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:10:01,329 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:10:01,329 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:10:01,330 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:10:01,330 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:10:01,331 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:10:01,331 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:10:01,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:10:01,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:10:01,331 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:10:01,332 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:10:01,332 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:10:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:10:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:10:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:10:01,333 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:10:01,334 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:10:01,334 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:10:01,335 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:10:01,335 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-15 01:10:01,336 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-15 01:10:01,336 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-15 01:10:01,336 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-15 01:10:01,336 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:10:01,336 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:10:01,336 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:10:01,337 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:10:01,337 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:10:01,337 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:10:01,337 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:10:01,337 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:10:01,338 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:10:01,338 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:10:01,338 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:10:01,338 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:10:01,338 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:10:01,338 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:10:01,339 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:10:01,339 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:10:01,339 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:10:01,339 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:10:01,339 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:10:01,340 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-15 01:10:01,340 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-15 01:10:01,340 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-15 01:10:01,340 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:10:01,340 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:10:01,341 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:10:01,341 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:10:01,341 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:10:01,341 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:10:01,342 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:10:01,342 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:10:01,342 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:10:01,342 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:10:01,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:10:01,344 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:10:01,344 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:10:01,344 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:10:01,345 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:10:01,345 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:10:01,345 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:10:01,345 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:10:01,346 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:10:01,346 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:10:01,346 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:10:01,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:10:01,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:10:01,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:10:01,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:10:01,351 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:10:01,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:10:01,352 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:10:01,352 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:10:01,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:10:01,353 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:10:01,360 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:10:01,360 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:10:01,361 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:10:01,361 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:10:01,361 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:10:01,361 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:10:01,361 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:10:01,362 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:10:01,362 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:10:01,362 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:10:01,362 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:10:01,362 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:10:01,362 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:10:01,362 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:10:01,362 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:10:01,363 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:10:01,363 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:10:01,363 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:10:01,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:10:01,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:10:01,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:10:03,424 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:10:03,424 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:10:03,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:10:03 BoogieIcfgContainer [2019-10-15 01:10:03,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:10:03,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:10:03,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:10:03,430 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:10:03,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:09:59" (1/3) ... [2019-10-15 01:10:03,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6157e528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:10:03, skipping insertion in model container [2019-10-15 01:10:03,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:01" (2/3) ... [2019-10-15 01:10:03,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6157e528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:10:03, skipping insertion in model container [2019-10-15 01:10:03,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:10:03" (3/3) ... [2019-10-15 01:10:03,434 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product25.cil.c [2019-10-15 01:10:03,443 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:10:03,455 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:10:03,466 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:10:03,503 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:10:03,503 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:10:03,503 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:10:03,503 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:10:03,503 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:10:03,503 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:10:03,503 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:10:03,503 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:10:03,543 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states. [2019-10-15 01:10:03,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-15 01:10:03,567 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:03,568 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] [2019-10-15 01:10:03,570 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:03,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:03,578 INFO L82 PathProgramCache]: Analyzing trace with hash -517241816, now seen corresponding path program 1 times [2019-10-15 01:10:03,585 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:03,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071391205] [2019-10-15 01:10:03,585 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:03,585 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:03,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:04,119 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:10:04,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071391205] [2019-10-15 01:10:04,121 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:04,121 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:04,121 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049136625] [2019-10-15 01:10:04,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:04,128 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:04,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:04,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:04,145 INFO L87 Difference]: Start difference. First operand 758 states. Second operand 4 states. [2019-10-15 01:10:04,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:04,359 INFO L93 Difference]: Finished difference Result 1179 states and 1917 transitions. [2019-10-15 01:10:04,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:04,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-10-15 01:10:04,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:04,395 INFO L225 Difference]: With dead ends: 1179 [2019-10-15 01:10:04,395 INFO L226 Difference]: Without dead ends: 598 [2019-10-15 01:10:04,407 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:10:04,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-15 01:10:04,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-15 01:10:04,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-15 01:10:04,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 960 transitions. [2019-10-15 01:10:04,533 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 960 transitions. Word has length 107 [2019-10-15 01:10:04,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:04,534 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 960 transitions. [2019-10-15 01:10:04,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:04,534 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 960 transitions. [2019-10-15 01:10:04,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-15 01:10:04,542 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:04,543 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] [2019-10-15 01:10:04,543 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:04,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:04,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1593007226, now seen corresponding path program 1 times [2019-10-15 01:10:04,544 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:04,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247261776] [2019-10-15 01:10:04,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:04,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:04,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:04,696 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:10:04,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247261776] [2019-10-15 01:10:04,697 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:04,697 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:04,697 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395446309] [2019-10-15 01:10:04,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:04,700 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:04,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:04,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:04,701 INFO L87 Difference]: Start difference. First operand 598 states and 960 transitions. Second operand 4 states. [2019-10-15 01:10:04,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:04,781 INFO L93 Difference]: Finished difference Result 1159 states and 1878 transitions. [2019-10-15 01:10:04,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:04,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-10-15 01:10:04,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:04,786 INFO L225 Difference]: With dead ends: 1159 [2019-10-15 01:10:04,787 INFO L226 Difference]: Without dead ends: 598 [2019-10-15 01:10:04,790 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:10:04,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-15 01:10:04,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-15 01:10:04,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-15 01:10:04,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 959 transitions. [2019-10-15 01:10:04,820 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 959 transitions. Word has length 110 [2019-10-15 01:10:04,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:04,821 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 959 transitions. [2019-10-15 01:10:04,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:04,821 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 959 transitions. [2019-10-15 01:10:04,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-15 01:10:04,826 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:04,826 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] [2019-10-15 01:10:04,826 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:04,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:04,827 INFO L82 PathProgramCache]: Analyzing trace with hash 2107821335, now seen corresponding path program 1 times [2019-10-15 01:10:04,827 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:04,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031091993] [2019-10-15 01:10:04,827 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:04,827 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:04,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:05,055 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:10:05,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031091993] [2019-10-15 01:10:05,056 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:05,056 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:05,056 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659827269] [2019-10-15 01:10:05,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:05,057 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:05,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:05,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:05,058 INFO L87 Difference]: Start difference. First operand 598 states and 959 transitions. Second operand 4 states. [2019-10-15 01:10:05,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:05,125 INFO L93 Difference]: Finished difference Result 1159 states and 1877 transitions. [2019-10-15 01:10:05,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:05,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-10-15 01:10:05,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:05,132 INFO L225 Difference]: With dead ends: 1159 [2019-10-15 01:10:05,132 INFO L226 Difference]: Without dead ends: 598 [2019-10-15 01:10:05,135 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:10:05,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-15 01:10:05,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-15 01:10:05,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-15 01:10:05,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 958 transitions. [2019-10-15 01:10:05,175 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 958 transitions. Word has length 111 [2019-10-15 01:10:05,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:05,176 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 958 transitions. [2019-10-15 01:10:05,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:05,176 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 958 transitions. [2019-10-15 01:10:05,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-15 01:10:05,180 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:05,180 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:10:05,181 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:05,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:05,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1729710442, now seen corresponding path program 1 times [2019-10-15 01:10:05,181 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:05,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356914845] [2019-10-15 01:10:05,182 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:05,182 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:05,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:05,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:05,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356914845] [2019-10-15 01:10:05,286 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:05,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:05,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649140804] [2019-10-15 01:10:05,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:05,287 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:05,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:05,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:05,288 INFO L87 Difference]: Start difference. First operand 598 states and 958 transitions. Second operand 4 states. [2019-10-15 01:10:05,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:05,347 INFO L93 Difference]: Finished difference Result 1159 states and 1876 transitions. [2019-10-15 01:10:05,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:05,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-15 01:10:05,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:05,356 INFO L225 Difference]: With dead ends: 1159 [2019-10-15 01:10:05,356 INFO L226 Difference]: Without dead ends: 598 [2019-10-15 01:10:05,360 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:10:05,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-15 01:10:05,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-15 01:10:05,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-15 01:10:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 957 transitions. [2019-10-15 01:10:05,394 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 957 transitions. Word has length 112 [2019-10-15 01:10:05,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:05,395 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 957 transitions. [2019-10-15 01:10:05,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:05,395 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 957 transitions. [2019-10-15 01:10:05,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-15 01:10:05,401 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:05,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] [2019-10-15 01:10:05,401 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:05,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:05,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1243956083, now seen corresponding path program 1 times [2019-10-15 01:10:05,402 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:05,403 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937390610] [2019-10-15 01:10:05,403 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:05,403 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:05,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:05,553 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:10:05,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937390610] [2019-10-15 01:10:05,554 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:05,554 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:05,554 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555045620] [2019-10-15 01:10:05,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:05,556 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:05,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:05,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:05,556 INFO L87 Difference]: Start difference. First operand 598 states and 957 transitions. Second operand 4 states. [2019-10-15 01:10:05,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:05,617 INFO L93 Difference]: Finished difference Result 1159 states and 1875 transitions. [2019-10-15 01:10:05,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:05,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-15 01:10:05,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:05,625 INFO L225 Difference]: With dead ends: 1159 [2019-10-15 01:10:05,625 INFO L226 Difference]: Without dead ends: 598 [2019-10-15 01:10:05,628 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:10:05,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-15 01:10:05,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-15 01:10:05,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-15 01:10:05,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 956 transitions. [2019-10-15 01:10:05,652 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 956 transitions. Word has length 113 [2019-10-15 01:10:05,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:05,653 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 956 transitions. [2019-10-15 01:10:05,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:05,653 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 956 transitions. [2019-10-15 01:10:05,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-15 01:10:05,657 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:05,657 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:10:05,657 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:05,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:05,658 INFO L82 PathProgramCache]: Analyzing trace with hash 616405170, now seen corresponding path program 1 times [2019-10-15 01:10:05,658 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:05,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360894252] [2019-10-15 01:10:05,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:05,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:05,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:05,895 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:10:05,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360894252] [2019-10-15 01:10:05,897 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:05,898 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:10:05,899 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732169379] [2019-10-15 01:10:05,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:10:05,900 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:05,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:10:05,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:10:05,900 INFO L87 Difference]: Start difference. First operand 598 states and 956 transitions. Second operand 10 states. [2019-10-15 01:10:06,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:06,065 INFO L93 Difference]: Finished difference Result 1117 states and 1795 transitions. [2019-10-15 01:10:06,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:10:06,066 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2019-10-15 01:10:06,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:06,080 INFO L225 Difference]: With dead ends: 1117 [2019-10-15 01:10:06,081 INFO L226 Difference]: Without dead ends: 607 [2019-10-15 01:10:06,088 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:10:06,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-15 01:10:06,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 605. [2019-10-15 01:10:06,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-15 01:10:06,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 965 transitions. [2019-10-15 01:10:06,127 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 965 transitions. Word has length 114 [2019-10-15 01:10:06,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:06,129 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 965 transitions. [2019-10-15 01:10:06,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:10:06,130 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 965 transitions. [2019-10-15 01:10:06,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-15 01:10:06,138 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:06,139 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:10:06,139 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:06,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:06,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1035922001, now seen corresponding path program 1 times [2019-10-15 01:10:06,140 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:06,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343991740] [2019-10-15 01:10:06,140 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:06,141 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:06,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:06,288 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:10:06,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343991740] [2019-10-15 01:10:06,289 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:06,290 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:06,290 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296222309] [2019-10-15 01:10:06,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:06,291 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:06,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:06,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:06,293 INFO L87 Difference]: Start difference. First operand 605 states and 965 transitions. Second operand 4 states. [2019-10-15 01:10:06,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:06,368 INFO L93 Difference]: Finished difference Result 1165 states and 1881 transitions. [2019-10-15 01:10:06,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:06,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-15 01:10:06,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:06,380 INFO L225 Difference]: With dead ends: 1165 [2019-10-15 01:10:06,380 INFO L226 Difference]: Without dead ends: 592 [2019-10-15 01:10:06,385 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:10:06,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-15 01:10:06,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-15 01:10:06,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-15 01:10:06,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 942 transitions. [2019-10-15 01:10:06,413 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 942 transitions. Word has length 114 [2019-10-15 01:10:06,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:06,413 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 942 transitions. [2019-10-15 01:10:06,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:06,414 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 942 transitions. [2019-10-15 01:10:06,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-15 01:10:06,420 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:06,420 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:10:06,420 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:06,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:06,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1806095573, now seen corresponding path program 1 times [2019-10-15 01:10:06,421 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:06,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25213314] [2019-10-15 01:10:06,421 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:06,422 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:06,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:06,638 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:10:06,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25213314] [2019-10-15 01:10:06,639 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:06,639 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:06,639 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567614973] [2019-10-15 01:10:06,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:06,640 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:06,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:06,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:06,642 INFO L87 Difference]: Start difference. First operand 592 states and 942 transitions. Second operand 6 states. [2019-10-15 01:10:06,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:06,860 INFO L93 Difference]: Finished difference Result 1105 states and 1773 transitions. [2019-10-15 01:10:06,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:06,861 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-10-15 01:10:06,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:06,865 INFO L225 Difference]: With dead ends: 1105 [2019-10-15 01:10:06,865 INFO L226 Difference]: Without dead ends: 592 [2019-10-15 01:10:06,868 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:10:06,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-15 01:10:06,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-15 01:10:06,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-15 01:10:06,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 938 transitions. [2019-10-15 01:10:06,889 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 938 transitions. Word has length 115 [2019-10-15 01:10:06,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:06,889 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 938 transitions. [2019-10-15 01:10:06,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:06,889 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 938 transitions. [2019-10-15 01:10:06,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-15 01:10:06,893 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:06,893 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:10:06,893 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:06,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:06,894 INFO L82 PathProgramCache]: Analyzing trace with hash 36368181, now seen corresponding path program 1 times [2019-10-15 01:10:06,894 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:06,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565278528] [2019-10-15 01:10:06,894 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:06,895 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:06,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:07,055 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:10:07,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565278528] [2019-10-15 01:10:07,057 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:07,057 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:07,057 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856135661] [2019-10-15 01:10:07,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:07,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:07,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:07,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:07,059 INFO L87 Difference]: Start difference. First operand 592 states and 938 transitions. Second operand 6 states. [2019-10-15 01:10:07,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:07,254 INFO L93 Difference]: Finished difference Result 1105 states and 1769 transitions. [2019-10-15 01:10:07,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:07,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2019-10-15 01:10:07,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:07,260 INFO L225 Difference]: With dead ends: 1105 [2019-10-15 01:10:07,261 INFO L226 Difference]: Without dead ends: 592 [2019-10-15 01:10:07,263 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:10:07,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-15 01:10:07,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-15 01:10:07,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-15 01:10:07,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 934 transitions. [2019-10-15 01:10:07,289 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 934 transitions. Word has length 116 [2019-10-15 01:10:07,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:07,289 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 934 transitions. [2019-10-15 01:10:07,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:07,289 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 934 transitions. [2019-10-15 01:10:07,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-15 01:10:07,292 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:07,293 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:10:07,293 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:07,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:07,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1408982758, now seen corresponding path program 1 times [2019-10-15 01:10:07,294 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:07,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045972076] [2019-10-15 01:10:07,294 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:07,294 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:07,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:07,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:07,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045972076] [2019-10-15 01:10:07,425 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:07,425 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:07,425 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293341594] [2019-10-15 01:10:07,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:07,426 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:07,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:07,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:07,427 INFO L87 Difference]: Start difference. First operand 592 states and 934 transitions. Second operand 6 states. [2019-10-15 01:10:07,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:07,608 INFO L93 Difference]: Finished difference Result 1105 states and 1765 transitions. [2019-10-15 01:10:07,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:07,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-10-15 01:10:07,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:07,614 INFO L225 Difference]: With dead ends: 1105 [2019-10-15 01:10:07,614 INFO L226 Difference]: Without dead ends: 592 [2019-10-15 01:10:07,622 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:10:07,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-15 01:10:07,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-15 01:10:07,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-15 01:10:07,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 930 transitions. [2019-10-15 01:10:07,649 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 930 transitions. Word has length 117 [2019-10-15 01:10:07,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:07,649 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 930 transitions. [2019-10-15 01:10:07,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:07,650 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 930 transitions. [2019-10-15 01:10:07,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-15 01:10:07,653 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:07,654 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:10:07,654 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:07,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:07,654 INFO L82 PathProgramCache]: Analyzing trace with hash -954122854, now seen corresponding path program 1 times [2019-10-15 01:10:07,655 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:07,655 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995626812] [2019-10-15 01:10:07,655 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:07,655 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:07,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:07,823 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:10:07,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995626812] [2019-10-15 01:10:07,823 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:07,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:07,824 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526604409] [2019-10-15 01:10:07,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:07,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:07,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:07,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:07,825 INFO L87 Difference]: Start difference. First operand 592 states and 930 transitions. Second operand 7 states. [2019-10-15 01:10:07,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:07,903 INFO L93 Difference]: Finished difference Result 1105 states and 1761 transitions. [2019-10-15 01:10:07,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:07,904 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-10-15 01:10:07,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:07,908 INFO L225 Difference]: With dead ends: 1105 [2019-10-15 01:10:07,908 INFO L226 Difference]: Without dead ends: 571 [2019-10-15 01:10:07,911 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:10:07,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-15 01:10:07,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-15 01:10:07,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-15 01:10:07,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 896 transitions. [2019-10-15 01:10:07,931 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 896 transitions. Word has length 117 [2019-10-15 01:10:07,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:07,932 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 896 transitions. [2019-10-15 01:10:07,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:07,932 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 896 transitions. [2019-10-15 01:10:07,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-15 01:10:07,936 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:07,936 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:10:07,936 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:07,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:07,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1388598246, now seen corresponding path program 1 times [2019-10-15 01:10:07,937 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:07,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041030906] [2019-10-15 01:10:07,937 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:07,937 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:07,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:08,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:08,047 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041030906] [2019-10-15 01:10:08,048 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:08,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:08,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451734262] [2019-10-15 01:10:08,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:08,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:08,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:08,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:08,049 INFO L87 Difference]: Start difference. First operand 571 states and 896 transitions. Second operand 6 states. [2019-10-15 01:10:08,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:08,139 INFO L93 Difference]: Finished difference Result 1084 states and 1727 transitions. [2019-10-15 01:10:08,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:08,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-10-15 01:10:08,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:08,144 INFO L225 Difference]: With dead ends: 1084 [2019-10-15 01:10:08,144 INFO L226 Difference]: Without dead ends: 571 [2019-10-15 01:10:08,146 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:10:08,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-15 01:10:08,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-15 01:10:08,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-15 01:10:08,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 895 transitions. [2019-10-15 01:10:08,164 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 895 transitions. Word has length 118 [2019-10-15 01:10:08,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:08,164 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 895 transitions. [2019-10-15 01:10:08,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:08,164 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 895 transitions. [2019-10-15 01:10:08,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-15 01:10:08,168 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:08,168 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:10:08,168 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:08,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:08,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1119912287, now seen corresponding path program 1 times [2019-10-15 01:10:08,169 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:08,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850018938] [2019-10-15 01:10:08,169 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:08,169 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:08,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:08,279 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:10:08,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850018938] [2019-10-15 01:10:08,279 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:08,280 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:10:08,280 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796806625] [2019-10-15 01:10:08,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:10:08,281 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:08,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:10:08,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:08,281 INFO L87 Difference]: Start difference. First operand 571 states and 895 transitions. Second operand 6 states. [2019-10-15 01:10:08,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:08,407 INFO L93 Difference]: Finished difference Result 1084 states and 1726 transitions. [2019-10-15 01:10:08,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:10:08,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-10-15 01:10:08,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:08,413 INFO L225 Difference]: With dead ends: 1084 [2019-10-15 01:10:08,413 INFO L226 Difference]: Without dead ends: 571 [2019-10-15 01:10:08,417 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:10:08,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-15 01:10:08,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-15 01:10:08,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-15 01:10:08,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 894 transitions. [2019-10-15 01:10:08,442 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 894 transitions. Word has length 119 [2019-10-15 01:10:08,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:08,443 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 894 transitions. [2019-10-15 01:10:08,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:10:08,443 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 894 transitions. [2019-10-15 01:10:08,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:10:08,448 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:08,448 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:10:08,449 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:08,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:08,449 INFO L82 PathProgramCache]: Analyzing trace with hash -844049153, now seen corresponding path program 1 times [2019-10-15 01:10:08,450 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:08,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534197726] [2019-10-15 01:10:08,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:08,450 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:08,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:08,708 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:10:08,708 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534197726] [2019-10-15 01:10:08,709 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:08,709 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:10:08,709 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232231626] [2019-10-15 01:10:08,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:10:08,710 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:08,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:10:08,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:10:08,711 INFO L87 Difference]: Start difference. First operand 571 states and 894 transitions. Second operand 12 states. [2019-10-15 01:10:08,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:08,882 INFO L93 Difference]: Finished difference Result 1085 states and 1725 transitions. [2019-10-15 01:10:08,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:10:08,882 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 120 [2019-10-15 01:10:08,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:08,887 INFO L225 Difference]: With dead ends: 1085 [2019-10-15 01:10:08,887 INFO L226 Difference]: Without dead ends: 571 [2019-10-15 01:10:08,890 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:10:08,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-15 01:10:08,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-15 01:10:08,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-15 01:10:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 893 transitions. [2019-10-15 01:10:08,910 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 893 transitions. Word has length 120 [2019-10-15 01:10:08,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:08,912 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 893 transitions. [2019-10-15 01:10:08,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:10:08,912 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 893 transitions. [2019-10-15 01:10:08,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-15 01:10:08,915 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:08,916 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:10:08,916 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:08,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:08,916 INFO L82 PathProgramCache]: Analyzing trace with hash 704955672, now seen corresponding path program 1 times [2019-10-15 01:10:08,916 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:08,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420799455] [2019-10-15 01:10:08,917 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:08,917 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:08,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:09,096 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:10:09,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420799455] [2019-10-15 01:10:09,096 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:09,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:10:09,097 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570251280] [2019-10-15 01:10:09,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:10:09,098 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:09,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:10:09,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:10:09,099 INFO L87 Difference]: Start difference. First operand 571 states and 893 transitions. Second operand 9 states. [2019-10-15 01:10:12,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:12,879 INFO L93 Difference]: Finished difference Result 1082 states and 1739 transitions. [2019-10-15 01:10:12,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:10:12,879 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-10-15 01:10:12,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:12,885 INFO L225 Difference]: With dead ends: 1082 [2019-10-15 01:10:12,885 INFO L226 Difference]: Without dead ends: 577 [2019-10-15 01:10:12,887 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:10:12,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-15 01:10:12,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 575. [2019-10-15 01:10:12,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-10-15 01:10:12,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 912 transitions. [2019-10-15 01:10:12,913 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 912 transitions. Word has length 121 [2019-10-15 01:10:12,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:12,913 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 912 transitions. [2019-10-15 01:10:12,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:10:12,914 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 912 transitions. [2019-10-15 01:10:12,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-15 01:10:12,917 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:12,917 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:10:12,917 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:12,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:12,918 INFO L82 PathProgramCache]: Analyzing trace with hash 949783563, now seen corresponding path program 1 times [2019-10-15 01:10:12,918 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:12,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429942022] [2019-10-15 01:10:12,918 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:12,918 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:12,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:13,086 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:10:13,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429942022] [2019-10-15 01:10:13,092 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:13,093 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:10:13,093 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998433073] [2019-10-15 01:10:13,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:10:13,094 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:13,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:10:13,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:10:13,094 INFO L87 Difference]: Start difference. First operand 575 states and 912 transitions. Second operand 8 states. [2019-10-15 01:10:19,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:19,851 INFO L93 Difference]: Finished difference Result 2026 states and 3340 transitions. [2019-10-15 01:10:19,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:10:19,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-10-15 01:10:19,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:19,863 INFO L225 Difference]: With dead ends: 2026 [2019-10-15 01:10:19,863 INFO L226 Difference]: Without dead ends: 1517 [2019-10-15 01:10:19,867 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:10:19,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2019-10-15 01:10:19,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1478. [2019-10-15 01:10:19,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1478 states. [2019-10-15 01:10:19,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 2365 transitions. [2019-10-15 01:10:19,950 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 2365 transitions. Word has length 122 [2019-10-15 01:10:19,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:19,951 INFO L462 AbstractCegarLoop]: Abstraction has 1478 states and 2365 transitions. [2019-10-15 01:10:19,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:10:19,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2365 transitions. [2019-10-15 01:10:19,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-15 01:10:19,954 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:19,955 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] [2019-10-15 01:10:19,955 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:19,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:19,955 INFO L82 PathProgramCache]: Analyzing trace with hash 360253614, now seen corresponding path program 1 times [2019-10-15 01:10:19,955 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:19,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319663133] [2019-10-15 01:10:19,956 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:19,956 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:19,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:20,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:20,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319663133] [2019-10-15 01:10:20,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:20,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:10:20,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737372448] [2019-10-15 01:10:20,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:10:20,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:20,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:10:20,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:10:20,137 INFO L87 Difference]: Start difference. First operand 1478 states and 2365 transitions. Second operand 9 states. [2019-10-15 01:10:27,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:27,038 INFO L93 Difference]: Finished difference Result 4735 states and 7800 transitions. [2019-10-15 01:10:27,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 01:10:27,038 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-10-15 01:10:27,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:27,063 INFO L225 Difference]: With dead ends: 4735 [2019-10-15 01:10:27,063 INFO L226 Difference]: Without dead ends: 3323 [2019-10-15 01:10:27,072 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:10:27,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2019-10-15 01:10:27,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 3100. [2019-10-15 01:10:27,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3100 states. [2019-10-15 01:10:27,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 5020 transitions. [2019-10-15 01:10:27,236 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 5020 transitions. Word has length 128 [2019-10-15 01:10:27,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:27,236 INFO L462 AbstractCegarLoop]: Abstraction has 3100 states and 5020 transitions. [2019-10-15 01:10:27,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:10:27,236 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 5020 transitions. [2019-10-15 01:10:27,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-15 01:10:27,240 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:27,240 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] [2019-10-15 01:10:27,240 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:27,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:27,241 INFO L82 PathProgramCache]: Analyzing trace with hash 352494255, now seen corresponding path program 1 times [2019-10-15 01:10:27,241 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:27,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108783337] [2019-10-15 01:10:27,241 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:27,242 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:27,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:27,437 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:10:27,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108783337] [2019-10-15 01:10:27,438 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:27,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:27,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974490249] [2019-10-15 01:10:27,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:27,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:27,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:27,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:27,441 INFO L87 Difference]: Start difference. First operand 3100 states and 5020 transitions. Second operand 7 states. [2019-10-15 01:10:31,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:31,290 INFO L93 Difference]: Finished difference Result 7942 states and 13084 transitions. [2019-10-15 01:10:31,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 01:10:31,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2019-10-15 01:10:31,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:31,333 INFO L225 Difference]: With dead ends: 7942 [2019-10-15 01:10:31,334 INFO L226 Difference]: Without dead ends: 5720 [2019-10-15 01:10:31,347 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:10:31,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5720 states. [2019-10-15 01:10:31,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5720 to 5627. [2019-10-15 01:10:31,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5627 states. [2019-10-15 01:10:31,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5627 states to 5627 states and 9190 transitions. [2019-10-15 01:10:31,654 INFO L78 Accepts]: Start accepts. Automaton has 5627 states and 9190 transitions. Word has length 128 [2019-10-15 01:10:31,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:31,657 INFO L462 AbstractCegarLoop]: Abstraction has 5627 states and 9190 transitions. [2019-10-15 01:10:31,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:31,658 INFO L276 IsEmpty]: Start isEmpty. Operand 5627 states and 9190 transitions. [2019-10-15 01:10:31,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-15 01:10:31,663 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:31,663 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] [2019-10-15 01:10:31,664 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:31,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:31,665 INFO L82 PathProgramCache]: Analyzing trace with hash 219395717, now seen corresponding path program 1 times [2019-10-15 01:10:31,665 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:31,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015037694] [2019-10-15 01:10:31,666 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:31,666 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:31,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:31,873 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:10:31,874 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015037694] [2019-10-15 01:10:31,874 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:31,874 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:10:31,874 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608572501] [2019-10-15 01:10:31,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:31,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:31,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:31,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:31,877 INFO L87 Difference]: Start difference. First operand 5627 states and 9190 transitions. Second operand 5 states. [2019-10-15 01:10:32,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:32,116 INFO L93 Difference]: Finished difference Result 10384 states and 17048 transitions. [2019-10-15 01:10:32,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:32,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-15 01:10:32,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:32,170 INFO L225 Difference]: With dead ends: 10384 [2019-10-15 01:10:32,170 INFO L226 Difference]: Without dead ends: 5745 [2019-10-15 01:10:32,193 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:10:32,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5745 states.