java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product09.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:09:23,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:09:23,392 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:09:23,404 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:09:23,404 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:09:23,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:09:23,406 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:09:23,408 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:09:23,410 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:09:23,411 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:09:23,412 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:09:23,413 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:09:23,413 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:09:23,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:09:23,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:09:23,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:09:23,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:09:23,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:09:23,419 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:09:23,421 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:09:23,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:09:23,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:09:23,424 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:09:23,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:09:23,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:09:23,430 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:09:23,431 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:09:23,432 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:09:23,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:09:23,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:09:23,435 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:09:23,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:09:23,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:09:23,439 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:09:23,443 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:09:23,443 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:09:23,444 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:09:23,444 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:09:23,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:09:23,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:09:23,447 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:09:23,447 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:09:23,460 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:09:23,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:09:23,462 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:09:23,462 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:09:23,462 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:09:23,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:09:23,463 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:09:23,463 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:09:23,463 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:09:23,463 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:09:23,463 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:09:23,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:09:23,464 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:09:23,464 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:09:23,464 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:09:23,464 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:09:23,465 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:09:23,465 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:09:23,465 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:09:23,465 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:09:23,466 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:09:23,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:09:23,466 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:09:23,466 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:09:23,466 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:09:23,467 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:09:23,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:09:23,467 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:09:23,467 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:09:23,724 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:09:23,737 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:09:23,740 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:09:23,742 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:09:23,742 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:09:23,743 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product09.cil.c [2019-10-15 01:09:23,819 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ad37c2fb/f8471f955aca4c66a8d31f4d08929f33/FLAG52fde2898 [2019-10-15 01:09:24,464 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:09:24,465 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product09.cil.c [2019-10-15 01:09:24,482 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ad37c2fb/f8471f955aca4c66a8d31f4d08929f33/FLAG52fde2898 [2019-10-15 01:09:24,654 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ad37c2fb/f8471f955aca4c66a8d31f4d08929f33 [2019-10-15 01:09:24,662 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:09:24,664 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:09:24,665 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:09:24,665 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:09:24,668 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:09:24,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:09:24" (1/1) ... [2019-10-15 01:09:24,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54803c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:24, skipping insertion in model container [2019-10-15 01:09:24,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:09:24" (1/1) ... [2019-10-15 01:09:24,678 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:09:24,763 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:09:25,397 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:09:25,416 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:09:25,548 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:09:25,602 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:09:25,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:25 WrapperNode [2019-10-15 01:09:25,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:09:25,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:09:25,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:09:25,603 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:09:25,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:25" (1/1) ... [2019-10-15 01:09:25,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:25" (1/1) ... [2019-10-15 01:09:25,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:25" (1/1) ... [2019-10-15 01:09:25,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:25" (1/1) ... [2019-10-15 01:09:25,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:25" (1/1) ... [2019-10-15 01:09:25,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:25" (1/1) ... [2019-10-15 01:09:25,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:25" (1/1) ... [2019-10-15 01:09:25,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:09:25,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:09:25,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:09:25,801 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:09:25,805 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:09:25,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:09:25,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:09:25,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:09:25,884 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:09:25,884 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:09:25,885 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:09:25,886 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:09:25,886 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:09:25,886 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:09:25,887 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:09:25,887 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:09:25,887 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:09:25,887 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:09:25,888 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:09:25,888 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:09:25,889 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:09:25,891 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:09:25,891 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:09:25,892 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:09:25,892 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:09:25,892 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:09:25,892 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:09:25,893 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:09:25,893 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-15 01:09:25,893 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-15 01:09:25,893 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-15 01:09:25,893 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-15 01:09:25,894 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:09:25,894 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:09:25,894 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:09:25,894 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:09:25,895 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:09:25,895 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:09:25,895 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:09:25,895 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:09:25,896 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:09:25,896 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:09:25,896 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:09:25,896 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:09:25,896 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:09:25,897 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:09:25,897 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:09:25,897 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:09:25,897 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:09:25,898 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-15 01:09:25,898 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:09:25,898 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:09:25,898 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:09:25,898 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:09:25,898 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:09:25,899 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:09:25,899 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:09:25,899 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:09:25,899 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:09:25,899 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:09:25,899 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:09:25,900 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:09:25,900 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:09:25,900 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:09:25,900 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:09:25,900 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:09:25,901 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:09:25,901 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:09:25,901 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:09:25,902 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:09:25,902 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:09:25,902 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:09:25,902 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:09:25,903 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:09:25,903 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:09:25,903 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:09:25,903 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:09:25,903 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:09:25,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:09:25,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:09:25,905 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:09:25,905 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:09:25,905 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:09:25,905 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:09:25,906 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:09:25,906 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:09:25,906 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:09:25,906 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:09:25,907 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:09:25,907 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:09:25,908 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:09:25,908 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:09:25,909 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:09:25,909 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:09:25,909 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:09:25,909 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:09:25,909 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:09:25,909 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:09:25,910 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:09:25,910 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:09:25,910 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:09:25,910 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:09:25,910 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:09:25,910 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-15 01:09:25,911 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-15 01:09:25,911 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:09:25,911 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:09:25,911 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:09:25,911 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:09:25,911 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:09:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:09:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:09:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:09:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:09:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:09:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:09:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-15 01:09:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-15 01:09:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:09:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:09:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:09:25,914 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:09:25,914 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:09:25,914 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:09:25,914 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:09:25,915 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:09:25,915 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:09:25,915 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:09:25,916 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:09:25,917 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:09:25,917 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:09:25,917 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:09:25,917 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-15 01:09:25,917 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:09:25,917 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:09:25,918 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:09:25,918 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:09:25,918 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:09:25,918 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:09:25,919 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:09:25,919 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:09:25,920 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:09:25,922 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:09:25,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:09:25,923 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:09:25,923 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:09:25,924 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:09:25,924 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:09:25,924 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:09:25,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:09:25,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:09:25,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:09:25,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:09:25,932 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:09:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:09:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:09:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:09:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:09:25,933 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:09:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:09:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:09:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:09:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:09:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:09:25,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:09:25,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:09:28,125 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:09:28,126 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:09:28,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:09:28 BoogieIcfgContainer [2019-10-15 01:09:28,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:09:28,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:09:28,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:09:28,132 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:09:28,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:09:24" (1/3) ... [2019-10-15 01:09:28,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2916d9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:09:28, skipping insertion in model container [2019-10-15 01:09:28,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:25" (2/3) ... [2019-10-15 01:09:28,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2916d9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:09:28, skipping insertion in model container [2019-10-15 01:09:28,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:09:28" (3/3) ... [2019-10-15 01:09:28,136 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product09.cil.c [2019-10-15 01:09:28,145 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:09:28,154 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:09:28,165 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:09:28,196 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:09:28,196 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:09:28,196 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:09:28,196 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:09:28,196 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:09:28,196 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:09:28,197 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:09:28,197 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:09:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states. [2019-10-15 01:09:28,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-15 01:09:28,260 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:28,262 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:28,264 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:28,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:28,270 INFO L82 PathProgramCache]: Analyzing trace with hash -943810912, now seen corresponding path program 1 times [2019-10-15 01:09:28,280 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:28,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879025145] [2019-10-15 01:09:28,280 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:28,280 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:28,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:28,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:28,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879025145] [2019-10-15 01:09:28,859 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:28,859 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:28,859 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972742531] [2019-10-15 01:09:28,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:28,866 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:28,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:28,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:28,886 INFO L87 Difference]: Start difference. First operand 737 states. Second operand 4 states. [2019-10-15 01:09:29,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:29,073 INFO L93 Difference]: Finished difference Result 1137 states and 1861 transitions. [2019-10-15 01:09:29,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:29,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-10-15 01:09:29,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:29,110 INFO L225 Difference]: With dead ends: 1137 [2019-10-15 01:09:29,110 INFO L226 Difference]: Without dead ends: 577 [2019-10-15 01:09:29,123 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:29,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-15 01:09:29,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-10-15 01:09:29,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-15 01:09:29,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 932 transitions. [2019-10-15 01:09:29,259 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 932 transitions. Word has length 107 [2019-10-15 01:09:29,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:29,260 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 932 transitions. [2019-10-15 01:09:29,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:29,261 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 932 transitions. [2019-10-15 01:09:29,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-15 01:09:29,270 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:29,271 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:29,272 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:29,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:29,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1793356700, now seen corresponding path program 1 times [2019-10-15 01:09:29,272 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:29,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295522163] [2019-10-15 01:09:29,273 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:29,273 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:29,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:29,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:29,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295522163] [2019-10-15 01:09:29,469 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:29,469 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:29,470 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620430042] [2019-10-15 01:09:29,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:29,476 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:29,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:29,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:29,477 INFO L87 Difference]: Start difference. First operand 577 states and 932 transitions. Second operand 4 states. [2019-10-15 01:09:29,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:29,561 INFO L93 Difference]: Finished difference Result 1117 states and 1822 transitions. [2019-10-15 01:09:29,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:29,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-10-15 01:09:29,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:29,568 INFO L225 Difference]: With dead ends: 1117 [2019-10-15 01:09:29,569 INFO L226 Difference]: Without dead ends: 577 [2019-10-15 01:09:29,578 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:29,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-15 01:09:29,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-10-15 01:09:29,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-15 01:09:29,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 931 transitions. [2019-10-15 01:09:29,627 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 931 transitions. Word has length 110 [2019-10-15 01:09:29,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:29,630 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 931 transitions. [2019-10-15 01:09:29,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:29,631 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 931 transitions. [2019-10-15 01:09:29,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-15 01:09:29,644 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:29,644 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:29,644 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:29,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:29,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1568343631, now seen corresponding path program 1 times [2019-10-15 01:09:29,645 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:29,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41422282] [2019-10-15 01:09:29,646 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:29,646 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:29,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:29,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:29,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41422282] [2019-10-15 01:09:29,872 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:29,872 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:29,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499596427] [2019-10-15 01:09:29,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:29,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:29,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:29,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:29,875 INFO L87 Difference]: Start difference. First operand 577 states and 931 transitions. Second operand 4 states. [2019-10-15 01:09:29,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:29,932 INFO L93 Difference]: Finished difference Result 1117 states and 1821 transitions. [2019-10-15 01:09:29,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:29,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-10-15 01:09:29,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:29,938 INFO L225 Difference]: With dead ends: 1117 [2019-10-15 01:09:29,938 INFO L226 Difference]: Without dead ends: 577 [2019-10-15 01:09:29,940 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:29,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-15 01:09:29,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-10-15 01:09:29,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-15 01:09:29,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 930 transitions. [2019-10-15 01:09:29,966 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 930 transitions. Word has length 111 [2019-10-15 01:09:29,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:29,967 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 930 transitions. [2019-10-15 01:09:29,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:29,967 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 930 transitions. [2019-10-15 01:09:29,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-15 01:09:29,971 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:29,971 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:29,971 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:29,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:29,972 INFO L82 PathProgramCache]: Analyzing trace with hash 84938816, now seen corresponding path program 1 times [2019-10-15 01:09:29,972 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:29,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407761992] [2019-10-15 01:09:29,972 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:29,972 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:29,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:30,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:30,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407761992] [2019-10-15 01:09:30,088 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:30,088 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:30,088 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080925686] [2019-10-15 01:09:30,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:30,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:30,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:30,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:30,089 INFO L87 Difference]: Start difference. First operand 577 states and 930 transitions. Second operand 4 states. [2019-10-15 01:09:30,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:30,149 INFO L93 Difference]: Finished difference Result 1117 states and 1820 transitions. [2019-10-15 01:09:30,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:30,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-15 01:09:30,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:30,154 INFO L225 Difference]: With dead ends: 1117 [2019-10-15 01:09:30,155 INFO L226 Difference]: Without dead ends: 577 [2019-10-15 01:09:30,157 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:30,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-15 01:09:30,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-10-15 01:09:30,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-15 01:09:30,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 929 transitions. [2019-10-15 01:09:30,180 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 929 transitions. Word has length 112 [2019-10-15 01:09:30,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:30,181 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 929 transitions. [2019-10-15 01:09:30,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:30,181 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 929 transitions. [2019-10-15 01:09:30,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-15 01:09:30,184 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:30,185 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:30,185 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:30,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:30,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1272870165, now seen corresponding path program 1 times [2019-10-15 01:09:30,186 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:30,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962181466] [2019-10-15 01:09:30,186 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:30,186 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:30,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:30,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:30,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962181466] [2019-10-15 01:09:30,293 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:30,293 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:30,293 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279892969] [2019-10-15 01:09:30,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:30,294 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:30,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:30,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:30,295 INFO L87 Difference]: Start difference. First operand 577 states and 929 transitions. Second operand 4 states. [2019-10-15 01:09:30,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:30,353 INFO L93 Difference]: Finished difference Result 1117 states and 1819 transitions. [2019-10-15 01:09:30,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:30,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-15 01:09:30,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:30,359 INFO L225 Difference]: With dead ends: 1117 [2019-10-15 01:09:30,359 INFO L226 Difference]: Without dead ends: 577 [2019-10-15 01:09:30,363 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:30,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-15 01:09:30,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-10-15 01:09:30,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-15 01:09:30,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 928 transitions. [2019-10-15 01:09:30,392 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 928 transitions. Word has length 113 [2019-10-15 01:09:30,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:30,393 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 928 transitions. [2019-10-15 01:09:30,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:30,393 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 928 transitions. [2019-10-15 01:09:30,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-15 01:09:30,397 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:30,398 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:30,398 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:30,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:30,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1262791708, now seen corresponding path program 1 times [2019-10-15 01:09:30,399 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:30,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343444977] [2019-10-15 01:09:30,400 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:30,400 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:30,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:30,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:30,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343444977] [2019-10-15 01:09:30,630 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:30,631 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:09:30,631 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889615278] [2019-10-15 01:09:30,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:09:30,632 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:30,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:09:30,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:09:30,632 INFO L87 Difference]: Start difference. First operand 577 states and 928 transitions. Second operand 10 states. [2019-10-15 01:09:30,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:30,788 INFO L93 Difference]: Finished difference Result 1075 states and 1739 transitions. [2019-10-15 01:09:30,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:09:30,789 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2019-10-15 01:09:30,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:30,793 INFO L225 Difference]: With dead ends: 1075 [2019-10-15 01:09:30,794 INFO L226 Difference]: Without dead ends: 586 [2019-10-15 01:09:30,796 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:09:30,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-15 01:09:30,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2019-10-15 01:09:30,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-15 01:09:30,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 937 transitions. [2019-10-15 01:09:30,827 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 937 transitions. Word has length 114 [2019-10-15 01:09:30,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:30,828 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 937 transitions. [2019-10-15 01:09:30,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:09:30,828 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 937 transitions. [2019-10-15 01:09:30,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-15 01:09:30,836 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:30,837 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:30,837 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:30,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:30,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1682308539, now seen corresponding path program 1 times [2019-10-15 01:09:30,837 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:30,838 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340954284] [2019-10-15 01:09:30,838 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:30,838 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:30,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:30,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-15 01:09:30,956 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340954284] [2019-10-15 01:09:30,957 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:30,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:30,957 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571818041] [2019-10-15 01:09:30,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:30,958 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:30,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:30,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:30,958 INFO L87 Difference]: Start difference. First operand 584 states and 937 transitions. Second operand 4 states. [2019-10-15 01:09:31,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:31,028 INFO L93 Difference]: Finished difference Result 1123 states and 1825 transitions. [2019-10-15 01:09:31,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:31,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-15 01:09:31,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:31,036 INFO L225 Difference]: With dead ends: 1123 [2019-10-15 01:09:31,036 INFO L226 Difference]: Without dead ends: 571 [2019-10-15 01:09:31,042 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:31,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-15 01:09:31,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-15 01:09:31,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-15 01:09:31,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 914 transitions. [2019-10-15 01:09:31,069 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 914 transitions. Word has length 114 [2019-10-15 01:09:31,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:31,069 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 914 transitions. [2019-10-15 01:09:31,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:31,070 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 914 transitions. [2019-10-15 01:09:31,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-15 01:09:31,075 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:31,075 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:31,075 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:31,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:31,076 INFO L82 PathProgramCache]: Analyzing trace with hash 441821781, now seen corresponding path program 1 times [2019-10-15 01:09:31,076 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:31,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335863962] [2019-10-15 01:09:31,077 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:31,077 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:31,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:31,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:31,327 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335863962] [2019-10-15 01:09:31,327 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:31,328 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:31,328 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256663051] [2019-10-15 01:09:31,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:31,329 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:31,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:31,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:31,329 INFO L87 Difference]: Start difference. First operand 571 states and 914 transitions. Second operand 6 states. [2019-10-15 01:09:31,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:31,581 INFO L93 Difference]: Finished difference Result 1063 states and 1717 transitions. [2019-10-15 01:09:31,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:31,581 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-10-15 01:09:31,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:31,588 INFO L225 Difference]: With dead ends: 1063 [2019-10-15 01:09:31,588 INFO L226 Difference]: Without dead ends: 571 [2019-10-15 01:09:31,591 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:31,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-15 01:09:31,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-15 01:09:31,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-15 01:09:31,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 910 transitions. [2019-10-15 01:09:31,613 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 910 transitions. Word has length 115 [2019-10-15 01:09:31,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:31,615 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 910 transitions. [2019-10-15 01:09:31,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:31,616 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 910 transitions. [2019-10-15 01:09:31,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-15 01:09:31,619 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:31,619 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:31,619 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:31,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:31,619 INFO L82 PathProgramCache]: Analyzing trace with hash 766133599, now seen corresponding path program 1 times [2019-10-15 01:09:31,620 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:31,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900577809] [2019-10-15 01:09:31,623 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:31,623 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:31,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:31,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:31,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900577809] [2019-10-15 01:09:31,754 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:31,754 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:31,755 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994013880] [2019-10-15 01:09:31,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:31,756 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:31,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:31,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:31,757 INFO L87 Difference]: Start difference. First operand 571 states and 910 transitions. Second operand 6 states. [2019-10-15 01:09:31,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:31,974 INFO L93 Difference]: Finished difference Result 1063 states and 1713 transitions. [2019-10-15 01:09:31,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:31,975 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2019-10-15 01:09:31,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:31,980 INFO L225 Difference]: With dead ends: 1063 [2019-10-15 01:09:31,980 INFO L226 Difference]: Without dead ends: 571 [2019-10-15 01:09:31,983 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:31,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-15 01:09:31,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-15 01:09:32,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-15 01:09:32,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 906 transitions. [2019-10-15 01:09:32,005 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 906 transitions. Word has length 116 [2019-10-15 01:09:32,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:32,005 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 906 transitions. [2019-10-15 01:09:32,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:32,006 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 906 transitions. [2019-10-15 01:09:32,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-15 01:09:32,009 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:32,009 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:32,009 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:32,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:32,010 INFO L82 PathProgramCache]: Analyzing trace with hash -188511270, now seen corresponding path program 1 times [2019-10-15 01:09:32,010 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:32,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540516945] [2019-10-15 01:09:32,010 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:32,010 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:32,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:32,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:32,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540516945] [2019-10-15 01:09:32,150 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:32,150 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:32,150 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416812303] [2019-10-15 01:09:32,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:32,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:32,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:32,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:32,152 INFO L87 Difference]: Start difference. First operand 571 states and 906 transitions. Second operand 6 states. [2019-10-15 01:09:32,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:32,371 INFO L93 Difference]: Finished difference Result 1063 states and 1709 transitions. [2019-10-15 01:09:32,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:32,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-10-15 01:09:32,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:32,377 INFO L225 Difference]: With dead ends: 1063 [2019-10-15 01:09:32,377 INFO L226 Difference]: Without dead ends: 571 [2019-10-15 01:09:32,380 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:32,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-15 01:09:32,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-15 01:09:32,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-15 01:09:32,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 902 transitions. [2019-10-15 01:09:32,400 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 902 transitions. Word has length 117 [2019-10-15 01:09:32,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:32,400 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 902 transitions. [2019-10-15 01:09:32,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:32,401 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 902 transitions. [2019-10-15 01:09:32,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-15 01:09:32,404 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:32,404 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:32,404 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:32,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:32,405 INFO L82 PathProgramCache]: Analyzing trace with hash 266348634, now seen corresponding path program 1 times [2019-10-15 01:09:32,405 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:32,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845522243] [2019-10-15 01:09:32,405 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:32,405 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:32,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:32,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:32,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845522243] [2019-10-15 01:09:32,528 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:32,528 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:09:32,528 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645236510] [2019-10-15 01:09:32,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:09:32,529 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:32,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:09:32,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:09:32,530 INFO L87 Difference]: Start difference. First operand 571 states and 902 transitions. Second operand 7 states. [2019-10-15 01:09:32,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:32,616 INFO L93 Difference]: Finished difference Result 1063 states and 1705 transitions. [2019-10-15 01:09:32,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:09:32,617 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-10-15 01:09:32,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:32,624 INFO L225 Difference]: With dead ends: 1063 [2019-10-15 01:09:32,624 INFO L226 Difference]: Without dead ends: 550 [2019-10-15 01:09:32,627 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:32,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-10-15 01:09:32,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2019-10-15 01:09:32,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-10-15 01:09:32,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 868 transitions. [2019-10-15 01:09:32,652 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 868 transitions. Word has length 117 [2019-10-15 01:09:32,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:32,652 INFO L462 AbstractCegarLoop]: Abstraction has 550 states and 868 transitions. [2019-10-15 01:09:32,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:09:32,653 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 868 transitions. [2019-10-15 01:09:32,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-15 01:09:32,657 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:32,657 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:32,657 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:32,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:32,658 INFO L82 PathProgramCache]: Analyzing trace with hash -2136107772, now seen corresponding path program 1 times [2019-10-15 01:09:32,658 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:32,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662648906] [2019-10-15 01:09:32,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:32,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:32,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:32,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:32,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662648906] [2019-10-15 01:09:32,804 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:32,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:32,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523537463] [2019-10-15 01:09:32,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:32,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:32,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:32,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:32,805 INFO L87 Difference]: Start difference. First operand 550 states and 868 transitions. Second operand 6 states. [2019-10-15 01:09:32,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:32,899 INFO L93 Difference]: Finished difference Result 1042 states and 1671 transitions. [2019-10-15 01:09:32,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:32,899 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-10-15 01:09:32,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:32,904 INFO L225 Difference]: With dead ends: 1042 [2019-10-15 01:09:32,904 INFO L226 Difference]: Without dead ends: 550 [2019-10-15 01:09:32,907 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:32,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-10-15 01:09:32,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2019-10-15 01:09:32,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-10-15 01:09:32,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 867 transitions. [2019-10-15 01:09:32,924 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 867 transitions. Word has length 118 [2019-10-15 01:09:32,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:32,925 INFO L462 AbstractCegarLoop]: Abstraction has 550 states and 867 transitions. [2019-10-15 01:09:32,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:32,925 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 867 transitions. [2019-10-15 01:09:32,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-15 01:09:32,928 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:32,928 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:32,929 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:32,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:32,929 INFO L82 PathProgramCache]: Analyzing trace with hash -505466529, now seen corresponding path program 1 times [2019-10-15 01:09:32,929 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:32,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388278918] [2019-10-15 01:09:32,930 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:32,930 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:32,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:33,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:33,072 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388278918] [2019-10-15 01:09:33,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:33,072 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:33,072 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522274317] [2019-10-15 01:09:33,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:33,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:33,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:33,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:33,074 INFO L87 Difference]: Start difference. First operand 550 states and 867 transitions. Second operand 6 states. [2019-10-15 01:09:33,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:33,161 INFO L93 Difference]: Finished difference Result 1042 states and 1670 transitions. [2019-10-15 01:09:33,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:33,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-10-15 01:09:33,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:33,167 INFO L225 Difference]: With dead ends: 1042 [2019-10-15 01:09:33,167 INFO L226 Difference]: Without dead ends: 550 [2019-10-15 01:09:33,170 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:33,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-10-15 01:09:33,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2019-10-15 01:09:33,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-10-15 01:09:33,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 866 transitions. [2019-10-15 01:09:33,189 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 866 transitions. Word has length 119 [2019-10-15 01:09:33,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:33,191 INFO L462 AbstractCegarLoop]: Abstraction has 550 states and 866 transitions. [2019-10-15 01:09:33,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:33,191 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 866 transitions. [2019-10-15 01:09:33,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:09:33,197 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:33,198 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:33,198 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:33,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:33,198 INFO L82 PathProgramCache]: Analyzing trace with hash -585955541, now seen corresponding path program 1 times [2019-10-15 01:09:33,198 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:33,199 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517847398] [2019-10-15 01:09:33,199 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:33,199 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:33,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:33,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:33,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517847398] [2019-10-15 01:09:33,304 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:33,304 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:33,304 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905383797] [2019-10-15 01:09:33,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:33,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:33,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:33,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:33,307 INFO L87 Difference]: Start difference. First operand 550 states and 866 transitions. Second operand 4 states. [2019-10-15 01:09:33,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:33,365 INFO L93 Difference]: Finished difference Result 1042 states and 1669 transitions. [2019-10-15 01:09:33,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:33,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-10-15 01:09:33,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:33,373 INFO L225 Difference]: With dead ends: 1042 [2019-10-15 01:09:33,373 INFO L226 Difference]: Without dead ends: 550 [2019-10-15 01:09:33,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-15 01:09:33,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-10-15 01:09:33,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2019-10-15 01:09:33,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-10-15 01:09:33,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 865 transitions. [2019-10-15 01:09:33,415 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 865 transitions. Word has length 120 [2019-10-15 01:09:33,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:33,415 INFO L462 AbstractCegarLoop]: Abstraction has 550 states and 865 transitions. [2019-10-15 01:09:33,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:33,415 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 865 transitions. [2019-10-15 01:09:33,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:09:33,420 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:33,420 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:33,421 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:33,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:33,421 INFO L82 PathProgramCache]: Analyzing trace with hash 381395113, now seen corresponding path program 1 times [2019-10-15 01:09:33,422 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:33,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399516763] [2019-10-15 01:09:33,422 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:33,422 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:33,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:33,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:33,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399516763] [2019-10-15 01:09:33,703 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:33,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:09:33,703 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089836114] [2019-10-15 01:09:33,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:09:33,704 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:33,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:09:33,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:09:33,705 INFO L87 Difference]: Start difference. First operand 550 states and 865 transitions. Second operand 12 states. [2019-10-15 01:09:33,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:33,954 INFO L93 Difference]: Finished difference Result 1043 states and 1668 transitions. [2019-10-15 01:09:33,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:09:33,955 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 120 [2019-10-15 01:09:33,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:33,961 INFO L225 Difference]: With dead ends: 1043 [2019-10-15 01:09:33,961 INFO L226 Difference]: Without dead ends: 550 [2019-10-15 01:09:33,967 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:09:33,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-10-15 01:09:33,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2019-10-15 01:09:33,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-10-15 01:09:33,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 864 transitions. [2019-10-15 01:09:33,990 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 864 transitions. Word has length 120 [2019-10-15 01:09:33,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:33,990 INFO L462 AbstractCegarLoop]: Abstraction has 550 states and 864 transitions. [2019-10-15 01:09:33,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:09:33,991 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 864 transitions. [2019-10-15 01:09:33,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-15 01:09:33,997 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:33,997 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:33,997 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:33,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:33,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1579499078, now seen corresponding path program 1 times [2019-10-15 01:09:33,998 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:33,998 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108636662] [2019-10-15 01:09:33,998 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:33,998 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:33,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:34,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:34,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108636662] [2019-10-15 01:09:34,203 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:34,204 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:09:34,204 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468334610] [2019-10-15 01:09:34,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:09:34,205 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:34,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:09:34,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:09:34,206 INFO L87 Difference]: Start difference. First operand 550 states and 864 transitions. Second operand 9 states. [2019-10-15 01:09:37,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:37,443 INFO L93 Difference]: Finished difference Result 1040 states and 1682 transitions. [2019-10-15 01:09:37,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:09:37,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-10-15 01:09:37,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:37,448 INFO L225 Difference]: With dead ends: 1040 [2019-10-15 01:09:37,448 INFO L226 Difference]: Without dead ends: 556 [2019-10-15 01:09:37,451 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:09:37,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-10-15 01:09:37,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 554. [2019-10-15 01:09:37,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-10-15 01:09:37,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 883 transitions. [2019-10-15 01:09:37,479 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 883 transitions. Word has length 121 [2019-10-15 01:09:37,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:37,479 INFO L462 AbstractCegarLoop]: Abstraction has 554 states and 883 transitions. [2019-10-15 01:09:37,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:09:37,479 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 883 transitions. [2019-10-15 01:09:37,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-15 01:09:37,482 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:37,482 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:37,483 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:37,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:37,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1625636341, now seen corresponding path program 1 times [2019-10-15 01:09:37,483 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:37,484 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361890274] [2019-10-15 01:09:37,484 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:37,484 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:37,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:37,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:37,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361890274] [2019-10-15 01:09:37,682 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:37,683 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:09:37,683 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987420983] [2019-10-15 01:09:37,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:09:37,684 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:37,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:09:37,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:37,685 INFO L87 Difference]: Start difference. First operand 554 states and 883 transitions. Second operand 8 states. [2019-10-15 01:09:43,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:43,752 INFO L93 Difference]: Finished difference Result 1942 states and 3227 transitions. [2019-10-15 01:09:43,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:09:43,753 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-10-15 01:09:43,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:43,767 INFO L225 Difference]: With dead ends: 1942 [2019-10-15 01:09:43,767 INFO L226 Difference]: Without dead ends: 1454 [2019-10-15 01:09:43,771 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:09:43,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2019-10-15 01:09:43,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1415. [2019-10-15 01:09:43,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1415 states. [2019-10-15 01:09:43,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 2280 transitions. [2019-10-15 01:09:43,857 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 2280 transitions. Word has length 122 [2019-10-15 01:09:43,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:43,857 INFO L462 AbstractCegarLoop]: Abstraction has 1415 states and 2280 transitions. [2019-10-15 01:09:43,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:09:43,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 2280 transitions. [2019-10-15 01:09:43,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-15 01:09:43,862 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:43,863 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:43,863 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:43,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:43,864 INFO L82 PathProgramCache]: Analyzing trace with hash -430074642, now seen corresponding path program 1 times [2019-10-15 01:09:43,864 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:43,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087539857] [2019-10-15 01:09:43,864 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:43,865 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:43,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:44,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:44,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087539857] [2019-10-15 01:09:44,083 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:44,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:09:44,083 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834727224] [2019-10-15 01:09:44,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:09:44,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:44,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:09:44,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:09:44,085 INFO L87 Difference]: Start difference. First operand 1415 states and 2280 transitions. Second operand 9 states. [2019-10-15 01:09:50,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:50,956 INFO L93 Difference]: Finished difference Result 4546 states and 7547 transitions. [2019-10-15 01:09:50,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 01:09:50,957 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-10-15 01:09:50,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:50,984 INFO L225 Difference]: With dead ends: 4546 [2019-10-15 01:09:50,985 INFO L226 Difference]: Without dead ends: 3197 [2019-10-15 01:09:50,993 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:09:50,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2019-10-15 01:09:51,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 2974. [2019-10-15 01:09:51,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2974 states. [2019-10-15 01:09:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2974 states and 4851 transitions. [2019-10-15 01:09:51,140 INFO L78 Accepts]: Start accepts. Automaton has 2974 states and 4851 transitions. Word has length 128 [2019-10-15 01:09:51,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:51,140 INFO L462 AbstractCegarLoop]: Abstraction has 2974 states and 4851 transitions. [2019-10-15 01:09:51,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:09:51,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 4851 transitions. [2019-10-15 01:09:51,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-15 01:09:51,143 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:51,144 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:51,144 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:51,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:51,144 INFO L82 PathProgramCache]: Analyzing trace with hash -437834001, now seen corresponding path program 1 times [2019-10-15 01:09:51,144 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:51,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305033721] [2019-10-15 01:09:51,145 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:51,145 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:51,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:51,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:51,278 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305033721] [2019-10-15 01:09:51,278 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:51,279 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:09:51,279 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419236458] [2019-10-15 01:09:51,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:09:51,280 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:51,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:09:51,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:09:51,281 INFO L87 Difference]: Start difference. First operand 2974 states and 4851 transitions. Second operand 7 states. [2019-10-15 01:09:55,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:55,294 INFO L93 Difference]: Finished difference Result 7648 states and 12691 transitions. [2019-10-15 01:09:55,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 01:09:55,294 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2019-10-15 01:09:55,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:55,337 INFO L225 Difference]: With dead ends: 7648 [2019-10-15 01:09:55,338 INFO L226 Difference]: Without dead ends: 5510 [2019-10-15 01:09:55,352 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-10-15 01:09:55,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5510 states. [2019-10-15 01:09:55,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5510 to 5417. [2019-10-15 01:09:55,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5417 states. [2019-10-15 01:09:55,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5417 states to 5417 states and 8909 transitions. [2019-10-15 01:09:55,716 INFO L78 Accepts]: Start accepts. Automaton has 5417 states and 8909 transitions. Word has length 128 [2019-10-15 01:09:55,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:55,717 INFO L462 AbstractCegarLoop]: Abstraction has 5417 states and 8909 transitions. [2019-10-15 01:09:55,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:09:55,717 INFO L276 IsEmpty]: Start isEmpty. Operand 5417 states and 8909 transitions. [2019-10-15 01:09:55,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-15 01:09:55,720 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:55,720 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:55,721 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:55,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:55,721 INFO L82 PathProgramCache]: Analyzing trace with hash -630018540, now seen corresponding path program 1 times [2019-10-15 01:09:55,721 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:55,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676515417] [2019-10-15 01:09:55,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:55,722 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:55,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:55,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:55,860 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676515417] [2019-10-15 01:09:55,860 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:55,860 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:09:55,860 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155473583] [2019-10-15 01:09:55,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:09:55,861 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:55,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:09:55,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:55,862 INFO L87 Difference]: Start difference. First operand 5417 states and 8909 transitions. Second operand 5 states. [2019-10-15 01:09:56,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:56,087 INFO L93 Difference]: Finished difference Result 10006 states and 16543 transitions. [2019-10-15 01:09:56,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:09:56,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-15 01:09:56,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:56,142 INFO L225 Difference]: With dead ends: 10006 [2019-10-15 01:09:56,143 INFO L226 Difference]: Without dead ends: 5535 [2019-10-15 01:09:56,170 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:56,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5535 states. [2019-10-15 01:09:56,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5535 to 5469. [2019-10-15 01:09:56,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5469 states. [2019-10-15 01:09:56,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5469 states to 5469 states and 8982 transitions. [2019-10-15 01:09:56,483 INFO L78 Accepts]: Start accepts. Automaton has 5469 states and 8982 transitions. Word has length 133 [2019-10-15 01:09:56,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:56,485 INFO L462 AbstractCegarLoop]: Abstraction has 5469 states and 8982 transitions. [2019-10-15 01:09:56,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:09:56,486 INFO L276 IsEmpty]: Start isEmpty. Operand 5469 states and 8982 transitions. [2019-10-15 01:09:56,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:09:56,492 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:56,493 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:56,493 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:56,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:56,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1275605709, now seen corresponding path program 1 times [2019-10-15 01:09:56,494 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:56,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971752473] [2019-10-15 01:09:56,494 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:56,495 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:56,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:56,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:56,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971752473] [2019-10-15 01:09:56,635 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:56,636 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:09:56,636 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843560313] [2019-10-15 01:09:56,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:09:56,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:56,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:09:56,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:09:56,642 INFO L87 Difference]: Start difference. First operand 5469 states and 8982 transitions. Second operand 7 states. [2019-10-15 01:09:57,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:57,052 INFO L93 Difference]: Finished difference Result 10582 states and 17659 transitions. [2019-10-15 01:09:57,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:09:57,053 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2019-10-15 01:09:57,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:57,093 INFO L225 Difference]: With dead ends: 10582 [2019-10-15 01:09:57,094 INFO L226 Difference]: Without dead ends: 5469 [2019-10-15 01:09:57,121 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:57,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5469 states. [2019-10-15 01:09:57,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5469 to 5469. [2019-10-15 01:09:57,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5469 states. [2019-10-15 01:09:57,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5469 states to 5469 states and 8890 transitions. [2019-10-15 01:09:57,367 INFO L78 Accepts]: Start accepts. Automaton has 5469 states and 8890 transitions. Word has length 140 [2019-10-15 01:09:57,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:57,367 INFO L462 AbstractCegarLoop]: Abstraction has 5469 states and 8890 transitions. [2019-10-15 01:09:57,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:09:57,368 INFO L276 IsEmpty]: Start isEmpty. Operand 5469 states and 8890 transitions. [2019-10-15 01:09:57,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-15 01:09:57,372 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:57,372 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:57,372 INFO L410 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:57,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:57,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1809403985, now seen corresponding path program 1 times [2019-10-15 01:09:57,373 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:57,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566995720] [2019-10-15 01:09:57,373 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:57,373 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:57,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:57,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:09:57,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566995720] [2019-10-15 01:09:57,500 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:57,500 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:09:57,501 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055932502] [2019-10-15 01:09:57,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:09:57,502 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:57,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:09:57,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:09:57,502 INFO L87 Difference]: Start difference. First operand 5469 states and 8890 transitions. Second operand 7 states.