java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec9_product25.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:35:55,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:35:55,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:35:55,059 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:35:55,059 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:35:55,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:35:55,063 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:35:55,078 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:35:55,080 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:35:55,082 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:35:55,085 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:35:55,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:35:55,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:35:55,090 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:35:55,093 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:35:55,095 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:35:55,096 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:35:55,100 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:35:55,102 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:35:55,107 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:35:55,112 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:35:55,114 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:35:55,118 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:35:55,119 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:35:55,122 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:35:55,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:35:55,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:35:55,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:35:55,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:35:55,128 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:35:55,128 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:35:55,129 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:35:55,129 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:35:55,130 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:35:55,132 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:35:55,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:35:55,133 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:35:55,133 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:35:55,133 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:35:55,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:35:55,135 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:35:55,136 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 12:35:55,156 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:35:55,157 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:35:55,158 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:35:55,158 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:35:55,158 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:35:55,159 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:35:55,159 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:35:55,159 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:35:55,159 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:35:55,160 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:35:55,160 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:35:55,160 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:35:55,160 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:35:55,160 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:35:55,160 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:35:55,161 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:35:55,161 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:35:55,161 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:35:55,161 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:35:55,162 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:35:55,162 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:35:55,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:35:55,162 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:35:55,162 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:35:55,163 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:35:55,163 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:35:55,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:35:55,163 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:35:55,163 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:35:55,211 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:35:55,228 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:35:55,233 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:35:55,234 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:35:55,235 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:35:55,236 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product25.cil.c [2019-10-02 12:35:55,315 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b3e3027a/b7cb4a672e34432bb2dca395d5eb3f2f/FLAGa39f3f7d0 [2019-10-02 12:35:55,988 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:35:55,992 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product25.cil.c [2019-10-02 12:35:56,024 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b3e3027a/b7cb4a672e34432bb2dca395d5eb3f2f/FLAGa39f3f7d0 [2019-10-02 12:35:56,177 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b3e3027a/b7cb4a672e34432bb2dca395d5eb3f2f [2019-10-02 12:35:56,189 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:35:56,191 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:35:56,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:35:56,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:35:56,195 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:35:56,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:35:56" (1/1) ... [2019-10-02 12:35:56,198 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4819bea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:35:56, skipping insertion in model container [2019-10-02 12:35:56,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:35:56" (1/1) ... [2019-10-02 12:35:56,204 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:35:56,275 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:35:56,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:35:56,985 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:35:57,113 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:35:57,184 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:35:57,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:35:57 WrapperNode [2019-10-02 12:35:57,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:35:57,186 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:35:57,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:35:57,187 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:35:57,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:35:57" (1/1) ... [2019-10-02 12:35:57,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:35:57" (1/1) ... [2019-10-02 12:35:57,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:35:57" (1/1) ... [2019-10-02 12:35:57,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:35:57" (1/1) ... [2019-10-02 12:35:57,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:35:57" (1/1) ... [2019-10-02 12:35:57,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:35:57" (1/1) ... [2019-10-02 12:35:57,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:35:57" (1/1) ... [2019-10-02 12:35:57,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:35:57,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:35:57,371 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:35:57,371 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:35:57,372 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:35:57" (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-02 12:35:57,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:35:57,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:35:57,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:35:57,462 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-10-02 12:35:57,463 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-10-02 12:35:57,463 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-10-02 12:35:57,463 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-10-02 12:35:57,463 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:35:57,463 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:35:57,464 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:35:57,464 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:35:57,464 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:35:57,464 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:35:57,464 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:35:57,465 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:35:57,465 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:35:57,465 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:35:57,465 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:35:57,465 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:35:57,466 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:35:57,466 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:35:57,466 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:35:57,466 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:35:57,466 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:35:57,467 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:35:57,467 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:35:57,467 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:35:57,467 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:35:57,467 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:35:57,468 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:35:57,468 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:35:57,468 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:35:57,468 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:35:57,468 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:35:57,468 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:35:57,469 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:35:57,469 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:35:57,469 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:35:57,469 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:35:57,469 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:35:57,470 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:35:57,470 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:35:57,470 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:35:57,470 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:35:57,470 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:35:57,470 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:35:57,471 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:35:57,471 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:35:57,471 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:35:57,471 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:35:57,471 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:35:57,472 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:35:57,472 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:35:57,472 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:35:57,472 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:35:57,472 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-02 12:35:57,472 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:35:57,473 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:35:57,473 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:35:57,473 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:35:57,473 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:35:57,473 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:35:57,474 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:35:57,474 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:35:57,474 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:35:57,474 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:35:57,474 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:35:57,474 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:35:57,475 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:35:57,475 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:35:57,475 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:35:57,475 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:35:57,475 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:35:57,476 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:35:57,476 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:35:57,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:35:57,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:35:57,477 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:35:57,477 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:35:57,477 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:35:57,477 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:35:57,477 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-10-02 12:35:57,478 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-10-02 12:35:57,478 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-10-02 12:35:57,478 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-10-02 12:35:57,478 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:35:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:35:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:35:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:35:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:35:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:35:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:35:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:35:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:35:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:35:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:35:57,481 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:35:57,481 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:35:57,481 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:35:57,481 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:35:57,482 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:35:57,482 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:35:57,482 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:35:57,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:35:57,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:35:57,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:35:57,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:35:57,483 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:35:57,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:35:57,484 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:35:57,484 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:35:57,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:35:57,484 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:35:57,484 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:35:57,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:35:57,485 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:35:57,485 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:35:57,485 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:35:57,485 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:35:57,486 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:35:57,486 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:35:57,486 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:35:57,486 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:35:57,486 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:35:57,487 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:35:57,487 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:35:57,487 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:35:57,487 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:35:57,487 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:35:57,488 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:35:57,488 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:35:57,488 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:35:57,488 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:35:57,488 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:35:57,489 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:35:57,489 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:35:57,489 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:35:57,489 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:35:57,489 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:35:57,490 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:35:57,490 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:35:57,490 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:35:57,490 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:35:57,490 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:35:57,491 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:35:57,491 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:35:57,491 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:35:57,491 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:35:57,491 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:35:57,491 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:35:57,492 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-02 12:35:57,492 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:35:57,492 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:35:57,492 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:35:57,492 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:35:57,492 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:35:57,492 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:35:57,492 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:35:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:35:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:35:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:35:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:35:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:35:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:35:57,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:35:59,947 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:35:59,948 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:35:59,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:35:59 BoogieIcfgContainer [2019-10-02 12:35:59,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:35:59,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:35:59,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:35:59,954 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:35:59,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:35:56" (1/3) ... [2019-10-02 12:35:59,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74fafde8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:35:59, skipping insertion in model container [2019-10-02 12:35:59,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:35:57" (2/3) ... [2019-10-02 12:35:59,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74fafde8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:35:59, skipping insertion in model container [2019-10-02 12:35:59,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:35:59" (3/3) ... [2019-10-02 12:35:59,958 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product25.cil.c [2019-10-02 12:35:59,969 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:35:59,979 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:35:59,997 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:36:00,034 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:36:00,035 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:36:00,036 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:36:00,036 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:36:00,036 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:36:00,036 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:36:00,036 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:36:00,036 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:36:00,036 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:36:00,072 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states. [2019-10-02 12:36:00,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-02 12:36:00,102 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:36:00,104 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:36:00,106 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:36:00,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:36:00,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1728086077, now seen corresponding path program 1 times [2019-10-02 12:36:00,115 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:36:00,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:36:00,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:00,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:00,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:00,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:36:00,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:36:00,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:36:00,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:36:00,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:36:00,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:36:00,796 INFO L87 Difference]: Start difference. First operand 749 states. Second operand 4 states. [2019-10-02 12:36:01,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:01,032 INFO L93 Difference]: Finished difference Result 1161 states and 1887 transitions. [2019-10-02 12:36:01,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:36:01,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-10-02 12:36:01,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:01,073 INFO L225 Difference]: With dead ends: 1161 [2019-10-02 12:36:01,074 INFO L226 Difference]: Without dead ends: 589 [2019-10-02 12:36:01,132 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-02 12:36:01,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-02 12:36:01,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-02 12:36:01,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-02 12:36:01,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 945 transitions. [2019-10-02 12:36:01,279 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 945 transitions. Word has length 109 [2019-10-02 12:36:01,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:36:01,279 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 945 transitions. [2019-10-02 12:36:01,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:36:01,280 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 945 transitions. [2019-10-02 12:36:01,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-02 12:36:01,294 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:36:01,294 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:36:01,294 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:36:01,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:36:01,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1757589142, now seen corresponding path program 1 times [2019-10-02 12:36:01,296 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:36:01,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:36:01,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:01,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:01,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:01,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:36:01,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:36:01,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:36:01,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:36:01,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:36:01,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:36:01,564 INFO L87 Difference]: Start difference. First operand 589 states and 945 transitions. Second operand 4 states. [2019-10-02 12:36:01,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:01,667 INFO L93 Difference]: Finished difference Result 1141 states and 1848 transitions. [2019-10-02 12:36:01,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:36:01,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-02 12:36:01,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:01,675 INFO L225 Difference]: With dead ends: 1141 [2019-10-02 12:36:01,675 INFO L226 Difference]: Without dead ends: 589 [2019-10-02 12:36:01,681 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-02 12:36:01,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-02 12:36:01,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-02 12:36:01,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-02 12:36:01,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 944 transitions. [2019-10-02 12:36:01,725 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 944 transitions. Word has length 112 [2019-10-02 12:36:01,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:36:01,728 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 944 transitions. [2019-10-02 12:36:01,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:36:01,728 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 944 transitions. [2019-10-02 12:36:01,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-02 12:36:01,735 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:36:01,736 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:36:01,736 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:36:01,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:36:01,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1080658030, now seen corresponding path program 1 times [2019-10-02 12:36:01,740 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:36:01,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:36:01,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:01,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:01,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:02,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:36:02,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:36:02,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:36:02,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:36:02,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:36:02,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:36:02,014 INFO L87 Difference]: Start difference. First operand 589 states and 944 transitions. Second operand 4 states. [2019-10-02 12:36:02,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:02,093 INFO L93 Difference]: Finished difference Result 1141 states and 1847 transitions. [2019-10-02 12:36:02,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:36:02,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-02 12:36:02,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:02,102 INFO L225 Difference]: With dead ends: 1141 [2019-10-02 12:36:02,102 INFO L226 Difference]: Without dead ends: 589 [2019-10-02 12:36:02,106 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-02 12:36:02,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-02 12:36:02,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-02 12:36:02,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-02 12:36:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 943 transitions. [2019-10-02 12:36:02,146 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 943 transitions. Word has length 113 [2019-10-02 12:36:02,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:36:02,147 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 943 transitions. [2019-10-02 12:36:02,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:36:02,147 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 943 transitions. [2019-10-02 12:36:02,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-02 12:36:02,154 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:36:02,154 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:36:02,154 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:36:02,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:36:02,155 INFO L82 PathProgramCache]: Analyzing trace with hash -714374894, now seen corresponding path program 1 times [2019-10-02 12:36:02,155 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:36:02,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:36:02,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:02,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:02,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:02,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:36:02,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:36:02,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:36:02,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:36:02,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:36:02,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:36:02,404 INFO L87 Difference]: Start difference. First operand 589 states and 943 transitions. Second operand 4 states. [2019-10-02 12:36:02,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:02,478 INFO L93 Difference]: Finished difference Result 1141 states and 1846 transitions. [2019-10-02 12:36:02,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:36:02,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-02 12:36:02,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:02,487 INFO L225 Difference]: With dead ends: 1141 [2019-10-02 12:36:02,487 INFO L226 Difference]: Without dead ends: 589 [2019-10-02 12:36:02,492 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-02 12:36:02,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-02 12:36:02,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-02 12:36:02,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-02 12:36:02,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 942 transitions. [2019-10-02 12:36:02,519 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 942 transitions. Word has length 114 [2019-10-02 12:36:02,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:36:02,521 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 942 transitions. [2019-10-02 12:36:02,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:36:02,521 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 942 transitions. [2019-10-02 12:36:02,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-02 12:36:02,526 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:36:02,526 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:36:02,526 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:36:02,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:36:02,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1484141674, now seen corresponding path program 1 times [2019-10-02 12:36:02,527 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:36:02,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:36:02,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:02,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:02,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:02,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:36:02,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:36:02,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:36:02,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:36:02,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:36:02,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:36:02,663 INFO L87 Difference]: Start difference. First operand 589 states and 942 transitions. Second operand 4 states. [2019-10-02 12:36:02,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:02,728 INFO L93 Difference]: Finished difference Result 1141 states and 1845 transitions. [2019-10-02 12:36:02,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:36:02,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-10-02 12:36:02,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:02,738 INFO L225 Difference]: With dead ends: 1141 [2019-10-02 12:36:02,739 INFO L226 Difference]: Without dead ends: 589 [2019-10-02 12:36:02,742 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-02 12:36:02,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-02 12:36:02,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2019-10-02 12:36:02,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-02 12:36:02,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 941 transitions. [2019-10-02 12:36:02,765 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 941 transitions. Word has length 115 [2019-10-02 12:36:02,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:36:02,766 INFO L475 AbstractCegarLoop]: Abstraction has 589 states and 941 transitions. [2019-10-02 12:36:02,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:36:02,766 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 941 transitions. [2019-10-02 12:36:02,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 12:36:02,771 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:36:02,771 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:36:02,772 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:36:02,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:36:02,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1366326386, now seen corresponding path program 1 times [2019-10-02 12:36:02,772 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:36:02,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:36:02,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:02,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:02,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:02,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:36:02,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:36:02,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:36:02,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:36:02,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:36:02,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:36:02,980 INFO L87 Difference]: Start difference. First operand 589 states and 941 transitions. Second operand 10 states. [2019-10-02 12:36:03,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:03,155 INFO L93 Difference]: Finished difference Result 1099 states and 1765 transitions. [2019-10-02 12:36:03,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:36:03,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 116 [2019-10-02 12:36:03,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:03,167 INFO L225 Difference]: With dead ends: 1099 [2019-10-02 12:36:03,167 INFO L226 Difference]: Without dead ends: 598 [2019-10-02 12:36:03,174 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-02 12:36:03,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-02 12:36:03,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 596. [2019-10-02 12:36:03,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-02 12:36:03,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 950 transitions. [2019-10-02 12:36:03,234 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 950 transitions. Word has length 116 [2019-10-02 12:36:03,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:36:03,235 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 950 transitions. [2019-10-02 12:36:03,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:36:03,235 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 950 transitions. [2019-10-02 12:36:03,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 12:36:03,242 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:36:03,242 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:36:03,243 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:36:03,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:36:03,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1937577619, now seen corresponding path program 1 times [2019-10-02 12:36:03,243 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:36:03,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:36:03,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:03,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:03,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:03,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:36:03,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:36:03,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:36:03,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:36:03,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:36:03,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:36:03,430 INFO L87 Difference]: Start difference. First operand 596 states and 950 transitions. Second operand 4 states. [2019-10-02 12:36:03,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:03,492 INFO L93 Difference]: Finished difference Result 1147 states and 1851 transitions. [2019-10-02 12:36:03,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:36:03,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-10-02 12:36:03,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:03,499 INFO L225 Difference]: With dead ends: 1147 [2019-10-02 12:36:03,499 INFO L226 Difference]: Without dead ends: 583 [2019-10-02 12:36:03,502 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-02 12:36:03,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-02 12:36:03,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-02 12:36:03,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-02 12:36:03,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 927 transitions. [2019-10-02 12:36:03,529 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 927 transitions. Word has length 116 [2019-10-02 12:36:03,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:36:03,531 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 927 transitions. [2019-10-02 12:36:03,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:36:03,531 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 927 transitions. [2019-10-02 12:36:03,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-02 12:36:03,535 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:36:03,535 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:36:03,535 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:36:03,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:36:03,536 INFO L82 PathProgramCache]: Analyzing trace with hash 13298972, now seen corresponding path program 1 times [2019-10-02 12:36:03,536 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:36:03,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:36:03,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:03,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:03,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:03,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:36:03,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:36:03,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:36:03,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:36:03,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:36:03,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:36:03,684 INFO L87 Difference]: Start difference. First operand 583 states and 927 transitions. Second operand 6 states. [2019-10-02 12:36:03,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:03,898 INFO L93 Difference]: Finished difference Result 1087 states and 1743 transitions. [2019-10-02 12:36:03,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:36:03,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-10-02 12:36:03,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:03,904 INFO L225 Difference]: With dead ends: 1087 [2019-10-02 12:36:03,904 INFO L226 Difference]: Without dead ends: 583 [2019-10-02 12:36:03,907 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-02 12:36:03,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-02 12:36:03,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-02 12:36:03,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-02 12:36:03,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 923 transitions. [2019-10-02 12:36:03,932 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 923 transitions. Word has length 117 [2019-10-02 12:36:03,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:36:03,934 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 923 transitions. [2019-10-02 12:36:03,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:36:03,935 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 923 transitions. [2019-10-02 12:36:03,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-02 12:36:03,938 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:36:03,939 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:36:03,939 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:36:03,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:36:03,939 INFO L82 PathProgramCache]: Analyzing trace with hash -65631567, now seen corresponding path program 1 times [2019-10-02 12:36:03,939 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:36:03,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:36:03,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:03,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:03,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:04,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:36:04,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:36:04,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:36:04,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:36:04,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:36:04,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:36:04,076 INFO L87 Difference]: Start difference. First operand 583 states and 923 transitions. Second operand 6 states. [2019-10-02 12:36:04,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:04,281 INFO L93 Difference]: Finished difference Result 1087 states and 1739 transitions. [2019-10-02 12:36:04,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:36:04,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-10-02 12:36:04,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:04,287 INFO L225 Difference]: With dead ends: 1087 [2019-10-02 12:36:04,287 INFO L226 Difference]: Without dead ends: 583 [2019-10-02 12:36:04,290 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-02 12:36:04,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-02 12:36:04,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-02 12:36:04,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-02 12:36:04,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 919 transitions. [2019-10-02 12:36:04,317 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 919 transitions. Word has length 118 [2019-10-02 12:36:04,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:36:04,318 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 919 transitions. [2019-10-02 12:36:04,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:36:04,318 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 919 transitions. [2019-10-02 12:36:04,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-02 12:36:04,322 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:36:04,322 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:36:04,323 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:36:04,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:36:04,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1299849921, now seen corresponding path program 1 times [2019-10-02 12:36:04,323 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:36:04,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:36:04,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:04,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:04,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:04,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:36:04,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:36:04,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:36:04,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:36:04,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:36:04,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:36:04,501 INFO L87 Difference]: Start difference. First operand 583 states and 919 transitions. Second operand 6 states. [2019-10-02 12:36:04,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:04,682 INFO L93 Difference]: Finished difference Result 1087 states and 1735 transitions. [2019-10-02 12:36:04,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:36:04,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-10-02 12:36:04,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:04,687 INFO L225 Difference]: With dead ends: 1087 [2019-10-02 12:36:04,687 INFO L226 Difference]: Without dead ends: 583 [2019-10-02 12:36:04,690 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-02 12:36:04,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-02 12:36:04,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-02 12:36:04,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-02 12:36:04,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 915 transitions. [2019-10-02 12:36:04,710 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 915 transitions. Word has length 119 [2019-10-02 12:36:04,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:36:04,711 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 915 transitions. [2019-10-02 12:36:04,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:36:04,711 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 915 transitions. [2019-10-02 12:36:04,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-02 12:36:04,714 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:36:04,714 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:36:04,715 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:36:04,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:36:04,715 INFO L82 PathProgramCache]: Analyzing trace with hash 333553473, now seen corresponding path program 1 times [2019-10-02 12:36:04,715 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:36:04,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:36:04,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:04,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:04,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:04,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:36:04,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:36:04,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:36:04,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:36:04,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:36:04,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:36:04,854 INFO L87 Difference]: Start difference. First operand 583 states and 915 transitions. Second operand 7 states. [2019-10-02 12:36:04,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:04,948 INFO L93 Difference]: Finished difference Result 1087 states and 1731 transitions. [2019-10-02 12:36:04,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:36:04,949 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2019-10-02 12:36:04,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:04,954 INFO L225 Difference]: With dead ends: 1087 [2019-10-02 12:36:04,954 INFO L226 Difference]: Without dead ends: 562 [2019-10-02 12:36:04,958 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-02 12:36:04,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-02 12:36:04,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-02 12:36:04,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-02 12:36:04,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 881 transitions. [2019-10-02 12:36:04,981 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 881 transitions. Word has length 119 [2019-10-02 12:36:04,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:36:04,982 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 881 transitions. [2019-10-02 12:36:04,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:36:04,982 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 881 transitions. [2019-10-02 12:36:04,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-02 12:36:04,986 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:36:04,986 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:36:04,986 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:36:04,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:36:04,987 INFO L82 PathProgramCache]: Analyzing trace with hash 197463990, now seen corresponding path program 1 times [2019-10-02 12:36:04,987 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:36:04,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:36:04,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:04,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:04,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:05,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:36:05,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:36:05,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:36:05,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:36:05,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:36:05,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:36:05,141 INFO L87 Difference]: Start difference. First operand 562 states and 881 transitions. Second operand 6 states. [2019-10-02 12:36:05,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:05,242 INFO L93 Difference]: Finished difference Result 1066 states and 1697 transitions. [2019-10-02 12:36:05,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:36:05,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-10-02 12:36:05,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:05,246 INFO L225 Difference]: With dead ends: 1066 [2019-10-02 12:36:05,247 INFO L226 Difference]: Without dead ends: 562 [2019-10-02 12:36:05,250 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-02 12:36:05,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-02 12:36:05,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-02 12:36:05,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-02 12:36:05,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 880 transitions. [2019-10-02 12:36:05,275 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 880 transitions. Word has length 120 [2019-10-02 12:36:05,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:36:05,276 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 880 transitions. [2019-10-02 12:36:05,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:36:05,276 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 880 transitions. [2019-10-02 12:36:05,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-02 12:36:05,281 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:36:05,281 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:36:05,281 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:36:05,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:36:05,282 INFO L82 PathProgramCache]: Analyzing trace with hash -99400602, now seen corresponding path program 1 times [2019-10-02 12:36:05,282 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:36:05,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:36:05,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:05,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:05,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:05,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:36:05,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:36:05,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:36:05,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:36:05,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:36:05,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:36:05,426 INFO L87 Difference]: Start difference. First operand 562 states and 880 transitions. Second operand 6 states. [2019-10-02 12:36:05,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:05,571 INFO L93 Difference]: Finished difference Result 1066 states and 1696 transitions. [2019-10-02 12:36:05,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:36:05,572 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-10-02 12:36:05,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:05,576 INFO L225 Difference]: With dead ends: 1066 [2019-10-02 12:36:05,576 INFO L226 Difference]: Without dead ends: 562 [2019-10-02 12:36:05,579 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-02 12:36:05,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-02 12:36:05,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-02 12:36:05,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-02 12:36:05,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 879 transitions. [2019-10-02 12:36:05,602 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 879 transitions. Word has length 121 [2019-10-02 12:36:05,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:36:05,604 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 879 transitions. [2019-10-02 12:36:05,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:36:05,604 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 879 transitions. [2019-10-02 12:36:05,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-02 12:36:05,607 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:36:05,608 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:36:05,608 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:36:05,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:36:05,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1189017277, now seen corresponding path program 1 times [2019-10-02 12:36:05,608 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:36:05,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:36:05,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:05,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:05,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:05,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:36:05,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:36:05,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:36:05,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:36:05,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:36:05,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:36:05,739 INFO L87 Difference]: Start difference. First operand 562 states and 879 transitions. Second operand 4 states. [2019-10-02 12:36:05,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:05,791 INFO L93 Difference]: Finished difference Result 1066 states and 1695 transitions. [2019-10-02 12:36:05,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:36:05,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-10-02 12:36:05,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:05,797 INFO L225 Difference]: With dead ends: 1066 [2019-10-02 12:36:05,797 INFO L226 Difference]: Without dead ends: 562 [2019-10-02 12:36:05,802 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-02 12:36:05,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-02 12:36:05,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-02 12:36:05,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-02 12:36:05,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 878 transitions. [2019-10-02 12:36:05,829 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 878 transitions. Word has length 122 [2019-10-02 12:36:05,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:36:05,829 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 878 transitions. [2019-10-02 12:36:05,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:36:05,830 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 878 transitions. [2019-10-02 12:36:05,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-02 12:36:05,833 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:36:05,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:36:05,834 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:36:05,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:36:05,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1194907461, now seen corresponding path program 1 times [2019-10-02 12:36:05,834 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:36:05,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:36:05,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:05,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:05,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:06,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:36:06,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:36:06,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:36:06,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:36:06,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:36:06,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:36:06,090 INFO L87 Difference]: Start difference. First operand 562 states and 878 transitions. Second operand 12 states. [2019-10-02 12:36:06,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:06,345 INFO L93 Difference]: Finished difference Result 1067 states and 1694 transitions. [2019-10-02 12:36:06,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:36:06,346 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 122 [2019-10-02 12:36:06,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:06,351 INFO L225 Difference]: With dead ends: 1067 [2019-10-02 12:36:06,351 INFO L226 Difference]: Without dead ends: 562 [2019-10-02 12:36:06,357 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:36:06,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-02 12:36:06,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-10-02 12:36:06,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-02 12:36:06,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 877 transitions. [2019-10-02 12:36:06,389 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 877 transitions. Word has length 122 [2019-10-02 12:36:06,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:36:06,390 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 877 transitions. [2019-10-02 12:36:06,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:36:06,390 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 877 transitions. [2019-10-02 12:36:06,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-02 12:36:06,395 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:36:06,395 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:36:06,396 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:36:06,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:36:06,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1301394887, now seen corresponding path program 1 times [2019-10-02 12:36:06,396 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:36:06,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:36:06,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:06,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:06,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:06,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:36:06,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:36:06,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:36:06,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:36:06,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:36:06,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:36:06,645 INFO L87 Difference]: Start difference. First operand 562 states and 877 transitions. Second operand 9 states. [2019-10-02 12:36:10,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:10,073 INFO L93 Difference]: Finished difference Result 1064 states and 1708 transitions. [2019-10-02 12:36:10,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:36:10,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-10-02 12:36:10,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:10,079 INFO L225 Difference]: With dead ends: 1064 [2019-10-02 12:36:10,079 INFO L226 Difference]: Without dead ends: 568 [2019-10-02 12:36:10,082 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:36:10,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-02 12:36:10,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 566. [2019-10-02 12:36:10,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-10-02 12:36:10,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 896 transitions. [2019-10-02 12:36:10,115 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 896 transitions. Word has length 123 [2019-10-02 12:36:10,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:36:10,116 INFO L475 AbstractCegarLoop]: Abstraction has 566 states and 896 transitions. [2019-10-02 12:36:10,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:36:10,116 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 896 transitions. [2019-10-02 12:36:10,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-02 12:36:10,119 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:36:10,119 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:36:10,120 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:36:10,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:36:10,120 INFO L82 PathProgramCache]: Analyzing trace with hash -613976497, now seen corresponding path program 1 times [2019-10-02 12:36:10,120 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:36:10,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:36:10,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:10,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:10,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:10,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:36:10,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:36:10,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:36:10,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:36:10,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:36:10,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:36:10,300 INFO L87 Difference]: Start difference. First operand 566 states and 896 transitions. Second operand 8 states. [2019-10-02 12:36:16,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:16,388 INFO L93 Difference]: Finished difference Result 1990 states and 3279 transitions. [2019-10-02 12:36:16,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:36:16,389 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 124 [2019-10-02 12:36:16,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:16,405 INFO L225 Difference]: With dead ends: 1990 [2019-10-02 12:36:16,405 INFO L226 Difference]: Without dead ends: 1490 [2019-10-02 12:36:16,409 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:36:16,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2019-10-02 12:36:16,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1451. [2019-10-02 12:36:16,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2019-10-02 12:36:16,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2319 transitions. [2019-10-02 12:36:16,483 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2319 transitions. Word has length 124 [2019-10-02 12:36:16,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:36:16,483 INFO L475 AbstractCegarLoop]: Abstraction has 1451 states and 2319 transitions. [2019-10-02 12:36:16,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:36:16,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2319 transitions. [2019-10-02 12:36:16,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-02 12:36:16,487 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:36:16,487 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:36:16,487 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:36:16,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:36:16,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1563620061, now seen corresponding path program 1 times [2019-10-02 12:36:16,488 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:36:16,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:36:16,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:16,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:16,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:16,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:36:16,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:36:16,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:36:16,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:36:16,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:36:16,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:36:16,661 INFO L87 Difference]: Start difference. First operand 1451 states and 2319 transitions. Second operand 9 states. [2019-10-02 12:36:23,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:23,894 INFO L93 Difference]: Finished difference Result 4654 states and 7664 transitions. [2019-10-02 12:36:23,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:36:23,894 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2019-10-02 12:36:23,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:23,924 INFO L225 Difference]: With dead ends: 4654 [2019-10-02 12:36:23,924 INFO L226 Difference]: Without dead ends: 3269 [2019-10-02 12:36:23,933 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:36:23,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3269 states. [2019-10-02 12:36:24,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3269 to 3046. [2019-10-02 12:36:24,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3046 states. [2019-10-02 12:36:24,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3046 states to 3046 states and 4929 transitions. [2019-10-02 12:36:24,097 INFO L78 Accepts]: Start accepts. Automaton has 3046 states and 4929 transitions. Word has length 130 [2019-10-02 12:36:24,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:36:24,097 INFO L475 AbstractCegarLoop]: Abstraction has 3046 states and 4929 transitions. [2019-10-02 12:36:24,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:36:24,098 INFO L276 IsEmpty]: Start isEmpty. Operand 3046 states and 4929 transitions. [2019-10-02 12:36:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-02 12:36:24,100 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:36:24,101 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:36:24,101 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:36:24,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:36:24,101 INFO L82 PathProgramCache]: Analyzing trace with hash -430429468, now seen corresponding path program 1 times [2019-10-02 12:36:24,102 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:36:24,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:36:24,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:24,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:24,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:24,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:36:24,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:36:24,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:36:24,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:36:24,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:36:24,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:36:24,233 INFO L87 Difference]: Start difference. First operand 3046 states and 4929 transitions. Second operand 5 states. [2019-10-02 12:36:26,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:26,882 INFO L93 Difference]: Finished difference Result 6665 states and 10769 transitions. [2019-10-02 12:36:26,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:36:26,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-10-02 12:36:26,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:26,916 INFO L225 Difference]: With dead ends: 6665 [2019-10-02 12:36:26,916 INFO L226 Difference]: Without dead ends: 4471 [2019-10-02 12:36:26,932 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:36:26,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4471 states. [2019-10-02 12:36:27,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4471 to 4444. [2019-10-02 12:36:27,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4444 states. [2019-10-02 12:36:27,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4444 states to 4444 states and 7119 transitions. [2019-10-02 12:36:27,152 INFO L78 Accepts]: Start accepts. Automaton has 4444 states and 7119 transitions. Word has length 130 [2019-10-02 12:36:27,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:36:27,153 INFO L475 AbstractCegarLoop]: Abstraction has 4444 states and 7119 transitions. [2019-10-02 12:36:27,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:36:27,153 INFO L276 IsEmpty]: Start isEmpty. Operand 4444 states and 7119 transitions. [2019-10-02 12:36:27,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-02 12:36:27,156 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:36:27,156 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:36:27,157 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:36:27,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:36:27,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1936265126, now seen corresponding path program 1 times [2019-10-02 12:36:27,157 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:36:27,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:36:27,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:27,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:27,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:27,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:36:27,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:36:27,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:36:27,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:36:27,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:36:27,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:36:27,299 INFO L87 Difference]: Start difference. First operand 4444 states and 7119 transitions. Second operand 7 states. [2019-10-02 12:36:32,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:32,019 INFO L93 Difference]: Finished difference Result 12262 states and 20085 transitions. [2019-10-02 12:36:32,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:36:32,020 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2019-10-02 12:36:32,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:32,125 INFO L225 Difference]: With dead ends: 12262 [2019-10-02 12:36:32,126 INFO L226 Difference]: Without dead ends: 8686 [2019-10-02 12:36:32,158 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:36:32,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8686 states. [2019-10-02 12:36:32,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8686 to 8523. [2019-10-02 12:36:32,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8523 states. [2019-10-02 12:36:32,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8523 states to 8523 states and 13801 transitions. [2019-10-02 12:36:32,928 INFO L78 Accepts]: Start accepts. Automaton has 8523 states and 13801 transitions. Word has length 130 [2019-10-02 12:36:32,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:36:32,931 INFO L475 AbstractCegarLoop]: Abstraction has 8523 states and 13801 transitions. [2019-10-02 12:36:32,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:36:32,931 INFO L276 IsEmpty]: Start isEmpty. Operand 8523 states and 13801 transitions. [2019-10-02 12:36:32,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-02 12:36:32,936 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:36:32,937 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:36:32,937 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:36:32,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:36:32,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1833691056, now seen corresponding path program 1 times [2019-10-02 12:36:32,938 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:36:32,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:36:32,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:32,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:32,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:33,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:36:33,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:36:33,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:36:33,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:36:33,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:36:33,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:36:33,137 INFO L87 Difference]: Start difference. First operand 8523 states and 13801 transitions. Second operand 5 states. [2019-10-02 12:36:33,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:33,659 INFO L93 Difference]: Finished difference Result 16290 states and 26559 transitions. [2019-10-02 12:36:33,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:36:33,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-02 12:36:33,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:33,756 INFO L225 Difference]: With dead ends: 16290 [2019-10-02 12:36:33,756 INFO L226 Difference]: Without dead ends: 8745 [2019-10-02 12:36:33,807 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:36:33,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8745 states. [2019-10-02 12:36:34,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8745 to 8613. [2019-10-02 12:36:34,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8613 states. [2019-10-02 12:36:34,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8613 states to 8613 states and 13928 transitions. [2019-10-02 12:36:34,468 INFO L78 Accepts]: Start accepts. Automaton has 8613 states and 13928 transitions. Word has length 135 [2019-10-02 12:36:34,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:36:34,469 INFO L475 AbstractCegarLoop]: Abstraction has 8613 states and 13928 transitions. [2019-10-02 12:36:34,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:36:34,469 INFO L276 IsEmpty]: Start isEmpty. Operand 8613 states and 13928 transitions. [2019-10-02 12:36:34,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 12:36:34,475 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:36:34,475 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:36:34,476 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:36:34,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:36:34,476 INFO L82 PathProgramCache]: Analyzing trace with hash 723364682, now seen corresponding path program 1 times [2019-10-02 12:36:34,477 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:36:34,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:36:34,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:34,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:34,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:35,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:36:35,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:36:35,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:36:35,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:36:35,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:36:35,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:36:35,882 INFO L87 Difference]: Start difference. First operand 8613 states and 13928 transitions. Second operand 7 states. [2019-10-02 12:36:36,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:36,421 INFO L93 Difference]: Finished difference Result 17274 states and 28505 transitions. [2019-10-02 12:36:36,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:36:36,422 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 142 [2019-10-02 12:36:36,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:36,479 INFO L225 Difference]: With dead ends: 17274 [2019-10-02 12:36:36,480 INFO L226 Difference]: Without dead ends: 8613 [2019-10-02 12:36:36,522 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:36:36,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8613 states. [2019-10-02 12:36:36,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8613 to 8613. [2019-10-02 12:36:36,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8613 states. [2019-10-02 12:36:37,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8613 states to 8613 states and 13752 transitions. [2019-10-02 12:36:37,032 INFO L78 Accepts]: Start accepts. Automaton has 8613 states and 13752 transitions. Word has length 142 [2019-10-02 12:36:37,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:36:37,033 INFO L475 AbstractCegarLoop]: Abstraction has 8613 states and 13752 transitions. [2019-10-02 12:36:37,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:36:37,033 INFO L276 IsEmpty]: Start isEmpty. Operand 8613 states and 13752 transitions. [2019-10-02 12:36:37,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-02 12:36:37,037 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:36:37,037 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:36:37,038 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:36:37,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:36:37,038 INFO L82 PathProgramCache]: Analyzing trace with hash -632472725, now seen corresponding path program 1 times [2019-10-02 12:36:37,038 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:36:37,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:36:37,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:37,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:37,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:37,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:36:37,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:36:37,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:36:37,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:36:37,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:36:37,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:36:37,212 INFO L87 Difference]: Start difference. First operand 8613 states and 13752 transitions. Second operand 7 states. [2019-10-02 12:36:41,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:41,698 INFO L93 Difference]: Finished difference Result 16906 states and 27138 transitions. [2019-10-02 12:36:41,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:36:41,698 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 147 [2019-10-02 12:36:41,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:41,759 INFO L225 Difference]: With dead ends: 16906 [2019-10-02 12:36:41,759 INFO L226 Difference]: Without dead ends: 9288 [2019-10-02 12:36:41,790 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:36:41,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9288 states. [2019-10-02 12:36:42,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9288 to 9077. [2019-10-02 12:36:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9077 states. [2019-10-02 12:36:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9077 states to 9077 states and 14374 transitions. [2019-10-02 12:36:42,429 INFO L78 Accepts]: Start accepts. Automaton has 9077 states and 14374 transitions. Word has length 147 [2019-10-02 12:36:42,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:36:42,430 INFO L475 AbstractCegarLoop]: Abstraction has 9077 states and 14374 transitions. [2019-10-02 12:36:42,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:36:42,430 INFO L276 IsEmpty]: Start isEmpty. Operand 9077 states and 14374 transitions. [2019-10-02 12:36:42,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 12:36:42,434 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:36:42,435 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:36:42,435 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:36:42,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:36:42,435 INFO L82 PathProgramCache]: Analyzing trace with hash -494140473, now seen corresponding path program 1 times [2019-10-02 12:36:42,436 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:36:42,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:36:42,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:42,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:42,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:42,590 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:36:42,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:36:42,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:36:42,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:36:42,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:36:42,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:36:42,593 INFO L87 Difference]: Start difference. First operand 9077 states and 14374 transitions. Second operand 10 states. [2019-10-02 12:36:48,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:48,988 INFO L93 Difference]: Finished difference Result 28845 states and 47917 transitions. [2019-10-02 12:36:48,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:36:48,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 152 [2019-10-02 12:36:48,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:49,142 INFO L225 Difference]: With dead ends: 28845 [2019-10-02 12:36:49,142 INFO L226 Difference]: Without dead ends: 19834 [2019-10-02 12:36:49,204 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:36:49,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19834 states. [2019-10-02 12:36:50,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19834 to 19617. [2019-10-02 12:36:50,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19617 states. [2019-10-02 12:36:50,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19617 states to 19617 states and 31575 transitions. [2019-10-02 12:36:50,751 INFO L78 Accepts]: Start accepts. Automaton has 19617 states and 31575 transitions. Word has length 152 [2019-10-02 12:36:50,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:36:50,752 INFO L475 AbstractCegarLoop]: Abstraction has 19617 states and 31575 transitions. [2019-10-02 12:36:50,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:36:50,752 INFO L276 IsEmpty]: Start isEmpty. Operand 19617 states and 31575 transitions. [2019-10-02 12:36:50,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-02 12:36:50,757 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:36:50,757 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:36:50,757 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:36:50,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:36:50,758 INFO L82 PathProgramCache]: Analyzing trace with hash -162054303, now seen corresponding path program 1 times [2019-10-02 12:36:50,758 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:36:50,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:36:50,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:50,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:36:50,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:36:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:36:50,928 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:36:50,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:36:50,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:36:50,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:36:50,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:36:50,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:36:50,930 INFO L87 Difference]: Start difference. First operand 19617 states and 31575 transitions. Second operand 10 states. [2019-10-02 12:36:58,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:58,705 INFO L93 Difference]: Finished difference Result 63717 states and 108249 transitions. [2019-10-02 12:36:58,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:36:58,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 153 [2019-10-02 12:36:58,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:58,994 INFO L225 Difference]: With dead ends: 63717 [2019-10-02 12:36:58,995 INFO L226 Difference]: Without dead ends: 44166 [2019-10-02 12:36:59,102 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:36:59,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44166 states. [2019-10-02 12:37:01,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44166 to 43751. [2019-10-02 12:37:01,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43751 states. [2019-10-02 12:37:01,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43751 states to 43751 states and 72337 transitions. [2019-10-02 12:37:01,328 INFO L78 Accepts]: Start accepts. Automaton has 43751 states and 72337 transitions. Word has length 153 [2019-10-02 12:37:01,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:01,329 INFO L475 AbstractCegarLoop]: Abstraction has 43751 states and 72337 transitions. [2019-10-02 12:37:01,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:37:01,329 INFO L276 IsEmpty]: Start isEmpty. Operand 43751 states and 72337 transitions. [2019-10-02 12:37:01,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 12:37:01,334 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:01,334 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:01,335 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:01,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:01,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1906881269, now seen corresponding path program 1 times [2019-10-02 12:37:01,335 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:01,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:01,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:01,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:01,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:37:01,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:01,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:37:01,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:37:01,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:37:01,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:37:01,497 INFO L87 Difference]: Start difference. First operand 43751 states and 72337 transitions. Second operand 10 states. [2019-10-02 12:37:12,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:12,796 INFO L93 Difference]: Finished difference Result 145440 states and 256486 transitions. [2019-10-02 12:37:12,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:37:12,796 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2019-10-02 12:37:12,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:13,402 INFO L225 Difference]: With dead ends: 145440 [2019-10-02 12:37:13,403 INFO L226 Difference]: Without dead ends: 101755 [2019-10-02 12:37:13,586 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:37:13,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101755 states. [2019-10-02 12:37:20,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101755 to 100944. [2019-10-02 12:37:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100944 states. [2019-10-02 12:37:21,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100944 states to 100944 states and 173534 transitions. [2019-10-02 12:37:21,088 INFO L78 Accepts]: Start accepts. Automaton has 100944 states and 173534 transitions. Word has length 154 [2019-10-02 12:37:21,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:21,089 INFO L475 AbstractCegarLoop]: Abstraction has 100944 states and 173534 transitions. [2019-10-02 12:37:21,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:37:21,089 INFO L276 IsEmpty]: Start isEmpty. Operand 100944 states and 173534 transitions. [2019-10-02 12:37:21,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 12:37:21,096 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:21,096 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:21,096 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:21,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:21,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1890832521, now seen corresponding path program 1 times [2019-10-02 12:37:21,097 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:21,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:21,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:21,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:21,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:21,277 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:37:21,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:21,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:37:21,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:37:21,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:37:21,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:37:21,278 INFO L87 Difference]: Start difference. First operand 100944 states and 173534 transitions. Second operand 11 states. [2019-10-02 12:37:35,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:37:35,377 INFO L93 Difference]: Finished difference Result 211350 states and 361716 transitions. [2019-10-02 12:37:35,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:37:35,377 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 157 [2019-10-02 12:37:35,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:37:36,574 INFO L225 Difference]: With dead ends: 211350 [2019-10-02 12:37:36,574 INFO L226 Difference]: Without dead ends: 121291 [2019-10-02 12:37:36,851 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-10-02 12:37:36,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121291 states. [2019-10-02 12:37:45,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121291 to 119320. [2019-10-02 12:37:45,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119320 states. [2019-10-02 12:37:46,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119320 states to 119320 states and 200014 transitions. [2019-10-02 12:37:46,557 INFO L78 Accepts]: Start accepts. Automaton has 119320 states and 200014 transitions. Word has length 157 [2019-10-02 12:37:46,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:46,557 INFO L475 AbstractCegarLoop]: Abstraction has 119320 states and 200014 transitions. [2019-10-02 12:37:46,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:37:46,558 INFO L276 IsEmpty]: Start isEmpty. Operand 119320 states and 200014 transitions. [2019-10-02 12:37:46,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 12:37:46,563 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:46,563 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:46,564 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:46,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:46,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1773676150, now seen corresponding path program 1 times [2019-10-02 12:37:46,564 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:46,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:46,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:46,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:46,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:37:46,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:37:46,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:37:46,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:37:46,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:37:46,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:37:46,721 INFO L87 Difference]: Start difference. First operand 119320 states and 200014 transitions. Second operand 10 states. [2019-10-02 12:38:09,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:38:09,755 INFO L93 Difference]: Finished difference Result 400151 states and 722543 transitions. [2019-10-02 12:38:09,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:38:09,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 157 [2019-10-02 12:38:09,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:38:11,542 INFO L225 Difference]: With dead ends: 400151 [2019-10-02 12:38:11,543 INFO L226 Difference]: Without dead ends: 280897 [2019-10-02 12:38:18,570 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:38:18,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280897 states. [2019-10-02 12:38:38,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280897 to 279294. [2019-10-02 12:38:38,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279294 states. [2019-10-02 12:38:42,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279294 states to 279294 states and 493304 transitions. [2019-10-02 12:38:42,209 INFO L78 Accepts]: Start accepts. Automaton has 279294 states and 493304 transitions. Word has length 157 [2019-10-02 12:38:42,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:38:42,210 INFO L475 AbstractCegarLoop]: Abstraction has 279294 states and 493304 transitions. [2019-10-02 12:38:42,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:38:42,210 INFO L276 IsEmpty]: Start isEmpty. Operand 279294 states and 493304 transitions. [2019-10-02 12:38:42,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 12:38:42,217 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:38:42,217 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:38:42,217 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:38:42,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:38:42,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1363256330, now seen corresponding path program 1 times [2019-10-02 12:38:42,218 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:38:42,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:38:42,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:42,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:38:42,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:38:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:38:42,378 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:38:42,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:38:42,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:38:42,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:38:42,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:38:42,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:38:42,380 INFO L87 Difference]: Start difference. First operand 279294 states and 493304 transitions. Second operand 10 states. [2019-10-02 12:39:52,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:52,619 INFO L93 Difference]: Finished difference Result 968644 states and 1889300 transitions. [2019-10-02 12:39:52,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:39:52,620 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 158 [2019-10-02 12:39:52,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:59,079 INFO L225 Difference]: With dead ends: 968644 [2019-10-02 12:39:59,079 INFO L226 Difference]: Without dead ends: 689416 [2019-10-02 12:40:00,703 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:40:16,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689416 states.