/usr/bin/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_product31.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 00:42:52,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:42:52,612 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:42:52,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:42:52,632 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:42:52,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:42:52,634 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:42:52,636 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:42:52,648 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:42:52,650 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:42:52,652 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:42:52,653 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:42:52,654 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:42:52,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:42:52,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:42:52,658 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:42:52,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:42:52,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:42:52,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:42:52,663 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:42:52,665 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:42:52,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:42:52,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:42:52,668 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:42:52,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:42:52,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:42:52,670 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:42:52,671 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:42:52,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:42:52,673 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:42:52,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:42:52,674 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:42:52,674 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:42:52,675 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:42:52,678 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:42:52,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:42:52,679 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:42:52,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:42:52,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:42:52,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:42:52,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:42:52,682 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-11-07 00:42:52,696 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:42:52,697 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:42:52,698 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:42:52,698 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:42:52,698 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:42:52,699 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:42:52,699 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:42:52,699 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:42:52,699 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:42:52,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:42:52,700 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:42:52,700 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:42:52,700 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:42:52,700 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:42:52,700 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:42:52,701 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:42:52,701 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:42:52,701 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:42:52,701 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:42:52,701 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:42:52,702 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:42:52,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:42:52,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:42:52,702 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:42:52,702 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:42:52,703 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:42:52,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:42:52,703 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:42:52,703 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-11-07 00:42:52,991 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:42:53,004 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:42:53,008 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:42:53,009 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:42:53,010 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:42:53,010 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product31.cil.c [2019-11-07 00:42:53,086 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/011dc385a/506c20bb0dfb4cad8cabc138751047b2/FLAGcaa8320fb [2019-11-07 00:42:53,789 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:42:53,790 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product31.cil.c [2019-11-07 00:42:53,810 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/011dc385a/506c20bb0dfb4cad8cabc138751047b2/FLAGcaa8320fb [2019-11-07 00:42:54,014 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/011dc385a/506c20bb0dfb4cad8cabc138751047b2 [2019-11-07 00:42:54,022 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:42:54,024 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:42:54,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:42:54,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:42:54,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:42:54,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:42:54" (1/1) ... [2019-11-07 00:42:54,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37ff6c3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:54, skipping insertion in model container [2019-11-07 00:42:54,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:42:54" (1/1) ... [2019-11-07 00:42:54,039 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:42:54,107 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:42:54,821 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:42:54,843 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:42:54,982 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:42:55,062 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:42:55,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:55 WrapperNode [2019-11-07 00:42:55,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:42:55,064 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:42:55,064 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:42:55,065 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:42:55,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:55" (1/1) ... [2019-11-07 00:42:55,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:55" (1/1) ... [2019-11-07 00:42:55,110 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:55" (1/1) ... [2019-11-07 00:42:55,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:55" (1/1) ... [2019-11-07 00:42:55,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:55" (1/1) ... [2019-11-07 00:42:55,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:55" (1/1) ... [2019-11-07 00:42:55,259 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:55" (1/1) ... [2019-11-07 00:42:55,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:42:55,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:42:55,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:42:55,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:42:55,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:55" (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-11-07 00:42:55,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:42:55,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:42:55,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-11-07 00:42:55,379 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-11-07 00:42:55,379 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-11-07 00:42:55,380 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-11-07 00:42:55,380 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-11-07 00:42:55,381 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-11-07 00:42:55,381 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-11-07 00:42:55,382 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-11-07 00:42:55,382 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-11-07 00:42:55,382 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-11-07 00:42:55,382 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-11-07 00:42:55,383 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-11-07 00:42:55,383 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-11-07 00:42:55,384 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-11-07 00:42:55,387 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-11-07 00:42:55,387 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-11-07 00:42:55,387 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-11-07 00:42:55,388 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-11-07 00:42:55,388 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-11-07 00:42:55,388 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-11-07 00:42:55,389 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-11-07 00:42:55,389 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-11-07 00:42:55,389 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-11-07 00:42:55,389 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-11-07 00:42:55,390 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-11-07 00:42:55,390 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-11-07 00:42:55,390 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-11-07 00:42:55,390 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-11-07 00:42:55,390 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-11-07 00:42:55,391 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-11-07 00:42:55,391 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-11-07 00:42:55,391 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-11-07 00:42:55,391 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-11-07 00:42:55,392 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-11-07 00:42:55,392 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:42:55,392 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-11-07 00:42:55,392 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-11-07 00:42:55,393 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-11-07 00:42:55,393 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-11-07 00:42:55,393 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-11-07 00:42:55,393 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-11-07 00:42:55,393 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-11-07 00:42:55,393 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-11-07 00:42:55,394 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-11-07 00:42:55,394 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-11-07 00:42:55,394 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-11-07 00:42:55,394 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-11-07 00:42:55,394 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-11-07 00:42:55,395 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-11-07 00:42:55,395 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-11-07 00:42:55,395 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-11-07 00:42:55,395 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-11-07 00:42:55,395 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-11-07 00:42:55,395 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-11-07 00:42:55,396 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-11-07 00:42:55,396 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-11-07 00:42:55,396 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-11-07 00:42:55,396 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-11-07 00:42:55,396 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-11-07 00:42:55,397 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-11-07 00:42:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-11-07 00:42:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-11-07 00:42:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-11-07 00:42:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-11-07 00:42:55,399 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-11-07 00:42:55,399 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-11-07 00:42:55,399 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-11-07 00:42:55,399 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-11-07 00:42:55,399 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-11-07 00:42:55,400 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-11-07 00:42:55,400 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-11-07 00:42:55,401 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-11-07 00:42:55,401 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-11-07 00:42:55,402 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-11-07 00:42:55,402 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-11-07 00:42:55,402 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-11-07 00:42:55,402 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-11-07 00:42:55,403 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-11-07 00:42:55,403 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-11-07 00:42:55,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:42:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 00:42:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-11-07 00:42:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-11-07 00:42:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-11-07 00:42:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-11-07 00:42:55,406 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-11-07 00:42:55,406 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-11-07 00:42:55,407 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-11-07 00:42:55,407 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-11-07 00:42:55,407 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-11-07 00:42:55,407 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-11-07 00:42:55,407 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-11-07 00:42:55,408 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-11-07 00:42:55,408 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-11-07 00:42:55,408 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-11-07 00:42:55,408 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-11-07 00:42:55,408 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-11-07 00:42:55,408 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-11-07 00:42:55,409 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-11-07 00:42:55,409 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-11-07 00:42:55,409 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-11-07 00:42:55,409 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-11-07 00:42:55,409 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-11-07 00:42:55,409 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-11-07 00:42:55,410 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-11-07 00:42:55,410 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-11-07 00:42:55,410 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-07 00:42:55,410 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-11-07 00:42:55,410 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-11-07 00:42:55,410 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-11-07 00:42:55,411 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-11-07 00:42:55,411 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-11-07 00:42:55,411 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-11-07 00:42:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-11-07 00:42:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-11-07 00:42:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-11-07 00:42:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-11-07 00:42:55,412 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-11-07 00:42:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-11-07 00:42:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-11-07 00:42:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-11-07 00:42:55,413 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-11-07 00:42:55,415 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-11-07 00:42:55,415 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-11-07 00:42:55,415 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-11-07 00:42:55,415 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-11-07 00:42:55,415 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-11-07 00:42:55,415 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-11-07 00:42:55,415 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:42:55,416 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-11-07 00:42:55,416 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-11-07 00:42:55,416 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-11-07 00:42:55,416 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-11-07 00:42:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-11-07 00:42:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-11-07 00:42:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-11-07 00:42:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-11-07 00:42:55,422 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-11-07 00:42:55,422 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-11-07 00:42:55,423 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-11-07 00:42:55,423 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-11-07 00:42:55,424 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-11-07 00:42:55,431 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-11-07 00:42:55,432 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-11-07 00:42:55,432 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-11-07 00:42:55,432 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-11-07 00:42:55,432 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-11-07 00:42:55,432 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-11-07 00:42:55,432 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-11-07 00:42:55,432 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-11-07 00:42:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-11-07 00:42:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-11-07 00:42:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-11-07 00:42:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-07 00:42:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-11-07 00:42:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-11-07 00:42:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-11-07 00:42:55,433 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-07 00:42:55,434 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-07 00:42:55,435 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-11-07 00:42:55,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-07 00:42:55,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-07 00:42:55,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-07 00:42:55,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-07 00:42:55,435 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-11-07 00:42:55,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-07 00:42:55,436 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-11-07 00:42:55,436 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-11-07 00:42:55,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-07 00:42:55,436 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-11-07 00:42:55,436 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-11-07 00:42:55,436 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-11-07 00:42:55,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:42:55,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-07 00:42:55,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:42:57,926 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:42:57,926 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-07 00:42:57,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:42:57 BoogieIcfgContainer [2019-11-07 00:42:57,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:42:57,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:42:57,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:42:57,933 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:42:57,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:42:54" (1/3) ... [2019-11-07 00:42:57,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da9919e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:42:57, skipping insertion in model container [2019-11-07 00:42:57,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:42:55" (2/3) ... [2019-11-07 00:42:57,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da9919e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:42:57, skipping insertion in model container [2019-11-07 00:42:57,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:42:57" (3/3) ... [2019-11-07 00:42:57,937 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product31.cil.c [2019-11-07 00:42:57,947 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:42:57,957 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 00:42:57,969 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 00:42:58,001 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:42:58,001 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:42:58,001 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:42:58,001 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:42:58,002 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:42:58,002 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:42:58,002 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:42:58,002 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:42:58,048 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states. [2019-11-07 00:42:58,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-07 00:42:58,082 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:58,083 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:42:58,085 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:58,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:58,092 INFO L82 PathProgramCache]: Analyzing trace with hash 841338012, now seen corresponding path program 1 times [2019-11-07 00:42:58,102 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:58,102 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51403980] [2019-11-07 00:42:58,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:58,773 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-07 00:42:58,774 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51403980] [2019-11-07 00:42:58,775 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:58,775 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:42:58,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162975025] [2019-11-07 00:42:58,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:42:58,783 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:58,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:42:58,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:42:58,801 INFO L87 Difference]: Start difference. First operand 817 states. Second operand 4 states. [2019-11-07 00:42:59,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:59,027 INFO L93 Difference]: Finished difference Result 1297 states and 2075 transitions. [2019-11-07 00:42:59,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:42:59,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-11-07 00:42:59,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:59,065 INFO L225 Difference]: With dead ends: 1297 [2019-11-07 00:42:59,066 INFO L226 Difference]: Without dead ends: 657 [2019-11-07 00:42:59,075 INFO L630 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-11-07 00:42:59,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-11-07 00:42:59,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-11-07 00:42:59,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-11-07 00:42:59,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1039 transitions. [2019-11-07 00:42:59,192 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1039 transitions. Word has length 133 [2019-11-07 00:42:59,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:59,192 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 1039 transitions. [2019-11-07 00:42:59,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:42:59,193 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1039 transitions. [2019-11-07 00:42:59,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-07 00:42:59,203 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:59,203 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:42:59,205 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:59,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:59,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1822294424, now seen corresponding path program 1 times [2019-11-07 00:42:59,206 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:59,206 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061253538] [2019-11-07 00:42:59,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:59,444 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-07 00:42:59,444 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061253538] [2019-11-07 00:42:59,444 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:59,445 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:42:59,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172616478] [2019-11-07 00:42:59,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:42:59,447 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:59,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:42:59,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:42:59,448 INFO L87 Difference]: Start difference. First operand 657 states and 1039 transitions. Second operand 4 states. [2019-11-07 00:42:59,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:59,529 INFO L93 Difference]: Finished difference Result 1277 states and 2036 transitions. [2019-11-07 00:42:59,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:42:59,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-11-07 00:42:59,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:59,597 INFO L225 Difference]: With dead ends: 1277 [2019-11-07 00:42:59,597 INFO L226 Difference]: Without dead ends: 657 [2019-11-07 00:42:59,602 INFO L630 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-11-07 00:42:59,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-11-07 00:42:59,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-11-07 00:42:59,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-11-07 00:42:59,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1038 transitions. [2019-11-07 00:42:59,657 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1038 transitions. Word has length 136 [2019-11-07 00:42:59,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:59,662 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 1038 transitions. [2019-11-07 00:42:59,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:42:59,663 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1038 transitions. [2019-11-07 00:42:59,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-07 00:42:59,671 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:59,672 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:42:59,672 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:59,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:59,672 INFO L82 PathProgramCache]: Analyzing trace with hash -122460853, now seen corresponding path program 1 times [2019-11-07 00:42:59,672 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:59,673 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736111148] [2019-11-07 00:42:59,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:59,888 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-07 00:42:59,889 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736111148] [2019-11-07 00:42:59,890 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:59,890 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:42:59,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827139389] [2019-11-07 00:42:59,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:42:59,894 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:59,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:42:59,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:42:59,895 INFO L87 Difference]: Start difference. First operand 657 states and 1038 transitions. Second operand 4 states. [2019-11-07 00:42:59,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:59,981 INFO L93 Difference]: Finished difference Result 1277 states and 2035 transitions. [2019-11-07 00:42:59,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:42:59,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-11-07 00:42:59,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:59,989 INFO L225 Difference]: With dead ends: 1277 [2019-11-07 00:42:59,989 INFO L226 Difference]: Without dead ends: 657 [2019-11-07 00:42:59,993 INFO L630 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-11-07 00:42:59,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-11-07 00:43:00,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-11-07 00:43:00,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-11-07 00:43:00,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1037 transitions. [2019-11-07 00:43:00,033 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1037 transitions. Word has length 137 [2019-11-07 00:43:00,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:43:00,033 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 1037 transitions. [2019-11-07 00:43:00,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:43:00,034 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1037 transitions. [2019-11-07 00:43:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-07 00:43:00,041 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:43:00,041 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:43:00,041 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:43:00,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:43:00,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1796711564, now seen corresponding path program 1 times [2019-11-07 00:43:00,042 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:43:00,042 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580282354] [2019-11-07 00:43:00,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:43:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:00,245 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-07 00:43:00,245 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580282354] [2019-11-07 00:43:00,246 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:43:00,246 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:43:00,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433696117] [2019-11-07 00:43:00,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:43:00,248 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:43:00,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:43:00,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:43:00,249 INFO L87 Difference]: Start difference. First operand 657 states and 1037 transitions. Second operand 4 states. [2019-11-07 00:43:00,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:43:00,335 INFO L93 Difference]: Finished difference Result 1277 states and 2034 transitions. [2019-11-07 00:43:00,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:43:00,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-11-07 00:43:00,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:43:00,346 INFO L225 Difference]: With dead ends: 1277 [2019-11-07 00:43:00,346 INFO L226 Difference]: Without dead ends: 657 [2019-11-07 00:43:00,350 INFO L630 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-11-07 00:43:00,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-11-07 00:43:00,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-11-07 00:43:00,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-11-07 00:43:00,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1036 transitions. [2019-11-07 00:43:00,385 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1036 transitions. Word has length 138 [2019-11-07 00:43:00,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:43:00,387 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 1036 transitions. [2019-11-07 00:43:00,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:43:00,387 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1036 transitions. [2019-11-07 00:43:00,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-07 00:43:00,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:43:00,399 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:43:00,400 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:43:00,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:43:00,400 INFO L82 PathProgramCache]: Analyzing trace with hash 619711975, now seen corresponding path program 1 times [2019-11-07 00:43:00,401 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:43:00,401 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008460905] [2019-11-07 00:43:00,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:43:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:00,633 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-07 00:43:00,634 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008460905] [2019-11-07 00:43:00,634 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:43:00,634 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:43:00,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877044639] [2019-11-07 00:43:00,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:43:00,635 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:43:00,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:43:00,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:43:00,636 INFO L87 Difference]: Start difference. First operand 657 states and 1036 transitions. Second operand 4 states. [2019-11-07 00:43:00,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:43:00,697 INFO L93 Difference]: Finished difference Result 1277 states and 2033 transitions. [2019-11-07 00:43:00,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:43:00,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-11-07 00:43:00,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:43:00,704 INFO L225 Difference]: With dead ends: 1277 [2019-11-07 00:43:00,704 INFO L226 Difference]: Without dead ends: 657 [2019-11-07 00:43:00,707 INFO L630 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-11-07 00:43:00,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-11-07 00:43:00,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-11-07 00:43:00,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-11-07 00:43:00,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1035 transitions. [2019-11-07 00:43:00,737 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1035 transitions. Word has length 139 [2019-11-07 00:43:00,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:43:00,737 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 1035 transitions. [2019-11-07 00:43:00,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:43:00,738 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1035 transitions. [2019-11-07 00:43:00,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-07 00:43:00,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:43:00,743 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:43:00,744 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:43:00,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:43:00,744 INFO L82 PathProgramCache]: Analyzing trace with hash 998018384, now seen corresponding path program 1 times [2019-11-07 00:43:00,744 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:43:00,744 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036216759] [2019-11-07 00:43:00,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:43:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:00,961 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-07 00:43:00,962 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036216759] [2019-11-07 00:43:00,963 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:43:00,964 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 00:43:00,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126449218] [2019-11-07 00:43:00,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 00:43:00,965 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:43:00,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 00:43:00,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-07 00:43:00,965 INFO L87 Difference]: Start difference. First operand 657 states and 1035 transitions. Second operand 10 states. [2019-11-07 00:43:01,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:43:01,141 INFO L93 Difference]: Finished difference Result 1235 states and 1953 transitions. [2019-11-07 00:43:01,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-07 00:43:01,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-11-07 00:43:01,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:43:01,147 INFO L225 Difference]: With dead ends: 1235 [2019-11-07 00:43:01,147 INFO L226 Difference]: Without dead ends: 666 [2019-11-07 00:43:01,152 INFO L630 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-11-07 00:43:01,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-11-07 00:43:01,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 664. [2019-11-07 00:43:01,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-11-07 00:43:01,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 1044 transitions. [2019-11-07 00:43:01,193 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 1044 transitions. Word has length 140 [2019-11-07 00:43:01,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:43:01,194 INFO L462 AbstractCegarLoop]: Abstraction has 664 states and 1044 transitions. [2019-11-07 00:43:01,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 00:43:01,194 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 1044 transitions. [2019-11-07 00:43:01,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-07 00:43:01,201 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:43:01,201 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:43:01,201 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:43:01,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:43:01,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1692665391, now seen corresponding path program 1 times [2019-11-07 00:43:01,202 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:43:01,202 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726396425] [2019-11-07 00:43:01,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:43:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:01,398 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-07 00:43:01,399 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726396425] [2019-11-07 00:43:01,399 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:43:01,399 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:43:01,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247964612] [2019-11-07 00:43:01,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:43:01,400 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:43:01,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:43:01,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:43:01,401 INFO L87 Difference]: Start difference. First operand 664 states and 1044 transitions. Second operand 4 states. [2019-11-07 00:43:01,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:43:01,483 INFO L93 Difference]: Finished difference Result 1283 states and 2039 transitions. [2019-11-07 00:43:01,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:43:01,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-11-07 00:43:01,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:43:01,491 INFO L225 Difference]: With dead ends: 1283 [2019-11-07 00:43:01,491 INFO L226 Difference]: Without dead ends: 651 [2019-11-07 00:43:01,496 INFO L630 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-11-07 00:43:01,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-11-07 00:43:01,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-11-07 00:43:01,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-11-07 00:43:01,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1021 transitions. [2019-11-07 00:43:01,521 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1021 transitions. Word has length 140 [2019-11-07 00:43:01,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:43:01,521 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 1021 transitions. [2019-11-07 00:43:01,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:43:01,522 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1021 transitions. [2019-11-07 00:43:01,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-07 00:43:01,527 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:43:01,527 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:43:01,527 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:43:01,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:43:01,528 INFO L82 PathProgramCache]: Analyzing trace with hash 677141201, now seen corresponding path program 1 times [2019-11-07 00:43:01,528 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:43:01,528 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515032650] [2019-11-07 00:43:01,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:43:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:01,682 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-07 00:43:01,683 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515032650] [2019-11-07 00:43:01,683 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:43:01,683 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:43:01,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607299704] [2019-11-07 00:43:01,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:43:01,684 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:43:01,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:43:01,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:43:01,685 INFO L87 Difference]: Start difference. First operand 651 states and 1021 transitions. Second operand 6 states. [2019-11-07 00:43:01,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:43:01,914 INFO L93 Difference]: Finished difference Result 1223 states and 1931 transitions. [2019-11-07 00:43:01,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:43:01,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-11-07 00:43:01,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:43:01,920 INFO L225 Difference]: With dead ends: 1223 [2019-11-07 00:43:01,920 INFO L226 Difference]: Without dead ends: 651 [2019-11-07 00:43:01,924 INFO L630 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-11-07 00:43:01,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-11-07 00:43:01,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-11-07 00:43:01,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-11-07 00:43:01,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1017 transitions. [2019-11-07 00:43:01,954 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1017 transitions. Word has length 141 [2019-11-07 00:43:01,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:43:01,956 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 1017 transitions. [2019-11-07 00:43:01,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:43:01,957 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1017 transitions. [2019-11-07 00:43:01,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-07 00:43:01,962 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:43:01,963 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:43:01,963 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:43:01,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:43:01,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1320232493, now seen corresponding path program 1 times [2019-11-07 00:43:01,964 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:43:01,964 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951950364] [2019-11-07 00:43:01,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:43:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:02,124 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-07 00:43:02,124 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951950364] [2019-11-07 00:43:02,125 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:43:02,125 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:43:02,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724244301] [2019-11-07 00:43:02,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:43:02,126 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:43:02,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:43:02,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:43:02,126 INFO L87 Difference]: Start difference. First operand 651 states and 1017 transitions. Second operand 6 states. [2019-11-07 00:43:02,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:43:02,364 INFO L93 Difference]: Finished difference Result 1223 states and 1927 transitions. [2019-11-07 00:43:02,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:43:02,365 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-11-07 00:43:02,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:43:02,370 INFO L225 Difference]: With dead ends: 1223 [2019-11-07 00:43:02,370 INFO L226 Difference]: Without dead ends: 651 [2019-11-07 00:43:02,374 INFO L630 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-11-07 00:43:02,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-11-07 00:43:02,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-11-07 00:43:02,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-11-07 00:43:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1013 transitions. [2019-11-07 00:43:02,398 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1013 transitions. Word has length 142 [2019-11-07 00:43:02,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:43:02,398 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 1013 transitions. [2019-11-07 00:43:02,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:43:02,398 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1013 transitions. [2019-11-07 00:43:02,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-07 00:43:02,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:43:02,404 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:43:02,404 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:43:02,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:43:02,404 INFO L82 PathProgramCache]: Analyzing trace with hash 893402902, now seen corresponding path program 1 times [2019-11-07 00:43:02,405 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:43:02,405 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333074899] [2019-11-07 00:43:02,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:43:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:02,570 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-07 00:43:02,571 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333074899] [2019-11-07 00:43:02,571 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:43:02,571 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:43:02,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77521349] [2019-11-07 00:43:02,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:43:02,572 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:43:02,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:43:02,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:43:02,573 INFO L87 Difference]: Start difference. First operand 651 states and 1013 transitions. Second operand 6 states. [2019-11-07 00:43:02,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:43:02,770 INFO L93 Difference]: Finished difference Result 1223 states and 1923 transitions. [2019-11-07 00:43:02,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:43:02,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-11-07 00:43:02,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:43:02,776 INFO L225 Difference]: With dead ends: 1223 [2019-11-07 00:43:02,776 INFO L226 Difference]: Without dead ends: 651 [2019-11-07 00:43:02,780 INFO L630 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-11-07 00:43:02,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-11-07 00:43:02,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-11-07 00:43:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-11-07 00:43:02,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1009 transitions. [2019-11-07 00:43:02,803 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1009 transitions. Word has length 143 [2019-11-07 00:43:02,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:43:02,803 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 1009 transitions. [2019-11-07 00:43:02,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:43:02,803 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1009 transitions. [2019-11-07 00:43:02,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-07 00:43:02,809 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:43:02,809 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:43:02,809 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:43:02,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:43:02,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1947876246, now seen corresponding path program 1 times [2019-11-07 00:43:02,810 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:43:02,810 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666016576] [2019-11-07 00:43:02,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:43:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:02,951 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-07 00:43:02,951 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666016576] [2019-11-07 00:43:02,952 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:43:02,952 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 00:43:02,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990826903] [2019-11-07 00:43:02,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 00:43:02,953 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:43:02,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 00:43:02,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:43:02,953 INFO L87 Difference]: Start difference. First operand 651 states and 1009 transitions. Second operand 7 states. [2019-11-07 00:43:03,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:43:03,035 INFO L93 Difference]: Finished difference Result 1223 states and 1919 transitions. [2019-11-07 00:43:03,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 00:43:03,036 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-11-07 00:43:03,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:43:03,040 INFO L225 Difference]: With dead ends: 1223 [2019-11-07 00:43:03,041 INFO L226 Difference]: Without dead ends: 630 [2019-11-07 00:43:03,044 INFO L630 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-11-07 00:43:03,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-11-07 00:43:03,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-11-07 00:43:03,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-11-07 00:43:03,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 975 transitions. [2019-11-07 00:43:03,065 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 975 transitions. Word has length 143 [2019-11-07 00:43:03,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:43:03,066 INFO L462 AbstractCegarLoop]: Abstraction has 630 states and 975 transitions. [2019-11-07 00:43:03,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 00:43:03,066 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 975 transitions. [2019-11-07 00:43:03,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-07 00:43:03,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:43:03,071 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:43:03,071 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:43:03,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:43:03,071 INFO L82 PathProgramCache]: Analyzing trace with hash 504333880, now seen corresponding path program 1 times [2019-11-07 00:43:03,072 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:43:03,072 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422970883] [2019-11-07 00:43:03,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:43:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:03,240 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-07 00:43:03,241 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422970883] [2019-11-07 00:43:03,241 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:43:03,241 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:43:03,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17520936] [2019-11-07 00:43:03,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:43:03,243 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:43:03,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:43:03,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:43:03,243 INFO L87 Difference]: Start difference. First operand 630 states and 975 transitions. Second operand 6 states. [2019-11-07 00:43:03,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:43:03,351 INFO L93 Difference]: Finished difference Result 1202 states and 1885 transitions. [2019-11-07 00:43:03,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:43:03,352 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-11-07 00:43:03,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:43:03,357 INFO L225 Difference]: With dead ends: 1202 [2019-11-07 00:43:03,357 INFO L226 Difference]: Without dead ends: 630 [2019-11-07 00:43:03,360 INFO L630 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-11-07 00:43:03,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-11-07 00:43:03,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-11-07 00:43:03,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-11-07 00:43:03,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 974 transitions. [2019-11-07 00:43:03,388 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 974 transitions. Word has length 144 [2019-11-07 00:43:03,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:43:03,389 INFO L462 AbstractCegarLoop]: Abstraction has 630 states and 974 transitions. [2019-11-07 00:43:03,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:43:03,390 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 974 transitions. [2019-11-07 00:43:03,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-07 00:43:03,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:43:03,395 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:43:03,395 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:43:03,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:43:03,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1035806555, now seen corresponding path program 1 times [2019-11-07 00:43:03,396 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:43:03,396 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085041287] [2019-11-07 00:43:03,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:43:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:03,524 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-07 00:43:03,524 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085041287] [2019-11-07 00:43:03,524 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:43:03,525 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:43:03,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127466306] [2019-11-07 00:43:03,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:43:03,526 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:43:03,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:43:03,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:43:03,527 INFO L87 Difference]: Start difference. First operand 630 states and 974 transitions. Second operand 6 states. [2019-11-07 00:43:03,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:43:03,624 INFO L93 Difference]: Finished difference Result 1202 states and 1884 transitions. [2019-11-07 00:43:03,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:43:03,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-11-07 00:43:03,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:43:03,629 INFO L225 Difference]: With dead ends: 1202 [2019-11-07 00:43:03,630 INFO L226 Difference]: Without dead ends: 630 [2019-11-07 00:43:03,633 INFO L630 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-11-07 00:43:03,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-11-07 00:43:03,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-11-07 00:43:03,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-11-07 00:43:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 973 transitions. [2019-11-07 00:43:03,661 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 973 transitions. Word has length 145 [2019-11-07 00:43:03,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:43:03,663 INFO L462 AbstractCegarLoop]: Abstraction has 630 states and 973 transitions. [2019-11-07 00:43:03,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:43:03,663 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 973 transitions. [2019-11-07 00:43:03,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-07 00:43:03,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:43:03,667 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:43:03,667 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:43:03,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:43:03,667 INFO L82 PathProgramCache]: Analyzing trace with hash 39300765, now seen corresponding path program 1 times [2019-11-07 00:43:03,668 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:43:03,668 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866551706] [2019-11-07 00:43:03,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:43:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:03,874 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-07 00:43:03,875 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866551706] [2019-11-07 00:43:03,875 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:43:03,875 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-07 00:43:03,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986480937] [2019-11-07 00:43:03,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-07 00:43:03,876 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:43:03,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-07 00:43:03,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-07 00:43:03,877 INFO L87 Difference]: Start difference. First operand 630 states and 973 transitions. Second operand 12 states. [2019-11-07 00:43:04,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:43:04,071 INFO L93 Difference]: Finished difference Result 1203 states and 1883 transitions. [2019-11-07 00:43:04,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-07 00:43:04,072 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-11-07 00:43:04,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:43:04,077 INFO L225 Difference]: With dead ends: 1203 [2019-11-07 00:43:04,077 INFO L226 Difference]: Without dead ends: 630 [2019-11-07 00:43:04,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-11-07 00:43:04,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-11-07 00:43:04,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-11-07 00:43:04,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-11-07 00:43:04,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 972 transitions. [2019-11-07 00:43:04,105 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 972 transitions. Word has length 146 [2019-11-07 00:43:04,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:43:04,106 INFO L462 AbstractCegarLoop]: Abstraction has 630 states and 972 transitions. [2019-11-07 00:43:04,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-07 00:43:04,106 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 972 transitions. [2019-11-07 00:43:04,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-07 00:43:04,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:43:04,112 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:43:04,112 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:43:04,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:43:04,112 INFO L82 PathProgramCache]: Analyzing trace with hash -733497836, now seen corresponding path program 1 times [2019-11-07 00:43:04,113 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:43:04,113 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959711039] [2019-11-07 00:43:04,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:43:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:04,361 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-07 00:43:04,362 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959711039] [2019-11-07 00:43:04,362 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708191519] [2019-11-07 00:43:04,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:43:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:04,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 2771 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-07 00:43:04,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:43:05,071 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 00:43:05,071 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:43:05,914 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 00:43:05,915 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 00:43:05,915 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 6] total 18 [2019-11-07 00:43:05,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881162120] [2019-11-07 00:43:05,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:43:05,916 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:43:05,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:43:05,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-11-07 00:43:05,917 INFO L87 Difference]: Start difference. First operand 630 states and 972 transitions. Second operand 5 states. [2019-11-07 00:43:06,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:43:06,837 INFO L93 Difference]: Finished difference Result 1202 states and 1911 transitions. [2019-11-07 00:43:06,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:43:06,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-11-07 00:43:06,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:43:06,844 INFO L225 Difference]: With dead ends: 1202 [2019-11-07 00:43:06,844 INFO L226 Difference]: Without dead ends: 638 [2019-11-07 00:43:06,858 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 293 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-11-07 00:43:06,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-11-07 00:43:06,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-11-07 00:43:06,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-11-07 00:43:06,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 985 transitions. [2019-11-07 00:43:06,897 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 985 transitions. Word has length 147 [2019-11-07 00:43:06,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:43:06,898 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 985 transitions. [2019-11-07 00:43:06,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:43:06,898 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 985 transitions. [2019-11-07 00:43:06,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-07 00:43:06,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:43:06,906 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:43:07,117 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:43:07,118 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:43:07,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:43:07,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1966079276, now seen corresponding path program 1 times [2019-11-07 00:43:07,119 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:43:07,119 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854235342] [2019-11-07 00:43:07,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:43:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:07,283 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 00:43:07,284 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854235342] [2019-11-07 00:43:07,284 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:43:07,284 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:43:07,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766144604] [2019-11-07 00:43:07,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:43:07,286 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:43:07,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:43:07,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:43:07,287 INFO L87 Difference]: Start difference. First operand 638 states and 985 transitions. Second operand 6 states. [2019-11-07 00:43:08,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:43:08,043 INFO L93 Difference]: Finished difference Result 1217 states and 1935 transitions. [2019-11-07 00:43:08,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:43:08,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2019-11-07 00:43:08,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:43:08,050 INFO L225 Difference]: With dead ends: 1217 [2019-11-07 00:43:08,050 INFO L226 Difference]: Without dead ends: 643 [2019-11-07 00:43:08,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-07 00:43:08,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-11-07 00:43:08,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-11-07 00:43:08,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-11-07 00:43:08,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 989 transitions. [2019-11-07 00:43:08,087 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 989 transitions. Word has length 149 [2019-11-07 00:43:08,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:43:08,088 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 989 transitions. [2019-11-07 00:43:08,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:43:08,088 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 989 transitions. [2019-11-07 00:43:08,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-07 00:43:08,094 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:43:08,094 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:43:08,094 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:43:08,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:43:08,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1163052, now seen corresponding path program 1 times [2019-11-07 00:43:08,095 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:43:08,095 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32392068] [2019-11-07 00:43:08,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:43:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:08,388 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-07 00:43:08,388 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32392068] [2019-11-07 00:43:08,389 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548739267] [2019-11-07 00:43:08,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:43:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:09,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 2775 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-07 00:43:09,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:43:09,126 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 00:43:09,126 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:43:09,838 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 00:43:09,839 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 00:43:09,839 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 6] total 18 [2019-11-07 00:43:09,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169563924] [2019-11-07 00:43:09,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:43:09,840 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:43:09,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:43:09,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-11-07 00:43:09,841 INFO L87 Difference]: Start difference. First operand 643 states and 989 transitions. Second operand 5 states. [2019-11-07 00:43:10,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:43:10,809 INFO L93 Difference]: Finished difference Result 1228 states and 1939 transitions. [2019-11-07 00:43:10,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:43:10,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-11-07 00:43:10,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:43:10,815 INFO L225 Difference]: With dead ends: 1228 [2019-11-07 00:43:10,815 INFO L226 Difference]: Without dead ends: 651 [2019-11-07 00:43:10,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 301 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-11-07 00:43:10,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-11-07 00:43:10,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-11-07 00:43:10,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-11-07 00:43:10,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1002 transitions. [2019-11-07 00:43:10,857 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1002 transitions. Word has length 151 [2019-11-07 00:43:10,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:43:10,857 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 1002 transitions. [2019-11-07 00:43:10,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:43:10,858 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1002 transitions. [2019-11-07 00:43:10,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-07 00:43:10,862 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:43:10,863 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:43:11,070 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:43:11,070 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:43:11,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:43:11,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1998068, now seen corresponding path program 1 times [2019-11-07 00:43:11,071 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:43:11,071 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306521875] [2019-11-07 00:43:11,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:43:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-07 00:43:11,248 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306521875] [2019-11-07 00:43:11,249 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562070417] [2019-11-07 00:43:11,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:43:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:11,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 2777 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-07 00:43:11,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:43:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 00:43:11,898 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:43:12,718 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 00:43:12,718 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 00:43:12,718 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 6] total 17 [2019-11-07 00:43:12,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306467531] [2019-11-07 00:43:12,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:43:12,719 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:43:12,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:43:12,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-11-07 00:43:12,720 INFO L87 Difference]: Start difference. First operand 651 states and 1002 transitions. Second operand 5 states. [2019-11-07 00:43:13,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:43:13,650 INFO L93 Difference]: Finished difference Result 1244 states and 1962 transitions. [2019-11-07 00:43:13,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:43:13,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-11-07 00:43:13,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:43:13,660 INFO L225 Difference]: With dead ends: 1244 [2019-11-07 00:43:13,660 INFO L226 Difference]: Without dead ends: 659 [2019-11-07 00:43:13,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 305 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-11-07 00:43:13,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-11-07 00:43:13,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2019-11-07 00:43:13,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-07 00:43:13,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 1015 transitions. [2019-11-07 00:43:13,696 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 1015 transitions. Word has length 153 [2019-11-07 00:43:13,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:43:13,697 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 1015 transitions. [2019-11-07 00:43:13,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:43:13,697 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1015 transitions. [2019-11-07 00:43:13,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-07 00:43:13,704 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:43:13,705 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:43:13,914 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:43:13,914 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:43:13,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:43:13,915 INFO L82 PathProgramCache]: Analyzing trace with hash -46315116, now seen corresponding path program 1 times [2019-11-07 00:43:13,915 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:43:13,915 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513934496] [2019-11-07 00:43:13,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:43:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:14,130 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-07 00:43:14,132 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513934496] [2019-11-07 00:43:14,133 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291319965] [2019-11-07 00:43:14,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:43:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:14,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 2779 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-07 00:43:14,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:43:14,953 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-07 00:43:14,953 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:43:15,472 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-07 00:43:15,473 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 00:43:15,473 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 6] imperfect sequences [11] total 18 [2019-11-07 00:43:15,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358093605] [2019-11-07 00:43:15,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 00:43:15,477 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:43:15,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 00:43:15,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-11-07 00:43:15,478 INFO L87 Difference]: Start difference. First operand 659 states and 1015 transitions. Second operand 9 states. [2019-11-07 00:43:17,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:43:17,002 INFO L93 Difference]: Finished difference Result 704 states and 1075 transitions. [2019-11-07 00:43:17,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 00:43:17,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 155 [2019-11-07 00:43:17,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:43:17,007 INFO L225 Difference]: With dead ends: 704 [2019-11-07 00:43:17,008 INFO L226 Difference]: Without dead ends: 687 [2019-11-07 00:43:17,009 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 313 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-11-07 00:43:17,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-11-07 00:43:17,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 673. [2019-11-07 00:43:17,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-11-07 00:43:17,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1034 transitions. [2019-11-07 00:43:17,036 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1034 transitions. Word has length 155 [2019-11-07 00:43:17,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:43:17,036 INFO L462 AbstractCegarLoop]: Abstraction has 673 states and 1034 transitions. [2019-11-07 00:43:17,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 00:43:17,037 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1034 transitions. [2019-11-07 00:43:17,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-07 00:43:17,041 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:43:17,042 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:43:17,254 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:43:17,254 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:43:17,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:43:17,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1624631089, now seen corresponding path program 1 times [2019-11-07 00:43:17,255 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:43:17,255 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693873880] [2019-11-07 00:43:17,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:43:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:17,470 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-07 00:43:17,470 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693873880] [2019-11-07 00:43:17,471 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248645758] [2019-11-07 00:43:17,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:43:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:18,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 2795 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-07 00:43:18,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:43:18,200 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-07 00:43:18,201 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:43:18,686 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-07 00:43:18,687 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 00:43:18,687 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [11] total 14 [2019-11-07 00:43:18,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406953058] [2019-11-07 00:43:18,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:43:18,691 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:43:18,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:43:18,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-07 00:43:18,692 INFO L87 Difference]: Start difference. First operand 673 states and 1034 transitions. Second operand 5 states. [2019-11-07 00:43:18,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:43:18,755 INFO L93 Difference]: Finished difference Result 690 states and 1054 transitions. [2019-11-07 00:43:18,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:43:18,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-11-07 00:43:18,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:43:18,762 INFO L225 Difference]: With dead ends: 690 [2019-11-07 00:43:18,762 INFO L226 Difference]: Without dead ends: 673 [2019-11-07 00:43:18,763 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 329 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-11-07 00:43:18,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-11-07 00:43:18,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2019-11-07 00:43:18,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-11-07 00:43:18,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1032 transitions. [2019-11-07 00:43:18,809 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1032 transitions. Word has length 161 [2019-11-07 00:43:18,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:43:18,810 INFO L462 AbstractCegarLoop]: Abstraction has 673 states and 1032 transitions. [2019-11-07 00:43:18,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:43:18,810 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1032 transitions. [2019-11-07 00:43:18,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-07 00:43:18,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:43:18,820 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:43:19,040 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:43:19,040 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:43:19,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:43:19,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1739480465, now seen corresponding path program 1 times [2019-11-07 00:43:19,041 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:43:19,041 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218529211] [2019-11-07 00:43:19,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:43:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:19,369 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-07 00:43:19,370 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218529211] [2019-11-07 00:43:19,370 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464880671] [2019-11-07 00:43:19,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:43:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:43:19,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 2845 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-07 00:43:19,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:43:20,045 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-07 00:43:20,045 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:43:20,414 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-07 00:43:20,415 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 00:43:20,415 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [11] total 18 [2019-11-07 00:43:20,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346809102] [2019-11-07 00:43:20,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 00:43:20,418 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:43:20,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 00:43:20,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-11-07 00:43:20,419 INFO L87 Difference]: Start difference. First operand 673 states and 1032 transitions. Second operand 9 states.