java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec9_product25.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:12:09,893 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:12:09,899 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:12:09,917 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:12:09,917 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:12:09,918 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:12:09,920 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:12:09,923 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:12:09,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:12:09,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:12:09,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:12:09,937 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:12:09,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:12:09,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:12:09,941 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:12:09,943 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:12:09,944 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:12:09,945 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:12:09,949 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:12:09,954 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:12:09,956 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:12:09,961 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:12:09,962 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:12:09,964 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:12:09,966 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:12:09,967 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:12:09,967 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:12:09,968 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:12:09,970 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:12:09,971 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:12:09,972 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:12:09,974 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:12:09,975 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:12:09,976 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:12:09,980 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:12:09,980 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:12:09,981 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:12:09,981 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:12:09,981 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:12:09,983 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:12:09,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:12:09,987 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-13 21:12:10,018 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:12:10,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:12:10,022 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:12:10,022 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:12:10,022 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:12:10,022 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:12:10,023 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:12:10,023 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:12:10,023 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:12:10,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:12:10,026 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:12:10,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:12:10,026 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:12:10,026 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:12:10,027 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:12:10,027 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:12:10,027 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:12:10,027 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:12:10,027 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:12:10,027 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:12:10,028 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:12:10,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:12:10,028 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:12:10,028 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:12:10,028 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:12:10,029 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:12:10,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:12:10,029 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:12:10,029 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-13 21:12:10,304 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:12:10,319 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:12:10,324 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:12:10,325 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:12:10,326 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:12:10,326 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product25.cil.c [2019-10-13 21:12:10,405 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99d93721e/dd11424d2af345178dfe1559ba9cc6d8/FLAGb1791abe7 [2019-10-13 21:12:11,038 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:12:11,039 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product25.cil.c [2019-10-13 21:12:11,065 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99d93721e/dd11424d2af345178dfe1559ba9cc6d8/FLAGb1791abe7 [2019-10-13 21:12:11,242 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99d93721e/dd11424d2af345178dfe1559ba9cc6d8 [2019-10-13 21:12:11,251 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:12:11,252 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:12:11,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:12:11,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:12:11,257 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:12:11,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:12:11" (1/1) ... [2019-10-13 21:12:11,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51752872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:11, skipping insertion in model container [2019-10-13 21:12:11,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:12:11" (1/1) ... [2019-10-13 21:12:11,270 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:12:11,353 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:12:12,191 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:12:12,218 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:12:12,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:12:12,455 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:12:12,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:12 WrapperNode [2019-10-13 21:12:12,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:12:12,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:12:12,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:12:12,457 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:12:12,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:12" (1/1) ... [2019-10-13 21:12:12,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:12" (1/1) ... [2019-10-13 21:12:12,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:12" (1/1) ... [2019-10-13 21:12:12,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:12" (1/1) ... [2019-10-13 21:12:12,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:12" (1/1) ... [2019-10-13 21:12:12,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:12" (1/1) ... [2019-10-13 21:12:12,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:12" (1/1) ... [2019-10-13 21:12:12,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:12:12,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:12:12,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:12:12,664 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:12:12,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:12" (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-13 21:12:12,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:12:12,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:12:12,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:12:12,743 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-10-13 21:12:12,743 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-10-13 21:12:12,744 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-10-13 21:12:12,745 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-10-13 21:12:12,745 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:12:12,745 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:12:12,746 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:12:12,746 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:12:12,746 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:12:12,746 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:12:12,747 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:12:12,748 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:12:12,748 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:12:12,750 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:12:12,750 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:12:12,751 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:12:12,751 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:12:12,751 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:12:12,752 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:12:12,752 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:12:12,752 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:12:12,752 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:12:12,753 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:12:12,753 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:12:12,753 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:12:12,753 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:12:12,753 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:12:12,754 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:12:12,754 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:12:12,754 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:12:12,755 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:12:12,755 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:12:12,755 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:12:12,756 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:12:12,756 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:12:12,756 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:12:12,756 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:12:12,756 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:12:12,757 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:12:12,757 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:12:12,757 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:12:12,757 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:12:12,757 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:12:12,757 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:12:12,758 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:12:12,758 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:12:12,758 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:12:12,758 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:12:12,758 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:12:12,758 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-13 21:12:12,759 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:12:12,759 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-13 21:12:12,759 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-13 21:12:12,759 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:12:12,759 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:12:12,760 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:12:12,760 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:12:12,760 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:12:12,760 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:12:12,760 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:12:12,761 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:12:12,761 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:12:12,761 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:12:12,761 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:12:12,762 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:12:12,762 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:12:12,762 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:12:12,762 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:12:12,762 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:12:12,762 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:12:12,763 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:12:12,763 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:12:12,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:12:12,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:12:12,764 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:12:12,764 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:12:12,765 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:12:12,765 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:12:12,765 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-10-13 21:12:12,765 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-10-13 21:12:12,766 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-10-13 21:12:12,766 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-10-13 21:12:12,767 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:12:12,767 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:12:12,768 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:12:12,768 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:12:12,768 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:12:12,768 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:12:12,768 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:12:12,769 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:12:12,769 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:12:12,769 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:12:12,769 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:12:12,769 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:12:12,769 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:12:12,770 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:12:12,770 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:12:12,770 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:12:12,770 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:12:12,770 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:12:12,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:12:12,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:12:12,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:12:12,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:12:12,771 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:12:12,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:12:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:12:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:12:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:12:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:12:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:12:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:12:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:12:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:12:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:12:12,774 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:12:12,774 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:12:12,774 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:12:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:12:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:12:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:12:12,776 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:12:12,776 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:12:12,777 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:12:12,777 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:12:12,777 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:12:12,777 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:12:12,777 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:12:12,778 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:12:12,778 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:12:12,778 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:12:12,778 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:12:12,779 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:12:12,779 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:12:12,783 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:12:12,783 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:12:12,783 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:12:12,784 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:12:12,784 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:12:12,784 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:12:12,785 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:12:12,791 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:12:12,792 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:12:12,792 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:12:12,792 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:12:12,792 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-13 21:12:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-13 21:12:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-13 21:12:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:12:12,794 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:12:12,795 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:12:12,795 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:12:12,795 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:12:12,795 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:12:12,795 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:12:12,795 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:12:12,796 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:12:12,796 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:12:12,796 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:12:12,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:12:12,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:12:12,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:12:15,188 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:12:15,189 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:12:15,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:12:15 BoogieIcfgContainer [2019-10-13 21:12:15,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:12:15,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:12:15,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:12:15,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:12:15,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:12:11" (1/3) ... [2019-10-13 21:12:15,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a6d9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:12:15, skipping insertion in model container [2019-10-13 21:12:15,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:12" (2/3) ... [2019-10-13 21:12:15,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a6d9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:12:15, skipping insertion in model container [2019-10-13 21:12:15,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:12:15" (3/3) ... [2019-10-13 21:12:15,201 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product25.cil.c [2019-10-13 21:12:15,211 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:12:15,222 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:12:15,234 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:12:15,283 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:12:15,283 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:12:15,284 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:12:15,284 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:12:15,284 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:12:15,284 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:12:15,284 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:12:15,284 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:12:15,328 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states. [2019-10-13 21:12:15,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-13 21:12:15,359 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:15,361 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:15,363 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:15,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:15,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1728086077, now seen corresponding path program 1 times [2019-10-13 21:12:15,379 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:15,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131144018] [2019-10-13 21:12:15,380 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:15,380 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:15,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:16,075 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-13 21:12:16,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131144018] [2019-10-13 21:12:16,077 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:16,077 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:16,078 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230574993] [2019-10-13 21:12:16,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:16,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:16,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:16,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:16,105 INFO L87 Difference]: Start difference. First operand 749 states. Second operand 4 states. [2019-10-13 21:12:16,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:16,325 INFO L93 Difference]: Finished difference Result 1161 states and 1887 transitions. [2019-10-13 21:12:16,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:16,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-10-13 21:12:16,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:16,366 INFO L225 Difference]: With dead ends: 1161 [2019-10-13 21:12:16,367 INFO L226 Difference]: Without dead ends: 589 [2019-10-13 21:12:16,378 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-13 21:12:16,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-13 21:12:16,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-13 21:12:16,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-13 21:12:16,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 945 transitions. [2019-10-13 21:12:16,495 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 945 transitions. Word has length 109 [2019-10-13 21:12:16,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:16,496 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 945 transitions. [2019-10-13 21:12:16,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:16,496 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 945 transitions. [2019-10-13 21:12:16,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-13 21:12:16,504 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:16,504 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-13 21:12:16,505 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:16,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:16,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1757589142, now seen corresponding path program 1 times [2019-10-13 21:12:16,506 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:16,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035184429] [2019-10-13 21:12:16,507 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:16,507 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:16,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:16,799 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-13 21:12:16,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035184429] [2019-10-13 21:12:16,800 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:16,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:16,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470793519] [2019-10-13 21:12:16,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:16,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:16,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:16,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:16,810 INFO L87 Difference]: Start difference. First operand 589 states and 945 transitions. Second operand 4 states. [2019-10-13 21:12:16,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:16,923 INFO L93 Difference]: Finished difference Result 1141 states and 1848 transitions. [2019-10-13 21:12:16,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:16,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-13 21:12:16,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:16,933 INFO L225 Difference]: With dead ends: 1141 [2019-10-13 21:12:16,934 INFO L226 Difference]: Without dead ends: 589 [2019-10-13 21:12:16,947 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-13 21:12:16,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-13 21:12:17,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-13 21:12:17,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-13 21:12:17,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 944 transitions. [2019-10-13 21:12:17,027 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 944 transitions. Word has length 112 [2019-10-13 21:12:17,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:17,035 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 944 transitions. [2019-10-13 21:12:17,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:17,035 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 944 transitions. [2019-10-13 21:12:17,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-13 21:12:17,045 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:17,045 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-13 21:12:17,046 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:17,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:17,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1080658030, now seen corresponding path program 1 times [2019-10-13 21:12:17,050 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:17,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023739672] [2019-10-13 21:12:17,050 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:17,051 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:17,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:17,382 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-13 21:12:17,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023739672] [2019-10-13 21:12:17,382 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:17,382 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:17,383 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679856517] [2019-10-13 21:12:17,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:17,385 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:17,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:17,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:17,385 INFO L87 Difference]: Start difference. First operand 589 states and 944 transitions. Second operand 4 states. [2019-10-13 21:12:17,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:17,454 INFO L93 Difference]: Finished difference Result 1141 states and 1847 transitions. [2019-10-13 21:12:17,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:17,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-13 21:12:17,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:17,461 INFO L225 Difference]: With dead ends: 1141 [2019-10-13 21:12:17,461 INFO L226 Difference]: Without dead ends: 589 [2019-10-13 21:12:17,465 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-13 21:12:17,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-13 21:12:17,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-13 21:12:17,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-13 21:12:17,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 943 transitions. [2019-10-13 21:12:17,506 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 943 transitions. Word has length 113 [2019-10-13 21:12:17,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:17,506 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 943 transitions. [2019-10-13 21:12:17,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:17,507 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 943 transitions. [2019-10-13 21:12:17,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-13 21:12:17,512 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:17,512 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-13 21:12:17,513 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:17,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:17,513 INFO L82 PathProgramCache]: Analyzing trace with hash -714374894, now seen corresponding path program 1 times [2019-10-13 21:12:17,513 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:17,513 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654725915] [2019-10-13 21:12:17,514 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:17,514 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:17,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:17,689 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-13 21:12:17,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654725915] [2019-10-13 21:12:17,690 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:17,690 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:17,691 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380448867] [2019-10-13 21:12:17,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:17,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:17,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:17,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:17,692 INFO L87 Difference]: Start difference. First operand 589 states and 943 transitions. Second operand 4 states. [2019-10-13 21:12:17,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:17,775 INFO L93 Difference]: Finished difference Result 1141 states and 1846 transitions. [2019-10-13 21:12:17,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:17,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-13 21:12:17,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:17,784 INFO L225 Difference]: With dead ends: 1141 [2019-10-13 21:12:17,784 INFO L226 Difference]: Without dead ends: 589 [2019-10-13 21:12:17,787 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-13 21:12:17,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-13 21:12:17,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-13 21:12:17,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-13 21:12:17,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 942 transitions. [2019-10-13 21:12:17,817 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 942 transitions. Word has length 114 [2019-10-13 21:12:17,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:17,818 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 942 transitions. [2019-10-13 21:12:17,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:17,818 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 942 transitions. [2019-10-13 21:12:17,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-13 21:12:17,821 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:17,822 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-13 21:12:17,822 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:17,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:17,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1484141674, now seen corresponding path program 1 times [2019-10-13 21:12:17,823 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:17,823 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990105679] [2019-10-13 21:12:17,823 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:17,823 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:17,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:17,983 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-13 21:12:17,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990105679] [2019-10-13 21:12:17,984 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:17,985 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:17,985 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221750377] [2019-10-13 21:12:17,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:17,987 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:17,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:17,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:17,989 INFO L87 Difference]: Start difference. First operand 589 states and 942 transitions. Second operand 4 states. [2019-10-13 21:12:18,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:18,074 INFO L93 Difference]: Finished difference Result 1141 states and 1845 transitions. [2019-10-13 21:12:18,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:18,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-10-13 21:12:18,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:18,090 INFO L225 Difference]: With dead ends: 1141 [2019-10-13 21:12:18,090 INFO L226 Difference]: Without dead ends: 589 [2019-10-13 21:12:18,094 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-13 21:12:18,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-13 21:12:18,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-13 21:12:18,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-13 21:12:18,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 941 transitions. [2019-10-13 21:12:18,175 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 941 transitions. Word has length 115 [2019-10-13 21:12:18,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:18,176 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 941 transitions. [2019-10-13 21:12:18,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:18,176 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 941 transitions. [2019-10-13 21:12:18,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-13 21:12:18,180 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:18,181 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-13 21:12:18,181 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:18,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:18,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1366326386, now seen corresponding path program 1 times [2019-10-13 21:12:18,182 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:18,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8906034] [2019-10-13 21:12:18,182 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:18,182 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:18,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:18,401 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-13 21:12:18,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8906034] [2019-10-13 21:12:18,403 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:18,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:12:18,404 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381100781] [2019-10-13 21:12:18,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:12:18,405 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:18,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:12:18,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:12:18,405 INFO L87 Difference]: Start difference. First operand 589 states and 941 transitions. Second operand 10 states. [2019-10-13 21:12:18,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:18,585 INFO L93 Difference]: Finished difference Result 1099 states and 1765 transitions. [2019-10-13 21:12:18,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:12:18,586 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 116 [2019-10-13 21:12:18,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:18,593 INFO L225 Difference]: With dead ends: 1099 [2019-10-13 21:12:18,593 INFO L226 Difference]: Without dead ends: 598 [2019-10-13 21:12:18,598 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-13 21:12:18,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-13 21:12:18,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2019-10-13 21:12:18,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-13 21:12:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 950 transitions. [2019-10-13 21:12:18,633 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 950 transitions. Word has length 116 [2019-10-13 21:12:18,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:18,635 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 950 transitions. [2019-10-13 21:12:18,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:12:18,635 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 950 transitions. [2019-10-13 21:12:18,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-13 21:12:18,639 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:18,640 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-13 21:12:18,640 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:18,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:18,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1937577619, now seen corresponding path program 1 times [2019-10-13 21:12:18,640 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:18,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197976573] [2019-10-13 21:12:18,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:18,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:18,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:18,759 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-13 21:12:18,760 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197976573] [2019-10-13 21:12:18,760 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:18,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:18,761 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105254415] [2019-10-13 21:12:18,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:18,761 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:18,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:18,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:18,762 INFO L87 Difference]: Start difference. First operand 596 states and 950 transitions. Second operand 4 states. [2019-10-13 21:12:18,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:18,817 INFO L93 Difference]: Finished difference Result 1147 states and 1851 transitions. [2019-10-13 21:12:18,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:18,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-10-13 21:12:18,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:18,824 INFO L225 Difference]: With dead ends: 1147 [2019-10-13 21:12:18,824 INFO L226 Difference]: Without dead ends: 583 [2019-10-13 21:12:18,827 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-13 21:12:18,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-13 21:12:18,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-13 21:12:18,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-13 21:12:18,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 927 transitions. [2019-10-13 21:12:18,851 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 927 transitions. Word has length 116 [2019-10-13 21:12:18,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:18,851 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 927 transitions. [2019-10-13 21:12:18,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:18,851 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 927 transitions. [2019-10-13 21:12:18,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-13 21:12:18,855 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:18,855 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-13 21:12:18,855 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:18,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:18,856 INFO L82 PathProgramCache]: Analyzing trace with hash 13298972, now seen corresponding path program 1 times [2019-10-13 21:12:18,856 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:18,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851600378] [2019-10-13 21:12:18,856 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:18,857 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:18,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:19,059 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-13 21:12:19,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851600378] [2019-10-13 21:12:19,061 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:19,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:19,061 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076700660] [2019-10-13 21:12:19,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:19,062 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:19,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:19,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:19,063 INFO L87 Difference]: Start difference. First operand 583 states and 927 transitions. Second operand 6 states. [2019-10-13 21:12:19,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:19,289 INFO L93 Difference]: Finished difference Result 1087 states and 1743 transitions. [2019-10-13 21:12:19,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:19,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-10-13 21:12:19,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:19,295 INFO L225 Difference]: With dead ends: 1087 [2019-10-13 21:12:19,295 INFO L226 Difference]: Without dead ends: 583 [2019-10-13 21:12:19,299 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-13 21:12:19,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-13 21:12:19,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-13 21:12:19,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-13 21:12:19,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 923 transitions. [2019-10-13 21:12:19,323 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 923 transitions. Word has length 117 [2019-10-13 21:12:19,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:19,324 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 923 transitions. [2019-10-13 21:12:19,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:19,325 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 923 transitions. [2019-10-13 21:12:19,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-13 21:12:19,328 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:19,329 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-13 21:12:19,329 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:19,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:19,333 INFO L82 PathProgramCache]: Analyzing trace with hash -65631567, now seen corresponding path program 1 times [2019-10-13 21:12:19,333 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:19,333 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036057225] [2019-10-13 21:12:19,333 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:19,334 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:19,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:19,485 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-13 21:12:19,485 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036057225] [2019-10-13 21:12:19,486 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:19,486 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:19,487 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005890991] [2019-10-13 21:12:19,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:19,488 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:19,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:19,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:19,488 INFO L87 Difference]: Start difference. First operand 583 states and 923 transitions. Second operand 6 states. [2019-10-13 21:12:19,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:19,709 INFO L93 Difference]: Finished difference Result 1087 states and 1739 transitions. [2019-10-13 21:12:19,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:19,710 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-10-13 21:12:19,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:19,716 INFO L225 Difference]: With dead ends: 1087 [2019-10-13 21:12:19,716 INFO L226 Difference]: Without dead ends: 583 [2019-10-13 21:12:19,719 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-13 21:12:19,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-13 21:12:19,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-13 21:12:19,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-13 21:12:19,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 919 transitions. [2019-10-13 21:12:19,749 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 919 transitions. Word has length 118 [2019-10-13 21:12:19,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:19,750 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 919 transitions. [2019-10-13 21:12:19,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:19,750 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 919 transitions. [2019-10-13 21:12:19,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-13 21:12:19,754 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:19,754 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-13 21:12:19,754 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:19,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:19,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1299849921, now seen corresponding path program 1 times [2019-10-13 21:12:19,755 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:19,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448077681] [2019-10-13 21:12:19,755 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:19,755 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:19,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:19,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:12:19,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448077681] [2019-10-13 21:12:19,957 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:19,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:19,958 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403248619] [2019-10-13 21:12:19,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:19,958 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:19,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:19,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:19,959 INFO L87 Difference]: Start difference. First operand 583 states and 919 transitions. Second operand 6 states. [2019-10-13 21:12:20,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:20,177 INFO L93 Difference]: Finished difference Result 1087 states and 1735 transitions. [2019-10-13 21:12:20,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:20,178 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-10-13 21:12:20,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:20,183 INFO L225 Difference]: With dead ends: 1087 [2019-10-13 21:12:20,183 INFO L226 Difference]: Without dead ends: 583 [2019-10-13 21:12:20,191 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-13 21:12:20,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-13 21:12:20,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-13 21:12:20,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-13 21:12:20,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 915 transitions. [2019-10-13 21:12:20,214 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 915 transitions. Word has length 119 [2019-10-13 21:12:20,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:20,214 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 915 transitions. [2019-10-13 21:12:20,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:20,214 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 915 transitions. [2019-10-13 21:12:20,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-13 21:12:20,218 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:20,218 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-13 21:12:20,218 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:20,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:20,219 INFO L82 PathProgramCache]: Analyzing trace with hash 333553473, now seen corresponding path program 1 times [2019-10-13 21:12:20,219 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:20,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139605071] [2019-10-13 21:12:20,220 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:20,220 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:20,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:20,361 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-13 21:12:20,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139605071] [2019-10-13 21:12:20,362 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:20,362 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:12:20,362 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578750688] [2019-10-13 21:12:20,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:12:20,363 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:20,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:12:20,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:12:20,364 INFO L87 Difference]: Start difference. First operand 583 states and 915 transitions. Second operand 7 states. [2019-10-13 21:12:20,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:20,495 INFO L93 Difference]: Finished difference Result 1087 states and 1731 transitions. [2019-10-13 21:12:20,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:12:20,496 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2019-10-13 21:12:20,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:20,503 INFO L225 Difference]: With dead ends: 1087 [2019-10-13 21:12:20,503 INFO L226 Difference]: Without dead ends: 562 [2019-10-13 21:12:20,507 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-13 21:12:20,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-13 21:12:20,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-13 21:12:20,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-13 21:12:20,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 881 transitions. [2019-10-13 21:12:20,533 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 881 transitions. Word has length 119 [2019-10-13 21:12:20,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:20,534 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 881 transitions. [2019-10-13 21:12:20,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:12:20,534 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 881 transitions. [2019-10-13 21:12:20,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 21:12:20,540 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:20,540 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-13 21:12:20,540 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:20,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:20,541 INFO L82 PathProgramCache]: Analyzing trace with hash 197463990, now seen corresponding path program 1 times [2019-10-13 21:12:20,541 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:20,541 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031478613] [2019-10-13 21:12:20,542 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:20,542 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:20,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:20,742 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-13 21:12:20,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031478613] [2019-10-13 21:12:20,743 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:20,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:20,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117180138] [2019-10-13 21:12:20,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:20,744 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:20,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:20,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:20,744 INFO L87 Difference]: Start difference. First operand 562 states and 881 transitions. Second operand 6 states. [2019-10-13 21:12:20,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:20,847 INFO L93 Difference]: Finished difference Result 1066 states and 1697 transitions. [2019-10-13 21:12:20,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:20,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-10-13 21:12:20,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:20,852 INFO L225 Difference]: With dead ends: 1066 [2019-10-13 21:12:20,853 INFO L226 Difference]: Without dead ends: 562 [2019-10-13 21:12:20,856 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-13 21:12:20,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-13 21:12:20,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-13 21:12:20,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-13 21:12:20,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 880 transitions. [2019-10-13 21:12:20,883 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 880 transitions. Word has length 120 [2019-10-13 21:12:20,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:20,884 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 880 transitions. [2019-10-13 21:12:20,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:20,884 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 880 transitions. [2019-10-13 21:12:20,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-13 21:12:20,889 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:20,889 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-13 21:12:20,889 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:20,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:20,890 INFO L82 PathProgramCache]: Analyzing trace with hash -99400602, now seen corresponding path program 1 times [2019-10-13 21:12:20,890 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:20,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129413930] [2019-10-13 21:12:20,891 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:20,891 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:20,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:21,051 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-13 21:12:21,051 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129413930] [2019-10-13 21:12:21,051 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:21,052 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:21,052 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405091269] [2019-10-13 21:12:21,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:21,053 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:21,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:21,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:21,054 INFO L87 Difference]: Start difference. First operand 562 states and 880 transitions. Second operand 6 states. [2019-10-13 21:12:21,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:21,149 INFO L93 Difference]: Finished difference Result 1066 states and 1696 transitions. [2019-10-13 21:12:21,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:21,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-10-13 21:12:21,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:21,155 INFO L225 Difference]: With dead ends: 1066 [2019-10-13 21:12:21,155 INFO L226 Difference]: Without dead ends: 562 [2019-10-13 21:12:21,159 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-13 21:12:21,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-13 21:12:21,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-13 21:12:21,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-13 21:12:21,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 879 transitions. [2019-10-13 21:12:21,178 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 879 transitions. Word has length 121 [2019-10-13 21:12:21,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:21,180 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 879 transitions. [2019-10-13 21:12:21,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:21,180 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 879 transitions. [2019-10-13 21:12:21,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-13 21:12:21,184 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:21,184 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-13 21:12:21,184 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:21,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:21,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1189017277, now seen corresponding path program 1 times [2019-10-13 21:12:21,185 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:21,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018336222] [2019-10-13 21:12:21,185 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:21,185 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:21,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:21,304 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-13 21:12:21,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018336222] [2019-10-13 21:12:21,305 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:21,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:21,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335407247] [2019-10-13 21:12:21,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:21,306 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:21,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:21,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:21,307 INFO L87 Difference]: Start difference. First operand 562 states and 879 transitions. Second operand 4 states. [2019-10-13 21:12:21,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:21,358 INFO L93 Difference]: Finished difference Result 1066 states and 1695 transitions. [2019-10-13 21:12:21,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:21,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-10-13 21:12:21,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:21,363 INFO L225 Difference]: With dead ends: 1066 [2019-10-13 21:12:21,364 INFO L226 Difference]: Without dead ends: 562 [2019-10-13 21:12:21,367 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-13 21:12:21,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-13 21:12:21,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-13 21:12:21,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-13 21:12:21,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 878 transitions. [2019-10-13 21:12:21,398 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 878 transitions. Word has length 122 [2019-10-13 21:12:21,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:21,398 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 878 transitions. [2019-10-13 21:12:21,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:21,399 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 878 transitions. [2019-10-13 21:12:21,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-13 21:12:21,402 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:21,403 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-13 21:12:21,403 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:21,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:21,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1194907461, now seen corresponding path program 1 times [2019-10-13 21:12:21,404 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:21,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555315163] [2019-10-13 21:12:21,404 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:21,404 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:21,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:21,603 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-13 21:12:21,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555315163] [2019-10-13 21:12:21,603 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:21,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:12:21,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048968385] [2019-10-13 21:12:21,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:12:21,605 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:21,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:12:21,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:12:21,605 INFO L87 Difference]: Start difference. First operand 562 states and 878 transitions. Second operand 12 states. [2019-10-13 21:12:21,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:21,795 INFO L93 Difference]: Finished difference Result 1067 states and 1694 transitions. [2019-10-13 21:12:21,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:12:21,796 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 122 [2019-10-13 21:12:21,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:21,801 INFO L225 Difference]: With dead ends: 1067 [2019-10-13 21:12:21,801 INFO L226 Difference]: Without dead ends: 562 [2019-10-13 21:12:21,804 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:12:21,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-13 21:12:21,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-13 21:12:21,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-13 21:12:21,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 877 transitions. [2019-10-13 21:12:21,827 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 877 transitions. Word has length 122 [2019-10-13 21:12:21,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:21,828 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 877 transitions. [2019-10-13 21:12:21,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:12:21,828 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 877 transitions. [2019-10-13 21:12:21,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-13 21:12:21,832 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:21,833 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:21,833 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:21,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:21,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1301394887, now seen corresponding path program 1 times [2019-10-13 21:12:21,834 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:21,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781987110] [2019-10-13 21:12:21,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:21,835 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:21,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:22,062 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-13 21:12:22,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781987110] [2019-10-13 21:12:22,063 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:22,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:12:22,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977207462] [2019-10-13 21:12:22,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:12:22,064 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:22,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:12:22,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:12:22,065 INFO L87 Difference]: Start difference. First operand 562 states and 877 transitions. Second operand 9 states. [2019-10-13 21:12:25,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:25,667 INFO L93 Difference]: Finished difference Result 1064 states and 1708 transitions. [2019-10-13 21:12:25,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:12:25,667 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-10-13 21:12:25,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:25,674 INFO L225 Difference]: With dead ends: 1064 [2019-10-13 21:12:25,674 INFO L226 Difference]: Without dead ends: 568 [2019-10-13 21:12:25,677 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-13 21:12:25,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-13 21:12:25,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 566. [2019-10-13 21:12:25,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-10-13 21:12:25,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 896 transitions. [2019-10-13 21:12:25,705 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 896 transitions. Word has length 123 [2019-10-13 21:12:25,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:25,705 INFO L462 AbstractCegarLoop]: Abstraction has 566 states and 896 transitions. [2019-10-13 21:12:25,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:12:25,706 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 896 transitions. [2019-10-13 21:12:25,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-13 21:12:25,709 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:25,709 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:25,710 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:25,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:25,710 INFO L82 PathProgramCache]: Analyzing trace with hash -613976497, now seen corresponding path program 1 times [2019-10-13 21:12:25,710 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:25,711 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654610153] [2019-10-13 21:12:25,711 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:25,711 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:25,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:25,905 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-13 21:12:25,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654610153] [2019-10-13 21:12:25,906 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:25,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:12:25,906 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595586565] [2019-10-13 21:12:25,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:12:25,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:25,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:12:25,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:12:25,908 INFO L87 Difference]: Start difference. First operand 566 states and 896 transitions. Second operand 8 states. [2019-10-13 21:12:32,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:32,163 INFO L93 Difference]: Finished difference Result 1990 states and 3279 transitions. [2019-10-13 21:12:32,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 21:12:32,164 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 124 [2019-10-13 21:12:32,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:32,183 INFO L225 Difference]: With dead ends: 1990 [2019-10-13 21:12:32,183 INFO L226 Difference]: Without dead ends: 1490 [2019-10-13 21:12:32,191 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-13 21:12:32,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2019-10-13 21:12:32,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1451. [2019-10-13 21:12:32,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2019-10-13 21:12:32,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2319 transitions. [2019-10-13 21:12:32,327 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2319 transitions. Word has length 124 [2019-10-13 21:12:32,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:32,327 INFO L462 AbstractCegarLoop]: Abstraction has 1451 states and 2319 transitions. [2019-10-13 21:12:32,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:12:32,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2319 transitions. [2019-10-13 21:12:32,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-13 21:12:32,334 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:32,334 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:32,335 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:32,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:32,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1563620061, now seen corresponding path program 1 times [2019-10-13 21:12:32,336 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:32,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095647042] [2019-10-13 21:12:32,336 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:32,336 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:32,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:32,568 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-13 21:12:32,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095647042] [2019-10-13 21:12:32,569 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:32,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:12:32,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731745471] [2019-10-13 21:12:32,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:12:32,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:32,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:12:32,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:12:32,572 INFO L87 Difference]: Start difference. First operand 1451 states and 2319 transitions. Second operand 9 states. [2019-10-13 21:12:39,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:39,975 INFO L93 Difference]: Finished difference Result 4654 states and 7664 transitions. [2019-10-13 21:12:39,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 21:12:39,983 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2019-10-13 21:12:39,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:40,009 INFO L225 Difference]: With dead ends: 4654 [2019-10-13 21:12:40,009 INFO L226 Difference]: Without dead ends: 3269 [2019-10-13 21:12:40,018 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-13 21:12:40,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3269 states. [2019-10-13 21:12:40,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3269 to 3046. [2019-10-13 21:12:40,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3046 states. [2019-10-13 21:12:40,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3046 states to 3046 states and 4929 transitions. [2019-10-13 21:12:40,180 INFO L78 Accepts]: Start accepts. Automaton has 3046 states and 4929 transitions. Word has length 130 [2019-10-13 21:12:40,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:40,181 INFO L462 AbstractCegarLoop]: Abstraction has 3046 states and 4929 transitions. [2019-10-13 21:12:40,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:12:40,181 INFO L276 IsEmpty]: Start isEmpty. Operand 3046 states and 4929 transitions. [2019-10-13 21:12:40,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-13 21:12:40,184 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:40,184 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:40,184 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:40,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:40,185 INFO L82 PathProgramCache]: Analyzing trace with hash -430429468, now seen corresponding path program 1 times [2019-10-13 21:12:40,185 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:40,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589494048] [2019-10-13 21:12:40,185 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:40,185 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:40,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:40,293 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-13 21:12:40,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589494048] [2019-10-13 21:12:40,294 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:40,294 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:12:40,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377270779] [2019-10-13 21:12:40,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:12:40,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:40,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:12:40,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:12:40,296 INFO L87 Difference]: Start difference. First operand 3046 states and 4929 transitions. Second operand 5 states. [2019-10-13 21:12:42,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:42,624 INFO L93 Difference]: Finished difference Result 6665 states and 10769 transitions. [2019-10-13 21:12:42,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:42,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-10-13 21:12:42,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:42,654 INFO L225 Difference]: With dead ends: 6665 [2019-10-13 21:12:42,654 INFO L226 Difference]: Without dead ends: 4471 [2019-10-13 21:12:42,668 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:12:42,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4471 states.