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_product18.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:02:38,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:02:38,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:02:38,858 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:02:38,858 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:02:38,859 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:02:38,860 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:02:38,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:02:38,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:02:38,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:02:38,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:02:38,867 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:02:38,867 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:02:38,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:02:38,869 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:02:38,870 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:02:38,871 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:02:38,871 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:02:38,873 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:02:38,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:02:38,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:02:38,878 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:02:38,879 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:02:38,880 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:02:38,882 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:02:38,882 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:02:38,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:02:38,883 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:02:38,884 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:02:38,885 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:02:38,885 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:02:38,886 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:02:38,886 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:02:38,887 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:02:38,888 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:02:38,888 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:02:38,889 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:02:38,889 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:02:38,889 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:02:38,890 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:02:38,891 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:02:38,892 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-09-08 04:02:38,906 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:02:38,906 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:02:38,907 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:02:38,907 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:02:38,908 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:02:38,908 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:02:38,908 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:02:38,908 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:02:38,908 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:02:38,909 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:02:38,909 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:02:38,909 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:02:38,909 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:02:38,909 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:02:38,910 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:02:38,910 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:02:38,910 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:02:38,910 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:02:38,910 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:02:38,911 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:02:38,911 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:02:38,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:02:38,911 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:02:38,912 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:02:38,912 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:02:38,912 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:02:38,912 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:02:38,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:02:38,912 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:02:38,940 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:02:38,957 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:02:38,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:02:38,963 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:02:38,963 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:02:38,964 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product18.cil.c [2019-09-08 04:02:39,037 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/758040870/72b0b1b04a1344008d7e880c8f4c080d/FLAG6db6ebb4d [2019-09-08 04:02:39,647 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:02:39,648 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product18.cil.c [2019-09-08 04:02:39,671 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/758040870/72b0b1b04a1344008d7e880c8f4c080d/FLAG6db6ebb4d [2019-09-08 04:02:39,841 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/758040870/72b0b1b04a1344008d7e880c8f4c080d [2019-09-08 04:02:39,850 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:02:39,852 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:02:39,853 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:02:39,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:02:39,857 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:02:39,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:02:39" (1/1) ... [2019-09-08 04:02:39,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23421e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:39, skipping insertion in model container [2019-09-08 04:02:39,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:02:39" (1/1) ... [2019-09-08 04:02:39,869 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:02:39,958 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:02:40,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:02:40,829 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:02:41,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:02:41,119 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:02:41,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:41 WrapperNode [2019-09-08 04:02:41,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:02:41,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:02:41,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:02:41,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:02:41,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:41" (1/1) ... [2019-09-08 04:02:41,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:41" (1/1) ... [2019-09-08 04:02:41,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:41" (1/1) ... [2019-09-08 04:02:41,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:41" (1/1) ... [2019-09-08 04:02:41,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:41" (1/1) ... [2019-09-08 04:02:41,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:41" (1/1) ... [2019-09-08 04:02:41,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:41" (1/1) ... [2019-09-08 04:02:41,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:02:41,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:02:41,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:02:41,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:02:41,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:41" (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-09-08 04:02:41,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:02:41,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:02:41,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:02:41,469 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 04:02:41,470 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 04:02:41,471 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:02:41,471 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 04:02:41,471 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 04:02:41,471 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 04:02:41,472 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:02:41,472 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:02:41,472 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:02:41,473 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:02:41,473 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 04:02:41,474 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 04:02:41,474 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 04:02:41,477 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-08 04:02:41,477 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 04:02:41,477 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 04:02:41,478 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 04:02:41,478 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 04:02:41,478 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 04:02:41,479 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 04:02:41,479 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 04:02:41,479 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 04:02:41,479 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 04:02:41,479 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 04:02:41,479 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 04:02:41,480 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 04:02:41,480 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 04:02:41,480 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 04:02:41,480 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 04:02:41,480 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 04:02:41,481 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 04:02:41,481 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 04:02:41,481 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__weight [2019-09-08 04:02:41,481 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 04:02:41,481 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__weight [2019-09-08 04:02:41,481 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 04:02:41,482 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 04:02:41,482 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:02:41,482 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:02:41,483 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:02:41,483 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:02:41,483 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:02:41,483 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:02:41,483 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:02:41,484 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 04:02:41,484 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 04:02:41,484 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 04:02:41,484 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 04:02:41,484 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 04:02:41,485 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 04:02:41,485 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 04:02:41,485 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 04:02:41,485 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 04:02:41,485 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 04:02:41,485 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 04:02:41,486 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 04:02:41,486 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 04:02:41,486 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 04:02:41,486 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:02:41,486 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 04:02:41,487 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:02:41,487 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-09-08 04:02:41,487 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-09-08 04:02:41,487 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-09-08 04:02:41,488 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-09-08 04:02:41,488 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 04:02:41,488 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 04:02:41,489 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 04:02:41,489 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 04:02:41,489 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 04:02:41,489 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 04:02:41,490 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 04:02:41,490 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 04:02:41,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:02:41,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:02:41,491 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 04:02:41,491 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 04:02:41,491 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 04:02:41,491 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 04:02:41,492 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 04:02:41,492 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 04:02:41,493 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 04:02:41,493 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 04:02:41,493 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 04:02:41,494 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 04:02:41,494 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 04:02:41,494 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:02:41,495 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 04:02:41,495 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 04:02:41,496 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:02:41,496 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:02:41,496 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:02:41,496 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:02:41,497 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:02:41,497 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 04:02:41,497 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 04:02:41,497 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 04:02:41,497 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 04:02:41,498 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 04:02:41,498 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 04:02:41,498 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 04:02:41,498 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 04:02:41,498 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 04:02:41,498 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 04:02:41,499 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 04:02:41,499 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 04:02:41,499 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 04:02:41,499 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-08 04:02:41,499 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 04:02:41,500 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 04:02:41,500 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-09-08 04:02:41,500 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 04:02:41,500 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 04:02:41,500 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 04:02:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 04:02:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 04:02:41,501 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 04:02:41,502 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 04:02:41,502 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 04:02:41,502 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 04:02:41,502 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__weight [2019-09-08 04:02:41,503 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-09-08 04:02:41,503 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__weight [2019-09-08 04:02:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:02:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 04:02:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:02:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:02:41,504 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:02:41,505 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:02:41,505 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:02:41,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:02:41,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:02:41,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:02:41,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:02:41,506 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:02:41,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:02:41,507 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:02:41,511 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:02:41,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:02:41,512 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:02:41,512 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:02:41,518 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:02:41,518 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 04:02:41,518 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 04:02:41,518 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 04:02:41,519 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 04:02:41,519 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 04:02:41,519 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 04:02:41,519 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 04:02:41,520 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 04:02:41,520 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 04:02:41,520 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 04:02:41,520 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 04:02:41,521 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 04:02:41,521 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 04:02:41,521 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:02:41,521 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-09-08 04:02:41,521 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-09-08 04:02:41,521 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 04:02:41,521 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:02:41,522 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 04:02:41,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:02:41,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:02:41,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:02:43,944 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:02:43,945 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 04:02:43,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:02:43 BoogieIcfgContainer [2019-09-08 04:02:43,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:02:43,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:02:43,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:02:43,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:02:43,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:02:39" (1/3) ... [2019-09-08 04:02:43,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10455573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:02:43, skipping insertion in model container [2019-09-08 04:02:43,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:02:41" (2/3) ... [2019-09-08 04:02:43,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10455573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:02:43, skipping insertion in model container [2019-09-08 04:02:43,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:02:43" (3/3) ... [2019-09-08 04:02:43,955 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product18.cil.c [2019-09-08 04:02:43,965 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:02:43,975 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:02:43,993 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:02:44,031 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:02:44,032 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:02:44,032 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:02:44,032 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:02:44,032 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:02:44,032 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:02:44,033 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:02:44,033 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:02:44,033 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:02:44,067 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states. [2019-09-08 04:02:44,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 04:02:44,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:44,085 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:44,087 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:44,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:44,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1188892362, now seen corresponding path program 1 times [2019-09-08 04:02:44,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:44,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:44,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:44,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:44,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:44,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:44,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:44,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:02:44,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:02:44,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:02:44,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:02:44,655 INFO L87 Difference]: Start difference. First operand 758 states. Second operand 4 states. [2019-09-08 04:02:44,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:44,898 INFO L93 Difference]: Finished difference Result 1165 states and 1897 transitions. [2019-09-08 04:02:44,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:02:44,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-08 04:02:44,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:44,997 INFO L225 Difference]: With dead ends: 1165 [2019-09-08 04:02:44,998 INFO L226 Difference]: Without dead ends: 591 [2019-09-08 04:02:45,013 INFO L628 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-09-08 04:02:45,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-08 04:02:45,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-09-08 04:02:45,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-08 04:02:45,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 950 transitions. [2019-09-08 04:02:45,141 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 950 transitions. Word has length 85 [2019-09-08 04:02:45,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:45,142 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 950 transitions. [2019-09-08 04:02:45,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:02:45,142 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 950 transitions. [2019-09-08 04:02:45,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 04:02:45,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:45,149 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:45,149 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:45,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:45,149 INFO L82 PathProgramCache]: Analyzing trace with hash -425590234, now seen corresponding path program 1 times [2019-09-08 04:02:45,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:45,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:45,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:45,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:45,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:45,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:45,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:45,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:02:45,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:02:45,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:02:45,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:02:45,363 INFO L87 Difference]: Start difference. First operand 591 states and 950 transitions. Second operand 4 states. [2019-09-08 04:02:45,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:45,459 INFO L93 Difference]: Finished difference Result 1145 states and 1858 transitions. [2019-09-08 04:02:45,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:02:45,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-08 04:02:45,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:45,467 INFO L225 Difference]: With dead ends: 1145 [2019-09-08 04:02:45,467 INFO L226 Difference]: Without dead ends: 591 [2019-09-08 04:02:45,471 INFO L628 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-09-08 04:02:45,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-08 04:02:45,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-09-08 04:02:45,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-08 04:02:45,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 949 transitions. [2019-09-08 04:02:45,517 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 949 transitions. Word has length 88 [2019-09-08 04:02:45,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:45,518 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 949 transitions. [2019-09-08 04:02:45,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:02:45,518 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 949 transitions. [2019-09-08 04:02:45,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 04:02:45,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:45,530 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:45,530 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:45,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:45,530 INFO L82 PathProgramCache]: Analyzing trace with hash -737262235, now seen corresponding path program 1 times [2019-09-08 04:02:45,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:45,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:45,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:45,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:45,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:45,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:45,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:45,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:02:45,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:02:45,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:02:45,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:02:45,714 INFO L87 Difference]: Start difference. First operand 591 states and 949 transitions. Second operand 4 states. [2019-09-08 04:02:45,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:45,782 INFO L93 Difference]: Finished difference Result 1145 states and 1857 transitions. [2019-09-08 04:02:45,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:02:45,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-08 04:02:45,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:45,790 INFO L225 Difference]: With dead ends: 1145 [2019-09-08 04:02:45,790 INFO L226 Difference]: Without dead ends: 591 [2019-09-08 04:02:45,798 INFO L628 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-09-08 04:02:45,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-08 04:02:45,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-09-08 04:02:45,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-08 04:02:45,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 948 transitions. [2019-09-08 04:02:45,847 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 948 transitions. Word has length 89 [2019-09-08 04:02:45,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:45,847 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 948 transitions. [2019-09-08 04:02:45,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:02:45,847 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 948 transitions. [2019-09-08 04:02:45,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 04:02:45,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:45,850 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:45,850 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:45,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:45,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1727810174, now seen corresponding path program 1 times [2019-09-08 04:02:45,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:45,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:45,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:45,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:45,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:46,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:46,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:46,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:02:46,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:02:46,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:02:46,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:02:46,025 INFO L87 Difference]: Start difference. First operand 591 states and 948 transitions. Second operand 4 states. [2019-09-08 04:02:46,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:46,109 INFO L93 Difference]: Finished difference Result 1145 states and 1856 transitions. [2019-09-08 04:02:46,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:02:46,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-08 04:02:46,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:46,118 INFO L225 Difference]: With dead ends: 1145 [2019-09-08 04:02:46,119 INFO L226 Difference]: Without dead ends: 591 [2019-09-08 04:02:46,122 INFO L628 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-09-08 04:02:46,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-08 04:02:46,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-09-08 04:02:46,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-08 04:02:46,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 947 transitions. [2019-09-08 04:02:46,149 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 947 transitions. Word has length 90 [2019-09-08 04:02:46,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:46,150 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 947 transitions. [2019-09-08 04:02:46,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:02:46,150 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 947 transitions. [2019-09-08 04:02:46,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 04:02:46,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:46,159 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:46,159 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:46,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:46,160 INFO L82 PathProgramCache]: Analyzing trace with hash 2006291585, now seen corresponding path program 1 times [2019-09-08 04:02:46,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:46,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:46,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:46,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:46,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:46,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:46,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:02:46,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:02:46,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:02:46,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:02:46,332 INFO L87 Difference]: Start difference. First operand 591 states and 947 transitions. Second operand 4 states. [2019-09-08 04:02:46,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:46,383 INFO L93 Difference]: Finished difference Result 1145 states and 1855 transitions. [2019-09-08 04:02:46,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:02:46,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-08 04:02:46,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:46,389 INFO L225 Difference]: With dead ends: 1145 [2019-09-08 04:02:46,389 INFO L226 Difference]: Without dead ends: 591 [2019-09-08 04:02:46,392 INFO L628 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-09-08 04:02:46,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-09-08 04:02:46,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-09-08 04:02:46,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-09-08 04:02:46,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 946 transitions. [2019-09-08 04:02:46,413 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 946 transitions. Word has length 91 [2019-09-08 04:02:46,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:46,413 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 946 transitions. [2019-09-08 04:02:46,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:02:46,413 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 946 transitions. [2019-09-08 04:02:46,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 04:02:46,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:46,416 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:46,416 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:46,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:46,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1880678622, now seen corresponding path program 1 times [2019-09-08 04:02:46,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:46,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:46,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:46,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:46,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:46,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:46,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:46,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:02:46,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:02:46,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:02:46,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:02:46,602 INFO L87 Difference]: Start difference. First operand 591 states and 946 transitions. Second operand 10 states. [2019-09-08 04:02:46,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:46,770 INFO L93 Difference]: Finished difference Result 1103 states and 1775 transitions. [2019-09-08 04:02:46,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:02:46,771 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-09-08 04:02:46,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:46,782 INFO L225 Difference]: With dead ends: 1103 [2019-09-08 04:02:46,782 INFO L226 Difference]: Without dead ends: 600 [2019-09-08 04:02:46,786 INFO L628 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-09-08 04:02:46,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-09-08 04:02:46,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 598. [2019-09-08 04:02:46,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-09-08 04:02:46,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 955 transitions. [2019-09-08 04:02:46,821 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 955 transitions. Word has length 92 [2019-09-08 04:02:46,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:46,821 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 955 transitions. [2019-09-08 04:02:46,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:02:46,821 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 955 transitions. [2019-09-08 04:02:46,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 04:02:46,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:46,825 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:46,825 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:46,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:46,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1901015997, now seen corresponding path program 1 times [2019-09-08 04:02:46,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:46,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:46,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:46,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:46,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:46,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:46,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:46,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:46,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:02:46,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:02:46,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:02:46,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:02:46,934 INFO L87 Difference]: Start difference. First operand 598 states and 955 transitions. Second operand 4 states. [2019-09-08 04:02:46,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:46,996 INFO L93 Difference]: Finished difference Result 1151 states and 1861 transitions. [2019-09-08 04:02:46,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:02:46,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-09-08 04:02:47,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:47,005 INFO L225 Difference]: With dead ends: 1151 [2019-09-08 04:02:47,005 INFO L226 Difference]: Without dead ends: 585 [2019-09-08 04:02:47,009 INFO L628 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-09-08 04:02:47,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-09-08 04:02:47,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2019-09-08 04:02:47,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-09-08 04:02:47,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 932 transitions. [2019-09-08 04:02:47,035 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 932 transitions. Word has length 92 [2019-09-08 04:02:47,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:47,038 INFO L475 AbstractCegarLoop]: Abstraction has 585 states and 932 transitions. [2019-09-08 04:02:47,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:02:47,038 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 932 transitions. [2019-09-08 04:02:47,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 04:02:47,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:47,042 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:47,043 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:47,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:47,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1516088769, now seen corresponding path program 1 times [2019-09-08 04:02:47,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:47,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:47,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:47,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:47,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:47,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:47,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:47,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:02:47,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:02:47,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:02:47,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:02:47,208 INFO L87 Difference]: Start difference. First operand 585 states and 932 transitions. Second operand 6 states. [2019-09-08 04:02:47,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:47,457 INFO L93 Difference]: Finished difference Result 1091 states and 1753 transitions. [2019-09-08 04:02:47,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:02:47,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-09-08 04:02:47,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:47,463 INFO L225 Difference]: With dead ends: 1091 [2019-09-08 04:02:47,463 INFO L226 Difference]: Without dead ends: 585 [2019-09-08 04:02:47,466 INFO L628 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-09-08 04:02:47,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-09-08 04:02:47,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2019-09-08 04:02:47,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-09-08 04:02:47,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 928 transitions. [2019-09-08 04:02:47,489 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 928 transitions. Word has length 93 [2019-09-08 04:02:47,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:47,491 INFO L475 AbstractCegarLoop]: Abstraction has 585 states and 928 transitions. [2019-09-08 04:02:47,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:02:47,491 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 928 transitions. [2019-09-08 04:02:47,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 04:02:47,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:47,493 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:47,494 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:47,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:47,494 INFO L82 PathProgramCache]: Analyzing trace with hash 645733217, now seen corresponding path program 1 times [2019-09-08 04:02:47,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:47,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:47,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:47,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:47,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:47,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:47,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:47,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:47,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:02:47,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:02:47,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:02:47,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:02:47,617 INFO L87 Difference]: Start difference. First operand 585 states and 928 transitions. Second operand 6 states. [2019-09-08 04:02:47,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:47,846 INFO L93 Difference]: Finished difference Result 1091 states and 1749 transitions. [2019-09-08 04:02:47,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:02:47,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-09-08 04:02:47,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:47,852 INFO L225 Difference]: With dead ends: 1091 [2019-09-08 04:02:47,852 INFO L226 Difference]: Without dead ends: 585 [2019-09-08 04:02:47,856 INFO L628 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-09-08 04:02:47,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-09-08 04:02:47,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2019-09-08 04:02:47,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-09-08 04:02:47,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 924 transitions. [2019-09-08 04:02:47,887 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 924 transitions. Word has length 94 [2019-09-08 04:02:47,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:47,888 INFO L475 AbstractCegarLoop]: Abstraction has 585 states and 924 transitions. [2019-09-08 04:02:47,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:02:47,888 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 924 transitions. [2019-09-08 04:02:47,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 04:02:47,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:47,890 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:47,891 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:47,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:47,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1096058748, now seen corresponding path program 1 times [2019-09-08 04:02:47,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:47,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:47,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:47,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:47,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:48,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:48,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:48,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:02:48,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:02:48,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:02:48,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:02:48,012 INFO L87 Difference]: Start difference. First operand 585 states and 924 transitions. Second operand 6 states. [2019-09-08 04:02:48,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:48,242 INFO L93 Difference]: Finished difference Result 1091 states and 1745 transitions. [2019-09-08 04:02:48,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:02:48,244 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-09-08 04:02:48,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:48,249 INFO L225 Difference]: With dead ends: 1091 [2019-09-08 04:02:48,249 INFO L226 Difference]: Without dead ends: 585 [2019-09-08 04:02:48,253 INFO L628 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-09-08 04:02:48,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-09-08 04:02:48,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2019-09-08 04:02:48,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-09-08 04:02:48,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 920 transitions. [2019-09-08 04:02:48,278 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 920 transitions. Word has length 95 [2019-09-08 04:02:48,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:48,278 INFO L475 AbstractCegarLoop]: Abstraction has 585 states and 920 transitions. [2019-09-08 04:02:48,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:02:48,278 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 920 transitions. [2019-09-08 04:02:48,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 04:02:48,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:48,281 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:48,281 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:48,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:48,282 INFO L82 PathProgramCache]: Analyzing trace with hash -48204540, now seen corresponding path program 1 times [2019-09-08 04:02:48,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:48,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:48,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:48,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:48,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:48,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:48,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:48,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:02:48,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:02:48,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:02:48,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:02:48,401 INFO L87 Difference]: Start difference. First operand 585 states and 920 transitions. Second operand 7 states. [2019-09-08 04:02:48,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:48,491 INFO L93 Difference]: Finished difference Result 1091 states and 1741 transitions. [2019-09-08 04:02:48,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:02:48,492 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-09-08 04:02:48,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:48,497 INFO L225 Difference]: With dead ends: 1091 [2019-09-08 04:02:48,497 INFO L226 Difference]: Without dead ends: 564 [2019-09-08 04:02:48,501 INFO L628 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-09-08 04:02:48,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-09-08 04:02:48,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-09-08 04:02:48,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-09-08 04:02:48,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 886 transitions. [2019-09-08 04:02:48,521 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 886 transitions. Word has length 95 [2019-09-08 04:02:48,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:48,521 INFO L475 AbstractCegarLoop]: Abstraction has 564 states and 886 transitions. [2019-09-08 04:02:48,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:02:48,521 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 886 transitions. [2019-09-08 04:02:48,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 04:02:48,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:48,523 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:48,523 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:48,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:48,524 INFO L82 PathProgramCache]: Analyzing trace with hash 704168390, now seen corresponding path program 1 times [2019-09-08 04:02:48,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:48,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:48,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:48,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:48,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:48,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:48,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:02:48,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:02:48,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:02:48,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:02:48,632 INFO L87 Difference]: Start difference. First operand 564 states and 886 transitions. Second operand 6 states. [2019-09-08 04:02:48,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:48,721 INFO L93 Difference]: Finished difference Result 1070 states and 1707 transitions. [2019-09-08 04:02:48,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:02:48,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-09-08 04:02:48,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:48,726 INFO L225 Difference]: With dead ends: 1070 [2019-09-08 04:02:48,726 INFO L226 Difference]: Without dead ends: 564 [2019-09-08 04:02:48,729 INFO L628 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-09-08 04:02:48,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-09-08 04:02:48,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-09-08 04:02:48,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-09-08 04:02:48,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 885 transitions. [2019-09-08 04:02:48,749 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 885 transitions. Word has length 96 [2019-09-08 04:02:48,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:48,749 INFO L475 AbstractCegarLoop]: Abstraction has 564 states and 885 transitions. [2019-09-08 04:02:48,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:02:48,749 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 885 transitions. [2019-09-08 04:02:48,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 04:02:48,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:48,751 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:48,752 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:48,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:48,752 INFO L82 PathProgramCache]: Analyzing trace with hash 637838025, now seen corresponding path program 1 times [2019-09-08 04:02:48,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:48,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:48,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:48,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:48,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:48,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:48,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:48,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:02:48,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:02:48,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:02:48,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:02:48,857 INFO L87 Difference]: Start difference. First operand 564 states and 885 transitions. Second operand 6 states. [2019-09-08 04:02:48,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:48,958 INFO L93 Difference]: Finished difference Result 1070 states and 1706 transitions. [2019-09-08 04:02:48,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:02:48,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-09-08 04:02:48,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:48,964 INFO L225 Difference]: With dead ends: 1070 [2019-09-08 04:02:48,965 INFO L226 Difference]: Without dead ends: 564 [2019-09-08 04:02:48,969 INFO L628 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-09-08 04:02:48,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-09-08 04:02:48,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-09-08 04:02:48,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-09-08 04:02:48,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 884 transitions. [2019-09-08 04:02:48,989 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 884 transitions. Word has length 97 [2019-09-08 04:02:48,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:48,989 INFO L475 AbstractCegarLoop]: Abstraction has 564 states and 884 transitions. [2019-09-08 04:02:48,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:02:48,990 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 884 transitions. [2019-09-08 04:02:48,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 04:02:48,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:48,992 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:48,992 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:48,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:48,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1457200085, now seen corresponding path program 1 times [2019-09-08 04:02:48,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:48,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:48,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:48,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:48,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:49,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:49,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:49,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:02:49,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:02:49,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:02:49,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:02:49,233 INFO L87 Difference]: Start difference. First operand 564 states and 884 transitions. Second operand 12 states. [2019-09-08 04:02:49,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:49,491 INFO L93 Difference]: Finished difference Result 1071 states and 1705 transitions. [2019-09-08 04:02:49,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:02:49,492 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-09-08 04:02:49,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:49,499 INFO L225 Difference]: With dead ends: 1071 [2019-09-08 04:02:49,499 INFO L226 Difference]: Without dead ends: 564 [2019-09-08 04:02:49,504 INFO L628 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-09-08 04:02:49,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-09-08 04:02:49,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-09-08 04:02:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-09-08 04:02:49,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 883 transitions. [2019-09-08 04:02:49,529 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 883 transitions. Word has length 98 [2019-09-08 04:02:49,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:49,529 INFO L475 AbstractCegarLoop]: Abstraction has 564 states and 883 transitions. [2019-09-08 04:02:49,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:02:49,530 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 883 transitions. [2019-09-08 04:02:49,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 04:02:49,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:49,533 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:02:49,533 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:49,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:49,534 INFO L82 PathProgramCache]: Analyzing trace with hash 910887794, now seen corresponding path program 1 times [2019-09-08 04:02:49,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:49,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:49,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:49,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:49,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:49,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:49,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:49,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:02:49,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:02:49,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:02:49,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:02:49,738 INFO L87 Difference]: Start difference. First operand 564 states and 883 transitions. Second operand 6 states. [2019-09-08 04:02:53,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:53,166 INFO L93 Difference]: Finished difference Result 1670 states and 2699 transitions. [2019-09-08 04:02:53,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:02:53,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-09-08 04:02:53,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:53,184 INFO L225 Difference]: With dead ends: 1670 [2019-09-08 04:02:53,184 INFO L226 Difference]: Without dead ends: 1172 [2019-09-08 04:02:53,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:02:53,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2019-09-08 04:02:53,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1047. [2019-09-08 04:02:53,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2019-09-08 04:02:53,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1686 transitions. [2019-09-08 04:02:53,279 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1686 transitions. Word has length 99 [2019-09-08 04:02:53,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:53,279 INFO L475 AbstractCegarLoop]: Abstraction has 1047 states and 1686 transitions. [2019-09-08 04:02:53,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:02:53,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1686 transitions. [2019-09-08 04:02:53,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 04:02:53,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:53,286 INFO L399 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] [2019-09-08 04:02:53,286 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:53,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:53,287 INFO L82 PathProgramCache]: Analyzing trace with hash 728641115, now seen corresponding path program 1 times [2019-09-08 04:02:53,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:53,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:53,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:53,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:53,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:53,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:02:53,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:02:53,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:02:53,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:02:53,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:02:53,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:02:53,569 INFO L87 Difference]: Start difference. First operand 1047 states and 1686 transitions. Second operand 12 states. [2019-09-08 04:03:03,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:03:03,576 INFO L93 Difference]: Finished difference Result 3352 states and 5434 transitions. [2019-09-08 04:03:03,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 04:03:03,578 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 131 [2019-09-08 04:03:03,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:03:03,596 INFO L225 Difference]: With dead ends: 3352 [2019-09-08 04:03:03,596 INFO L226 Difference]: Without dead ends: 2371 [2019-09-08 04:03:03,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-09-08 04:03:03,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2371 states. [2019-09-08 04:03:03,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 2313. [2019-09-08 04:03:03,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2313 states. [2019-09-08 04:03:03,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3713 transitions. [2019-09-08 04:03:03,739 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3713 transitions. Word has length 131 [2019-09-08 04:03:03,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:03:03,740 INFO L475 AbstractCegarLoop]: Abstraction has 2313 states and 3713 transitions. [2019-09-08 04:03:03,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:03:03,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3713 transitions. [2019-09-08 04:03:03,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 04:03:03,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:03:03,744 INFO L399 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] [2019-09-08 04:03:03,745 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:03:03,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:03:03,745 INFO L82 PathProgramCache]: Analyzing trace with hash 552853337, now seen corresponding path program 1 times [2019-09-08 04:03:03,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:03:03,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:03:03,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:03,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:03:03,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:03:03,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:03:03,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:03:03,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:03:03,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:03:03,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:03:03,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:03:03,955 INFO L87 Difference]: Start difference. First operand 2313 states and 3713 transitions. Second operand 9 states. [2019-09-08 04:03:07,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:03:07,759 INFO L93 Difference]: Finished difference Result 4600 states and 7543 transitions. [2019-09-08 04:03:07,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:03:07,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-08 04:03:07,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:03:07,780 INFO L225 Difference]: With dead ends: 4600 [2019-09-08 04:03:07,780 INFO L226 Difference]: Without dead ends: 2353 [2019-09-08 04:03:07,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 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-09-08 04:03:07,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2019-09-08 04:03:07,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 2337. [2019-09-08 04:03:07,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2337 states. [2019-09-08 04:03:08,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 3797 transitions. [2019-09-08 04:03:08,006 INFO L78 Accepts]: Start accepts. Automaton has 2337 states and 3797 transitions. Word has length 132 [2019-09-08 04:03:08,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:03:08,006 INFO L475 AbstractCegarLoop]: Abstraction has 2337 states and 3797 transitions. [2019-09-08 04:03:08,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:03:08,007 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 3797 transitions. [2019-09-08 04:03:08,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 04:03:08,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:03:08,013 INFO L399 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-09-08 04:03:08,014 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:03:08,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:03:08,014 INFO L82 PathProgramCache]: Analyzing trace with hash -2055663078, now seen corresponding path program 1 times [2019-09-08 04:03:08,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:03:08,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:03:08,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:08,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:03:08,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:03:08,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:03:08,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:03:08,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:03:08,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:03:08,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:03:08,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:03:08,248 INFO L87 Difference]: Start difference. First operand 2337 states and 3797 transitions. Second operand 8 states. [2019-09-08 04:03:14,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:03:14,385 INFO L93 Difference]: Finished difference Result 7919 states and 13290 transitions. [2019-09-08 04:03:14,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 04:03:14,386 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 133 [2019-09-08 04:03:14,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:03:14,428 INFO L225 Difference]: With dead ends: 7919 [2019-09-08 04:03:14,429 INFO L226 Difference]: Without dead ends: 5648 [2019-09-08 04:03:14,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 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-09-08 04:03:14,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5648 states. [2019-09-08 04:03:14,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5648 to 5600. [2019-09-08 04:03:14,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5600 states. [2019-09-08 04:03:14,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5600 states to 5600 states and 8993 transitions. [2019-09-08 04:03:14,761 INFO L78 Accepts]: Start accepts. Automaton has 5600 states and 8993 transitions. Word has length 133 [2019-09-08 04:03:14,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:03:14,762 INFO L475 AbstractCegarLoop]: Abstraction has 5600 states and 8993 transitions. [2019-09-08 04:03:14,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:03:14,762 INFO L276 IsEmpty]: Start isEmpty. Operand 5600 states and 8993 transitions. [2019-09-08 04:03:14,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 04:03:14,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:03:14,769 INFO L399 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] [2019-09-08 04:03:14,770 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:03:14,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:03:14,770 INFO L82 PathProgramCache]: Analyzing trace with hash -2071050646, now seen corresponding path program 1 times [2019-09-08 04:03:14,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:03:14,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:03:14,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:14,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:03:14,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:03:15,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:03:15,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:03:15,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:03:15,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:03:15,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:03:15,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:03:15,017 INFO L87 Difference]: Start difference. First operand 5600 states and 8993 transitions. Second operand 9 states. [2019-09-08 04:03:23,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:03:23,654 INFO L93 Difference]: Finished difference Result 14795 states and 24355 transitions. [2019-09-08 04:03:23,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 04:03:23,656 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 139 [2019-09-08 04:03:23,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:03:23,767 INFO L225 Difference]: With dead ends: 14795 [2019-09-08 04:03:23,768 INFO L226 Difference]: Without dead ends: 9255 [2019-09-08 04:03:23,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 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-09-08 04:03:23,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9255 states. [2019-09-08 04:03:24,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9255 to 8645. [2019-09-08 04:03:24,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8645 states. [2019-09-08 04:03:24,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8645 states to 8645 states and 13813 transitions. [2019-09-08 04:03:24,421 INFO L78 Accepts]: Start accepts. Automaton has 8645 states and 13813 transitions. Word has length 139 [2019-09-08 04:03:24,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:03:24,421 INFO L475 AbstractCegarLoop]: Abstraction has 8645 states and 13813 transitions. [2019-09-08 04:03:24,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:03:24,422 INFO L276 IsEmpty]: Start isEmpty. Operand 8645 states and 13813 transitions. [2019-09-08 04:03:24,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 04:03:24,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:03:24,426 INFO L399 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] [2019-09-08 04:03:24,426 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:03:24,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:03:24,426 INFO L82 PathProgramCache]: Analyzing trace with hash -937860053, now seen corresponding path program 1 times [2019-09-08 04:03:24,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:03:24,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:03:24,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:24,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:03:24,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:03:24,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:03:24,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:03:24,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:03:24,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:03:24,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:03:24,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:03:24,582 INFO L87 Difference]: Start difference. First operand 8645 states and 13813 transitions. Second operand 7 states. [2019-09-08 04:03:29,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:03:29,538 INFO L93 Difference]: Finished difference Result 24968 states and 41171 transitions. [2019-09-08 04:03:29,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 04:03:29,538 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2019-09-08 04:03:29,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:03:29,659 INFO L225 Difference]: With dead ends: 24968 [2019-09-08 04:03:29,660 INFO L226 Difference]: Without dead ends: 17579 [2019-09-08 04:03:29,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-08 04:03:29,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17579 states. [2019-09-08 04:03:30,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17579 to 17197. [2019-09-08 04:03:30,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17197 states. [2019-09-08 04:03:30,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17197 states to 17197 states and 27862 transitions. [2019-09-08 04:03:30,783 INFO L78 Accepts]: Start accepts. Automaton has 17197 states and 27862 transitions. Word has length 139 [2019-09-08 04:03:30,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:03:30,785 INFO L475 AbstractCegarLoop]: Abstraction has 17197 states and 27862 transitions. [2019-09-08 04:03:30,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:03:30,785 INFO L276 IsEmpty]: Start isEmpty. Operand 17197 states and 27862 transitions. [2019-09-08 04:03:30,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 04:03:30,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:03:30,790 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:03:30,790 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:03:30,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:03:30,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1123011920, now seen corresponding path program 1 times [2019-09-08 04:03:30,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:03:30,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:03:30,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:30,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:03:30,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:03:30,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:03:30,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:03:30,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:03:30,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:03:30,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:03:30,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:03:30,957 INFO L87 Difference]: Start difference. First operand 17197 states and 27862 transitions. Second operand 5 states. [2019-09-08 04:03:31,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:03:31,942 INFO L93 Difference]: Finished difference Result 33378 states and 54663 transitions. [2019-09-08 04:03:31,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:03:31,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 04:03:31,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:03:32,038 INFO L225 Difference]: With dead ends: 33378 [2019-09-08 04:03:32,038 INFO L226 Difference]: Without dead ends: 17602 [2019-09-08 04:03:32,083 INFO L628 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-09-08 04:03:32,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17602 states. [2019-09-08 04:03:32,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17602 to 17386. [2019-09-08 04:03:32,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17386 states. [2019-09-08 04:03:33,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17386 states to 17386 states and 28126 transitions. [2019-09-08 04:03:33,026 INFO L78 Accepts]: Start accepts. Automaton has 17386 states and 28126 transitions. Word has length 144 [2019-09-08 04:03:33,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:03:33,027 INFO L475 AbstractCegarLoop]: Abstraction has 17386 states and 28126 transitions. [2019-09-08 04:03:33,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:03:33,027 INFO L276 IsEmpty]: Start isEmpty. Operand 17386 states and 28126 transitions. [2019-09-08 04:03:33,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 04:03:33,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:03:33,032 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:03:33,032 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:03:33,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:03:33,033 INFO L82 PathProgramCache]: Analyzing trace with hash -67888017, now seen corresponding path program 1 times [2019-09-08 04:03:33,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:03:33,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:03:33,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:33,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:03:33,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:03:33,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:03:33,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:03:33,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:03:33,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:03:33,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:03:33,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:03:33,172 INFO L87 Difference]: Start difference. First operand 17386 states and 28126 transitions. Second operand 7 states. [2019-09-08 04:03:34,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:03:34,632 INFO L93 Difference]: Finished difference Result 35544 states and 59061 transitions. [2019-09-08 04:03:34,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:03:34,632 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 151 [2019-09-08 04:03:34,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:03:34,736 INFO L225 Difference]: With dead ends: 35544 [2019-09-08 04:03:34,736 INFO L226 Difference]: Without dead ends: 17386 [2019-09-08 04:03:34,795 INFO L628 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-09-08 04:03:34,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17386 states. [2019-09-08 04:03:35,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17386 to 17386. [2019-09-08 04:03:35,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17386 states. [2019-09-08 04:03:35,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17386 states to 17386 states and 27736 transitions. [2019-09-08 04:03:35,582 INFO L78 Accepts]: Start accepts. Automaton has 17386 states and 27736 transitions. Word has length 151 [2019-09-08 04:03:35,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:03:35,582 INFO L475 AbstractCegarLoop]: Abstraction has 17386 states and 27736 transitions. [2019-09-08 04:03:35,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:03:35,582 INFO L276 IsEmpty]: Start isEmpty. Operand 17386 states and 27736 transitions. [2019-09-08 04:03:35,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 04:03:35,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:03:35,588 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:03:35,588 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:03:35,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:03:35,589 INFO L82 PathProgramCache]: Analyzing trace with hash 455720139, now seen corresponding path program 1 times [2019-09-08 04:03:35,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:03:35,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:03:35,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:35,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:03:35,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:03:35,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 04:03:35,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:03:35,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:03:35,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:03:35,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:03:35,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:03:35,737 INFO L87 Difference]: Start difference. First operand 17386 states and 27736 transitions. Second operand 7 states. [2019-09-08 04:03:40,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:03:40,874 INFO L93 Difference]: Finished difference Result 34932 states and 56289 transitions. [2019-09-08 04:03:40,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 04:03:40,874 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 156 [2019-09-08 04:03:40,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:03:40,962 INFO L225 Difference]: With dead ends: 34932 [2019-09-08 04:03:40,963 INFO L226 Difference]: Without dead ends: 18989 [2019-09-08 04:03:41,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-09-08 04:03:41,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18989 states. [2019-09-08 04:03:41,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18989 to 18448. [2019-09-08 04:03:41,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18448 states. [2019-09-08 04:03:41,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18448 states to 18448 states and 29176 transitions. [2019-09-08 04:03:41,679 INFO L78 Accepts]: Start accepts. Automaton has 18448 states and 29176 transitions. Word has length 156 [2019-09-08 04:03:41,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:03:41,679 INFO L475 AbstractCegarLoop]: Abstraction has 18448 states and 29176 transitions. [2019-09-08 04:03:41,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:03:41,679 INFO L276 IsEmpty]: Start isEmpty. Operand 18448 states and 29176 transitions. [2019-09-08 04:03:41,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 04:03:41,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:03:41,684 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:03:41,684 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:03:41,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:03:41,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1238020489, now seen corresponding path program 1 times [2019-09-08 04:03:41,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:03:41,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:03:41,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:41,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:03:41,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:03:41,795 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 04:03:41,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:03:41,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:03:41,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:03:41,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:03:41,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:03:41,797 INFO L87 Difference]: Start difference. First operand 18448 states and 29176 transitions. Second operand 6 states. [2019-09-08 04:03:42,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:03:42,828 INFO L93 Difference]: Finished difference Result 43174 states and 69474 transitions. [2019-09-08 04:03:42,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:03:42,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2019-09-08 04:03:42,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:03:42,962 INFO L225 Difference]: With dead ends: 43174 [2019-09-08 04:03:42,962 INFO L226 Difference]: Without dead ends: 26169 [2019-09-08 04:03:43,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:03:43,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26169 states. [2019-09-08 04:03:43,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26169 to 24187. [2019-09-08 04:03:43,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24187 states. [2019-09-08 04:03:43,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24187 states to 24187 states and 38644 transitions. [2019-09-08 04:03:43,953 INFO L78 Accepts]: Start accepts. Automaton has 24187 states and 38644 transitions. Word has length 161 [2019-09-08 04:03:43,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:03:43,954 INFO L475 AbstractCegarLoop]: Abstraction has 24187 states and 38644 transitions. [2019-09-08 04:03:43,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:03:43,954 INFO L276 IsEmpty]: Start isEmpty. Operand 24187 states and 38644 transitions. [2019-09-08 04:03:43,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-08 04:03:43,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:03:43,960 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:03:43,961 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:03:43,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:03:43,961 INFO L82 PathProgramCache]: Analyzing trace with hash -728750315, now seen corresponding path program 1 times [2019-09-08 04:03:43,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:03:43,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:03:43,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:43,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:03:43,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:03:44,136 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 04:03:44,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:03:44,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:03:44,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:03:44,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:03:44,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:03:44,138 INFO L87 Difference]: Start difference. First operand 24187 states and 38644 transitions. Second operand 11 states. [2019-09-08 04:03:52,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:03:52,894 INFO L93 Difference]: Finished difference Result 54862 states and 88973 transitions. [2019-09-08 04:03:52,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 04:03:52,894 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 163 [2019-09-08 04:03:52,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:03:53,027 INFO L225 Difference]: With dead ends: 54862 [2019-09-08 04:03:53,027 INFO L226 Difference]: Without dead ends: 31901 [2019-09-08 04:03:53,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-09-08 04:03:53,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31901 states. [2019-09-08 04:03:54,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31901 to 29515. [2019-09-08 04:03:54,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29515 states. [2019-09-08 04:03:54,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29515 states to 29515 states and 46471 transitions. [2019-09-08 04:03:54,573 INFO L78 Accepts]: Start accepts. Automaton has 29515 states and 46471 transitions. Word has length 163 [2019-09-08 04:03:54,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:03:54,574 INFO L475 AbstractCegarLoop]: Abstraction has 29515 states and 46471 transitions. [2019-09-08 04:03:54,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:03:54,574 INFO L276 IsEmpty]: Start isEmpty. Operand 29515 states and 46471 transitions. [2019-09-08 04:03:54,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 04:03:54,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:03:54,580 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:03:54,580 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:03:54,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:03:54,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1165633931, now seen corresponding path program 1 times [2019-09-08 04:03:54,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:03:54,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:03:54,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:54,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:03:54,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:03:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:03:54,727 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 04:03:54,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:03:54,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:03:54,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:03:54,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:03:54,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:03:54,728 INFO L87 Difference]: Start difference. First operand 29515 states and 46471 transitions. Second operand 4 states. [2019-09-08 04:03:58,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:03:58,368 INFO L93 Difference]: Finished difference Result 81686 states and 134050 transitions. [2019-09-08 04:03:58,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:03:58,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-08 04:03:58,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:03:58,588 INFO L225 Difference]: With dead ends: 81686 [2019-09-08 04:03:58,588 INFO L226 Difference]: Without dead ends: 52237 [2019-09-08 04:03:58,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-09-08 04:03:58,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52237 states. [2019-09-08 04:04:02,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52237 to 51669. [2019-09-08 04:04:02,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51669 states. [2019-09-08 04:04:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51669 states to 51669 states and 83688 transitions. [2019-09-08 04:04:02,648 INFO L78 Accepts]: Start accepts. Automaton has 51669 states and 83688 transitions. Word has length 161 [2019-09-08 04:04:02,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:04:02,649 INFO L475 AbstractCegarLoop]: Abstraction has 51669 states and 83688 transitions. [2019-09-08 04:04:02,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:04:02,649 INFO L276 IsEmpty]: Start isEmpty. Operand 51669 states and 83688 transitions. [2019-09-08 04:04:02,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 04:04:02,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:04:02,653 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:04:02,653 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:04:02,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:04:02,653 INFO L82 PathProgramCache]: Analyzing trace with hash -424333131, now seen corresponding path program 1 times [2019-09-08 04:04:02,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:04:02,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:04:02,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:04:02,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:04:02,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:04:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:04:02,779 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 04:04:02,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:04:02,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:04:02,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:04:02,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:04:02,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:04:02,781 INFO L87 Difference]: Start difference. First operand 51669 states and 83688 transitions. Second operand 4 states. [2019-09-08 04:04:07,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:04:07,699 INFO L93 Difference]: Finished difference Result 151715 states and 266500 transitions. [2019-09-08 04:04:07,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:04:07,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-09-08 04:04:07,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:04:11,017 INFO L225 Difference]: With dead ends: 151715 [2019-09-08 04:04:11,018 INFO L226 Difference]: Without dead ends: 100112 [2019-09-08 04:04:11,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-09-08 04:04:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100112 states. [2019-09-08 04:04:14,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100112 to 98863. [2019-09-08 04:04:14,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98863 states. [2019-09-08 04:04:15,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98863 states to 98863 states and 170108 transitions. [2019-09-08 04:04:15,238 INFO L78 Accepts]: Start accepts. Automaton has 98863 states and 170108 transitions. Word has length 164 [2019-09-08 04:04:15,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:04:15,239 INFO L475 AbstractCegarLoop]: Abstraction has 98863 states and 170108 transitions. [2019-09-08 04:04:15,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:04:15,239 INFO L276 IsEmpty]: Start isEmpty. Operand 98863 states and 170108 transitions. [2019-09-08 04:04:15,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-08 04:04:15,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:04:15,243 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:04:15,244 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:04:15,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:04:15,244 INFO L82 PathProgramCache]: Analyzing trace with hash -853934291, now seen corresponding path program 1 times [2019-09-08 04:04:15,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:04:15,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:04:15,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:04:15,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:04:15,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:04:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:04:15,349 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 04:04:15,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:04:15,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:04:15,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:04:15,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:04:15,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:04:15,351 INFO L87 Difference]: Start difference. First operand 98863 states and 170108 transitions. Second operand 4 states. [2019-09-08 04:04:28,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:04:28,168 INFO L93 Difference]: Finished difference Result 302858 states and 603638 transitions. [2019-09-08 04:04:28,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:04:28,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-08 04:04:28,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:04:29,524 INFO L225 Difference]: With dead ends: 302858 [2019-09-08 04:04:29,524 INFO L226 Difference]: Without dead ends: 204061 [2019-09-08 04:04:29,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-09-08 04:04:30,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204061 states. [2019-09-08 04:04:45,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204061 to 201147. [2019-09-08 04:04:45,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201147 states. [2019-09-08 04:04:46,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201147 states to 201147 states and 386597 transitions. [2019-09-08 04:04:46,858 INFO L78 Accepts]: Start accepts. Automaton has 201147 states and 386597 transitions. Word has length 163 [2019-09-08 04:04:46,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:04:46,858 INFO L475 AbstractCegarLoop]: Abstraction has 201147 states and 386597 transitions. [2019-09-08 04:04:46,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:04:46,859 INFO L276 IsEmpty]: Start isEmpty. Operand 201147 states and 386597 transitions. [2019-09-08 04:04:46,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 04:04:46,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:04:46,864 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:04:46,864 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:04:46,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:04:46,864 INFO L82 PathProgramCache]: Analyzing trace with hash -703453984, now seen corresponding path program 1 times [2019-09-08 04:04:46,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:04:46,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:04:46,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:04:46,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:04:46,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:04:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:04:46,976 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 04:04:46,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:04:46,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:04:46,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:04:46,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:04:46,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:04:46,978 INFO L87 Difference]: Start difference. First operand 201147 states and 386597 transitions. Second operand 4 states. [2019-09-08 04:05:29,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:05:29,024 INFO L93 Difference]: Finished difference Result 635967 states and 1565351 transitions. [2019-09-08 04:05:29,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:05:29,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-09-08 04:05:29,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:05:32,748 INFO L225 Difference]: With dead ends: 635967 [2019-09-08 04:05:32,748 INFO L226 Difference]: Without dead ends: 434886 [2019-09-08 04:05:33,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-09-08 04:05:35,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434886 states. [2019-09-08 04:06:14,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434886 to 427731. [2019-09-08 04:06:14,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427731 states. [2019-09-08 04:06:33,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427731 states to 427731 states and 988914 transitions. [2019-09-08 04:06:33,264 INFO L78 Accepts]: Start accepts. Automaton has 427731 states and 988914 transitions. Word has length 164 [2019-09-08 04:06:33,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:06:33,265 INFO L475 AbstractCegarLoop]: Abstraction has 427731 states and 988914 transitions. [2019-09-08 04:06:33,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:06:33,265 INFO L276 IsEmpty]: Start isEmpty. Operand 427731 states and 988914 transitions. [2019-09-08 04:06:33,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 04:06:33,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:06:33,275 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:06:33,275 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:06:33,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:06:33,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1785988216, now seen corresponding path program 1 times [2019-09-08 04:06:33,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:06:33,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:06:33,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:33,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:06:33,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:06:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:06:33,390 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 04:06:33,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:06:33,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:06:33,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:06:33,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:06:33,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:06:33,392 INFO L87 Difference]: Start difference. First operand 427731 states and 988914 transitions. Second operand 4 states.