java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product20.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:10:32,535 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:10:32,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:10:32,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:10:32,553 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:10:32,554 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:10:32,556 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:10:32,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:10:32,562 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:10:32,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:10:32,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:10:32,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:10:32,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:10:32,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:10:32,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:10:32,580 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:10:32,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:10:32,582 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:10:32,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:10:32,589 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:10:32,592 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:10:32,593 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:10:32,596 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:10:32,597 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:10:32,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:10:32,602 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:10:32,603 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:10:32,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:10:32,605 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:10:32,606 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:10:32,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:10:32,608 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:10:32,609 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:10:32,610 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:10:32,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:10:32,612 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:10:32,612 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:10:32,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:10:32,613 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:10:32,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:10:32,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:10:32,617 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:10:32,635 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:10:32,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:10:32,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:10:32,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:10:32,639 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:10:32,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:10:32,639 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:10:32,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:10:32,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:10:32,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:10:32,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:10:32,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:10:32,642 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:10:32,642 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:10:32,642 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:10:32,642 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:10:32,643 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:10:32,643 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:10:32,643 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:10:32,643 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:10:32,643 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:10:32,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:10:32,644 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:10:32,644 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:10:32,644 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:10:32,644 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:10:32,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:10:32,645 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:10:32,645 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:10:33,005 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:10:33,029 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:10:33,032 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:10:33,035 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:10:33,035 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:10:33,036 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product20.cil.c [2019-10-13 21:10:33,115 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3792f7f40/ead830c6b0f64785aac1f051be1410f4/FLAG6547c284e [2019-10-13 21:10:33,739 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:10:33,740 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product20.cil.c [2019-10-13 21:10:33,770 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3792f7f40/ead830c6b0f64785aac1f051be1410f4/FLAG6547c284e [2019-10-13 21:10:33,954 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3792f7f40/ead830c6b0f64785aac1f051be1410f4 [2019-10-13 21:10:33,966 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:10:33,968 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:10:33,969 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:10:33,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:10:33,972 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:10:33,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:10:33" (1/1) ... [2019-10-13 21:10:33,976 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd083ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:33, skipping insertion in model container [2019-10-13 21:10:33,976 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:10:33" (1/1) ... [2019-10-13 21:10:33,984 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:10:34,059 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:10:34,825 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:10:34,853 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:10:35,008 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:10:35,085 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:10:35,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:35 WrapperNode [2019-10-13 21:10:35,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:10:35,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:10:35,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:10:35,087 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:10:35,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:35" (1/1) ... [2019-10-13 21:10:35,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:35" (1/1) ... [2019-10-13 21:10:35,135 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:35" (1/1) ... [2019-10-13 21:10:35,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:35" (1/1) ... [2019-10-13 21:10:35,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:35" (1/1) ... [2019-10-13 21:10:35,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:35" (1/1) ... [2019-10-13 21:10:35,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:35" (1/1) ... [2019-10-13 21:10:35,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:10:35,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:10:35,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:10:35,298 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:10:35,299 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:35" (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:10:35,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:10:35,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:10:35,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:10:35,381 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-13 21:10:35,381 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-13 21:10:35,382 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-13 21:10:35,382 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-13 21:10:35,382 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:10:35,383 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:10:35,383 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:10:35,383 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-13 21:10:35,384 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:10:35,384 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-13 21:10:35,385 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:10:35,385 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:10:35,385 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:10:35,389 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:10:35,389 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:10:35,389 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:10:35,390 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:10:35,390 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:10:35,390 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:10:35,390 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:10:35,390 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-13 21:10:35,391 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:10:35,391 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:10:35,391 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:10:35,391 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-13 21:10:35,391 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:10:35,392 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:10:35,392 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:10:35,392 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-10-13 21:10:35,392 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:10:35,392 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-10-13 21:10:35,393 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:10:35,393 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:10:35,393 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-13 21:10:35,394 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-13 21:10:35,394 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:10:35,394 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:10:35,394 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:10:35,394 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:10:35,394 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:10:35,395 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:10:35,395 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:10:35,395 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:10:35,395 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:10:35,395 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:10:35,395 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:10:35,396 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:10:35,396 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:10:35,396 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:10:35,396 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:10:35,396 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:10:35,396 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:10:35,396 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:10:35,397 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:10:35,397 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:10:35,397 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:10:35,397 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:10:35,397 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:10:35,397 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:10:35,398 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:10:35,398 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:10:35,398 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:10:35,398 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:10:35,399 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:10:35,399 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:10:35,399 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:10:35,399 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:10:35,400 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:10:35,400 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:10:35,400 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:10:35,401 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:10:35,401 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:10:35,402 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:10:35,402 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:10:35,402 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:10:35,402 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:10:35,403 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:10:35,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:10:35,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:10:35,404 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:10:35,404 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:10:35,405 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:10:35,406 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-13 21:10:35,406 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-13 21:10:35,407 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-13 21:10:35,407 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-13 21:10:35,408 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:10:35,408 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:10:35,408 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:10:35,408 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:10:35,409 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:10:35,409 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:10:35,409 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:10:35,409 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:10:35,409 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:10:35,410 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:10:35,410 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:10:35,410 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:10:35,410 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:10:35,410 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:10:35,410 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:10:35,411 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:10:35,411 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:10:35,411 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:10:35,411 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:10:35,411 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-13 21:10:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-13 21:10:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-13 21:10:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-13 21:10:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:10:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:10:35,412 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:10:35,413 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:10:35,413 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:10:35,413 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-13 21:10:35,414 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:10:35,414 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:10:35,414 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-13 21:10:35,415 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:10:35,415 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:10:35,415 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:10:35,416 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-10-13 21:10:35,417 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-10-13 21:10:35,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:10:35,417 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:10:35,417 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:10:35,418 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:10:35,418 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:10:35,418 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:10:35,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:10:35,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:10:35,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:10:35,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:10:35,421 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:10:35,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:10:35,425 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:10:35,425 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:10:35,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:10:35,426 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:10:35,427 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:10:35,427 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:10:35,428 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:10:35,428 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:10:35,429 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:10:35,429 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:10:35,429 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:10:35,429 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:10:35,429 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:10:35,430 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:10:35,430 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:10:35,430 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:10:35,430 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:10:35,430 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:10:35,430 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:10:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:10:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:10:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:10:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:10:35,434 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:10:35,434 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:10:35,435 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:10:35,435 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:10:35,435 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:10:35,435 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:10:35,435 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:10:35,436 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:10:35,436 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:10:35,436 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:10:35,436 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:10:35,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:10:35,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:10:35,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:10:38,136 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:10:38,137 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:10:38,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:10:38 BoogieIcfgContainer [2019-10-13 21:10:38,140 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:10:38,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:10:38,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:10:38,145 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:10:38,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:10:33" (1/3) ... [2019-10-13 21:10:38,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645d7ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:10:38, skipping insertion in model container [2019-10-13 21:10:38,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:35" (2/3) ... [2019-10-13 21:10:38,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645d7ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:10:38, skipping insertion in model container [2019-10-13 21:10:38,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:10:38" (3/3) ... [2019-10-13 21:10:38,149 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product20.cil.c [2019-10-13 21:10:38,159 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:10:38,168 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:10:38,181 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:10:38,212 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:10:38,212 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:10:38,212 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:10:38,212 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:10:38,213 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:10:38,213 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:10:38,213 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:10:38,213 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:10:38,247 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states. [2019-10-13 21:10:38,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-13 21:10:38,262 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:38,263 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:38,265 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:38,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:38,270 INFO L82 PathProgramCache]: Analyzing trace with hash 64151631, now seen corresponding path program 1 times [2019-10-13 21:10:38,280 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:38,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187512206] [2019-10-13 21:10:38,280 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:38,281 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:38,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:38,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:38,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187512206] [2019-10-13 21:10:38,823 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:38,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:38,824 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191237451] [2019-10-13 21:10:38,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:38,832 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:38,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:38,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:38,850 INFO L87 Difference]: Start difference. First operand 786 states. Second operand 4 states. [2019-10-13 21:10:39,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:39,027 INFO L93 Difference]: Finished difference Result 1221 states and 1969 transitions. [2019-10-13 21:10:39,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:39,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-13 21:10:39,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:39,052 INFO L225 Difference]: With dead ends: 1221 [2019-10-13 21:10:39,052 INFO L226 Difference]: Without dead ends: 619 [2019-10-13 21:10:39,062 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:10:39,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-10-13 21:10:39,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2019-10-13 21:10:39,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-10-13 21:10:39,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 986 transitions. [2019-10-13 21:10:39,197 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 986 transitions. Word has length 85 [2019-10-13 21:10:39,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:39,198 INFO L462 AbstractCegarLoop]: Abstraction has 619 states and 986 transitions. [2019-10-13 21:10:39,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:39,198 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 986 transitions. [2019-10-13 21:10:39,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-13 21:10:39,213 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:39,213 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:39,213 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:39,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:39,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1001440901, now seen corresponding path program 1 times [2019-10-13 21:10:39,215 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:39,215 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137406495] [2019-10-13 21:10:39,215 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:39,216 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:39,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:39,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:39,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137406495] [2019-10-13 21:10:39,494 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:39,494 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:39,494 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917700967] [2019-10-13 21:10:39,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:39,503 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:39,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:39,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:39,505 INFO L87 Difference]: Start difference. First operand 619 states and 986 transitions. Second operand 4 states. [2019-10-13 21:10:39,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:39,604 INFO L93 Difference]: Finished difference Result 1201 states and 1930 transitions. [2019-10-13 21:10:39,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:39,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-13 21:10:39,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:39,619 INFO L225 Difference]: With dead ends: 1201 [2019-10-13 21:10:39,620 INFO L226 Difference]: Without dead ends: 619 [2019-10-13 21:10:39,632 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:10:39,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-10-13 21:10:39,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2019-10-13 21:10:39,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-10-13 21:10:39,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 985 transitions. [2019-10-13 21:10:39,700 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 985 transitions. Word has length 88 [2019-10-13 21:10:39,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:39,701 INFO L462 AbstractCegarLoop]: Abstraction has 619 states and 985 transitions. [2019-10-13 21:10:39,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:39,701 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 985 transitions. [2019-10-13 21:10:39,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-13 21:10:39,704 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:39,705 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:39,705 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:39,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:39,706 INFO L82 PathProgramCache]: Analyzing trace with hash 271669182, now seen corresponding path program 1 times [2019-10-13 21:10:39,706 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:39,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617033242] [2019-10-13 21:10:39,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:39,707 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:39,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:39,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:39,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617033242] [2019-10-13 21:10:39,924 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:39,925 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:39,925 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945653725] [2019-10-13 21:10:39,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:39,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:39,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:39,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:39,929 INFO L87 Difference]: Start difference. First operand 619 states and 985 transitions. Second operand 4 states. [2019-10-13 21:10:39,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:39,987 INFO L93 Difference]: Finished difference Result 1201 states and 1929 transitions. [2019-10-13 21:10:39,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:39,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-10-13 21:10:39,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:39,992 INFO L225 Difference]: With dead ends: 1201 [2019-10-13 21:10:39,993 INFO L226 Difference]: Without dead ends: 619 [2019-10-13 21:10:39,995 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:10:39,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-10-13 21:10:40,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2019-10-13 21:10:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-10-13 21:10:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 984 transitions. [2019-10-13 21:10:40,058 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 984 transitions. Word has length 89 [2019-10-13 21:10:40,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:40,058 INFO L462 AbstractCegarLoop]: Abstraction has 619 states and 984 transitions. [2019-10-13 21:10:40,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:40,059 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 984 transitions. [2019-10-13 21:10:40,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-13 21:10:40,060 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:40,060 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:40,061 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:40,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:40,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1164725591, now seen corresponding path program 1 times [2019-10-13 21:10:40,061 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:40,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023942944] [2019-10-13 21:10:40,062 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,062 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:40,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:40,179 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023942944] [2019-10-13 21:10:40,179 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:40,180 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:40,180 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74241385] [2019-10-13 21:10:40,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:40,181 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:40,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:40,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:40,181 INFO L87 Difference]: Start difference. First operand 619 states and 984 transitions. Second operand 4 states. [2019-10-13 21:10:40,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:40,233 INFO L93 Difference]: Finished difference Result 1201 states and 1928 transitions. [2019-10-13 21:10:40,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:40,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-13 21:10:40,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:40,239 INFO L225 Difference]: With dead ends: 1201 [2019-10-13 21:10:40,240 INFO L226 Difference]: Without dead ends: 619 [2019-10-13 21:10:40,243 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:10:40,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-10-13 21:10:40,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2019-10-13 21:10:40,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-10-13 21:10:40,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 983 transitions. [2019-10-13 21:10:40,266 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 983 transitions. Word has length 90 [2019-10-13 21:10:40,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:40,267 INFO L462 AbstractCegarLoop]: Abstraction has 619 states and 983 transitions. [2019-10-13 21:10:40,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:40,267 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 983 transitions. [2019-10-13 21:10:40,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-13 21:10:40,269 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:40,269 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:40,270 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:40,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:40,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1133947302, now seen corresponding path program 1 times [2019-10-13 21:10:40,270 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:40,271 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230212193] [2019-10-13 21:10:40,271 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,271 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:40,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230212193] [2019-10-13 21:10:40,382 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:40,383 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:40,383 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278516043] [2019-10-13 21:10:40,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:40,385 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:40,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:40,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:40,386 INFO L87 Difference]: Start difference. First operand 619 states and 983 transitions. Second operand 4 states. [2019-10-13 21:10:40,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:40,449 INFO L93 Difference]: Finished difference Result 1201 states and 1927 transitions. [2019-10-13 21:10:40,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:40,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-13 21:10:40,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:40,461 INFO L225 Difference]: With dead ends: 1201 [2019-10-13 21:10:40,462 INFO L226 Difference]: Without dead ends: 619 [2019-10-13 21:10:40,467 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:10:40,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-10-13 21:10:40,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2019-10-13 21:10:40,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-10-13 21:10:40,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 982 transitions. [2019-10-13 21:10:40,492 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 982 transitions. Word has length 91 [2019-10-13 21:10:40,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:40,492 INFO L462 AbstractCegarLoop]: Abstraction has 619 states and 982 transitions. [2019-10-13 21:10:40,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:40,493 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 982 transitions. [2019-10-13 21:10:40,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 21:10:40,494 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:40,494 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:40,495 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:40,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:40,495 INFO L82 PathProgramCache]: Analyzing trace with hash 702986547, now seen corresponding path program 1 times [2019-10-13 21:10:40,496 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:40,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870415880] [2019-10-13 21:10:40,496 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,496 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:40,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:40,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870415880] [2019-10-13 21:10:40,690 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:40,690 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:10:40,690 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395748317] [2019-10-13 21:10:40,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:10:40,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:40,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:10:40,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:10:40,692 INFO L87 Difference]: Start difference. First operand 619 states and 982 transitions. Second operand 10 states. [2019-10-13 21:10:40,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:40,931 INFO L93 Difference]: Finished difference Result 1159 states and 1847 transitions. [2019-10-13 21:10:40,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:10:40,932 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-13 21:10:40,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:40,937 INFO L225 Difference]: With dead ends: 1159 [2019-10-13 21:10:40,937 INFO L226 Difference]: Without dead ends: 628 [2019-10-13 21:10:40,940 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:10:40,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-10-13 21:10:40,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 626. [2019-10-13 21:10:40,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-13 21:10:40,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 991 transitions. [2019-10-13 21:10:40,967 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 991 transitions. Word has length 92 [2019-10-13 21:10:40,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:40,967 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 991 transitions. [2019-10-13 21:10:40,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:10:40,968 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 991 transitions. [2019-10-13 21:10:40,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 21:10:40,970 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:40,970 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:40,970 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:40,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:40,971 INFO L82 PathProgramCache]: Analyzing trace with hash 723323922, now seen corresponding path program 1 times [2019-10-13 21:10:40,971 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:40,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652697863] [2019-10-13 21:10:40,971 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,972 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:41,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:41,072 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652697863] [2019-10-13 21:10:41,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:41,072 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:41,072 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373353129] [2019-10-13 21:10:41,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:41,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:41,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:41,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:41,074 INFO L87 Difference]: Start difference. First operand 626 states and 991 transitions. Second operand 4 states. [2019-10-13 21:10:41,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:41,126 INFO L93 Difference]: Finished difference Result 1207 states and 1933 transitions. [2019-10-13 21:10:41,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:41,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-13 21:10:41,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:41,132 INFO L225 Difference]: With dead ends: 1207 [2019-10-13 21:10:41,132 INFO L226 Difference]: Without dead ends: 613 [2019-10-13 21:10:41,135 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:10:41,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-13 21:10:41,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-10-13 21:10:41,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-13 21:10:41,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 968 transitions. [2019-10-13 21:10:41,158 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 968 transitions. Word has length 92 [2019-10-13 21:10:41,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:41,158 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 968 transitions. [2019-10-13 21:10:41,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:41,159 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 968 transitions. [2019-10-13 21:10:41,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-13 21:10:41,160 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:41,160 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:41,161 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:41,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:41,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1512255588, now seen corresponding path program 1 times [2019-10-13 21:10:41,161 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:41,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106393915] [2019-10-13 21:10:41,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:41,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:41,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:41,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:41,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106393915] [2019-10-13 21:10:41,290 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:41,290 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:41,290 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585920482] [2019-10-13 21:10:41,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:41,291 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:41,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:41,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:41,292 INFO L87 Difference]: Start difference. First operand 613 states and 968 transitions. Second operand 6 states. [2019-10-13 21:10:41,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:41,513 INFO L93 Difference]: Finished difference Result 1147 states and 1825 transitions. [2019-10-13 21:10:41,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:41,514 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-10-13 21:10:41,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:41,520 INFO L225 Difference]: With dead ends: 1147 [2019-10-13 21:10:41,520 INFO L226 Difference]: Without dead ends: 613 [2019-10-13 21:10:41,525 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:10:41,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-13 21:10:41,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-10-13 21:10:41,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-13 21:10:41,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 964 transitions. [2019-10-13 21:10:41,554 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 964 transitions. Word has length 93 [2019-10-13 21:10:41,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:41,555 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 964 transitions. [2019-10-13 21:10:41,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:41,555 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 964 transitions. [2019-10-13 21:10:41,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-13 21:10:41,559 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:41,559 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:41,559 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:41,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:41,560 INFO L82 PathProgramCache]: Analyzing trace with hash 917220790, now seen corresponding path program 1 times [2019-10-13 21:10:41,560 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:41,560 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557602018] [2019-10-13 21:10:41,561 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:41,561 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:41,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:41,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:41,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557602018] [2019-10-13 21:10:41,770 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:41,770 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:41,770 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347662015] [2019-10-13 21:10:41,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:41,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:41,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:41,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:41,772 INFO L87 Difference]: Start difference. First operand 613 states and 964 transitions. Second operand 6 states. [2019-10-13 21:10:41,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:41,995 INFO L93 Difference]: Finished difference Result 1147 states and 1821 transitions. [2019-10-13 21:10:41,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:41,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-10-13 21:10:41,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:42,001 INFO L225 Difference]: With dead ends: 1147 [2019-10-13 21:10:42,001 INFO L226 Difference]: Without dead ends: 613 [2019-10-13 21:10:42,003 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:10:42,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-13 21:10:42,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-10-13 21:10:42,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-13 21:10:42,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 960 transitions. [2019-10-13 21:10:42,022 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 960 transitions. Word has length 94 [2019-10-13 21:10:42,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:42,023 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 960 transitions. [2019-10-13 21:10:42,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:42,023 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 960 transitions. [2019-10-13 21:10:42,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-13 21:10:42,024 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:42,024 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:42,025 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:42,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:42,025 INFO L82 PathProgramCache]: Analyzing trace with hash -387785559, now seen corresponding path program 1 times [2019-10-13 21:10:42,025 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:42,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089855294] [2019-10-13 21:10:42,025 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:42,026 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:42,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:42,142 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089855294] [2019-10-13 21:10:42,143 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:42,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:42,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180033104] [2019-10-13 21:10:42,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:42,144 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:42,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:42,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:42,145 INFO L87 Difference]: Start difference. First operand 613 states and 960 transitions. Second operand 6 states. [2019-10-13 21:10:42,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:42,351 INFO L93 Difference]: Finished difference Result 1147 states and 1817 transitions. [2019-10-13 21:10:42,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:42,352 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-13 21:10:42,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:42,356 INFO L225 Difference]: With dead ends: 1147 [2019-10-13 21:10:42,356 INFO L226 Difference]: Without dead ends: 613 [2019-10-13 21:10:42,359 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:10:42,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-13 21:10:42,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-10-13 21:10:42,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-13 21:10:42,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 956 transitions. [2019-10-13 21:10:42,378 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 956 transitions. Word has length 95 [2019-10-13 21:10:42,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:42,379 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 956 transitions. [2019-10-13 21:10:42,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:42,379 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 956 transitions. [2019-10-13 21:10:42,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-13 21:10:42,380 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:42,381 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:42,381 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:42,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:42,381 INFO L82 PathProgramCache]: Analyzing trace with hash 660068649, now seen corresponding path program 1 times [2019-10-13 21:10:42,381 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:42,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561719385] [2019-10-13 21:10:42,382 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:42,382 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:42,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:42,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:42,510 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561719385] [2019-10-13 21:10:42,510 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:42,510 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:10:42,510 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929487599] [2019-10-13 21:10:42,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:10:42,511 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:42,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:10:42,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:10:42,512 INFO L87 Difference]: Start difference. First operand 613 states and 956 transitions. Second operand 7 states. [2019-10-13 21:10:42,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:42,593 INFO L93 Difference]: Finished difference Result 1147 states and 1813 transitions. [2019-10-13 21:10:42,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:10:42,594 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-13 21:10:42,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:42,598 INFO L225 Difference]: With dead ends: 1147 [2019-10-13 21:10:42,599 INFO L226 Difference]: Without dead ends: 592 [2019-10-13 21:10:42,602 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:10:42,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-13 21:10:42,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-13 21:10:42,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-13 21:10:42,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 922 transitions. [2019-10-13 21:10:42,622 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 922 transitions. Word has length 95 [2019-10-13 21:10:42,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:42,623 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 922 transitions. [2019-10-13 21:10:42,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:10:42,623 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 922 transitions. [2019-10-13 21:10:42,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-13 21:10:42,624 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:42,625 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:42,625 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:42,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:42,625 INFO L82 PathProgramCache]: Analyzing trace with hash 2067893787, now seen corresponding path program 1 times [2019-10-13 21:10:42,625 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:42,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370404974] [2019-10-13 21:10:42,626 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:42,626 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:42,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:42,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:42,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370404974] [2019-10-13 21:10:42,809 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:42,809 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:42,809 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118093309] [2019-10-13 21:10:42,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:42,810 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:42,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:42,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:42,811 INFO L87 Difference]: Start difference. First operand 592 states and 922 transitions. Second operand 6 states. [2019-10-13 21:10:42,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:42,921 INFO L93 Difference]: Finished difference Result 1126 states and 1779 transitions. [2019-10-13 21:10:42,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:42,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-13 21:10:42,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:42,926 INFO L225 Difference]: With dead ends: 1126 [2019-10-13 21:10:42,926 INFO L226 Difference]: Without dead ends: 592 [2019-10-13 21:10:42,929 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:10:42,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-13 21:10:42,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-13 21:10:42,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-13 21:10:42,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 921 transitions. [2019-10-13 21:10:42,954 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 921 transitions. Word has length 96 [2019-10-13 21:10:42,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:42,956 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 921 transitions. [2019-10-13 21:10:42,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:42,956 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 921 transitions. [2019-10-13 21:10:42,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 21:10:42,958 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:42,958 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:42,958 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:42,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:42,959 INFO L82 PathProgramCache]: Analyzing trace with hash 845745390, now seen corresponding path program 1 times [2019-10-13 21:10:42,959 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:42,959 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965225375] [2019-10-13 21:10:42,959 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:42,959 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:42,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:43,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:43,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965225375] [2019-10-13 21:10:43,095 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:43,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:43,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569544190] [2019-10-13 21:10:43,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:43,097 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:43,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:43,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:43,097 INFO L87 Difference]: Start difference. First operand 592 states and 921 transitions. Second operand 6 states. [2019-10-13 21:10:43,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:43,215 INFO L93 Difference]: Finished difference Result 1126 states and 1778 transitions. [2019-10-13 21:10:43,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:43,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-13 21:10:43,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:43,220 INFO L225 Difference]: With dead ends: 1126 [2019-10-13 21:10:43,220 INFO L226 Difference]: Without dead ends: 592 [2019-10-13 21:10:43,223 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:10:43,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-13 21:10:43,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-13 21:10:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-13 21:10:43,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 920 transitions. [2019-10-13 21:10:43,253 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 920 transitions. Word has length 97 [2019-10-13 21:10:43,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:43,253 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 920 transitions. [2019-10-13 21:10:43,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:43,253 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 920 transitions. [2019-10-13 21:10:43,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-13 21:10:43,255 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:43,255 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:43,255 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:43,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:43,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1559535234, now seen corresponding path program 1 times [2019-10-13 21:10:43,256 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:43,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057569681] [2019-10-13 21:10:43,256 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:43,256 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:43,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:43,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:43,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057569681] [2019-10-13 21:10:43,377 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:43,377 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:43,378 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758108608] [2019-10-13 21:10:43,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:43,378 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:43,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:43,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:43,379 INFO L87 Difference]: Start difference. First operand 592 states and 920 transitions. Second operand 4 states. [2019-10-13 21:10:43,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:43,428 INFO L93 Difference]: Finished difference Result 1126 states and 1777 transitions. [2019-10-13 21:10:43,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:43,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-13 21:10:43,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:43,435 INFO L225 Difference]: With dead ends: 1126 [2019-10-13 21:10:43,435 INFO L226 Difference]: Without dead ends: 592 [2019-10-13 21:10:43,439 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:10:43,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-13 21:10:43,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-13 21:10:43,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-13 21:10:43,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 919 transitions. [2019-10-13 21:10:43,463 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 919 transitions. Word has length 98 [2019-10-13 21:10:43,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:43,464 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 919 transitions. [2019-10-13 21:10:43,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:43,464 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 919 transitions. [2019-10-13 21:10:43,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-13 21:10:43,465 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:43,466 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:43,466 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:43,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:43,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1575053952, now seen corresponding path program 1 times [2019-10-13 21:10:43,466 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:43,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010284840] [2019-10-13 21:10:43,467 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:43,467 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:43,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:43,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:43,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010284840] [2019-10-13 21:10:43,644 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:43,644 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:10:43,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451862991] [2019-10-13 21:10:43,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:10:43,645 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:43,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:10:43,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:10:43,646 INFO L87 Difference]: Start difference. First operand 592 states and 919 transitions. Second operand 12 states. [2019-10-13 21:10:43,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:43,867 INFO L93 Difference]: Finished difference Result 1127 states and 1776 transitions. [2019-10-13 21:10:43,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:10:43,867 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-10-13 21:10:43,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:43,872 INFO L225 Difference]: With dead ends: 1127 [2019-10-13 21:10:43,872 INFO L226 Difference]: Without dead ends: 592 [2019-10-13 21:10:43,877 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:10:43,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-13 21:10:43,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-13 21:10:43,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-13 21:10:43,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 918 transitions. [2019-10-13 21:10:43,898 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 918 transitions. Word has length 98 [2019-10-13 21:10:43,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:43,898 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 918 transitions. [2019-10-13 21:10:43,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:10:43,898 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 918 transitions. [2019-10-13 21:10:43,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-13 21:10:43,900 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:43,900 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:43,900 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:43,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:43,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1898679017, now seen corresponding path program 1 times [2019-10-13 21:10:43,901 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:43,901 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259868003] [2019-10-13 21:10:43,901 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:43,902 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:43,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:44,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:44,064 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259868003] [2019-10-13 21:10:44,066 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:44,066 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:44,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093229740] [2019-10-13 21:10:44,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:44,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:44,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:44,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:44,069 INFO L87 Difference]: Start difference. First operand 592 states and 918 transitions. Second operand 6 states. [2019-10-13 21:10:47,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:47,463 INFO L93 Difference]: Finished difference Result 1754 states and 2806 transitions. [2019-10-13 21:10:47,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:47,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-10-13 21:10:47,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:47,473 INFO L225 Difference]: With dead ends: 1754 [2019-10-13 21:10:47,473 INFO L226 Difference]: Without dead ends: 1228 [2019-10-13 21:10:47,476 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:10:47,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-10-13 21:10:47,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1103. [2019-10-13 21:10:47,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2019-10-13 21:10:47,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1757 transitions. [2019-10-13 21:10:47,527 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1757 transitions. Word has length 99 [2019-10-13 21:10:47,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:47,527 INFO L462 AbstractCegarLoop]: Abstraction has 1103 states and 1757 transitions. [2019-10-13 21:10:47,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:47,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1757 transitions. [2019-10-13 21:10:47,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-13 21:10:47,532 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:47,533 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:47,533 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:47,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:47,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1662557516, now seen corresponding path program 1 times [2019-10-13 21:10:47,534 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:47,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755768762] [2019-10-13 21:10:47,534 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:47,534 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:47,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:47,940 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:47,940 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755768762] [2019-10-13 21:10:47,941 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:47,941 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:10:47,941 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076381731] [2019-10-13 21:10:47,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:10:47,943 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:47,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:10:47,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:10:47,944 INFO L87 Difference]: Start difference. First operand 1103 states and 1757 transitions. Second operand 12 states. [2019-10-13 21:10:58,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:58,922 INFO L93 Difference]: Finished difference Result 3586 states and 5731 transitions. [2019-10-13 21:10:58,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-13 21:10:58,926 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 157 [2019-10-13 21:10:58,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:58,942 INFO L225 Difference]: With dead ends: 3586 [2019-10-13 21:10:58,942 INFO L226 Difference]: Without dead ends: 2549 [2019-10-13 21:10:58,949 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-10-13 21:10:58,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2019-10-13 21:10:59,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 2491. [2019-10-13 21:10:59,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2491 states. [2019-10-13 21:10:59,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2491 states to 2491 states and 3938 transitions. [2019-10-13 21:10:59,080 INFO L78 Accepts]: Start accepts. Automaton has 2491 states and 3938 transitions. Word has length 157 [2019-10-13 21:10:59,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:59,081 INFO L462 AbstractCegarLoop]: Abstraction has 2491 states and 3938 transitions. [2019-10-13 21:10:59,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:10:59,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2491 states and 3938 transitions. [2019-10-13 21:10:59,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-13 21:10:59,086 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:59,087 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:59,087 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:59,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:59,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1568685766, now seen corresponding path program 1 times [2019-10-13 21:10:59,088 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:59,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592034011] [2019-10-13 21:10:59,088 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:59,088 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:59,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:59,237 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:10:59,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592034011] [2019-10-13 21:10:59,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653417398] [2019-10-13 21:10:59,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:59,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 3053 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:10:59,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:10:59,996 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:10:59,996 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:00,978 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:11:00,979 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:11:00,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-13 21:11:00,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905617959] [2019-10-13 21:11:00,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:00,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:00,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:00,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:11:00,981 INFO L87 Difference]: Start difference. First operand 2491 states and 3938 transitions. Second operand 5 states. [2019-10-13 21:11:02,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:02,020 INFO L93 Difference]: Finished difference Result 4980 states and 8084 transitions. [2019-10-13 21:11:02,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:02,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-10-13 21:11:02,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:02,053 INFO L225 Difference]: With dead ends: 4980 [2019-10-13 21:11:02,053 INFO L226 Difference]: Without dead ends: 2555 [2019-10-13 21:11:02,074 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 302 SyntacticMatches, 8 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:11:02,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2019-10-13 21:11:02,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 2555. [2019-10-13 21:11:02,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2555 states. [2019-10-13 21:11:02,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 4040 transitions. [2019-10-13 21:11:02,433 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 4040 transitions. Word has length 158 [2019-10-13 21:11:02,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:02,434 INFO L462 AbstractCegarLoop]: Abstraction has 2555 states and 4040 transitions. [2019-10-13 21:11:02,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:02,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 4040 transitions. [2019-10-13 21:11:02,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-13 21:11:02,442 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:02,443 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:02,654 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:02,654 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:02,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:02,655 INFO L82 PathProgramCache]: Analyzing trace with hash -633101954, now seen corresponding path program 1 times [2019-10-13 21:11:02,655 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:02,655 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363150656] [2019-10-13 21:11:02,656 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:02,656 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:02,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:02,893 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:11:02,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363150656] [2019-10-13 21:11:02,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512926904] [2019-10-13 21:11:02,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:03,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 3055 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:11:03,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:03,814 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:11:03,814 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:11:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:11:04,644 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:11:04,645 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-13 21:11:04,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109691669] [2019-10-13 21:11:04,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:11:04,645 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:04,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:11:04,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:11:04,646 INFO L87 Difference]: Start difference. First operand 2555 states and 4040 transitions. Second operand 5 states. [2019-10-13 21:11:05,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:05,574 INFO L93 Difference]: Finished difference Result 5108 states and 8270 transitions. [2019-10-13 21:11:05,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:05,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2019-10-13 21:11:05,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:05,593 INFO L225 Difference]: With dead ends: 5108 [2019-10-13 21:11:05,594 INFO L226 Difference]: Without dead ends: 2619 [2019-10-13 21:11:05,605 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 306 SyntacticMatches, 8 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:11:05,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2619 states. [2019-10-13 21:11:05,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2619 to 2619. [2019-10-13 21:11:05,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2619 states. [2019-10-13 21:11:05,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2619 states and 4142 transitions. [2019-10-13 21:11:05,731 INFO L78 Accepts]: Start accepts. Automaton has 2619 states and 4142 transitions. Word has length 160 [2019-10-13 21:11:05,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:05,732 INFO L462 AbstractCegarLoop]: Abstraction has 2619 states and 4142 transitions. [2019-10-13 21:11:05,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:05,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2619 states and 4142 transitions. [2019-10-13 21:11:05,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-13 21:11:05,739 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:05,739 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:05,957 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:05,958 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:05,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:05,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1116163654, now seen corresponding path program 1 times [2019-10-13 21:11:05,959 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:05,959 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705267285] [2019-10-13 21:11:05,962 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:05,962 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:05,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:06,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:06,152 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:11:06,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705267285] [2019-10-13 21:11:06,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946554325] [2019-10-13 21:11:06,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:06,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 3057 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:11:06,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:06,796 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:11:06,796 INFO L321 TraceCheckSpWp]: Computing backward predicates...