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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product03.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:40:53,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:40:53,511 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:40:53,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:40:53,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:40:53,525 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:40:53,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:40:53,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:40:53,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:40:53,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:40:53,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:40:53,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:40:53,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:40:53,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:40:53,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:40:53,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:40:53,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:40:53,539 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:40:53,541 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:40:53,543 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:40:53,545 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:40:53,546 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:40:53,547 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:40:53,548 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:40:53,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:40:53,551 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:40:53,551 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:40:53,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:40:53,553 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:40:53,554 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:40:53,554 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:40:53,555 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:40:53,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:40:53,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:40:53,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:40:53,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:40:53,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:40:53,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:40:53,559 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:40:53,560 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:40:53,561 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:40:53,562 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:40:53,577 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:40:53,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:40:53,578 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:40:53,578 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:40:53,579 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:40:53,579 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:40:53,579 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:40:53,579 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:40:53,580 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:40:53,580 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:40:53,580 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:40:53,581 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:40:53,581 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:40:53,581 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:40:53,581 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:40:53,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:40:53,582 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:40:53,582 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:40:53,582 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:40:53,582 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:40:53,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:40:53,583 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:40:53,583 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:40:53,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:40:53,584 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:40:53,584 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:40:53,584 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:40:53,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:40:53,584 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:40:53,585 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:40:53,613 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:40:53,626 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:40:53,630 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:40:53,631 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:40:53,632 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:40:53,633 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product03.cil.c [2019-10-03 02:40:53,693 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0751f64a/328dd591893f4a118b4b415fd7506958/FLAGb720fd505 [2019-10-03 02:40:54,380 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:40:54,381 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product03.cil.c [2019-10-03 02:40:54,411 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0751f64a/328dd591893f4a118b4b415fd7506958/FLAGb720fd505 [2019-10-03 02:40:54,676 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0751f64a/328dd591893f4a118b4b415fd7506958 [2019-10-03 02:40:54,686 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:40:54,688 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:40:54,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:40:54,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:40:54,693 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:40:54,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:40:54" (1/1) ... [2019-10-03 02:40:54,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5038e766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:54, skipping insertion in model container [2019-10-03 02:40:54,697 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:40:54" (1/1) ... [2019-10-03 02:40:54,705 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:40:54,791 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:40:55,598 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:40:55,623 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:40:55,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:40:55,862 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:40:55,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:55 WrapperNode [2019-10-03 02:40:55,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:40:55,863 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:40:55,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:40:55,864 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:40:55,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:55" (1/1) ... [2019-10-03 02:40:55,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:55" (1/1) ... [2019-10-03 02:40:55,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:55" (1/1) ... [2019-10-03 02:40:55,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:55" (1/1) ... [2019-10-03 02:40:56,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:55" (1/1) ... [2019-10-03 02:40:56,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:55" (1/1) ... [2019-10-03 02:40:56,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:55" (1/1) ... [2019-10-03 02:40:56,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:40:56,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:40:56,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:40:56,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:40:56,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:40:56,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:40:56,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:40:56,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:40:56,225 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-03 02:40:56,225 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-03 02:40:56,225 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-03 02:40:56,226 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-03 02:40:56,227 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-03 02:40:56,227 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-03 02:40:56,227 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-03 02:40:56,227 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-03 02:40:56,228 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-03 02:40:56,228 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-03 02:40:56,229 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-03 02:40:56,229 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:40:56,230 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:40:56,230 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:40:56,232 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:40:56,232 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:40:56,232 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:40:56,232 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:40:56,232 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:40:56,232 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:40:56,233 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:40:56,233 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:40:56,234 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:40:56,234 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-03 02:40:56,234 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-03 02:40:56,234 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-03 02:40:56,234 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-03 02:40:56,234 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-03 02:40:56,235 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-03 02:40:56,235 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-03 02:40:56,235 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-03 02:40:56,235 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-03 02:40:56,235 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-03 02:40:56,235 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-03 02:40:56,235 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-03 02:40:56,236 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-03 02:40:56,236 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-03 02:40:56,236 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:40:56,236 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-03 02:40:56,236 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:40:56,236 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-03 02:40:56,237 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-03 02:40:56,237 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-03 02:40:56,237 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-03 02:40:56,237 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-03 02:40:56,237 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-03 02:40:56,238 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-03 02:40:56,238 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-03 02:40:56,238 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-03 02:40:56,238 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-03 02:40:56,238 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-03 02:40:56,238 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-03 02:40:56,239 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-03 02:40:56,239 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-03 02:40:56,239 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__base [2019-10-03 02:40:56,240 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-03 02:40:56,240 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-03 02:40:56,240 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-03 02:40:56,241 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__base [2019-10-03 02:40:56,241 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-03 02:40:56,241 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-03 02:40:56,241 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-03 02:40:56,242 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-03 02:40:56,242 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-03 02:40:56,242 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-03 02:40:56,242 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-03 02:40:56,243 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-03 02:40:56,243 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-03 02:40:56,243 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-03 02:40:56,243 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-03 02:40:56,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-03 02:40:56,244 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-03 02:40:56,244 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-03 02:40:56,245 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:40:56,245 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:40:56,245 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-03 02:40:56,246 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-03 02:40:56,246 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-03 02:40:56,246 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-03 02:40:56,246 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-03 02:40:56,246 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-03 02:40:56,247 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-03 02:40:56,248 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-03 02:40:56,248 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-03 02:40:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-03 02:40:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-03 02:40:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-03 02:40:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-03 02:40:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:40:56,250 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:40:56,250 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:40:56,250 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:40:56,250 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:40:56,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:40:56,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:40:56,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:40:56,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:40:56,251 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:40:56,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:40:56,251 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:40:56,252 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:40:56,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:40:56,252 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:40:56,252 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:40:56,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:40:56,253 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:40:56,253 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:40:56,253 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:40:56,253 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:40:56,253 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:40:56,253 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:40:56,254 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-03 02:40:56,254 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-03 02:40:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-03 02:40:56,255 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-03 02:40:56,256 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-03 02:40:56,256 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-03 02:40:56,256 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-03 02:40:56,256 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-03 02:40:56,257 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-03 02:40:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-03 02:40:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-03 02:40:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-03 02:40:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-03 02:40:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-03 02:40:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-03 02:40:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-03 02:40:56,260 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-03 02:40:56,260 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-03 02:40:56,260 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:40:56,260 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-03 02:40:56,261 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-03 02:40:56,261 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-03 02:40:56,261 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:40:56,261 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:40:56,262 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-03 02:40:56,265 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-03 02:40:56,266 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-03 02:40:56,266 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-03 02:40:56,266 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-03 02:40:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-03 02:40:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-03 02:40:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-03 02:40:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-03 02:40:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-03 02:40:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-03 02:40:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-03 02:40:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-03 02:40:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-03 02:40:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-03 02:40:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__base [2019-10-03 02:40:56,275 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-03 02:40:56,275 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-03 02:40:56,276 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__base [2019-10-03 02:40:56,276 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-03 02:40:56,276 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-03 02:40:56,276 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-03 02:40:56,276 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-03 02:40:56,276 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-03 02:40:56,276 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-03 02:40:56,277 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-03 02:40:56,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:40:56,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:40:56,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:40:58,766 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:40:58,767 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-03 02:40:58,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:40:58 BoogieIcfgContainer [2019-10-03 02:40:58,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:40:58,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:40:58,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:40:58,773 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:40:58,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:40:54" (1/3) ... [2019-10-03 02:40:58,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d25f757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:40:58, skipping insertion in model container [2019-10-03 02:40:58,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:40:55" (2/3) ... [2019-10-03 02:40:58,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d25f757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:40:58, skipping insertion in model container [2019-10-03 02:40:58,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:40:58" (3/3) ... [2019-10-03 02:40:58,777 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product03.cil.c [2019-10-03 02:40:58,787 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:40:58,802 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:40:58,820 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:40:58,844 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:40:58,844 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:40:58,844 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:40:58,844 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:40:58,844 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:40:58,845 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:40:58,845 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:40:58,845 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:40:58,878 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states. [2019-10-03 02:40:58,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-03 02:40:58,910 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:40:58,912 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:40:58,914 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:40:58,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:40:58,921 INFO L82 PathProgramCache]: Analyzing trace with hash 370351368, now seen corresponding path program 1 times [2019-10-03 02:40:58,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:40:58,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:58,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:40:58,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:40:58,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:40:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:40:59,546 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-03 02:40:59,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:40:59,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:40:59,549 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:40:59,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:40:59,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:40:59,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:40:59,575 INFO L87 Difference]: Start difference. First operand 749 states. Second operand 4 states. [2019-10-03 02:40:59,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:40:59,780 INFO L93 Difference]: Finished difference Result 600 states and 957 transitions. [2019-10-03 02:40:59,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:40:59,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-10-03 02:40:59,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:40:59,820 INFO L225 Difference]: With dead ends: 600 [2019-10-03 02:40:59,820 INFO L226 Difference]: Without dead ends: 589 [2019-10-03 02:40:59,823 INFO L640 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-03 02:40:59,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-03 02:40:59,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-03 02:40:59,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-03 02:40:59,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 945 transitions. [2019-10-03 02:40:59,991 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 945 transitions. Word has length 133 [2019-10-03 02:40:59,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:40:59,991 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 945 transitions. [2019-10-03 02:40:59,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:40:59,992 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 945 transitions. [2019-10-03 02:41:00,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-03 02:41:00,000 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:00,001 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:00,001 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:00,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:00,002 INFO L82 PathProgramCache]: Analyzing trace with hash -743808276, now seen corresponding path program 1 times [2019-10-03 02:41:00,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:00,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:00,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:00,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:00,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:00,183 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-03 02:41:00,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:00,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:00,184 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:00,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:00,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:00,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:00,191 INFO L87 Difference]: Start difference. First operand 589 states and 945 transitions. Second operand 4 states. [2019-10-03 02:41:00,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:00,257 INFO L93 Difference]: Finished difference Result 591 states and 946 transitions. [2019-10-03 02:41:00,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:41:00,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-10-03 02:41:00,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:00,263 INFO L225 Difference]: With dead ends: 591 [2019-10-03 02:41:00,264 INFO L226 Difference]: Without dead ends: 589 [2019-10-03 02:41:00,265 INFO L640 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-03 02:41:00,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-03 02:41:00,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-03 02:41:00,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-03 02:41:00,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 944 transitions. [2019-10-03 02:41:00,295 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 944 transitions. Word has length 136 [2019-10-03 02:41:00,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:00,297 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 944 transitions. [2019-10-03 02:41:00,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:00,298 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 944 transitions. [2019-10-03 02:41:00,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-03 02:41:00,309 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:00,309 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:00,310 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:00,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:00,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1971987191, now seen corresponding path program 1 times [2019-10-03 02:41:00,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:00,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:00,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:00,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:00,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:00,532 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-03 02:41:00,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:00,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:00,533 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:00,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:00,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:00,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:00,535 INFO L87 Difference]: Start difference. First operand 589 states and 944 transitions. Second operand 4 states. [2019-10-03 02:41:00,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:00,613 INFO L93 Difference]: Finished difference Result 591 states and 945 transitions. [2019-10-03 02:41:00,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:41:00,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-03 02:41:00,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:00,622 INFO L225 Difference]: With dead ends: 591 [2019-10-03 02:41:00,623 INFO L226 Difference]: Without dead ends: 589 [2019-10-03 02:41:00,623 INFO L640 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-03 02:41:00,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-03 02:41:00,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-03 02:41:00,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-03 02:41:00,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 943 transitions. [2019-10-03 02:41:00,660 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 943 transitions. Word has length 137 [2019-10-03 02:41:00,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:00,661 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 943 transitions. [2019-10-03 02:41:00,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:00,661 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 943 transitions. [2019-10-03 02:41:00,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-03 02:41:00,667 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:00,668 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:00,668 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:00,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:00,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1254078520, now seen corresponding path program 1 times [2019-10-03 02:41:00,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:00,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:00,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:00,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:00,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:00,874 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 02:41:00,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:00,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:00,875 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:00,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:00,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:00,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:00,876 INFO L87 Difference]: Start difference. First operand 589 states and 943 transitions. Second operand 4 states. [2019-10-03 02:41:00,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:00,926 INFO L93 Difference]: Finished difference Result 591 states and 944 transitions. [2019-10-03 02:41:00,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:41:00,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-03 02:41:00,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:00,931 INFO L225 Difference]: With dead ends: 591 [2019-10-03 02:41:00,932 INFO L226 Difference]: Without dead ends: 589 [2019-10-03 02:41:00,932 INFO L640 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-03 02:41:00,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-03 02:41:00,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-03 02:41:00,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-03 02:41:00,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 942 transitions. [2019-10-03 02:41:00,958 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 942 transitions. Word has length 138 [2019-10-03 02:41:00,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:00,959 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 942 transitions. [2019-10-03 02:41:00,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:00,959 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 942 transitions. [2019-10-03 02:41:00,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-03 02:41:00,964 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:00,965 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:00,965 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:00,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:00,965 INFO L82 PathProgramCache]: Analyzing trace with hash 300720275, now seen corresponding path program 1 times [2019-10-03 02:41:00,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:00,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:00,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:00,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:00,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:01,097 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-03 02:41:01,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:01,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:01,098 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:01,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:01,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:01,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:01,099 INFO L87 Difference]: Start difference. First operand 589 states and 942 transitions. Second operand 4 states. [2019-10-03 02:41:01,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:01,152 INFO L93 Difference]: Finished difference Result 591 states and 943 transitions. [2019-10-03 02:41:01,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:41:01,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-03 02:41:01,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:01,159 INFO L225 Difference]: With dead ends: 591 [2019-10-03 02:41:01,159 INFO L226 Difference]: Without dead ends: 589 [2019-10-03 02:41:01,159 INFO L640 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-03 02:41:01,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-03 02:41:01,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-03 02:41:01,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-03 02:41:01,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 941 transitions. [2019-10-03 02:41:01,178 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 941 transitions. Word has length 139 [2019-10-03 02:41:01,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:01,178 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 941 transitions. [2019-10-03 02:41:01,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:01,178 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 941 transitions. [2019-10-03 02:41:01,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-03 02:41:01,183 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:01,183 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:01,184 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:01,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:01,184 INFO L82 PathProgramCache]: Analyzing trace with hash -261536604, now seen corresponding path program 1 times [2019-10-03 02:41:01,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:01,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:01,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:01,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:01,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:01,382 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-03 02:41:01,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:01,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:41:01,383 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:01,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:41:01,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:41:01,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:41:01,384 INFO L87 Difference]: Start difference. First operand 589 states and 941 transitions. Second operand 10 states. [2019-10-03 02:41:01,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:01,554 INFO L93 Difference]: Finished difference Result 598 states and 952 transitions. [2019-10-03 02:41:01,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:41:01,555 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-10-03 02:41:01,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:01,561 INFO L225 Difference]: With dead ends: 598 [2019-10-03 02:41:01,561 INFO L226 Difference]: Without dead ends: 598 [2019-10-03 02:41:01,561 INFO L640 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-03 02:41:01,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-03 02:41:01,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2019-10-03 02:41:01,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-03 02:41:01,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 950 transitions. [2019-10-03 02:41:01,595 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 950 transitions. Word has length 140 [2019-10-03 02:41:01,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:01,596 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 950 transitions. [2019-10-03 02:41:01,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:41:01,596 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 950 transitions. [2019-10-03 02:41:01,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-03 02:41:01,604 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:01,605 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:01,605 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:01,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:01,605 INFO L82 PathProgramCache]: Analyzing trace with hash 433110403, now seen corresponding path program 1 times [2019-10-03 02:41:01,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:01,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:01,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:01,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:01,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:01,779 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-03 02:41:01,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:01,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:41:01,779 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:01,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:41:01,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:41:01,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:41:01,781 INFO L87 Difference]: Start difference. First operand 596 states and 950 transitions. Second operand 4 states. [2019-10-03 02:41:01,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:01,831 INFO L93 Difference]: Finished difference Result 594 states and 945 transitions. [2019-10-03 02:41:01,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:41:01,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-03 02:41:01,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:01,838 INFO L225 Difference]: With dead ends: 594 [2019-10-03 02:41:01,839 INFO L226 Difference]: Without dead ends: 583 [2019-10-03 02:41:01,839 INFO L640 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-03 02:41:01,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-03 02:41:01,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-03 02:41:01,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-03 02:41:01,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 927 transitions. [2019-10-03 02:41:01,866 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 927 transitions. Word has length 140 [2019-10-03 02:41:01,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:01,868 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 927 transitions. [2019-10-03 02:41:01,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:41:01,868 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 927 transitions. [2019-10-03 02:41:01,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-03 02:41:01,872 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:01,872 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:01,872 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:01,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:01,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1772555127, now seen corresponding path program 1 times [2019-10-03 02:41:01,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:01,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:01,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:01,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:01,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:02,035 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-03 02:41:02,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:02,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:41:02,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:02,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:41:02,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:41:02,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:41:02,039 INFO L87 Difference]: Start difference. First operand 583 states and 927 transitions. Second operand 6 states. [2019-10-03 02:41:02,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:02,263 INFO L93 Difference]: Finished difference Result 586 states and 930 transitions. [2019-10-03 02:41:02,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:41:02,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-03 02:41:02,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:02,270 INFO L225 Difference]: With dead ends: 586 [2019-10-03 02:41:02,270 INFO L226 Difference]: Without dead ends: 583 [2019-10-03 02:41:02,271 INFO L640 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-03 02:41:02,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-03 02:41:02,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-03 02:41:02,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-03 02:41:02,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 923 transitions. [2019-10-03 02:41:02,293 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 923 transitions. Word has length 141 [2019-10-03 02:41:02,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:02,295 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 923 transitions. [2019-10-03 02:41:02,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:41:02,296 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 923 transitions. [2019-10-03 02:41:02,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-03 02:41:02,300 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:02,300 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:02,300 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:02,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:02,301 INFO L82 PathProgramCache]: Analyzing trace with hash -235226265, now seen corresponding path program 1 times [2019-10-03 02:41:02,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:02,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:02,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:02,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:02,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:02,450 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-03 02:41:02,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:02,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:41:02,450 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:02,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:41:02,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:41:02,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:41:02,452 INFO L87 Difference]: Start difference. First operand 583 states and 923 transitions. Second operand 6 states. [2019-10-03 02:41:02,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:02,672 INFO L93 Difference]: Finished difference Result 586 states and 926 transitions. [2019-10-03 02:41:02,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:41:02,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-03 02:41:02,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:02,677 INFO L225 Difference]: With dead ends: 586 [2019-10-03 02:41:02,677 INFO L226 Difference]: Without dead ends: 583 [2019-10-03 02:41:02,678 INFO L640 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-03 02:41:02,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-03 02:41:02,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-03 02:41:02,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-03 02:41:02,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 919 transitions. [2019-10-03 02:41:02,705 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 919 transitions. Word has length 142 [2019-10-03 02:41:02,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:02,706 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 919 transitions. [2019-10-03 02:41:02,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:41:02,706 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 919 transitions. [2019-10-03 02:41:02,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 02:41:02,710 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:02,710 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:02,710 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:02,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:02,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1655770492, now seen corresponding path program 1 times [2019-10-03 02:41:02,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:02,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:02,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:02,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:02,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:02,907 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-03 02:41:02,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:02,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:41:02,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:02,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:41:02,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:41:02,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:41:02,910 INFO L87 Difference]: Start difference. First operand 583 states and 919 transitions. Second operand 6 states. [2019-10-03 02:41:03,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:03,174 INFO L93 Difference]: Finished difference Result 586 states and 922 transitions. [2019-10-03 02:41:03,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:41:03,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-03 02:41:03,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:03,182 INFO L225 Difference]: With dead ends: 586 [2019-10-03 02:41:03,183 INFO L226 Difference]: Without dead ends: 583 [2019-10-03 02:41:03,183 INFO L640 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-03 02:41:03,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-03 02:41:03,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-03 02:41:03,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-03 02:41:03,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 915 transitions. [2019-10-03 02:41:03,213 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 915 transitions. Word has length 143 [2019-10-03 02:41:03,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:03,214 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 915 transitions. [2019-10-03 02:41:03,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:41:03,214 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 915 transitions. [2019-10-03 02:41:03,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 02:41:03,219 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:03,220 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:03,220 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:03,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:03,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1584723460, now seen corresponding path program 1 times [2019-10-03 02:41:03,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:03,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:03,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:03,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:03,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:03,432 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-03 02:41:03,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:03,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:41:03,433 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:03,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:41:03,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:41:03,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:41:03,435 INFO L87 Difference]: Start difference. First operand 583 states and 915 transitions. Second operand 7 states. [2019-10-03 02:41:03,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:03,514 INFO L93 Difference]: Finished difference Result 586 states and 918 transitions. [2019-10-03 02:41:03,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:41:03,515 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-03 02:41:03,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:03,520 INFO L225 Difference]: With dead ends: 586 [2019-10-03 02:41:03,520 INFO L226 Difference]: Without dead ends: 562 [2019-10-03 02:41:03,521 INFO L640 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-03 02:41:03,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-03 02:41:03,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-03 02:41:03,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-03 02:41:03,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 881 transitions. [2019-10-03 02:41:03,543 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 881 transitions. Word has length 143 [2019-10-03 02:41:03,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:03,543 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 881 transitions. [2019-10-03 02:41:03,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:41:03,543 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 881 transitions. [2019-10-03 02:41:03,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-03 02:41:03,548 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:03,548 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:03,548 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:03,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:03,549 INFO L82 PathProgramCache]: Analyzing trace with hash -145161716, now seen corresponding path program 1 times [2019-10-03 02:41:03,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:03,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:03,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:03,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:03,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:03,687 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-03 02:41:03,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:03,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:41:03,688 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:03,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:41:03,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:41:03,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:41:03,692 INFO L87 Difference]: Start difference. First operand 562 states and 881 transitions. Second operand 6 states. [2019-10-03 02:41:03,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:03,814 INFO L93 Difference]: Finished difference Result 565 states and 884 transitions. [2019-10-03 02:41:03,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:41:03,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-03 02:41:03,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:03,819 INFO L225 Difference]: With dead ends: 565 [2019-10-03 02:41:03,819 INFO L226 Difference]: Without dead ends: 562 [2019-10-03 02:41:03,820 INFO L640 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-03 02:41:03,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-03 02:41:03,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-03 02:41:03,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-03 02:41:03,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 880 transitions. [2019-10-03 02:41:03,843 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 880 transitions. Word has length 144 [2019-10-03 02:41:03,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:03,845 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 880 transitions. [2019-10-03 02:41:03,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:41:03,845 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 880 transitions. [2019-10-03 02:41:03,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-03 02:41:03,849 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:03,849 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:03,849 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:03,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:03,850 INFO L82 PathProgramCache]: Analyzing trace with hash -431774847, now seen corresponding path program 1 times [2019-10-03 02:41:03,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:03,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:03,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:03,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:03,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:04,004 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-03 02:41:04,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:04,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:41:04,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:04,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:41:04,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:41:04,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:41:04,007 INFO L87 Difference]: Start difference. First operand 562 states and 880 transitions. Second operand 6 states. [2019-10-03 02:41:04,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:04,132 INFO L93 Difference]: Finished difference Result 565 states and 883 transitions. [2019-10-03 02:41:04,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:41:04,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-03 02:41:04,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:04,139 INFO L225 Difference]: With dead ends: 565 [2019-10-03 02:41:04,139 INFO L226 Difference]: Without dead ends: 562 [2019-10-03 02:41:04,140 INFO L640 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-03 02:41:04,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-03 02:41:04,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-03 02:41:04,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-03 02:41:04,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 879 transitions. [2019-10-03 02:41:04,164 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 879 transitions. Word has length 145 [2019-10-03 02:41:04,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:04,167 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 879 transitions. [2019-10-03 02:41:04,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:41:04,167 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 879 transitions. [2019-10-03 02:41:04,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-03 02:41:04,171 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:04,172 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:04,172 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:04,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:04,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1019136847, now seen corresponding path program 1 times [2019-10-03 02:41:04,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:04,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:04,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:04,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:04,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:04,410 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-03 02:41:04,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:41:04,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:41:04,411 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:04,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:41:04,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:41:04,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:41:04,413 INFO L87 Difference]: Start difference. First operand 562 states and 879 transitions. Second operand 12 states. [2019-10-03 02:41:04,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:04,590 INFO L93 Difference]: Finished difference Result 566 states and 882 transitions. [2019-10-03 02:41:04,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:41:04,591 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-10-03 02:41:04,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:04,595 INFO L225 Difference]: With dead ends: 566 [2019-10-03 02:41:04,595 INFO L226 Difference]: Without dead ends: 562 [2019-10-03 02:41:04,597 INFO L640 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-03 02:41:04,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-03 02:41:04,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-03 02:41:04,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-03 02:41:04,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 878 transitions. [2019-10-03 02:41:04,623 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 878 transitions. Word has length 146 [2019-10-03 02:41:04,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:04,624 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 878 transitions. [2019-10-03 02:41:04,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:41:04,624 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 878 transitions. [2019-10-03 02:41:04,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-03 02:41:04,628 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:41:04,628 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:41:04,629 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:41:04,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:04,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1801631980, now seen corresponding path program 1 times [2019-10-03 02:41:04,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:41:04,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:04,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:41:04,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:41:04,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:41:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:41:04,770 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-03 02:41:04,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:41:04,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:41:04,772 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2019-10-03 02:41:04,775 INFO L207 CegarAbsIntRunner]: [55], [56], [140], [144], [147], [338], [340], [342], [407], [408], [410], [411], [412], [414], [417], [419], [423], [446], [846], [848], [867], [887], [907], [927], [947], [949], [978], [979], [980], [982], [991], [993], [1006], [1019], [1020], [1022], [1119], [1122], [1127], [1130], [1149], [1152], [1188], [1193], [1260], [1261], [1293], [1295], [1298], [1300], [1306], [1310], [1311], [1347], [1350], [1355], [1360], [1365], [1370], [1375], [1378], [1494], [1505], [1510], [1513], [1532], [1763], [1767], [1771], [1775], [1779], [1783], [1786], [1788], [1804], [1817], [1820], [1826], [1830], [1942], [1943], [2237], [2329], [2332], [2350], [2486], [2487], [2488], [2489], [2490], [2491], [2492], [2493], [2494], [2504], [2505], [2506], [2507], [2524], [2525], [2526], [2527], [2528], [2529], [2536], [2537], [2538], [2539], [2584], [2585], [2596], [2597], [2604], [2605], [2634], [2635], [2636], [2637], [2648], [2649], [2650], [2670], [2671], [2672], [2673], [2678], [2679], [2686], [2687], [2688], [2689], [2690], [2746], [2747], [2748] [2019-10-03 02:41:04,842 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:41:04,842 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:41:04,986 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:41:04,987 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 170 root evaluator evaluations with a maximum evaluation depth of 0. Performed 170 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 260 variables. [2019-10-03 02:41:04,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:41:04,993 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:41:05,089 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:41:05,089 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:41:05,101 INFO L420 sIntCurrentIteration]: We unified 146 AI predicates to 146 [2019-10-03 02:41:05,101 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:41:05,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:41:05,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-10-03 02:41:05,103 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:41:05,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:41:05,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:41:05,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:41:05,105 INFO L87 Difference]: Start difference. First operand 562 states and 878 transitions. Second operand 2 states. [2019-10-03 02:41:05,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:41:05,105 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:41:05,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:41:05,106 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 147 [2019-10-03 02:41:05,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:41:05,106 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:41:05,107 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:41:05,110 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:41:05,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:41:05,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:41:05,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:41:05,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:41:05,111 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 147 [2019-10-03 02:41:05,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:41:05,111 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:41:05,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:41:05,112 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:41:05,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:41:05,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:41:05 BoogieIcfgContainer [2019-10-03 02:41:05,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:41:05,124 INFO L168 Benchmark]: Toolchain (without parser) took 10434.44 ms. Allocated memory was 137.9 MB in the beginning and 443.0 MB in the end (delta: 305.1 MB). Free memory was 82.8 MB in the beginning and 216.5 MB in the end (delta: -133.7 MB). Peak memory consumption was 171.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:41:05,126 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 137.9 MB. Free memory was 103.9 MB in the beginning and 103.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:41:05,129 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1173.90 ms. Allocated memory was 137.9 MB in the beginning and 198.7 MB in the end (delta: 60.8 MB). Free memory was 82.5 MB in the beginning and 136.7 MB in the end (delta: -54.1 MB). Peak memory consumption was 29.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:41:05,134 INFO L168 Benchmark]: Boogie Preprocessor took 263.76 ms. Allocated memory is still 198.7 MB. Free memory was 136.7 MB in the beginning and 127.0 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-10-03 02:41:05,135 INFO L168 Benchmark]: RCFGBuilder took 2641.22 ms. Allocated memory was 198.7 MB in the beginning and 273.7 MB in the end (delta: 75.0 MB). Free memory was 127.0 MB in the beginning and 158.3 MB in the end (delta: -31.3 MB). Peak memory consumption was 91.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:41:05,136 INFO L168 Benchmark]: TraceAbstraction took 6350.35 ms. Allocated memory was 273.7 MB in the beginning and 443.0 MB in the end (delta: 169.3 MB). Free memory was 158.3 MB in the beginning and 216.5 MB in the end (delta: -58.2 MB). Peak memory consumption was 111.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:41:05,152 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 137.9 MB. Free memory was 103.9 MB in the beginning and 103.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1173.90 ms. Allocated memory was 137.9 MB in the beginning and 198.7 MB in the end (delta: 60.8 MB). Free memory was 82.5 MB in the beginning and 136.7 MB in the end (delta: -54.1 MB). Peak memory consumption was 29.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 263.76 ms. Allocated memory is still 198.7 MB. Free memory was 136.7 MB in the beginning and 127.0 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2641.22 ms. Allocated memory was 198.7 MB in the beginning and 273.7 MB in the end (delta: 75.0 MB). Free memory was 127.0 MB in the beginning and 158.3 MB in the end (delta: -31.3 MB). Peak memory consumption was 91.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6350.35 ms. Allocated memory was 273.7 MB in the beginning and 443.0 MB in the end (delta: 169.3 MB). Free memory was 158.3 MB in the beginning and 216.5 MB in the end (delta: -58.2 MB). Peak memory consumption was 111.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1212]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 76 procedures, 905 locations, 1 error locations. SAFE Result, 6.2s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12650 SDtfs, 440 SDslu, 48850 SDs, 0 SdLazy, 1264 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=749occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.6506849315068493 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2114 NumberOfCodeBlocks, 2114 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2099 ConstructedInterpolants, 0 QuantifiedInterpolants, 356627 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 264/270 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...