java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec9_product29.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:12:19,201 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:12:19,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:12:19,229 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:12:19,229 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:12:19,231 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:12:19,234 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:12:19,238 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:12:19,248 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:12:19,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:12:19,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:12:19,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:12:19,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:12:19,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:12:19,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:12:19,258 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:12:19,261 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:12:19,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:12:19,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:12:19,269 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:12:19,272 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:12:19,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:12:19,275 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:12:19,277 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:12:19,279 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:12:19,279 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:12:19,280 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:12:19,284 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:12:19,285 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:12:19,287 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:12:19,287 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:12:19,289 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:12:19,290 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:12:19,291 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:12:19,295 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:12:19,295 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:12:19,296 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:12:19,296 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:12:19,296 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:12:19,299 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:12:19,302 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:12:19,303 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:12:19,324 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:12:19,324 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:12:19,326 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:12:19,326 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:12:19,326 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:12:19,326 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:12:19,327 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:12:19,327 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:12:19,327 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:12:19,327 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:12:19,327 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:12:19,328 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:12:19,328 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:12:19,328 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:12:19,328 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:12:19,328 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:12:19,329 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:12:19,329 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:12:19,329 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:12:19,329 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:12:19,329 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:12:19,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:12:19,330 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:12:19,330 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:12:19,330 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:12:19,330 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:12:19,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:12:19,331 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:12:19,331 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:12:19,641 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:12:19,659 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:12:19,663 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:12:19,665 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:12:19,666 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:12:19,667 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product29.cil.c [2019-10-13 21:12:19,742 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36b4fe0a0/e4394efa939c461d9962a863b2a2fa43/FLAG1ff20caae [2019-10-13 21:12:20,453 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:12:20,454 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product29.cil.c [2019-10-13 21:12:20,473 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36b4fe0a0/e4394efa939c461d9962a863b2a2fa43/FLAG1ff20caae [2019-10-13 21:12:20,617 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36b4fe0a0/e4394efa939c461d9962a863b2a2fa43 [2019-10-13 21:12:20,628 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:12:20,629 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:12:20,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:12:20,631 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:12:20,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:12:20,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:12:20" (1/1) ... [2019-10-13 21:12:20,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7183b207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:20, skipping insertion in model container [2019-10-13 21:12:20,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:12:20" (1/1) ... [2019-10-13 21:12:20,650 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:12:20,748 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:12:21,660 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:12:21,678 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:12:21,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:12:21,848 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:12:21,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:21 WrapperNode [2019-10-13 21:12:21,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:12:21,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:12:21,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:12:21,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:12:21,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:21" (1/1) ... [2019-10-13 21:12:21,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:21" (1/1) ... [2019-10-13 21:12:21,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:21" (1/1) ... [2019-10-13 21:12:21,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:21" (1/1) ... [2019-10-13 21:12:22,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:21" (1/1) ... [2019-10-13 21:12:22,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:21" (1/1) ... [2019-10-13 21:12:22,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:21" (1/1) ... [2019-10-13 21:12:22,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:12:22,089 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:12:22,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:12:22,090 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:12:22,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:12:22,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:12:22,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:12:22,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:12:22,176 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:12:22,177 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:12:22,178 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-10-13 21:12:22,178 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-10-13 21:12:22,178 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-10-13 21:12:22,178 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-10-13 21:12:22,179 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:12:22,179 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:12:22,180 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:12:22,180 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:12:22,181 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:12:22,181 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:12:22,182 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:12:22,184 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:12:22,185 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:12:22,185 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:12:22,185 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:12:22,186 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:12:22,186 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:12:22,186 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:12:22,186 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:12:22,186 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:12:22,187 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:12:22,187 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:12:22,187 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:12:22,187 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:12:22,187 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:12:22,188 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:12:22,188 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:12:22,188 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:12:22,188 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:12:22,189 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:12:22,189 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:12:22,190 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:12:22,190 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:12:22,190 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:12:22,190 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:12:22,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:12:22,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:12:22,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:12:22,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:12:22,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:12:22,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:12:22,192 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:12:22,192 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:12:22,192 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:12:22,192 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-13 21:12:22,192 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:12:22,193 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-13 21:12:22,193 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-13 21:12:22,193 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:12:22,193 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:12:22,193 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:12:22,193 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:12:22,194 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:12:22,194 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:12:22,194 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:12:22,194 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:12:22,194 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:12:22,195 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:12:22,195 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-13 21:12:22,196 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:12:22,196 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:12:22,196 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:12:22,196 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-13 21:12:22,196 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:12:22,197 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:12:22,197 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:12:22,197 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:12:22,197 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:12:22,198 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:12:22,198 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:12:22,198 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:12:22,198 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:12:22,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:12:22,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:12:22,200 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:12:22,200 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:12:22,200 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:12:22,201 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:12:22,201 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:12:22,201 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:12:22,202 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:12:22,202 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-10-13 21:12:22,203 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-10-13 21:12:22,203 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-10-13 21:12:22,203 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-10-13 21:12:22,203 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:12:22,203 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:12:22,204 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:12:22,204 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:12:22,204 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:12:22,204 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:12:22,204 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:12:22,204 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:12:22,205 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:12:22,205 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:12:22,205 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:12:22,205 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:12:22,205 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:12:22,206 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:12:22,206 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:12:22,206 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:12:22,206 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:12:22,206 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:12:22,207 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:12:22,207 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:12:22,207 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:12:22,207 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:12:22,207 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:12:22,207 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:12:22,207 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:12:22,208 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:12:22,208 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:12:22,209 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:12:22,209 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:12:22,209 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:12:22,210 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:12:22,210 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:12:22,210 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:12:22,210 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:12:22,211 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:12:22,212 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:12:22,212 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:12:22,212 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:12:22,212 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:12:22,212 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:12:22,212 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:12:22,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:12:22,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:12:22,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:12:22,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:12:22,214 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:12:22,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:12:22,218 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:12:22,218 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:12:22,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:12:22,219 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:12:22,219 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:12:22,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:12:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:12:22,226 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:12:22,226 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:12:22,227 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:12:22,227 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:12:22,227 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:12:22,227 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:12:22,228 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-13 21:12:22,228 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-13 21:12:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-13 21:12:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:12:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:12:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:12:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:12:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:12:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-13 21:12:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:12:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:12:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-13 21:12:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:12:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:12:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:12:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:12:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:12:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:12:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:12:24,672 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:12:24,672 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:12:24,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:12:24 BoogieIcfgContainer [2019-10-13 21:12:24,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:12:24,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:12:24,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:12:24,682 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:12:24,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:12:20" (1/3) ... [2019-10-13 21:12:24,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6afe3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:12:24, skipping insertion in model container [2019-10-13 21:12:24,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:21" (2/3) ... [2019-10-13 21:12:24,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6afe3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:12:24, skipping insertion in model container [2019-10-13 21:12:24,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:12:24" (3/3) ... [2019-10-13 21:12:24,688 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product29.cil.c [2019-10-13 21:12:24,698 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:12:24,712 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:12:24,724 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:12:24,772 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:12:24,772 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:12:24,772 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:12:24,773 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:12:24,773 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:12:24,773 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:12:24,773 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:12:24,773 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:12:24,810 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states. [2019-10-13 21:12:24,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-13 21:12:24,857 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:24,860 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:24,862 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:24,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:24,870 INFO L82 PathProgramCache]: Analyzing trace with hash 998764860, now seen corresponding path program 1 times [2019-10-13 21:12:24,880 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:24,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848629618] [2019-10-13 21:12:24,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:24,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:24,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:25,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:12:25,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848629618] [2019-10-13 21:12:25,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:25,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:25,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560517646] [2019-10-13 21:12:25,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:25,614 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:25,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:25,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:25,633 INFO L87 Difference]: Start difference. First operand 780 states. Second operand 4 states. [2019-10-13 21:12:25,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:25,889 INFO L93 Difference]: Finished difference Result 1223 states and 1973 transitions. [2019-10-13 21:12:25,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:25,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-10-13 21:12:25,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:25,928 INFO L225 Difference]: With dead ends: 1223 [2019-10-13 21:12:25,928 INFO L226 Difference]: Without dead ends: 620 [2019-10-13 21:12:25,942 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:12:25,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-13 21:12:26,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-13 21:12:26,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-13 21:12:26,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 988 transitions. [2019-10-13 21:12:26,062 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 988 transitions. Word has length 126 [2019-10-13 21:12:26,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:26,063 INFO L462 AbstractCegarLoop]: Abstraction has 620 states and 988 transitions. [2019-10-13 21:12:26,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:26,064 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 988 transitions. [2019-10-13 21:12:26,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-13 21:12:26,077 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:26,078 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:26,078 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:26,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:26,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1436115491, now seen corresponding path program 1 times [2019-10-13 21:12:26,079 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:26,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729853938] [2019-10-13 21:12:26,079 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:26,079 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:26,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:26,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:12:26,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729853938] [2019-10-13 21:12:26,261 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:26,261 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:26,262 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858708523] [2019-10-13 21:12:26,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:26,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:26,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:26,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:26,266 INFO L87 Difference]: Start difference. First operand 620 states and 988 transitions. Second operand 4 states. [2019-10-13 21:12:26,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:26,343 INFO L93 Difference]: Finished difference Result 1203 states and 1934 transitions. [2019-10-13 21:12:26,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:26,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-10-13 21:12:26,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:26,350 INFO L225 Difference]: With dead ends: 1203 [2019-10-13 21:12:26,350 INFO L226 Difference]: Without dead ends: 620 [2019-10-13 21:12:26,354 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:12:26,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-13 21:12:26,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-13 21:12:26,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-13 21:12:26,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 987 transitions. [2019-10-13 21:12:26,394 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 987 transitions. Word has length 129 [2019-10-13 21:12:26,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:26,395 INFO L462 AbstractCegarLoop]: Abstraction has 620 states and 987 transitions. [2019-10-13 21:12:26,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:26,395 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 987 transitions. [2019-10-13 21:12:26,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-13 21:12:26,400 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:26,400 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:26,401 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:26,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:26,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1964351121, now seen corresponding path program 1 times [2019-10-13 21:12:26,401 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:26,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935063631] [2019-10-13 21:12:26,402 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:26,402 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:26,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:26,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:12:26,613 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935063631] [2019-10-13 21:12:26,613 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:26,614 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:26,614 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104628203] [2019-10-13 21:12:26,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:26,617 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:26,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:26,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:26,618 INFO L87 Difference]: Start difference. First operand 620 states and 987 transitions. Second operand 4 states. [2019-10-13 21:12:26,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:26,710 INFO L93 Difference]: Finished difference Result 1203 states and 1933 transitions. [2019-10-13 21:12:26,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:26,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-10-13 21:12:26,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:26,718 INFO L225 Difference]: With dead ends: 1203 [2019-10-13 21:12:26,718 INFO L226 Difference]: Without dead ends: 620 [2019-10-13 21:12:26,722 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:12:26,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-13 21:12:26,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-13 21:12:26,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-13 21:12:26,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 986 transitions. [2019-10-13 21:12:26,772 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 986 transitions. Word has length 130 [2019-10-13 21:12:26,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:26,773 INFO L462 AbstractCegarLoop]: Abstraction has 620 states and 986 transitions. [2019-10-13 21:12:26,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:26,773 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 986 transitions. [2019-10-13 21:12:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-13 21:12:26,780 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:26,780 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:26,781 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:26,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:26,781 INFO L82 PathProgramCache]: Analyzing trace with hash 2042355745, now seen corresponding path program 1 times [2019-10-13 21:12:26,781 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:26,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625228007] [2019-10-13 21:12:26,782 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:26,782 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:26,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:26,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:12:26,934 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625228007] [2019-10-13 21:12:26,934 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:26,934 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:26,935 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440764131] [2019-10-13 21:12:26,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:26,936 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:26,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:26,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:26,936 INFO L87 Difference]: Start difference. First operand 620 states and 986 transitions. Second operand 4 states. [2019-10-13 21:12:27,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:27,007 INFO L93 Difference]: Finished difference Result 1203 states and 1932 transitions. [2019-10-13 21:12:27,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:27,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-10-13 21:12:27,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:27,013 INFO L225 Difference]: With dead ends: 1203 [2019-10-13 21:12:27,014 INFO L226 Difference]: Without dead ends: 620 [2019-10-13 21:12:27,017 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:12:27,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-13 21:12:27,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-13 21:12:27,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-13 21:12:27,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 985 transitions. [2019-10-13 21:12:27,045 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 985 transitions. Word has length 131 [2019-10-13 21:12:27,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:27,046 INFO L462 AbstractCegarLoop]: Abstraction has 620 states and 985 transitions. [2019-10-13 21:12:27,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:27,046 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 985 transitions. [2019-10-13 21:12:27,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-13 21:12:27,051 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:27,051 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:27,051 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:27,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:27,052 INFO L82 PathProgramCache]: Analyzing trace with hash 603391923, now seen corresponding path program 1 times [2019-10-13 21:12:27,052 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:27,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924647107] [2019-10-13 21:12:27,053 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:27,053 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:27,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:27,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:12:27,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924647107] [2019-10-13 21:12:27,250 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:27,251 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:27,251 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259236751] [2019-10-13 21:12:27,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:27,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:27,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:27,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:27,254 INFO L87 Difference]: Start difference. First operand 620 states and 985 transitions. Second operand 4 states. [2019-10-13 21:12:27,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:27,331 INFO L93 Difference]: Finished difference Result 1203 states and 1931 transitions. [2019-10-13 21:12:27,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:27,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-10-13 21:12:27,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:27,344 INFO L225 Difference]: With dead ends: 1203 [2019-10-13 21:12:27,344 INFO L226 Difference]: Without dead ends: 620 [2019-10-13 21:12:27,347 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:12:27,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-13 21:12:27,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-13 21:12:27,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-13 21:12:27,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 984 transitions. [2019-10-13 21:12:27,378 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 984 transitions. Word has length 132 [2019-10-13 21:12:27,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:27,379 INFO L462 AbstractCegarLoop]: Abstraction has 620 states and 984 transitions. [2019-10-13 21:12:27,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:27,379 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 984 transitions. [2019-10-13 21:12:27,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-13 21:12:27,385 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:27,386 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:27,390 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:27,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:27,391 INFO L82 PathProgramCache]: Analyzing trace with hash 2147328613, now seen corresponding path program 1 times [2019-10-13 21:12:27,391 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:27,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510984662] [2019-10-13 21:12:27,391 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:27,391 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:27,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:27,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:12:27,609 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510984662] [2019-10-13 21:12:27,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:27,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:12:27,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794369939] [2019-10-13 21:12:27,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:12:27,612 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:27,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:12:27,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:12:27,613 INFO L87 Difference]: Start difference. First operand 620 states and 984 transitions. Second operand 10 states. [2019-10-13 21:12:27,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:27,829 INFO L93 Difference]: Finished difference Result 1161 states and 1851 transitions. [2019-10-13 21:12:27,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:12:27,830 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 133 [2019-10-13 21:12:27,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:27,840 INFO L225 Difference]: With dead ends: 1161 [2019-10-13 21:12:27,841 INFO L226 Difference]: Without dead ends: 629 [2019-10-13 21:12:27,850 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:12:27,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-13 21:12:27,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 627. [2019-10-13 21:12:27,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-10-13 21:12:27,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 993 transitions. [2019-10-13 21:12:27,888 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 993 transitions. Word has length 133 [2019-10-13 21:12:27,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:27,888 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 993 transitions. [2019-10-13 21:12:27,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:12:27,888 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 993 transitions. [2019-10-13 21:12:27,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-13 21:12:27,896 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:27,896 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:27,896 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:27,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:27,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1347103130, now seen corresponding path program 1 times [2019-10-13 21:12:27,897 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:27,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962442558] [2019-10-13 21:12:27,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:27,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:27,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:28,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:12:28,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962442558] [2019-10-13 21:12:28,098 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:28,098 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:28,098 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995804865] [2019-10-13 21:12:28,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:28,099 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:28,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:28,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:28,100 INFO L87 Difference]: Start difference. First operand 627 states and 993 transitions. Second operand 4 states. [2019-10-13 21:12:28,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:28,168 INFO L93 Difference]: Finished difference Result 1209 states and 1937 transitions. [2019-10-13 21:12:28,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:28,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-10-13 21:12:28,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:28,176 INFO L225 Difference]: With dead ends: 1209 [2019-10-13 21:12:28,176 INFO L226 Difference]: Without dead ends: 614 [2019-10-13 21:12:28,180 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:12:28,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-13 21:12:28,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-10-13 21:12:28,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-10-13 21:12:28,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 970 transitions. [2019-10-13 21:12:28,206 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 970 transitions. Word has length 133 [2019-10-13 21:12:28,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:28,209 INFO L462 AbstractCegarLoop]: Abstraction has 614 states and 970 transitions. [2019-10-13 21:12:28,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:28,209 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 970 transitions. [2019-10-13 21:12:28,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-13 21:12:28,214 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:28,214 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:28,215 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:28,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:28,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1290451205, now seen corresponding path program 1 times [2019-10-13 21:12:28,216 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:28,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346070214] [2019-10-13 21:12:28,217 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:28,217 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:28,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:28,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:12:28,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346070214] [2019-10-13 21:12:28,375 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:28,375 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:28,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493683023] [2019-10-13 21:12:28,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:28,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:28,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:28,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:28,377 INFO L87 Difference]: Start difference. First operand 614 states and 970 transitions. Second operand 6 states. [2019-10-13 21:12:28,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:28,590 INFO L93 Difference]: Finished difference Result 1149 states and 1829 transitions. [2019-10-13 21:12:28,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:28,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-10-13 21:12:28,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:28,596 INFO L225 Difference]: With dead ends: 1149 [2019-10-13 21:12:28,596 INFO L226 Difference]: Without dead ends: 614 [2019-10-13 21:12:28,600 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:12:28,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-13 21:12:28,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-10-13 21:12:28,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-10-13 21:12:28,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 966 transitions. [2019-10-13 21:12:28,630 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 966 transitions. Word has length 134 [2019-10-13 21:12:28,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:28,632 INFO L462 AbstractCegarLoop]: Abstraction has 614 states and 966 transitions. [2019-10-13 21:12:28,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:28,632 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 966 transitions. [2019-10-13 21:12:28,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-13 21:12:28,642 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:28,642 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:28,643 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:28,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:28,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1379251042, now seen corresponding path program 1 times [2019-10-13 21:12:28,643 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:28,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420884167] [2019-10-13 21:12:28,644 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:28,644 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:28,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:28,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:12:28,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420884167] [2019-10-13 21:12:28,804 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:28,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:28,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509641664] [2019-10-13 21:12:28,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:28,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:28,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:28,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:28,807 INFO L87 Difference]: Start difference. First operand 614 states and 966 transitions. Second operand 6 states. [2019-10-13 21:12:29,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:29,078 INFO L93 Difference]: Finished difference Result 1149 states and 1825 transitions. [2019-10-13 21:12:29,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:29,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2019-10-13 21:12:29,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:29,085 INFO L225 Difference]: With dead ends: 1149 [2019-10-13 21:12:29,085 INFO L226 Difference]: Without dead ends: 614 [2019-10-13 21:12:29,089 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:12:29,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-13 21:12:29,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-10-13 21:12:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-10-13 21:12:29,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 962 transitions. [2019-10-13 21:12:29,124 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 962 transitions. Word has length 135 [2019-10-13 21:12:29,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:29,124 INFO L462 AbstractCegarLoop]: Abstraction has 614 states and 962 transitions. [2019-10-13 21:12:29,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:29,124 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 962 transitions. [2019-10-13 21:12:29,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-13 21:12:29,129 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:29,129 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:29,130 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:29,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:29,130 INFO L82 PathProgramCache]: Analyzing trace with hash 234769472, now seen corresponding path program 1 times [2019-10-13 21:12:29,130 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:29,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209752183] [2019-10-13 21:12:29,131 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:29,131 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:29,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:29,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:12:29,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209752183] [2019-10-13 21:12:29,275 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:29,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:29,276 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486744872] [2019-10-13 21:12:29,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:29,277 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:29,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:29,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:29,277 INFO L87 Difference]: Start difference. First operand 614 states and 962 transitions. Second operand 6 states. [2019-10-13 21:12:29,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:29,472 INFO L93 Difference]: Finished difference Result 1149 states and 1821 transitions. [2019-10-13 21:12:29,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:29,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2019-10-13 21:12:29,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:29,478 INFO L225 Difference]: With dead ends: 1149 [2019-10-13 21:12:29,478 INFO L226 Difference]: Without dead ends: 614 [2019-10-13 21:12:29,485 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:12:29,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-13 21:12:29,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-10-13 21:12:29,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-10-13 21:12:29,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 958 transitions. [2019-10-13 21:12:29,507 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 958 transitions. Word has length 136 [2019-10-13 21:12:29,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:29,507 INFO L462 AbstractCegarLoop]: Abstraction has 614 states and 958 transitions. [2019-10-13 21:12:29,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:29,507 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 958 transitions. [2019-10-13 21:12:29,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-13 21:12:29,512 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:29,512 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:29,512 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:29,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:29,513 INFO L82 PathProgramCache]: Analyzing trace with hash -185638976, now seen corresponding path program 1 times [2019-10-13 21:12:29,513 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:29,513 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241634405] [2019-10-13 21:12:29,513 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:29,514 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:29,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:29,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:12:29,663 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241634405] [2019-10-13 21:12:29,663 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:29,664 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:12:29,664 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552121087] [2019-10-13 21:12:29,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:12:29,665 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:29,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:12:29,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:12:29,665 INFO L87 Difference]: Start difference. First operand 614 states and 958 transitions. Second operand 7 states. [2019-10-13 21:12:29,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:29,798 INFO L93 Difference]: Finished difference Result 1149 states and 1817 transitions. [2019-10-13 21:12:29,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:12:29,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 136 [2019-10-13 21:12:29,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:29,803 INFO L225 Difference]: With dead ends: 1149 [2019-10-13 21:12:29,803 INFO L226 Difference]: Without dead ends: 593 [2019-10-13 21:12:29,806 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:12:29,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-10-13 21:12:29,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2019-10-13 21:12:29,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-10-13 21:12:29,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 924 transitions. [2019-10-13 21:12:29,826 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 924 transitions. Word has length 136 [2019-10-13 21:12:29,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:29,827 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 924 transitions. [2019-10-13 21:12:29,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:12:29,827 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 924 transitions. [2019-10-13 21:12:29,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-13 21:12:29,831 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:29,832 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:29,832 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:29,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:29,832 INFO L82 PathProgramCache]: Analyzing trace with hash -486730051, now seen corresponding path program 1 times [2019-10-13 21:12:29,833 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:29,833 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932482408] [2019-10-13 21:12:29,833 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:29,833 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:29,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:29,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:12:29,956 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932482408] [2019-10-13 21:12:29,956 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:29,956 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:29,956 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400685875] [2019-10-13 21:12:29,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:29,957 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:29,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:29,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:29,958 INFO L87 Difference]: Start difference. First operand 593 states and 924 transitions. Second operand 6 states. [2019-10-13 21:12:30,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:30,055 INFO L93 Difference]: Finished difference Result 1128 states and 1783 transitions. [2019-10-13 21:12:30,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:30,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 137 [2019-10-13 21:12:30,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:30,060 INFO L225 Difference]: With dead ends: 1128 [2019-10-13 21:12:30,060 INFO L226 Difference]: Without dead ends: 593 [2019-10-13 21:12:30,063 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:12:30,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-10-13 21:12:30,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2019-10-13 21:12:30,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-10-13 21:12:30,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 923 transitions. [2019-10-13 21:12:30,084 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 923 transitions. Word has length 137 [2019-10-13 21:12:30,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:30,085 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 923 transitions. [2019-10-13 21:12:30,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:30,085 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 923 transitions. [2019-10-13 21:12:30,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-13 21:12:30,090 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:30,090 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:30,090 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:30,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:30,091 INFO L82 PathProgramCache]: Analyzing trace with hash -980688005, now seen corresponding path program 1 times [2019-10-13 21:12:30,091 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:30,091 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550635098] [2019-10-13 21:12:30,091 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:30,092 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:30,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:30,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:12:30,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550635098] [2019-10-13 21:12:30,212 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:30,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:30,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083912036] [2019-10-13 21:12:30,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:30,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:30,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:30,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:30,213 INFO L87 Difference]: Start difference. First operand 593 states and 923 transitions. Second operand 6 states. [2019-10-13 21:12:30,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:30,304 INFO L93 Difference]: Finished difference Result 1128 states and 1782 transitions. [2019-10-13 21:12:30,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:30,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2019-10-13 21:12:30,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:30,309 INFO L225 Difference]: With dead ends: 1128 [2019-10-13 21:12:30,309 INFO L226 Difference]: Without dead ends: 593 [2019-10-13 21:12:30,312 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:12:30,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-10-13 21:12:30,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2019-10-13 21:12:30,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-10-13 21:12:30,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 922 transitions. [2019-10-13 21:12:30,332 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 922 transitions. Word has length 138 [2019-10-13 21:12:30,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:30,332 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 922 transitions. [2019-10-13 21:12:30,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:30,332 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 922 transitions. [2019-10-13 21:12:30,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-13 21:12:30,337 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:30,337 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:30,337 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:30,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:30,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1284175384, now seen corresponding path program 1 times [2019-10-13 21:12:30,338 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:30,338 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945647894] [2019-10-13 21:12:30,338 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:30,338 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:30,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:30,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:12:30,532 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945647894] [2019-10-13 21:12:30,532 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:30,533 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:12:30,533 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828298687] [2019-10-13 21:12:30,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:12:30,534 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:30,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:12:30,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:12:30,535 INFO L87 Difference]: Start difference. First operand 593 states and 922 transitions. Second operand 12 states. [2019-10-13 21:12:30,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:30,833 INFO L93 Difference]: Finished difference Result 1129 states and 1781 transitions. [2019-10-13 21:12:30,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:12:30,834 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 139 [2019-10-13 21:12:30,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:30,840 INFO L225 Difference]: With dead ends: 1129 [2019-10-13 21:12:30,840 INFO L226 Difference]: Without dead ends: 593 [2019-10-13 21:12:30,846 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:12:30,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-10-13 21:12:30,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2019-10-13 21:12:30,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-10-13 21:12:30,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 921 transitions. [2019-10-13 21:12:30,888 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 921 transitions. Word has length 139 [2019-10-13 21:12:30,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:30,888 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 921 transitions. [2019-10-13 21:12:30,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:12:30,889 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 921 transitions. [2019-10-13 21:12:30,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:12:30,895 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:30,896 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:30,896 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:30,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:30,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1594513904, now seen corresponding path program 1 times [2019-10-13 21:12:30,897 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:30,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811148908] [2019-10-13 21:12:30,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:30,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:30,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:31,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:12:31,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811148908] [2019-10-13 21:12:31,109 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:31,109 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:31,109 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968603621] [2019-10-13 21:12:31,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:31,110 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:31,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:31,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:31,111 INFO L87 Difference]: Start difference. First operand 593 states and 921 transitions. Second operand 6 states. [2019-10-13 21:12:35,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:35,062 INFO L93 Difference]: Finished difference Result 1777 states and 2884 transitions. [2019-10-13 21:12:35,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:12:35,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-10-13 21:12:35,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:35,074 INFO L225 Difference]: With dead ends: 1777 [2019-10-13 21:12:35,074 INFO L226 Difference]: Without dead ends: 1250 [2019-10-13 21:12:35,078 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:12:35,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2019-10-13 21:12:35,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1167. [2019-10-13 21:12:35,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1167 states. [2019-10-13 21:12:35,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1860 transitions. [2019-10-13 21:12:35,138 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1860 transitions. Word has length 140 [2019-10-13 21:12:35,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:35,138 INFO L462 AbstractCegarLoop]: Abstraction has 1167 states and 1860 transitions. [2019-10-13 21:12:35,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:35,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1860 transitions. [2019-10-13 21:12:35,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 21:12:35,143 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:35,144 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:35,144 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:35,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:35,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1854401282, now seen corresponding path program 1 times [2019-10-13 21:12:35,144 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:35,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407989609] [2019-10-13 21:12:35,145 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:35,145 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:35,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:35,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:12:35,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407989609] [2019-10-13 21:12:35,288 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:35,288 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:35,288 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077740673] [2019-10-13 21:12:35,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:35,289 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:35,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:35,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:35,290 INFO L87 Difference]: Start difference. First operand 1167 states and 1860 transitions. Second operand 6 states. [2019-10-13 21:12:39,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:39,331 INFO L93 Difference]: Finished difference Result 3724 states and 6160 transitions. [2019-10-13 21:12:39,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:12:39,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-13 21:12:39,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:39,361 INFO L225 Difference]: With dead ends: 3724 [2019-10-13 21:12:39,361 INFO L226 Difference]: Without dead ends: 2624 [2019-10-13 21:12:39,370 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:12:39,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2019-10-13 21:12:39,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 2428. [2019-10-13 21:12:39,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2428 states. [2019-10-13 21:12:39,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 3951 transitions. [2019-10-13 21:12:39,543 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 3951 transitions. Word has length 141 [2019-10-13 21:12:39,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:39,544 INFO L462 AbstractCegarLoop]: Abstraction has 2428 states and 3951 transitions. [2019-10-13 21:12:39,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:39,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 3951 transitions. [2019-10-13 21:12:39,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:12:39,549 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:39,549 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:39,550 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:39,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:39,550 INFO L82 PathProgramCache]: Analyzing trace with hash -2086190540, now seen corresponding path program 1 times [2019-10-13 21:12:39,550 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:39,550 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907941291] [2019-10-13 21:12:39,551 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:39,551 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:39,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:39,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:12:39,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907941291] [2019-10-13 21:12:39,688 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:39,688 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:39,688 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567352550] [2019-10-13 21:12:39,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:39,689 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:39,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:39,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:39,690 INFO L87 Difference]: Start difference. First operand 2428 states and 3951 transitions. Second operand 6 states. [2019-10-13 21:12:43,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:43,908 INFO L93 Difference]: Finished difference Result 8163 states and 13810 transitions. [2019-10-13 21:12:43,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:12:43,909 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-13 21:12:43,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:43,955 INFO L225 Difference]: With dead ends: 8163 [2019-10-13 21:12:43,955 INFO L226 Difference]: Without dead ends: 5804 [2019-10-13 21:12:43,973 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:12:43,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5804 states. [2019-10-13 21:12:44,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5804 to 5283. [2019-10-13 21:12:44,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5283 states. [2019-10-13 21:12:44,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5283 states to 5283 states and 8798 transitions. [2019-10-13 21:12:44,317 INFO L78 Accepts]: Start accepts. Automaton has 5283 states and 8798 transitions. Word has length 142 [2019-10-13 21:12:44,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:44,319 INFO L462 AbstractCegarLoop]: Abstraction has 5283 states and 8798 transitions. [2019-10-13 21:12:44,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:44,320 INFO L276 IsEmpty]: Start isEmpty. Operand 5283 states and 8798 transitions. [2019-10-13 21:12:44,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:12:44,327 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:44,328 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:44,328 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:44,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:44,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1197315910, now seen corresponding path program 1 times [2019-10-13 21:12:44,329 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:44,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459885271] [2019-10-13 21:12:44,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:44,330 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:44,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:44,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:12:44,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459885271] [2019-10-13 21:12:44,518 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:44,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:44,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459769423] [2019-10-13 21:12:44,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:44,520 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:44,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:44,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:44,521 INFO L87 Difference]: Start difference. First operand 5283 states and 8798 transitions. Second operand 6 states. [2019-10-13 21:12:49,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:49,110 INFO L93 Difference]: Finished difference Result 18708 states and 32638 transitions. [2019-10-13 21:12:49,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:12:49,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-13 21:12:49,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:49,242 INFO L225 Difference]: With dead ends: 18708 [2019-10-13 21:12:49,242 INFO L226 Difference]: Without dead ends: 13498 [2019-10-13 21:12:49,289 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:12:49,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13498 states. [2019-10-13 21:12:50,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13498 to 12022. [2019-10-13 21:12:50,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12022 states. [2019-10-13 21:12:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12022 states to 12022 states and 20671 transitions. [2019-10-13 21:12:50,217 INFO L78 Accepts]: Start accepts. Automaton has 12022 states and 20671 transitions. Word has length 143 [2019-10-13 21:12:50,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:50,218 INFO L462 AbstractCegarLoop]: Abstraction has 12022 states and 20671 transitions. [2019-10-13 21:12:50,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:50,218 INFO L276 IsEmpty]: Start isEmpty. Operand 12022 states and 20671 transitions. [2019-10-13 21:12:50,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-13 21:12:50,224 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:50,224 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:50,225 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:50,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:50,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1130931207, now seen corresponding path program 1 times [2019-10-13 21:12:50,226 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:50,226 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976408082] [2019-10-13 21:12:50,226 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:50,226 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:50,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:50,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:12:50,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976408082] [2019-10-13 21:12:50,398 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:50,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:12:50,399 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213324107] [2019-10-13 21:12:50,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:12:50,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:50,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:12:50,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:12:50,401 INFO L87 Difference]: Start difference. First operand 12022 states and 20671 transitions. Second operand 9 states.