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_spec2_product01.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:13:18,144 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:13:18,146 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:13:18,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:13:18,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:13:18,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:13:18,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:13:18,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:13:18,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:13:18,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:13:18,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:13:18,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:13:18,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:13:18,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:13:18,176 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:13:18,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:13:18,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:13:18,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:13:18,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:13:18,193 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:13:18,195 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:13:18,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:13:18,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:13:18,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:13:18,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:13:18,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:13:18,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:13:18,209 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:13:18,210 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:13:18,211 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:13:18,212 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:13:18,213 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:13:18,213 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:13:18,214 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:13:18,215 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:13:18,215 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:13:18,216 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:13:18,216 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:13:18,216 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:13:18,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:13:18,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:13:18,222 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:13:18,242 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:13:18,243 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:13:18,244 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:13:18,244 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:13:18,244 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:13:18,245 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:13:18,245 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:13:18,245 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:13:18,245 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:13:18,246 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:13:18,246 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:13:18,246 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:13:18,246 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:13:18,246 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:13:18,247 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:13:18,247 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:13:18,247 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:13:18,247 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:13:18,247 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:13:18,248 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:13:18,248 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:13:18,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:13:18,248 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:13:18,249 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:13:18,249 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:13:18,249 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:13:18,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:13:18,249 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:13:18,250 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:13:18,287 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:13:18,299 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:13:18,303 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:13:18,304 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:13:18,305 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:13:18,305 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product01.cil.c [2019-10-02 12:13:18,366 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc6637461/75f1cc1b041e4adda8f3b77304cc9a50/FLAG869a0ef40 [2019-10-02 12:13:19,099 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:13:19,100 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product01.cil.c [2019-10-02 12:13:19,138 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc6637461/75f1cc1b041e4adda8f3b77304cc9a50/FLAG869a0ef40 [2019-10-02 12:13:19,374 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc6637461/75f1cc1b041e4adda8f3b77304cc9a50 [2019-10-02 12:13:19,384 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:13:19,385 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:13:19,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:13:19,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:13:19,389 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:13:19,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:13:19" (1/1) ... [2019-10-02 12:13:19,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4432d2ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:13:19, skipping insertion in model container [2019-10-02 12:13:19,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:13:19" (1/1) ... [2019-10-02 12:13:19,399 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:13:19,486 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:13:20,128 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:13:20,148 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:13:20,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:13:20,394 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:13:20,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:13:20 WrapperNode [2019-10-02 12:13:20,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:13:20,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:13:20,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:13:20,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:13:20,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:13:20" (1/1) ... [2019-10-02 12:13:20,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:13:20" (1/1) ... [2019-10-02 12:13:20,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:13:20" (1/1) ... [2019-10-02 12:13:20,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:13:20" (1/1) ... [2019-10-02 12:13:20,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:13:20" (1/1) ... [2019-10-02 12:13:20,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:13:20" (1/1) ... [2019-10-02 12:13:20,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:13:20" (1/1) ... [2019-10-02 12:13:20,626 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:13:20,626 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:13:20,627 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:13:20,627 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:13:20,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:13:20" (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:13:20,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:13:20,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:13:20,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:13:20,694 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:13:20,694 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:13:20,695 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:13:20,695 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:13:20,695 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:13:20,695 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-02 12:13:20,695 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-02 12:13:20,696 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-02 12:13:20,696 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-02 12:13:20,696 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:13:20,696 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:13:20,697 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:13:20,697 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:13:20,697 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:13:20,697 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:13:20,697 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:13:20,697 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:13:20,698 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:13:20,699 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:13:20,699 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:13:20,699 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:13:20,699 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:13:20,699 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:13:20,699 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:13:20,699 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:13:20,700 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:13:20,700 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:13:20,700 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:13:20,700 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:13:20,700 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:13:20,700 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:13:20,700 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:13:20,701 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:13:20,701 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:13:20,701 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:13:20,701 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:13:20,701 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:13:20,701 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:13:20,701 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:13:20,702 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:13:20,702 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:13:20,702 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:13:20,702 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:13:20,703 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:13:20,703 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:13:20,703 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:13:20,703 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:13:20,703 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:13:20,704 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:13:20,704 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:13:20,704 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:13:20,704 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:13:20,704 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:13:20,704 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:13:20,705 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:13:20,705 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:13:20,705 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:13:20,705 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:13:20,705 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:13:20,705 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:13:20,706 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:13:20,706 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:13:20,706 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:13:20,706 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:13:20,706 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:13:20,707 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:13:20,707 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:13:20,707 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:13:20,707 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:13:20,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:13:20,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:13:20,708 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:13:20,708 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:13:20,708 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:13:20,709 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:13:20,709 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:13:20,709 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:13:20,709 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:13:20,710 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:13:20,710 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:13:20,710 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-02 12:13:20,711 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-02 12:13:20,711 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-02 12:13:20,711 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-02 12:13:20,712 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:13:20,712 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:13:20,712 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:13:20,713 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:13:20,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:13:20,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:13:20,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:13:20,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:13:20,714 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:13:20,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:13:20,714 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:13:20,714 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:13:20,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:13:20,714 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:13:20,714 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:13:20,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:13:20,715 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:13:20,715 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:13:20,715 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:13:20,715 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:13:20,715 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:13:20,716 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:13:20,716 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:13:20,716 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:13:20,716 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:13:20,716 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:13:20,716 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:13:20,716 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:13:20,717 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:13:20,717 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:13:20,717 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:13:20,717 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:13:20,717 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:13:20,718 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:13:20,718 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:13:20,718 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:13:20,718 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:13:20,719 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:13:20,719 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:13:20,719 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:13:20,719 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:13:20,720 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:13:20,720 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:13:20,720 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:13:20,721 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:13:20,721 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:13:20,721 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:13:20,721 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:13:20,721 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:13:20,722 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:13:20,722 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:13:20,722 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:13:20,723 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:13:20,726 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:13:20,726 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:13:20,726 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:13:20,727 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:13:20,733 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:13:20,733 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:13:20,733 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:13:20,733 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:13:20,734 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:13:20,734 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:13:20,734 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:13:20,734 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:13:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:13:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:13:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:13:20,738 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:13:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:13:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:13:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:13:22,907 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:13:22,908 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:13:22,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:13:22 BoogieIcfgContainer [2019-10-02 12:13:22,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:13:22,911 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:13:22,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:13:22,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:13:22,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:13:19" (1/3) ... [2019-10-02 12:13:22,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c96bf92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:13:22, skipping insertion in model container [2019-10-02 12:13:22,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:13:20" (2/3) ... [2019-10-02 12:13:22,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c96bf92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:13:22, skipping insertion in model container [2019-10-02 12:13:22,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:13:22" (3/3) ... [2019-10-02 12:13:22,918 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product01.cil.c [2019-10-02 12:13:22,931 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:13:22,942 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:13:22,964 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:13:23,022 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:13:23,024 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:13:23,024 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:13:23,024 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:13:23,024 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:13:23,024 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:13:23,025 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:13:23,025 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:13:23,025 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:13:23,077 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states. [2019-10-02 12:13:23,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-02 12:13:23,114 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:23,115 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] [2019-10-02 12:13:23,118 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:23,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:23,125 INFO L82 PathProgramCache]: Analyzing trace with hash 579631, now seen corresponding path program 1 times [2019-10-02 12:13:23,127 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:23,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:23,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:23,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:23,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:23,683 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:13:23,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:23,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:13:23,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:13:23,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:13:23,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:13:23,709 INFO L87 Difference]: Start difference. First operand 721 states. Second operand 4 states. [2019-10-02 12:13:23,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:23,982 INFO L93 Difference]: Finished difference Result 1105 states and 1815 transitions. [2019-10-02 12:13:23,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:13:23,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-10-02 12:13:23,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:24,021 INFO L225 Difference]: With dead ends: 1105 [2019-10-02 12:13:24,022 INFO L226 Difference]: Without dead ends: 561 [2019-10-02 12:13:24,036 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:13:24,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-02 12:13:24,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2019-10-02 12:13:24,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-10-02 12:13:24,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 909 transitions. [2019-10-02 12:13:24,156 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 909 transitions. Word has length 107 [2019-10-02 12:13:24,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:24,157 INFO L475 AbstractCegarLoop]: Abstraction has 561 states and 909 transitions. [2019-10-02 12:13:24,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:13:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 909 transitions. [2019-10-02 12:13:24,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-02 12:13:24,167 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:24,168 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] [2019-10-02 12:13:24,168 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:24,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:24,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1624649059, now seen corresponding path program 1 times [2019-10-02 12:13:24,169 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:24,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:24,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:24,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:24,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:24,451 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:13:24,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:24,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:13:24,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:13:24,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:13:24,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:13:24,458 INFO L87 Difference]: Start difference. First operand 561 states and 909 transitions. Second operand 4 states. [2019-10-02 12:13:24,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:24,534 INFO L93 Difference]: Finished difference Result 1085 states and 1776 transitions. [2019-10-02 12:13:24,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:13:24,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-10-02 12:13:24,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:24,540 INFO L225 Difference]: With dead ends: 1085 [2019-10-02 12:13:24,541 INFO L226 Difference]: Without dead ends: 561 [2019-10-02 12:13:24,545 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:13:24,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-02 12:13:24,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2019-10-02 12:13:24,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-10-02 12:13:24,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 908 transitions. [2019-10-02 12:13:24,591 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 908 transitions. Word has length 110 [2019-10-02 12:13:24,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:24,592 INFO L475 AbstractCegarLoop]: Abstraction has 561 states and 908 transitions. [2019-10-02 12:13:24,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:13:24,592 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 908 transitions. [2019-10-02 12:13:24,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-02 12:13:24,597 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:24,598 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] [2019-10-02 12:13:24,598 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:24,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:24,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1144681058, now seen corresponding path program 1 times [2019-10-02 12:13:24,599 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:24,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:24,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:24,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:24,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:24,813 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:13:24,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:24,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:13:24,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:13:24,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:13:24,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:13:24,815 INFO L87 Difference]: Start difference. First operand 561 states and 908 transitions. Second operand 4 states. [2019-10-02 12:13:24,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:24,897 INFO L93 Difference]: Finished difference Result 1085 states and 1775 transitions. [2019-10-02 12:13:24,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:13:24,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-10-02 12:13:24,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:24,906 INFO L225 Difference]: With dead ends: 1085 [2019-10-02 12:13:24,907 INFO L226 Difference]: Without dead ends: 561 [2019-10-02 12:13:24,910 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:13:24,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-02 12:13:24,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2019-10-02 12:13:24,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-10-02 12:13:24,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 907 transitions. [2019-10-02 12:13:24,964 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 907 transitions. Word has length 111 [2019-10-02 12:13:24,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:24,965 INFO L475 AbstractCegarLoop]: Abstraction has 561 states and 907 transitions. [2019-10-02 12:13:24,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:13:24,965 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 907 transitions. [2019-10-02 12:13:24,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-02 12:13:24,969 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:24,969 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:13:24,969 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:24,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:24,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1767474887, now seen corresponding path program 1 times [2019-10-02 12:13:24,970 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:24,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:24,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:24,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:24,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:25,195 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:13:25,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:25,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:13:25,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:13:25,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:13:25,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:13:25,198 INFO L87 Difference]: Start difference. First operand 561 states and 907 transitions. Second operand 4 states. [2019-10-02 12:13:25,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:25,272 INFO L93 Difference]: Finished difference Result 1085 states and 1774 transitions. [2019-10-02 12:13:25,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:13:25,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-02 12:13:25,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:25,280 INFO L225 Difference]: With dead ends: 1085 [2019-10-02 12:13:25,281 INFO L226 Difference]: Without dead ends: 561 [2019-10-02 12:13:25,284 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:13:25,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-02 12:13:25,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2019-10-02 12:13:25,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-10-02 12:13:25,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 906 transitions. [2019-10-02 12:13:25,318 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 906 transitions. Word has length 112 [2019-10-02 12:13:25,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:25,319 INFO L475 AbstractCegarLoop]: Abstraction has 561 states and 906 transitions. [2019-10-02 12:13:25,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:13:25,319 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 906 transitions. [2019-10-02 12:13:25,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-02 12:13:25,324 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:25,324 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:13:25,324 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:25,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:25,325 INFO L82 PathProgramCache]: Analyzing trace with hash 2078820218, now seen corresponding path program 1 times [2019-10-02 12:13:25,325 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:25,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:25,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:25,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:25,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:25,475 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:13:25,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:25,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:13:25,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:13:25,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:13:25,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:13:25,478 INFO L87 Difference]: Start difference. First operand 561 states and 906 transitions. Second operand 4 states. [2019-10-02 12:13:25,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:25,556 INFO L93 Difference]: Finished difference Result 1085 states and 1773 transitions. [2019-10-02 12:13:25,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:13:25,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-02 12:13:25,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:25,572 INFO L225 Difference]: With dead ends: 1085 [2019-10-02 12:13:25,572 INFO L226 Difference]: Without dead ends: 561 [2019-10-02 12:13:25,576 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:13:25,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-02 12:13:25,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2019-10-02 12:13:25,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-10-02 12:13:25,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 905 transitions. [2019-10-02 12:13:25,608 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 905 transitions. Word has length 113 [2019-10-02 12:13:25,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:25,608 INFO L475 AbstractCegarLoop]: Abstraction has 561 states and 905 transitions. [2019-10-02 12:13:25,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:13:25,609 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 905 transitions. [2019-10-02 12:13:25,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-02 12:13:25,616 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:25,616 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:13:25,617 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:25,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:25,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1562015787, now seen corresponding path program 1 times [2019-10-02 12:13:25,618 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:25,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:25,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:25,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:25,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:25,830 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:13:25,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:25,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:13:25,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:13:25,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:13:25,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:13:25,833 INFO L87 Difference]: Start difference. First operand 561 states and 905 transitions. Second operand 10 states. [2019-10-02 12:13:26,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:26,031 INFO L93 Difference]: Finished difference Result 1043 states and 1693 transitions. [2019-10-02 12:13:26,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:13:26,034 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2019-10-02 12:13:26,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:26,045 INFO L225 Difference]: With dead ends: 1043 [2019-10-02 12:13:26,045 INFO L226 Difference]: Without dead ends: 570 [2019-10-02 12:13:26,050 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:13:26,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-10-02 12:13:26,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 568. [2019-10-02 12:13:26,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-02 12:13:26,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 914 transitions. [2019-10-02 12:13:26,104 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 914 transitions. Word has length 114 [2019-10-02 12:13:26,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:26,107 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 914 transitions. [2019-10-02 12:13:26,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:13:26,108 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 914 transitions. [2019-10-02 12:13:26,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-02 12:13:26,127 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:26,127 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:13:26,127 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:26,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:26,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1142498956, now seen corresponding path program 1 times [2019-10-02 12:13:26,128 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:26,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:26,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:26,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:26,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:26,275 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:13:26,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:26,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:13:26,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:13:26,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:13:26,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:13:26,277 INFO L87 Difference]: Start difference. First operand 568 states and 914 transitions. Second operand 4 states. [2019-10-02 12:13:26,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:26,325 INFO L93 Difference]: Finished difference Result 1091 states and 1779 transitions. [2019-10-02 12:13:26,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:13:26,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-02 12:13:26,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:26,331 INFO L225 Difference]: With dead ends: 1091 [2019-10-02 12:13:26,331 INFO L226 Difference]: Without dead ends: 555 [2019-10-02 12:13:26,334 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:13:26,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-02 12:13:26,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-02 12:13:26,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-02 12:13:26,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 891 transitions. [2019-10-02 12:13:26,358 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 891 transitions. Word has length 114 [2019-10-02 12:13:26,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:26,358 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 891 transitions. [2019-10-02 12:13:26,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:13:26,359 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 891 transitions. [2019-10-02 12:13:26,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-02 12:13:26,362 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:26,363 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:13:26,363 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:26,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:26,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1780568648, now seen corresponding path program 1 times [2019-10-02 12:13:26,363 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:26,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:26,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:26,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:26,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:26,497 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:13:26,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:26,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:13:26,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:13:26,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:13:26,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:13:26,498 INFO L87 Difference]: Start difference. First operand 555 states and 891 transitions. Second operand 6 states. [2019-10-02 12:13:26,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:26,722 INFO L93 Difference]: Finished difference Result 1031 states and 1671 transitions. [2019-10-02 12:13:26,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:13:26,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-10-02 12:13:26,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:26,730 INFO L225 Difference]: With dead ends: 1031 [2019-10-02 12:13:26,730 INFO L226 Difference]: Without dead ends: 555 [2019-10-02 12:13:26,733 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:13:26,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-02 12:13:26,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-02 12:13:26,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-02 12:13:26,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 887 transitions. [2019-10-02 12:13:26,762 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 887 transitions. Word has length 115 [2019-10-02 12:13:26,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:26,764 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 887 transitions. [2019-10-02 12:13:26,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:13:26,764 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 887 transitions. [2019-10-02 12:13:26,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 12:13:26,768 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:26,768 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:13:26,768 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:26,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:26,769 INFO L82 PathProgramCache]: Analyzing trace with hash 38803032, now seen corresponding path program 1 times [2019-10-02 12:13:26,769 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:26,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:26,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:26,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:26,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:26,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:13:26,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:26,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:13:26,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:13:26,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:13:26,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:13:26,927 INFO L87 Difference]: Start difference. First operand 555 states and 887 transitions. Second operand 6 states. [2019-10-02 12:13:27,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:27,189 INFO L93 Difference]: Finished difference Result 1031 states and 1667 transitions. [2019-10-02 12:13:27,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:13:27,190 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2019-10-02 12:13:27,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:27,195 INFO L225 Difference]: With dead ends: 1031 [2019-10-02 12:13:27,196 INFO L226 Difference]: Without dead ends: 555 [2019-10-02 12:13:27,198 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:13:27,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-02 12:13:27,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-02 12:13:27,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-02 12:13:27,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 883 transitions. [2019-10-02 12:13:27,222 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 883 transitions. Word has length 116 [2019-10-02 12:13:27,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:27,222 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 883 transitions. [2019-10-02 12:13:27,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:13:27,222 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 883 transitions. [2019-10-02 12:13:27,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-02 12:13:27,226 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:27,226 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:13:27,226 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:27,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:27,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1813626371, now seen corresponding path program 1 times [2019-10-02 12:13:27,227 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:27,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:27,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:27,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:27,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:27,359 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:13:27,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:27,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:13:27,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:13:27,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:13:27,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:13:27,361 INFO L87 Difference]: Start difference. First operand 555 states and 883 transitions. Second operand 6 states. [2019-10-02 12:13:27,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:27,548 INFO L93 Difference]: Finished difference Result 1031 states and 1663 transitions. [2019-10-02 12:13:27,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:13:27,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-10-02 12:13:27,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:27,554 INFO L225 Difference]: With dead ends: 1031 [2019-10-02 12:13:27,554 INFO L226 Difference]: Without dead ends: 555 [2019-10-02 12:13:27,557 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:13:27,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-02 12:13:27,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-02 12:13:27,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-02 12:13:27,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 879 transitions. [2019-10-02 12:13:27,579 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 879 transitions. Word has length 117 [2019-10-02 12:13:27,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:27,580 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 879 transitions. [2019-10-02 12:13:27,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:13:27,580 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 879 transitions. [2019-10-02 12:13:27,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-02 12:13:27,583 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:27,583 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:13:27,584 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:27,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:27,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1358766467, now seen corresponding path program 1 times [2019-10-02 12:13:27,584 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:27,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:27,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:27,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:27,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:27,721 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:13:27,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:27,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:13:27,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:13:27,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:13:27,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:13:27,723 INFO L87 Difference]: Start difference. First operand 555 states and 879 transitions. Second operand 7 states. [2019-10-02 12:13:27,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:27,812 INFO L93 Difference]: Finished difference Result 1031 states and 1659 transitions. [2019-10-02 12:13:27,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:13:27,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-10-02 12:13:27,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:27,819 INFO L225 Difference]: With dead ends: 1031 [2019-10-02 12:13:27,819 INFO L226 Difference]: Without dead ends: 534 [2019-10-02 12:13:27,823 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:13:27,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-10-02 12:13:27,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2019-10-02 12:13:27,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-10-02 12:13:27,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 845 transitions. [2019-10-02 12:13:27,853 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 845 transitions. Word has length 117 [2019-10-02 12:13:27,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:27,853 INFO L475 AbstractCegarLoop]: Abstraction has 534 states and 845 transitions. [2019-10-02 12:13:27,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:13:27,854 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 845 transitions. [2019-10-02 12:13:27,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-02 12:13:27,857 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:27,857 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:13:27,858 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:27,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:27,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1527772355, now seen corresponding path program 1 times [2019-10-02 12:13:27,858 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:27,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:27,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:27,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:27,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:27,997 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:13:27,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:27,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:13:27,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:13:27,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:13:27,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:13:27,999 INFO L87 Difference]: Start difference. First operand 534 states and 845 transitions. Second operand 6 states. [2019-10-02 12:13:28,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:28,105 INFO L93 Difference]: Finished difference Result 1010 states and 1625 transitions. [2019-10-02 12:13:28,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:13:28,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-10-02 12:13:28,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:28,111 INFO L225 Difference]: With dead ends: 1010 [2019-10-02 12:13:28,111 INFO L226 Difference]: Without dead ends: 534 [2019-10-02 12:13:28,114 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:13:28,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-10-02 12:13:28,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2019-10-02 12:13:28,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-10-02 12:13:28,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 844 transitions. [2019-10-02 12:13:28,178 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 844 transitions. Word has length 118 [2019-10-02 12:13:28,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:28,178 INFO L475 AbstractCegarLoop]: Abstraction has 534 states and 844 transitions. [2019-10-02 12:13:28,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:13:28,178 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 844 transitions. [2019-10-02 12:13:28,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-02 12:13:28,182 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:28,183 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:13:28,183 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:28,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:28,183 INFO L82 PathProgramCache]: Analyzing trace with hash 620358210, now seen corresponding path program 1 times [2019-10-02 12:13:28,184 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:28,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:28,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:28,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:28,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:28,304 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:13:28,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:28,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:13:28,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:13:28,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:13:28,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:13:28,306 INFO L87 Difference]: Start difference. First operand 534 states and 844 transitions. Second operand 6 states. [2019-10-02 12:13:28,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:28,414 INFO L93 Difference]: Finished difference Result 1010 states and 1624 transitions. [2019-10-02 12:13:28,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:13:28,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-10-02 12:13:28,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:28,421 INFO L225 Difference]: With dead ends: 1010 [2019-10-02 12:13:28,421 INFO L226 Difference]: Without dead ends: 534 [2019-10-02 12:13:28,425 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:13:28,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-10-02 12:13:28,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2019-10-02 12:13:28,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-10-02 12:13:28,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 843 transitions. [2019-10-02 12:13:28,449 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 843 transitions. Word has length 119 [2019-10-02 12:13:28,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:28,449 INFO L475 AbstractCegarLoop]: Abstraction has 534 states and 843 transitions. [2019-10-02 12:13:28,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:13:28,449 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 843 transitions. [2019-10-02 12:13:28,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-02 12:13:28,458 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:28,458 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:13:28,458 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:28,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:28,459 INFO L82 PathProgramCache]: Analyzing trace with hash -597831004, now seen corresponding path program 1 times [2019-10-02 12:13:28,459 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:28,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:28,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:28,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:28,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:28,628 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:13:28,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:28,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:13:28,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:13:28,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:13:28,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:13:28,631 INFO L87 Difference]: Start difference. First operand 534 states and 843 transitions. Second operand 4 states. [2019-10-02 12:13:28,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:28,690 INFO L93 Difference]: Finished difference Result 1010 states and 1623 transitions. [2019-10-02 12:13:28,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:13:28,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-10-02 12:13:28,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:28,698 INFO L225 Difference]: With dead ends: 1010 [2019-10-02 12:13:28,698 INFO L226 Difference]: Without dead ends: 534 [2019-10-02 12:13:28,703 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:13:28,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-10-02 12:13:28,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2019-10-02 12:13:28,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-10-02 12:13:28,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 842 transitions. [2019-10-02 12:13:28,731 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 842 transitions. Word has length 120 [2019-10-02 12:13:28,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:28,733 INFO L475 AbstractCegarLoop]: Abstraction has 534 states and 842 transitions. [2019-10-02 12:13:28,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:13:28,734 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 842 transitions. [2019-10-02 12:13:28,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-02 12:13:28,742 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:28,742 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:13:28,742 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:28,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:28,743 INFO L82 PathProgramCache]: Analyzing trace with hash 369519650, now seen corresponding path program 1 times [2019-10-02 12:13:28,743 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:28,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:28,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:28,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:28,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:28,999 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:13:29,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:29,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:13:29,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:13:29,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:13:29,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:13:29,001 INFO L87 Difference]: Start difference. First operand 534 states and 842 transitions. Second operand 12 states. [2019-10-02 12:13:29,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:29,175 INFO L93 Difference]: Finished difference Result 1011 states and 1622 transitions. [2019-10-02 12:13:29,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:13:29,176 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 120 [2019-10-02 12:13:29,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:29,181 INFO L225 Difference]: With dead ends: 1011 [2019-10-02 12:13:29,181 INFO L226 Difference]: Without dead ends: 534 [2019-10-02 12:13:29,186 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:13:29,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-10-02 12:13:29,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2019-10-02 12:13:29,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-10-02 12:13:29,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 841 transitions. [2019-10-02 12:13:29,206 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 841 transitions. Word has length 120 [2019-10-02 12:13:29,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:29,206 INFO L475 AbstractCegarLoop]: Abstraction has 534 states and 841 transitions. [2019-10-02 12:13:29,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:13:29,207 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 841 transitions. [2019-10-02 12:13:29,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-02 12:13:29,210 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:29,210 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:13:29,211 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:29,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:29,211 INFO L82 PathProgramCache]: Analyzing trace with hash 718640905, now seen corresponding path program 1 times [2019-10-02 12:13:29,211 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:29,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:29,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:29,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:29,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:29,456 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:13:29,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:29,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:13:29,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:13:29,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:13:29,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:13:29,459 INFO L87 Difference]: Start difference. First operand 534 states and 841 transitions. Second operand 9 states. [2019-10-02 12:13:32,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:32,733 INFO L93 Difference]: Finished difference Result 1008 states and 1636 transitions. [2019-10-02 12:13:32,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:13:32,733 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-10-02 12:13:32,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:32,738 INFO L225 Difference]: With dead ends: 1008 [2019-10-02 12:13:32,738 INFO L226 Difference]: Without dead ends: 540 [2019-10-02 12:13:32,742 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:13:32,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-10-02 12:13:32,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 538. [2019-10-02 12:13:32,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-10-02 12:13:32,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 860 transitions. [2019-10-02 12:13:32,779 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 860 transitions. Word has length 121 [2019-10-02 12:13:32,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:32,780 INFO L475 AbstractCegarLoop]: Abstraction has 538 states and 860 transitions. [2019-10-02 12:13:32,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:13:32,780 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 860 transitions. [2019-10-02 12:13:32,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-02 12:13:32,783 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:32,783 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:13:32,784 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:32,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:32,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1721131710, now seen corresponding path program 1 times [2019-10-02 12:13:32,785 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:32,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:32,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:32,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:32,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:32,988 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:13:32,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:32,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:13:32,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:13:32,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:13:32,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:13:32,991 INFO L87 Difference]: Start difference. First operand 538 states and 860 transitions. Second operand 8 states. [2019-10-02 12:13:38,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:38,762 INFO L93 Difference]: Finished difference Result 1878 states and 3135 transitions. [2019-10-02 12:13:38,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:13:38,762 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-10-02 12:13:38,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:38,777 INFO L225 Difference]: With dead ends: 1878 [2019-10-02 12:13:38,777 INFO L226 Difference]: Without dead ends: 1406 [2019-10-02 12:13:38,782 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:13:38,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2019-10-02 12:13:38,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1367. [2019-10-02 12:13:38,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1367 states. [2019-10-02 12:13:38,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 2211 transitions. [2019-10-02 12:13:38,861 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 2211 transitions. Word has length 122 [2019-10-02 12:13:38,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:38,862 INFO L475 AbstractCegarLoop]: Abstraction has 1367 states and 2211 transitions. [2019-10-02 12:13:38,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:13:38,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 2211 transitions. [2019-10-02 12:13:38,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-02 12:13:38,865 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:38,865 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] [2019-10-02 12:13:38,866 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:38,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:38,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1283805034, now seen corresponding path program 1 times [2019-10-02 12:13:38,866 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:38,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:38,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:38,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:38,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:39,053 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:13:39,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:39,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:13:39,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:13:39,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:13:39,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:13:39,055 INFO L87 Difference]: Start difference. First operand 1367 states and 2211 transitions. Second operand 9 states. [2019-10-02 12:13:45,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:45,812 INFO L93 Difference]: Finished difference Result 4315 states and 7169 transitions. [2019-10-02 12:13:45,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:13:45,813 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-10-02 12:13:45,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:45,842 INFO L225 Difference]: With dead ends: 4315 [2019-10-02 12:13:45,842 INFO L226 Difference]: Without dead ends: 3014 [2019-10-02 12:13:45,852 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:13:45,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2019-10-02 12:13:45,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 2791. [2019-10-02 12:13:45,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2791 states. [2019-10-02 12:13:46,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2791 states and 4542 transitions. [2019-10-02 12:13:46,003 INFO L78 Accepts]: Start accepts. Automaton has 2791 states and 4542 transitions. Word has length 128 [2019-10-02 12:13:46,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:46,003 INFO L475 AbstractCegarLoop]: Abstraction has 2791 states and 4542 transitions. [2019-10-02 12:13:46,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:13:46,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 4542 transitions. [2019-10-02 12:13:46,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-02 12:13:46,006 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:46,007 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] [2019-10-02 12:13:46,007 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:46,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:46,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1276045675, now seen corresponding path program 1 times [2019-10-02 12:13:46,008 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:46,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:46,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:46,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:46,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:46,155 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:13:46,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:46,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:13:46,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:13:46,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:13:46,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:13:46,157 INFO L87 Difference]: Start difference. First operand 2791 states and 4542 transitions. Second operand 7 states. [2019-10-02 12:13:50,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:50,311 INFO L93 Difference]: Finished difference Result 7221 states and 11970 transitions. [2019-10-02 12:13:50,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:13:50,312 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2019-10-02 12:13:50,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:50,351 INFO L225 Difference]: With dead ends: 7221 [2019-10-02 12:13:50,351 INFO L226 Difference]: Without dead ends: 5205 [2019-10-02 12:13:50,363 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:13:50,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5205 states. [2019-10-02 12:13:50,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5205 to 5112. [2019-10-02 12:13:50,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5112 states. [2019-10-02 12:13:50,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5112 states to 5112 states and 8394 transitions. [2019-10-02 12:13:50,622 INFO L78 Accepts]: Start accepts. Automaton has 5112 states and 8394 transitions. Word has length 128 [2019-10-02 12:13:50,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:50,623 INFO L475 AbstractCegarLoop]: Abstraction has 5112 states and 8394 transitions. [2019-10-02 12:13:50,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:13:50,624 INFO L276 IsEmpty]: Start isEmpty. Operand 5112 states and 8394 transitions. [2019-10-02 12:13:50,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-02 12:13:50,629 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:50,630 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] [2019-10-02 12:13:50,630 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:50,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:50,631 INFO L82 PathProgramCache]: Analyzing trace with hash 421466230, now seen corresponding path program 1 times [2019-10-02 12:13:50,631 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:50,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:50,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:50,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:50,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:50,811 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:13:50,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:50,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:13:50,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:13:50,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:13:50,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:13:50,814 INFO L87 Difference]: Start difference. First operand 5112 states and 8394 transitions. Second operand 5 states. [2019-10-02 12:13:51,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:51,084 INFO L93 Difference]: Finished difference Result 9457 states and 15616 transitions. [2019-10-02 12:13:51,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:13:51,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-02 12:13:51,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:51,161 INFO L225 Difference]: With dead ends: 9457 [2019-10-02 12:13:51,161 INFO L226 Difference]: Without dead ends: 5230 [2019-10-02 12:13:51,191 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:13:51,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5230 states. [2019-10-02 12:13:51,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5230 to 5164. [2019-10-02 12:13:51,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5164 states. [2019-10-02 12:13:51,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5164 states to 5164 states and 8467 transitions. [2019-10-02 12:13:51,506 INFO L78 Accepts]: Start accepts. Automaton has 5164 states and 8467 transitions. Word has length 133 [2019-10-02 12:13:51,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:51,507 INFO L475 AbstractCegarLoop]: Abstraction has 5164 states and 8467 transitions. [2019-10-02 12:13:51,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:13:51,508 INFO L276 IsEmpty]: Start isEmpty. Operand 5164 states and 8467 transitions. [2019-10-02 12:13:51,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 12:13:51,512 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:51,512 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] [2019-10-02 12:13:51,513 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:51,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:51,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1968794639, now seen corresponding path program 1 times [2019-10-02 12:13:51,513 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:51,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:51,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:51,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:51,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:51,723 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:13:51,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:51,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:13:51,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:13:51,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:13:51,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:13:51,726 INFO L87 Difference]: Start difference. First operand 5164 states and 8467 transitions. Second operand 7 states. [2019-10-02 12:13:52,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:52,344 INFO L93 Difference]: Finished difference Result 10033 states and 16732 transitions. [2019-10-02 12:13:52,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:13:52,345 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2019-10-02 12:13:52,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:52,388 INFO L225 Difference]: With dead ends: 10033 [2019-10-02 12:13:52,389 INFO L226 Difference]: Without dead ends: 5164 [2019-10-02 12:13:52,412 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:13:52,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5164 states. [2019-10-02 12:13:52,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5164 to 5164. [2019-10-02 12:13:52,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5164 states. [2019-10-02 12:13:52,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5164 states to 5164 states and 8375 transitions. [2019-10-02 12:13:52,654 INFO L78 Accepts]: Start accepts. Automaton has 5164 states and 8375 transitions. Word has length 140 [2019-10-02 12:13:52,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:52,655 INFO L475 AbstractCegarLoop]: Abstraction has 5164 states and 8375 transitions. [2019-10-02 12:13:52,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:13:52,655 INFO L276 IsEmpty]: Start isEmpty. Operand 5164 states and 8375 transitions. [2019-10-02 12:13:52,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 12:13:52,659 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:52,659 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] [2019-10-02 12:13:52,660 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:52,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:52,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1901521423, now seen corresponding path program 1 times [2019-10-02 12:13:52,660 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:52,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:52,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:52,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:52,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:52,802 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:13:52,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:52,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:13:52,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:13:52,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:13:52,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:13:52,804 INFO L87 Difference]: Start difference. First operand 5164 states and 8375 transitions. Second operand 7 states. [2019-10-02 12:13:57,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:57,440 INFO L93 Difference]: Finished difference Result 9773 states and 15911 transitions. [2019-10-02 12:13:57,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:13:57,441 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2019-10-02 12:13:57,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:57,485 INFO L225 Difference]: With dead ends: 9773 [2019-10-02 12:13:57,486 INFO L226 Difference]: Without dead ends: 5511 [2019-10-02 12:13:57,508 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:13:57,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5511 states. [2019-10-02 12:13:57,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5511 to 5396. [2019-10-02 12:13:57,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5396 states. [2019-10-02 12:13:57,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5396 states to 5396 states and 8689 transitions. [2019-10-02 12:13:57,883 INFO L78 Accepts]: Start accepts. Automaton has 5396 states and 8689 transitions. Word has length 145 [2019-10-02 12:13:57,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:57,884 INFO L475 AbstractCegarLoop]: Abstraction has 5396 states and 8689 transitions. [2019-10-02 12:13:57,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:13:57,884 INFO L276 IsEmpty]: Start isEmpty. Operand 5396 states and 8689 transitions. [2019-10-02 12:13:57,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 12:13:57,891 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:57,892 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:13:57,892 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:57,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:57,893 INFO L82 PathProgramCache]: Analyzing trace with hash 482613306, now seen corresponding path program 1 times [2019-10-02 12:13:57,893 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:57,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:57,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:57,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:57,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:58,179 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:13:58,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:58,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:13:58,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:13:58,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:13:58,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:13:58,182 INFO L87 Difference]: Start difference. First operand 5396 states and 8689 transitions. Second operand 11 states. [2019-10-02 12:14:05,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:05,440 INFO L93 Difference]: Finished difference Result 11320 states and 18187 transitions. [2019-10-02 12:14:05,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:14:05,441 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 152 [2019-10-02 12:14:05,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:05,487 INFO L225 Difference]: With dead ends: 11320 [2019-10-02 12:14:05,487 INFO L226 Difference]: Without dead ends: 6705 [2019-10-02 12:14:05,572 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-10-02 12:14:05,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6705 states. [2019-10-02 12:14:05,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6705 to 6556. [2019-10-02 12:14:05,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6556 states. [2019-10-02 12:14:05,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6556 states to 6556 states and 10381 transitions. [2019-10-02 12:14:05,900 INFO L78 Accepts]: Start accepts. Automaton has 6556 states and 10381 transitions. Word has length 152 [2019-10-02 12:14:05,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:05,900 INFO L475 AbstractCegarLoop]: Abstraction has 6556 states and 10381 transitions. [2019-10-02 12:14:05,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:14:05,901 INFO L276 IsEmpty]: Start isEmpty. Operand 6556 states and 10381 transitions. [2019-10-02 12:14:05,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 12:14:05,905 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:05,905 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:14:05,906 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:05,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:05,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1251783321, now seen corresponding path program 1 times [2019-10-02 12:14:05,907 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:05,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:05,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:05,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:05,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:06,044 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:14:06,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:06,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:14:06,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:14:06,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:14:06,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:14:06,045 INFO L87 Difference]: Start difference. First operand 6556 states and 10381 transitions. Second operand 4 states. [2019-10-02 12:14:08,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:08,045 INFO L93 Difference]: Finished difference Result 20540 states and 33563 transitions. [2019-10-02 12:14:08,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:14:08,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-10-02 12:14:08,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:08,149 INFO L225 Difference]: With dead ends: 20540 [2019-10-02 12:14:08,150 INFO L226 Difference]: Without dead ends: 14050 [2019-10-02 12:14:08,178 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:14:08,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14050 states. [2019-10-02 12:14:08,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14050 to 13896. [2019-10-02 12:14:08,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13896 states. [2019-10-02 12:14:09,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13896 states to 13896 states and 22678 transitions. [2019-10-02 12:14:09,076 INFO L78 Accepts]: Start accepts. Automaton has 13896 states and 22678 transitions. Word has length 152 [2019-10-02 12:14:09,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:09,076 INFO L475 AbstractCegarLoop]: Abstraction has 13896 states and 22678 transitions. [2019-10-02 12:14:09,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:14:09,077 INFO L276 IsEmpty]: Start isEmpty. Operand 13896 states and 22678 transitions. [2019-10-02 12:14:09,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-02 12:14:09,083 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:09,083 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] [2019-10-02 12:14:09,083 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:09,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:09,084 INFO L82 PathProgramCache]: Analyzing trace with hash -481020583, now seen corresponding path program 1 times [2019-10-02 12:14:09,084 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:09,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:09,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:09,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:09,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:09,206 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:14:09,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:09,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:14:09,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:14:09,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:14:09,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:14:09,208 INFO L87 Difference]: Start difference. First operand 13896 states and 22678 transitions. Second operand 4 states. [2019-10-02 12:14:12,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:12,583 INFO L93 Difference]: Finished difference Result 44232 states and 76271 transitions. [2019-10-02 12:14:12,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:14:12,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-10-02 12:14:12,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:12,814 INFO L225 Difference]: With dead ends: 44232 [2019-10-02 12:14:12,815 INFO L226 Difference]: Without dead ends: 30402 [2019-10-02 12:14:12,885 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:14:12,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30402 states. [2019-10-02 12:14:14,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30402 to 30055. [2019-10-02 12:14:14,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30055 states. [2019-10-02 12:14:14,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30055 states to 30055 states and 51650 transitions. [2019-10-02 12:14:14,481 INFO L78 Accepts]: Start accepts. Automaton has 30055 states and 51650 transitions. Word has length 151 [2019-10-02 12:14:14,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:14,482 INFO L475 AbstractCegarLoop]: Abstraction has 30055 states and 51650 transitions. [2019-10-02 12:14:14,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:14:14,482 INFO L276 IsEmpty]: Start isEmpty. Operand 30055 states and 51650 transitions. [2019-10-02 12:14:14,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 12:14:14,490 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:14,491 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:14:14,491 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:14,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:14,491 INFO L82 PathProgramCache]: Analyzing trace with hash 332233531, now seen corresponding path program 1 times [2019-10-02 12:14:14,491 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:14,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:14,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:14,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:14,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:14,605 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:14:14,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:14,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:14:14,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:14:14,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:14:14,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:14:14,607 INFO L87 Difference]: Start difference. First operand 30055 states and 51650 transitions. Second operand 4 states. [2019-10-02 12:14:19,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:19,797 INFO L93 Difference]: Finished difference Result 97241 states and 183757 transitions. [2019-10-02 12:14:19,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:14:19,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-10-02 12:14:19,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:20,283 INFO L225 Difference]: With dead ends: 97241 [2019-10-02 12:14:20,284 INFO L226 Difference]: Without dead ends: 67252 [2019-10-02 12:14:20,410 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:14:20,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67252 states. [2019-10-02 12:14:26,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67252 to 66440. [2019-10-02 12:14:26,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66440 states. [2019-10-02 12:14:26,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66440 states to 66440 states and 124259 transitions. [2019-10-02 12:14:26,528 INFO L78 Accepts]: Start accepts. Automaton has 66440 states and 124259 transitions. Word has length 154 [2019-10-02 12:14:26,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:26,529 INFO L475 AbstractCegarLoop]: Abstraction has 66440 states and 124259 transitions. [2019-10-02 12:14:26,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:14:26,529 INFO L276 IsEmpty]: Start isEmpty. Operand 66440 states and 124259 transitions. [2019-10-02 12:14:26,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 12:14:26,537 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:26,538 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] [2019-10-02 12:14:26,538 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:26,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:26,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1708040838, now seen corresponding path program 1 times [2019-10-02 12:14:26,538 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:26,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:26,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:26,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:26,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:26,651 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:14:26,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:26,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:14:26,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:14:26,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:14:26,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:14:26,652 INFO L87 Difference]: Start difference. First operand 66440 states and 124259 transitions. Second operand 4 states. [2019-10-02 12:14:38,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:38,686 INFO L93 Difference]: Finished difference Result 218788 states and 479448 transitions. [2019-10-02 12:14:38,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:14:38,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-10-02 12:14:38,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:39,866 INFO L225 Difference]: With dead ends: 218788 [2019-10-02 12:14:39,866 INFO L226 Difference]: Without dead ends: 152414 [2019-10-02 12:14:40,136 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:14:40,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152414 states. [2019-10-02 12:14:47,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152414 to 150433. [2019-10-02 12:14:47,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150433 states. [2019-10-02 12:14:55,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150433 states to 150433 states and 321264 transitions. [2019-10-02 12:14:55,779 INFO L78 Accepts]: Start accepts. Automaton has 150433 states and 321264 transitions. Word has length 155 [2019-10-02 12:14:55,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:55,780 INFO L475 AbstractCegarLoop]: Abstraction has 150433 states and 321264 transitions. [2019-10-02 12:14:55,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:14:55,780 INFO L276 IsEmpty]: Start isEmpty. Operand 150433 states and 321264 transitions. [2019-10-02 12:14:55,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 12:14:55,791 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:55,792 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] [2019-10-02 12:14:55,792 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:55,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:55,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1408398301, now seen corresponding path program 1 times [2019-10-02 12:14:55,792 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:55,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:55,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:55,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:55,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:55,921 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:14:55,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:55,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:14:55,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:14:55,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:14:55,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:14:55,923 INFO L87 Difference]: Start difference. First operand 150433 states and 321264 transitions. Second operand 4 states. [2019-10-02 12:15:35,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:35,315 INFO L93 Difference]: Finished difference Result 504771 states and 1386166 transitions. [2019-10-02 12:15:35,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:15:35,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-10-02 12:15:35,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:39,730 INFO L225 Difference]: With dead ends: 504771 [2019-10-02 12:15:39,731 INFO L226 Difference]: Without dead ends: 354392 [2019-10-02 12:15:40,407 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:15:40,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354392 states. [2019-10-02 12:16:21,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354392 to 349356. [2019-10-02 12:16:21,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349356 states. [2019-10-02 12:16:39,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349356 states to 349356 states and 910057 transitions. [2019-10-02 12:16:39,649 INFO L78 Accepts]: Start accepts. Automaton has 349356 states and 910057 transitions. Word has length 156 [2019-10-02 12:16:39,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:39,650 INFO L475 AbstractCegarLoop]: Abstraction has 349356 states and 910057 transitions. [2019-10-02 12:16:39,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:16:39,651 INFO L276 IsEmpty]: Start isEmpty. Operand 349356 states and 910057 transitions. [2019-10-02 12:16:39,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-02 12:16:39,703 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:39,704 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:39,704 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:39,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:39,704 INFO L82 PathProgramCache]: Analyzing trace with hash 204946901, now seen corresponding path program 1 times [2019-10-02 12:16:39,705 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:39,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:39,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:39,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:39,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:39,867 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-02 12:16:39,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:39,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:16:39,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:16:39,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:16:39,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:16:39,869 INFO L87 Difference]: Start difference. First operand 349356 states and 910057 transitions. Second operand 5 states. [2019-10-02 12:17:32,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:17:32,951 INFO L93 Difference]: Finished difference Result 700244 states and 1911339 transitions. [2019-10-02 12:17:32,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:17:32,951 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2019-10-02 12:17:32,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:17:47,554 INFO L225 Difference]: With dead ends: 700244 [2019-10-02 12:17:47,554 INFO L226 Difference]: Without dead ends: 350956 [2019-10-02 12:17:49,478 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:17:49,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350956 states. [2019-10-02 12:18:18,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350956 to 350636. [2019-10-02 12:18:18,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350636 states. [2019-10-02 12:18:43,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350636 states to 350636 states and 911465 transitions. [2019-10-02 12:18:43,501 INFO L78 Accepts]: Start accepts. Automaton has 350636 states and 911465 transitions. Word has length 212 [2019-10-02 12:18:43,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:18:43,502 INFO L475 AbstractCegarLoop]: Abstraction has 350636 states and 911465 transitions. [2019-10-02 12:18:43,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:18:43,502 INFO L276 IsEmpty]: Start isEmpty. Operand 350636 states and 911465 transitions. [2019-10-02 12:18:43,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-02 12:18:43,528 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:18:43,528 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:43,528 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:18:43,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:18:43,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1660384730, now seen corresponding path program 1 times [2019-10-02 12:18:43,529 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:18:43,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:18:43,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:18:43,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:18:43,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:18:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:18:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-02 12:18:43,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:18:43,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:18:43,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:18:43,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:18:43,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:18:43,725 INFO L87 Difference]: Start difference. First operand 350636 states and 911465 transitions. Second operand 8 states.