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/email_spec7_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 05:38:47,899 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:38:47,901 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:38:47,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:38:47,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:38:47,914 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:38:47,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:38:47,917 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:38:47,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:38:47,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:38:47,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:38:47,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:38:47,922 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:38:47,923 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:38:47,924 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:38:47,925 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:38:47,926 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:38:47,927 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:38:47,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:38:47,930 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:38:47,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:38:47,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:38:47,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:38:47,935 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:38:47,938 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:38:47,938 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:38:47,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:38:47,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:38:47,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:38:47,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:38:47,942 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:38:47,942 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:38:47,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:38:47,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:38:47,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:38:47,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:38:47,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:38:47,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:38:47,946 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:38:47,947 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:38:47,948 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:38:47,949 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 05:38:47,974 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:38:47,975 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:38:47,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:38:47,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:38:47,978 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:38:47,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:38:47,979 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:38:47,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:38:47,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:38:47,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:38:47,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:38:47,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:38:47,981 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:38:47,981 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:38:47,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:38:47,981 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:38:47,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:38:47,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:38:47,982 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:38:47,982 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:38:47,983 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:38:47,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:38:47,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:38:47,984 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:38:47,984 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:38:47,984 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:38:47,984 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:38:47,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:38:47,985 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:38:48,014 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:38:48,030 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:38:48,033 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:38:48,034 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:38:48,037 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:38:48,037 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec7_productSimulator.cil.c [2019-09-08 05:38:48,096 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/932f06f3f/2763d0bca8af4227ad0b845850f52bdb/FLAGb63b25e72 [2019-09-08 05:38:48,738 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:38:48,738 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec7_productSimulator.cil.c [2019-09-08 05:38:48,760 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/932f06f3f/2763d0bca8af4227ad0b845850f52bdb/FLAGb63b25e72 [2019-09-08 05:38:48,912 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/932f06f3f/2763d0bca8af4227ad0b845850f52bdb [2019-09-08 05:38:48,922 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:38:48,924 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:38:48,925 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:38:48,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:38:48,929 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:38:48,930 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:38:48" (1/1) ... [2019-09-08 05:38:48,933 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75fca47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:38:48, skipping insertion in model container [2019-09-08 05:38:48,933 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:38:48" (1/1) ... [2019-09-08 05:38:48,941 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:38:49,024 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:38:49,852 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:38:49,874 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:38:50,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:38:50,203 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:38:50,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:38:50 WrapperNode [2019-09-08 05:38:50,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:38:50,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:38:50,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:38:50,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:38:50,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:38:50" (1/1) ... [2019-09-08 05:38:50,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:38:50" (1/1) ... [2019-09-08 05:38:50,258 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:38:50" (1/1) ... [2019-09-08 05:38:50,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:38:50" (1/1) ... [2019-09-08 05:38:50,323 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:38:50" (1/1) ... [2019-09-08 05:38:50,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:38:50" (1/1) ... [2019-09-08 05:38:50,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:38:50" (1/1) ... [2019-09-08 05:38:50,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:38:50,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:38:50,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:38:50,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:38:50,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:38:50" (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 05:38:50,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:38:50,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:38:50,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:38:50,531 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:38:50,532 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2019-09-08 05:38:50,533 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Encrypt [2019-09-08 05:38:50,533 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2019-09-08 05:38:50,533 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__AddressBook [2019-09-08 05:38:50,533 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2019-09-08 05:38:50,534 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Sign [2019-09-08 05:38:50,534 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:38:50,534 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:38:50,535 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2019-09-08 05:38:50,535 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__AutoResponder [2019-09-08 05:38:50,536 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2019-09-08 05:38:50,536 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Forward [2019-09-08 05:38:50,539 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2019-09-08 05:38:50,539 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Verify [2019-09-08 05:38:50,539 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2019-09-08 05:38:50,540 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Decrypt [2019-09-08 05:38:50,540 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:38:50,541 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:38:50,541 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:38:50,541 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:38:50,541 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:38:50,542 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:38:50,542 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:38:50,542 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:38:50,542 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:38:50,542 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-08 05:38:50,543 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 05:38:50,543 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 05:38:50,543 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-08 05:38:50,544 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 05:38:50,544 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:38:50,544 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:38:50,544 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:38:50,545 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:38:50,545 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:38:50,545 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:38:50,545 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:38:50,546 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:38:50,546 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:38:50,546 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:38:50,547 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:38:50,547 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:38:50,548 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:38:50,548 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:38:50,548 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:38:50,548 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:38:50,549 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:38:50,549 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:38:50,549 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:38:50,549 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:38:50,550 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:38:50,550 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2019-09-08 05:38:50,550 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__role__Keys [2019-09-08 05:38:50,550 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:38:50,550 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2019-09-08 05:38:50,551 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__role__Keys [2019-09-08 05:38:50,551 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:38:50,551 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2019-09-08 05:38:50,551 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__role__Keys [2019-09-08 05:38:50,552 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:38:50,552 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:38:50,552 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:38:50,553 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:38:50,553 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:38:50,553 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:38:50,554 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:38:50,554 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:38:50,554 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:38:50,554 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:38:50,555 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:38:50,555 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:38:50,556 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:38:50,556 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:38:50,556 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-08 05:38:50,556 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 05:38:50,557 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-08 05:38:50,557 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptVerify_spec__1 [2019-09-08 05:38:50,557 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2019-09-08 05:38:50,558 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Encrypt [2019-09-08 05:38:50,558 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2019-09-08 05:38:50,558 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Sign [2019-09-08 05:38:50,558 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2019-09-08 05:38:50,559 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Verify [2019-09-08 05:38:50,559 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:38:50,560 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2019-09-08 05:38:50,560 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__role__Encrypt [2019-09-08 05:38:50,561 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:38:50,562 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:38:50,562 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:38:50,562 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:38:50,562 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:38:50,563 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:38:50,563 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:38:50,563 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:38:50,563 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:38:50,564 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:38:50,564 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:38:50,564 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:38:50,564 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:38:50,565 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:38:50,565 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:38:50,565 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:38:50,565 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:38:50,566 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:38:50,566 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:38:50,566 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:38:50,566 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:38:50,566 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:38:50,567 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:38:50,567 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:38:50,567 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:38:50,567 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:38:50,568 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:38:50,568 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:38:50,568 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:38:50,569 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:38:50,569 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:38:50,570 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:38:50,570 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:38:50,570 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:38:50,571 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:38:50,571 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:38:50,571 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:38:50,572 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:38:50,572 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:38:50,572 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:38:50,572 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:38:50,573 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:38:50,573 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:38:50,573 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:38:50,573 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:38:50,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:38:50,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:38:50,574 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:38:50,575 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:38:50,575 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:38:50,579 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:38:50,580 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:38:50,580 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:38:50,581 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:38:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:38:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:38:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:38:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:38:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:38:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:38:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:38:50,590 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:38:50,590 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:38:50,590 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:38:50,590 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:38:50,590 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:38:50,591 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:38:50,591 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:38:50,591 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:38:50,591 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:38:50,613 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:38:50,613 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:38:50,613 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:38:50,614 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:38:50,614 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:38:50,614 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:38:50,614 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:38:50,614 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:38:50,614 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:38:50,614 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:38:50,614 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:38:50,614 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:38:50,615 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:38:50,615 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:38:50,615 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:38:50,615 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:38:50,615 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-08 05:38:50,615 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 05:38:50,615 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 05:38:50,615 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-08 05:38:50,616 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 05:38:50,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:38:50,616 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2019-09-08 05:38:50,616 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Encrypt [2019-09-08 05:38:50,616 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2019-09-08 05:38:50,616 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__AddressBook [2019-09-08 05:38:50,616 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2019-09-08 05:38:50,617 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Sign [2019-09-08 05:38:50,617 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2019-09-08 05:38:50,617 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__AutoResponder [2019-09-08 05:38:50,617 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2019-09-08 05:38:50,617 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Forward [2019-09-08 05:38:50,617 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2019-09-08 05:38:50,618 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Verify [2019-09-08 05:38:50,618 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2019-09-08 05:38:50,618 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Decrypt [2019-09-08 05:38:50,618 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptVerify_spec__1 [2019-09-08 05:38:50,618 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:38:50,619 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:38:50,619 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:38:50,619 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:38:50,619 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:38:50,619 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:38:50,619 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:38:50,619 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:38:50,620 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:38:50,620 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:38:50,620 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:38:50,620 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:38:50,620 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:38:50,620 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:38:50,620 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:38:50,621 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:38:50,621 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:38:50,621 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:38:50,622 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:38:50,622 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:38:50,622 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:38:50,622 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:38:50,623 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:38:50,623 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:38:50,623 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:38:50,623 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:38:50,623 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:38:50,623 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:38:50,623 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:38:50,624 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:38:50,624 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:38:50,624 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:38:50,624 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:38:50,624 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:38:50,624 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:38:50,624 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:38:50,625 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:38:50,625 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:38:50,625 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:38:50,625 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-08 05:38:50,625 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 05:38:50,625 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-08 05:38:50,625 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2019-09-08 05:38:50,625 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__role__Keys [2019-09-08 05:38:50,626 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2019-09-08 05:38:50,626 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__role__Keys [2019-09-08 05:38:50,626 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2019-09-08 05:38:50,626 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__role__Keys [2019-09-08 05:38:50,626 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:38:50,626 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:38:50,626 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2019-09-08 05:38:50,626 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Encrypt [2019-09-08 05:38:50,627 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2019-09-08 05:38:50,627 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Sign [2019-09-08 05:38:50,627 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2019-09-08 05:38:50,627 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Verify [2019-09-08 05:38:50,627 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2019-09-08 05:38:50,627 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__role__Encrypt [2019-09-08 05:38:50,627 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:38:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:38:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:38:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:38:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:38:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:38:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:38:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:38:50,628 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:38:50,629 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:38:50,629 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:38:50,630 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:38:50,634 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:38:50,634 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:38:50,634 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:38:50,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:38:50,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:38:50,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:38:50,638 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:38:50,638 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:38:50,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:38:50,639 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:38:50,639 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:38:50,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:38:50,639 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:38:50,639 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:38:50,639 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:38:50,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:38:50,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:38:50,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:38:53,022 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:38:53,023 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:38:53,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:38:53 BoogieIcfgContainer [2019-09-08 05:38:53,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:38:53,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:38:53,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:38:53,029 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:38:53,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:38:48" (1/3) ... [2019-09-08 05:38:53,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fbb26ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:38:53, skipping insertion in model container [2019-09-08 05:38:53,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:38:50" (2/3) ... [2019-09-08 05:38:53,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fbb26ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:38:53, skipping insertion in model container [2019-09-08 05:38:53,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:38:53" (3/3) ... [2019-09-08 05:38:53,033 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec7_productSimulator.cil.c [2019-09-08 05:38:53,043 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:38:53,052 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:38:53,070 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:38:53,114 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:38:53,115 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:38:53,115 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:38:53,115 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:38:53,115 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:38:53,115 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:38:53,116 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:38:53,116 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:38:53,116 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:38:53,157 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states. [2019-09-08 05:38:53,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-08 05:38:53,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:38:53,190 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 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 05:38:53,193 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:38:53,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:38:53,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1981240698, now seen corresponding path program 1 times [2019-09-08 05:38:53,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:38:53,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:38:53,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:53,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:38:53,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:38:53,947 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-08 05:38:53,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:38:53,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:38:53,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:38:53,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:38:53,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:38:53,973 INFO L87 Difference]: Start difference. First operand 810 states. Second operand 6 states. [2019-09-08 05:38:54,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:38:54,219 INFO L93 Difference]: Finished difference Result 1538 states and 2131 transitions. [2019-09-08 05:38:54,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:38:54,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 190 [2019-09-08 05:38:54,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:38:54,261 INFO L225 Difference]: With dead ends: 1538 [2019-09-08 05:38:54,261 INFO L226 Difference]: Without dead ends: 781 [2019-09-08 05:38:54,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:38:54,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2019-09-08 05:38:54,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 781. [2019-09-08 05:38:54,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-09-08 05:38:54,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1063 transitions. [2019-09-08 05:38:54,444 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1063 transitions. Word has length 190 [2019-09-08 05:38:54,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:38:54,452 INFO L475 AbstractCegarLoop]: Abstraction has 781 states and 1063 transitions. [2019-09-08 05:38:54,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:38:54,452 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1063 transitions. [2019-09-08 05:38:54,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-08 05:38:54,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:38:54,467 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:38:54,468 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:38:54,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:38:54,468 INFO L82 PathProgramCache]: Analyzing trace with hash 109619264, now seen corresponding path program 1 times [2019-09-08 05:38:54,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:38:54,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:38:54,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:54,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:38:54,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:38:54,706 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-08 05:38:54,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:38:54,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 05:38:54,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 05:38:54,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 05:38:54,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 05:38:54,710 INFO L87 Difference]: Start difference. First operand 781 states and 1063 transitions. Second operand 4 states. [2019-09-08 05:38:55,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:38:55,679 INFO L93 Difference]: Finished difference Result 1519 states and 2091 transitions. [2019-09-08 05:38:55,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 05:38:55,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2019-09-08 05:38:55,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:38:55,694 INFO L225 Difference]: With dead ends: 1519 [2019-09-08 05:38:55,694 INFO L226 Difference]: Without dead ends: 782 [2019-09-08 05:38:55,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 05:38:55,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2019-09-08 05:38:55,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2019-09-08 05:38:55,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-09-08 05:38:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1058 transitions. [2019-09-08 05:38:55,763 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1058 transitions. Word has length 196 [2019-09-08 05:38:55,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:38:55,763 INFO L475 AbstractCegarLoop]: Abstraction has 782 states and 1058 transitions. [2019-09-08 05:38:55,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 05:38:55,764 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1058 transitions. [2019-09-08 05:38:55,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-08 05:38:55,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:38:55,771 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:38:55,771 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:38:55,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:38:55,772 INFO L82 PathProgramCache]: Analyzing trace with hash 818687885, now seen corresponding path program 1 times [2019-09-08 05:38:55,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:38:55,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:38:55,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:55,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:38:55,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:38:56,042 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-08 05:38:56,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:38:56,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:38:56,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:38:56,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:38:56,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:38:56,045 INFO L87 Difference]: Start difference. First operand 782 states and 1058 transitions. Second operand 3 states. [2019-09-08 05:38:56,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:38:56,177 INFO L93 Difference]: Finished difference Result 2222 states and 3067 transitions. [2019-09-08 05:38:56,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:38:56,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-09-08 05:38:56,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:38:56,191 INFO L225 Difference]: With dead ends: 2222 [2019-09-08 05:38:56,191 INFO L226 Difference]: Without dead ends: 1485 [2019-09-08 05:38:56,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:38:56,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2019-09-08 05:38:56,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1482. [2019-09-08 05:38:56,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1482 states. [2019-09-08 05:38:56,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2031 transitions. [2019-09-08 05:38:56,288 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2031 transitions. Word has length 197 [2019-09-08 05:38:56,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:38:56,288 INFO L475 AbstractCegarLoop]: Abstraction has 1482 states and 2031 transitions. [2019-09-08 05:38:56,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:38:56,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2031 transitions. [2019-09-08 05:38:56,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-08 05:38:56,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:38:56,299 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:38:56,299 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:38:56,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:38:56,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1701488253, now seen corresponding path program 1 times [2019-09-08 05:38:56,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:38:56,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:38:56,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:56,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:38:56,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:38:56,446 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-08 05:38:56,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:38:56,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:38:56,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:38:56,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:38:56,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:38:56,449 INFO L87 Difference]: Start difference. First operand 1482 states and 2031 transitions. Second operand 3 states. [2019-09-08 05:38:56,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:38:56,606 INFO L93 Difference]: Finished difference Result 1485 states and 2033 transitions. [2019-09-08 05:38:56,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:38:56,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-09-08 05:38:56,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:38:56,615 INFO L225 Difference]: With dead ends: 1485 [2019-09-08 05:38:56,615 INFO L226 Difference]: Without dead ends: 783 [2019-09-08 05:38:56,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:38:56,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2019-09-08 05:38:56,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 783. [2019-09-08 05:38:56,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-08 05:38:56,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1052 transitions. [2019-09-08 05:38:56,685 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1052 transitions. Word has length 198 [2019-09-08 05:38:56,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:38:56,687 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1052 transitions. [2019-09-08 05:38:56,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:38:56,688 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1052 transitions. [2019-09-08 05:38:56,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-08 05:38:56,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:38:56,696 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:38:56,696 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:38:56,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:38:56,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1151446893, now seen corresponding path program 1 times [2019-09-08 05:38:56,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:38:56,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:38:56,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:56,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:38:56,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:38:57,020 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-08 05:38:57,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:38:57,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 05:38:57,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 05:38:57,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 05:38:57,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 05:38:57,024 INFO L87 Difference]: Start difference. First operand 783 states and 1052 transitions. Second operand 4 states. [2019-09-08 05:38:57,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:38:57,862 INFO L93 Difference]: Finished difference Result 1503 states and 2028 transitions. [2019-09-08 05:38:57,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 05:38:57,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2019-09-08 05:38:57,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:38:57,869 INFO L225 Difference]: With dead ends: 1503 [2019-09-08 05:38:57,869 INFO L226 Difference]: Without dead ends: 789 [2019-09-08 05:38:57,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 05:38:57,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-09-08 05:38:57,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 783. [2019-09-08 05:38:57,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-09-08 05:38:57,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1037 transitions. [2019-09-08 05:38:57,905 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1037 transitions. Word has length 212 [2019-09-08 05:38:57,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:38:57,906 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1037 transitions. [2019-09-08 05:38:57,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 05:38:57,906 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1037 transitions. [2019-09-08 05:38:57,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 05:38:57,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:38:57,911 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:38:57,911 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:38:57,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:38:57,912 INFO L82 PathProgramCache]: Analyzing trace with hash 881915616, now seen corresponding path program 1 times [2019-09-08 05:38:57,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:38:57,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:38:57,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:57,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:38:57,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:38:58,174 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-08 05:38:58,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:38:58,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:38:58,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:38:58,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:38:58,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:38:58,176 INFO L87 Difference]: Start difference. First operand 783 states and 1037 transitions. Second operand 3 states. [2019-09-08 05:38:58,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:38:58,218 INFO L93 Difference]: Finished difference Result 1213 states and 1589 transitions. [2019-09-08 05:38:58,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:38:58,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-08 05:38:58,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:38:58,224 INFO L225 Difference]: With dead ends: 1213 [2019-09-08 05:38:58,224 INFO L226 Difference]: Without dead ends: 786 [2019-09-08 05:38:58,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:38:58,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2019-09-08 05:38:58,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 785. [2019-09-08 05:38:58,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2019-09-08 05:38:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1039 transitions. [2019-09-08 05:38:58,260 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1039 transitions. Word has length 239 [2019-09-08 05:38:58,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:38:58,261 INFO L475 AbstractCegarLoop]: Abstraction has 785 states and 1039 transitions. [2019-09-08 05:38:58,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:38:58,262 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1039 transitions. [2019-09-08 05:38:58,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-08 05:38:58,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:38:58,267 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:38:58,267 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:38:58,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:38:58,267 INFO L82 PathProgramCache]: Analyzing trace with hash -159986652, now seen corresponding path program 1 times [2019-09-08 05:38:58,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:38:58,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:38:58,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:58,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:38:58,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:38:58,467 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-08 05:38:58,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:38:58,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:38:58,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:38:58,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:38:58,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:38:58,470 INFO L87 Difference]: Start difference. First operand 785 states and 1039 transitions. Second operand 3 states. [2019-09-08 05:38:58,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:38:58,559 INFO L93 Difference]: Finished difference Result 1502 states and 2030 transitions. [2019-09-08 05:38:58,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:38:58,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 247 [2019-09-08 05:38:58,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:38:58,574 INFO L225 Difference]: With dead ends: 1502 [2019-09-08 05:38:58,574 INFO L226 Difference]: Without dead ends: 840 [2019-09-08 05:38:58,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:38:58,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2019-09-08 05:38:58,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 839. [2019-09-08 05:38:58,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-09-08 05:38:58,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1127 transitions. [2019-09-08 05:38:58,655 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1127 transitions. Word has length 247 [2019-09-08 05:38:58,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:38:58,656 INFO L475 AbstractCegarLoop]: Abstraction has 839 states and 1127 transitions. [2019-09-08 05:38:58,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:38:58,657 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1127 transitions. [2019-09-08 05:38:58,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-08 05:38:58,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:38:58,666 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:38:58,666 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:38:58,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:38:58,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1666613841, now seen corresponding path program 1 times [2019-09-08 05:38:58,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:38:58,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:38:58,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:58,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:38:58,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:38:59,115 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-08 05:38:59,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:38:59,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 05:38:59,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:38:59,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:38:59,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:38:59,117 INFO L87 Difference]: Start difference. First operand 839 states and 1127 transitions. Second operand 9 states. [2019-09-08 05:38:59,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:38:59,421 INFO L93 Difference]: Finished difference Result 846 states and 1136 transitions. [2019-09-08 05:38:59,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:38:59,422 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 248 [2019-09-08 05:38:59,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:38:59,428 INFO L225 Difference]: With dead ends: 846 [2019-09-08 05:38:59,428 INFO L226 Difference]: Without dead ends: 843 [2019-09-08 05:38:59,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-09-08 05:38:59,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2019-09-08 05:38:59,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 843. [2019-09-08 05:38:59,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2019-09-08 05:38:59,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1133 transitions. [2019-09-08 05:38:59,468 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1133 transitions. Word has length 248 [2019-09-08 05:38:59,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:38:59,469 INFO L475 AbstractCegarLoop]: Abstraction has 843 states and 1133 transitions. [2019-09-08 05:38:59,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:38:59,469 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1133 transitions. [2019-09-08 05:38:59,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-08 05:38:59,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:38:59,475 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:38:59,475 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:38:59,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:38:59,476 INFO L82 PathProgramCache]: Analyzing trace with hash 316090334, now seen corresponding path program 1 times [2019-09-08 05:38:59,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:38:59,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:38:59,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:59,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:38:59,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:38:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-08 05:38:59,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:38:59,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 05:38:59,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 05:38:59,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 05:38:59,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 05:38:59,713 INFO L87 Difference]: Start difference. First operand 843 states and 1133 transitions. Second operand 4 states. [2019-09-08 05:39:01,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:01,086 INFO L93 Difference]: Finished difference Result 2393 states and 3294 transitions. [2019-09-08 05:39:01,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 05:39:01,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 255 [2019-09-08 05:39:01,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:01,092 INFO L225 Difference]: With dead ends: 2393 [2019-09-08 05:39:01,092 INFO L226 Difference]: Without dead ends: 838 [2019-09-08 05:39:01,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 05:39:01,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-09-08 05:39:01,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2019-09-08 05:39:01,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-09-08 05:39:01,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1117 transitions. [2019-09-08 05:39:01,136 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1117 transitions. Word has length 255 [2019-09-08 05:39:01,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:01,136 INFO L475 AbstractCegarLoop]: Abstraction has 838 states and 1117 transitions. [2019-09-08 05:39:01,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 05:39:01,137 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1117 transitions. [2019-09-08 05:39:01,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-09-08 05:39:01,142 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:01,142 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:39:01,142 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:01,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:01,143 INFO L82 PathProgramCache]: Analyzing trace with hash 2003629459, now seen corresponding path program 1 times [2019-09-08 05:39:01,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:01,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:01,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:01,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:01,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:01,311 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-08 05:39:01,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:01,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:39:01,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:39:01,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:39:01,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:39:01,313 INFO L87 Difference]: Start difference. First operand 838 states and 1117 transitions. Second operand 3 states. [2019-09-08 05:39:01,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:01,435 INFO L93 Difference]: Finished difference Result 1625 states and 2191 transitions. [2019-09-08 05:39:01,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:39:01,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 273 [2019-09-08 05:39:01,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:01,441 INFO L225 Difference]: With dead ends: 1625 [2019-09-08 05:39:01,441 INFO L226 Difference]: Without dead ends: 837 [2019-09-08 05:39:01,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:39:01,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2019-09-08 05:39:01,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2019-09-08 05:39:01,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-08 05:39:01,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1113 transitions. [2019-09-08 05:39:01,488 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1113 transitions. Word has length 273 [2019-09-08 05:39:01,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:01,489 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1113 transitions. [2019-09-08 05:39:01,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:39:01,489 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1113 transitions. [2019-09-08 05:39:01,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-09-08 05:39:01,495 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:01,495 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:39:01,496 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:01,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:01,496 INFO L82 PathProgramCache]: Analyzing trace with hash -953455789, now seen corresponding path program 1 times [2019-09-08 05:39:01,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:01,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:01,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:01,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:01,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:02,119 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-08 05:39:02,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:02,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 05:39:02,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 05:39:02,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 05:39:02,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2019-09-08 05:39:02,121 INFO L87 Difference]: Start difference. First operand 837 states and 1113 transitions. Second operand 21 states. [2019-09-08 05:39:08,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:08,710 INFO L93 Difference]: Finished difference Result 2887 states and 3928 transitions. [2019-09-08 05:39:08,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 05:39:08,711 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 283 [2019-09-08 05:39:08,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:08,725 INFO L225 Difference]: With dead ends: 2887 [2019-09-08 05:39:08,726 INFO L226 Difference]: Without dead ends: 2478 [2019-09-08 05:39:08,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1067 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=505, Invalid=3785, Unknown=0, NotChecked=0, Total=4290 [2019-09-08 05:39:08,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2019-09-08 05:39:08,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 2441. [2019-09-08 05:39:08,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2441 states. [2019-09-08 05:39:08,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 3317 transitions. [2019-09-08 05:39:08,889 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 3317 transitions. Word has length 283 [2019-09-08 05:39:08,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:08,891 INFO L475 AbstractCegarLoop]: Abstraction has 2441 states and 3317 transitions. [2019-09-08 05:39:08,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 05:39:08,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 3317 transitions. [2019-09-08 05:39:08,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-08 05:39:08,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:08,901 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:39:08,902 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:08,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:08,902 INFO L82 PathProgramCache]: Analyzing trace with hash 782051777, now seen corresponding path program 1 times [2019-09-08 05:39:08,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:08,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:08,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:08,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:08,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:09,288 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 05:39:09,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:09,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 05:39:09,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 05:39:09,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 05:39:09,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:39:09,290 INFO L87 Difference]: Start difference. First operand 2441 states and 3317 transitions. Second operand 17 states. [2019-09-08 05:39:10,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:10,027 INFO L93 Difference]: Finished difference Result 4280 states and 5786 transitions. [2019-09-08 05:39:10,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 05:39:10,028 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 284 [2019-09-08 05:39:10,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:10,045 INFO L225 Difference]: With dead ends: 4280 [2019-09-08 05:39:10,045 INFO L226 Difference]: Without dead ends: 2555 [2019-09-08 05:39:10,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2019-09-08 05:39:10,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2019-09-08 05:39:10,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 2555. [2019-09-08 05:39:10,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2555 states. [2019-09-08 05:39:10,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 3475 transitions. [2019-09-08 05:39:10,202 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 3475 transitions. Word has length 284 [2019-09-08 05:39:10,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:10,203 INFO L475 AbstractCegarLoop]: Abstraction has 2555 states and 3475 transitions. [2019-09-08 05:39:10,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 05:39:10,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 3475 transitions. [2019-09-08 05:39:10,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-08 05:39:10,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:10,211 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:39:10,211 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:10,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:10,212 INFO L82 PathProgramCache]: Analyzing trace with hash 491512210, now seen corresponding path program 1 times [2019-09-08 05:39:10,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:10,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:10,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:10,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:10,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:10,677 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-08 05:39:10,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:10,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 05:39:10,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 05:39:10,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 05:39:10,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:39:10,680 INFO L87 Difference]: Start difference. First operand 2555 states and 3475 transitions. Second operand 17 states. [2019-09-08 05:39:15,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:15,817 INFO L93 Difference]: Finished difference Result 4417 states and 6017 transitions. [2019-09-08 05:39:15,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-08 05:39:15,818 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 284 [2019-09-08 05:39:15,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:15,834 INFO L225 Difference]: With dead ends: 4417 [2019-09-08 05:39:15,835 INFO L226 Difference]: Without dead ends: 2687 [2019-09-08 05:39:15,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=273, Invalid=2697, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 05:39:15,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2687 states. [2019-09-08 05:39:15,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2650. [2019-09-08 05:39:15,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2650 states. [2019-09-08 05:39:15,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 3625 transitions. [2019-09-08 05:39:15,999 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 3625 transitions. Word has length 284 [2019-09-08 05:39:15,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:16,000 INFO L475 AbstractCegarLoop]: Abstraction has 2650 states and 3625 transitions. [2019-09-08 05:39:16,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 05:39:16,000 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 3625 transitions. [2019-09-08 05:39:16,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-08 05:39:16,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:16,008 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:39:16,009 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:16,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:16,009 INFO L82 PathProgramCache]: Analyzing trace with hash 47490106, now seen corresponding path program 1 times [2019-09-08 05:39:16,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:16,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:16,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:16,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:16,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:16,493 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-08 05:39:16,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:16,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 05:39:16,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 05:39:16,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 05:39:16,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-09-08 05:39:16,495 INFO L87 Difference]: Start difference. First operand 2650 states and 3625 transitions. Second operand 22 states. [2019-09-08 05:39:17,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:17,165 INFO L93 Difference]: Finished difference Result 4545 states and 6164 transitions. [2019-09-08 05:39:17,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 05:39:17,165 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 284 [2019-09-08 05:39:17,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:17,182 INFO L225 Difference]: With dead ends: 4545 [2019-09-08 05:39:17,182 INFO L226 Difference]: Without dead ends: 2697 [2019-09-08 05:39:17,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2019-09-08 05:39:17,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-09-08 05:39:17,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2695. [2019-09-08 05:39:17,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2695 states. [2019-09-08 05:39:17,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 3672 transitions. [2019-09-08 05:39:17,331 INFO L78 Accepts]: Start accepts. Automaton has 2695 states and 3672 transitions. Word has length 284 [2019-09-08 05:39:17,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:17,332 INFO L475 AbstractCegarLoop]: Abstraction has 2695 states and 3672 transitions. [2019-09-08 05:39:17,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 05:39:17,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 3672 transitions. [2019-09-08 05:39:17,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-08 05:39:17,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:17,340 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:39:17,340 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:17,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:17,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1061329622, now seen corresponding path program 1 times [2019-09-08 05:39:17,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:17,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:17,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:17,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:17,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:17,650 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 05:39:17,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:17,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:39:17,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:39:17,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:39:17,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:39:17,652 INFO L87 Difference]: Start difference. First operand 2695 states and 3672 transitions. Second operand 5 states. [2019-09-08 05:39:19,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:19,284 INFO L93 Difference]: Finished difference Result 6823 states and 9447 transitions. [2019-09-08 05:39:19,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 05:39:19,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 284 [2019-09-08 05:39:19,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:19,322 INFO L225 Difference]: With dead ends: 6823 [2019-09-08 05:39:19,322 INFO L226 Difference]: Without dead ends: 5880 [2019-09-08 05:39:19,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:39:19,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5880 states. [2019-09-08 05:39:19,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5880 to 5862. [2019-09-08 05:39:19,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5862 states. [2019-09-08 05:39:19,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5862 states to 5862 states and 8090 transitions. [2019-09-08 05:39:19,650 INFO L78 Accepts]: Start accepts. Automaton has 5862 states and 8090 transitions. Word has length 284 [2019-09-08 05:39:19,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:19,651 INFO L475 AbstractCegarLoop]: Abstraction has 5862 states and 8090 transitions. [2019-09-08 05:39:19,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:39:19,651 INFO L276 IsEmpty]: Start isEmpty. Operand 5862 states and 8090 transitions. [2019-09-08 05:39:19,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-08 05:39:19,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:19,669 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:39:19,670 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:19,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:19,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1563124105, now seen corresponding path program 1 times [2019-09-08 05:39:19,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:19,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:19,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:19,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:19,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:19,988 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 05:39:19,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:19,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:39:19,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:39:19,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:39:19,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:39:19,990 INFO L87 Difference]: Start difference. First operand 5862 states and 8090 transitions. Second operand 7 states. [2019-09-08 05:39:23,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:23,115 INFO L93 Difference]: Finished difference Result 19873 states and 30769 transitions. [2019-09-08 05:39:23,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:39:23,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 284 [2019-09-08 05:39:23,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:23,222 INFO L225 Difference]: With dead ends: 19873 [2019-09-08 05:39:23,222 INFO L226 Difference]: Without dead ends: 15286 [2019-09-08 05:39:23,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:39:23,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15286 states. [2019-09-08 05:39:24,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15286 to 15260. [2019-09-08 05:39:24,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15260 states. [2019-09-08 05:39:24,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15260 states to 15260 states and 22997 transitions. [2019-09-08 05:39:24,914 INFO L78 Accepts]: Start accepts. Automaton has 15260 states and 22997 transitions. Word has length 284 [2019-09-08 05:39:24,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:24,915 INFO L475 AbstractCegarLoop]: Abstraction has 15260 states and 22997 transitions. [2019-09-08 05:39:24,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:39:24,915 INFO L276 IsEmpty]: Start isEmpty. Operand 15260 states and 22997 transitions. [2019-09-08 05:39:24,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-09-08 05:39:24,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:24,931 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:39:24,931 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:24,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:24,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1291173616, now seen corresponding path program 1 times [2019-09-08 05:39:24,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:24,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:24,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:24,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:24,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:25,831 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 05:39:25,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:25,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2019-09-08 05:39:25,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-08 05:39:25,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-08 05:39:25,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 05:39:25,833 INFO L87 Difference]: Start difference. First operand 15260 states and 22997 transitions. Second operand 38 states. [2019-09-08 05:39:27,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:27,947 INFO L93 Difference]: Finished difference Result 30346 states and 46106 transitions. [2019-09-08 05:39:27,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-08 05:39:27,948 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 285 [2019-09-08 05:39:27,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:28,035 INFO L225 Difference]: With dead ends: 30346 [2019-09-08 05:39:28,035 INFO L226 Difference]: Without dead ends: 16451 [2019-09-08 05:39:28,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=141, Invalid=2829, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 05:39:28,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16451 states. [2019-09-08 05:39:28,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16451 to 16430. [2019-09-08 05:39:28,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16430 states. [2019-09-08 05:39:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16430 states to 16430 states and 24760 transitions. [2019-09-08 05:39:29,018 INFO L78 Accepts]: Start accepts. Automaton has 16430 states and 24760 transitions. Word has length 285 [2019-09-08 05:39:29,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:29,019 INFO L475 AbstractCegarLoop]: Abstraction has 16430 states and 24760 transitions. [2019-09-08 05:39:29,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-08 05:39:29,020 INFO L276 IsEmpty]: Start isEmpty. Operand 16430 states and 24760 transitions. [2019-09-08 05:39:29,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-08 05:39:29,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:29,034 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:39:29,034 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:29,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:29,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1368716989, now seen corresponding path program 1 times [2019-09-08 05:39:29,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:29,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:29,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:29,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:29,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:29,553 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 05:39:29,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:29,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 05:39:29,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 05:39:29,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 05:39:29,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:39:29,554 INFO L87 Difference]: Start difference. First operand 16430 states and 24760 transitions. Second operand 19 states. [2019-09-08 05:39:30,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:30,728 INFO L93 Difference]: Finished difference Result 31052 states and 48029 transitions. [2019-09-08 05:39:30,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 05:39:30,729 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 294 [2019-09-08 05:39:30,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:30,841 INFO L225 Difference]: With dead ends: 31052 [2019-09-08 05:39:30,841 INFO L226 Difference]: Without dead ends: 17247 [2019-09-08 05:39:30,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=1075, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 05:39:30,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17247 states. [2019-09-08 05:39:32,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17247 to 17247. [2019-09-08 05:39:32,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17247 states. [2019-09-08 05:39:32,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17247 states to 17247 states and 26555 transitions. [2019-09-08 05:39:32,731 INFO L78 Accepts]: Start accepts. Automaton has 17247 states and 26555 transitions. Word has length 294 [2019-09-08 05:39:32,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:32,732 INFO L475 AbstractCegarLoop]: Abstraction has 17247 states and 26555 transitions. [2019-09-08 05:39:32,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 05:39:32,733 INFO L276 IsEmpty]: Start isEmpty. Operand 17247 states and 26555 transitions. [2019-09-08 05:39:32,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-08 05:39:32,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:32,749 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:39:32,750 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:32,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:32,750 INFO L82 PathProgramCache]: Analyzing trace with hash -187844619, now seen corresponding path program 1 times [2019-09-08 05:39:32,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:32,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:32,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:32,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:32,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:33,603 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 05:39:33,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:33,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2019-09-08 05:39:33,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-08 05:39:33,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-08 05:39:33,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 05:39:33,605 INFO L87 Difference]: Start difference. First operand 17247 states and 26555 transitions. Second operand 40 states. [2019-09-08 05:39:36,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:36,164 INFO L93 Difference]: Finished difference Result 33322 states and 53941 transitions. [2019-09-08 05:39:36,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 05:39:36,165 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 294 [2019-09-08 05:39:36,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:36,257 INFO L225 Difference]: With dead ends: 33322 [2019-09-08 05:39:36,257 INFO L226 Difference]: Without dead ends: 18838 [2019-09-08 05:39:36,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=149, Invalid=3157, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 05:39:36,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18838 states. [2019-09-08 05:39:37,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18838 to 18821. [2019-09-08 05:39:37,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18821 states. [2019-09-08 05:39:37,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18821 states to 18821 states and 29278 transitions. [2019-09-08 05:39:37,464 INFO L78 Accepts]: Start accepts. Automaton has 18821 states and 29278 transitions. Word has length 294 [2019-09-08 05:39:37,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:37,465 INFO L475 AbstractCegarLoop]: Abstraction has 18821 states and 29278 transitions. [2019-09-08 05:39:37,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-08 05:39:37,465 INFO L276 IsEmpty]: Start isEmpty. Operand 18821 states and 29278 transitions. [2019-09-08 05:39:37,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-09-08 05:39:37,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:37,479 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:39:37,479 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:37,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:37,479 INFO L82 PathProgramCache]: Analyzing trace with hash -46884149, now seen corresponding path program 1 times [2019-09-08 05:39:37,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:37,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:37,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:37,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:37,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:37,730 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 05:39:37,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:37,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 05:39:37,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:39:37,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:39:37,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:39:37,732 INFO L87 Difference]: Start difference. First operand 18821 states and 29278 transitions. Second operand 11 states. [2019-09-08 05:39:38,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:38,938 INFO L93 Difference]: Finished difference Result 19034 states and 29618 transitions. [2019-09-08 05:39:38,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:39:38,938 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 289 [2019-09-08 05:39:38,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:39,032 INFO L225 Difference]: With dead ends: 19034 [2019-09-08 05:39:39,033 INFO L226 Difference]: Without dead ends: 19031 [2019-09-08 05:39:39,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:39:39,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19031 states. [2019-09-08 05:39:39,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19031 to 19031. [2019-09-08 05:39:39,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19031 states. [2019-09-08 05:39:39,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19031 states to 19031 states and 29567 transitions. [2019-09-08 05:39:39,942 INFO L78 Accepts]: Start accepts. Automaton has 19031 states and 29567 transitions. Word has length 289 [2019-09-08 05:39:39,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:39,943 INFO L475 AbstractCegarLoop]: Abstraction has 19031 states and 29567 transitions. [2019-09-08 05:39:39,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:39:39,943 INFO L276 IsEmpty]: Start isEmpty. Operand 19031 states and 29567 transitions. [2019-09-08 05:39:39,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-09-08 05:39:39,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:39,953 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:39:39,953 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:39,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:39,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1185836743, now seen corresponding path program 1 times [2019-09-08 05:39:39,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:39,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:39,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:39,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:39,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:40,142 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 05:39:40,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:40,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:39:40,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:39:40,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:39:40,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:39:40,145 INFO L87 Difference]: Start difference. First operand 19031 states and 29567 transitions. Second operand 5 states. [2019-09-08 05:39:40,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:40,905 INFO L93 Difference]: Finished difference Result 36497 states and 57626 transitions. [2019-09-08 05:39:40,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:39:40,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 294 [2019-09-08 05:39:40,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:40,971 INFO L225 Difference]: With dead ends: 36497 [2019-09-08 05:39:40,972 INFO L226 Difference]: Without dead ends: 19419 [2019-09-08 05:39:41,018 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 05:39:41,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19419 states. [2019-09-08 05:39:41,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19419 to 19185. [2019-09-08 05:39:41,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19185 states. [2019-09-08 05:39:41,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19185 states to 19185 states and 29768 transitions. [2019-09-08 05:39:41,894 INFO L78 Accepts]: Start accepts. Automaton has 19185 states and 29768 transitions. Word has length 294 [2019-09-08 05:39:41,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:41,894 INFO L475 AbstractCegarLoop]: Abstraction has 19185 states and 29768 transitions. [2019-09-08 05:39:41,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:39:41,895 INFO L276 IsEmpty]: Start isEmpty. Operand 19185 states and 29768 transitions. [2019-09-08 05:39:41,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-09-08 05:39:41,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:41,905 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:39:41,905 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:41,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:41,905 INFO L82 PathProgramCache]: Analyzing trace with hash 168481653, now seen corresponding path program 1 times [2019-09-08 05:39:41,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:41,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:41,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:41,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:41,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 05:39:42,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:42,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:39:42,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:39:42,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:39:42,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:39:42,114 INFO L87 Difference]: Start difference. First operand 19185 states and 29768 transitions. Second operand 6 states. [2019-09-08 05:39:43,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:43,952 INFO L93 Difference]: Finished difference Result 55667 states and 87353 transitions. [2019-09-08 05:39:43,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:39:43,954 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 295 [2019-09-08 05:39:43,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:44,138 INFO L225 Difference]: With dead ends: 55667 [2019-09-08 05:39:44,138 INFO L226 Difference]: Without dead ends: 38287 [2019-09-08 05:39:44,202 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:39:44,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38287 states. [2019-09-08 05:39:47,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38287 to 37776. [2019-09-08 05:39:47,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37776 states. [2019-09-08 05:39:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37776 states to 37776 states and 58355 transitions. [2019-09-08 05:39:47,205 INFO L78 Accepts]: Start accepts. Automaton has 37776 states and 58355 transitions. Word has length 295 [2019-09-08 05:39:47,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:47,206 INFO L475 AbstractCegarLoop]: Abstraction has 37776 states and 58355 transitions. [2019-09-08 05:39:47,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:39:47,206 INFO L276 IsEmpty]: Start isEmpty. Operand 37776 states and 58355 transitions. [2019-09-08 05:39:47,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 05:39:47,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:47,230 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:39:47,230 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:47,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:47,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1687729027, now seen corresponding path program 1 times [2019-09-08 05:39:47,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:47,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:47,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:47,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:47,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:47,478 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-08 05:39:47,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:47,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:39:47,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:39:47,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:39:47,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:39:47,480 INFO L87 Difference]: Start difference. First operand 37776 states and 58355 transitions. Second operand 8 states. [2019-09-08 05:39:51,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:51,209 INFO L93 Difference]: Finished difference Result 114215 states and 185361 transitions. [2019-09-08 05:39:51,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 05:39:51,210 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 314 [2019-09-08 05:39:51,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:51,651 INFO L225 Difference]: With dead ends: 114215 [2019-09-08 05:39:51,652 INFO L226 Difference]: Without dead ends: 78467 [2019-09-08 05:39:51,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:39:51,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78467 states. [2019-09-08 05:39:56,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78467 to 78128. [2019-09-08 05:39:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78128 states. [2019-09-08 05:39:57,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78128 states to 78128 states and 122657 transitions. [2019-09-08 05:39:57,274 INFO L78 Accepts]: Start accepts. Automaton has 78128 states and 122657 transitions. Word has length 314 [2019-09-08 05:39:57,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:57,275 INFO L475 AbstractCegarLoop]: Abstraction has 78128 states and 122657 transitions. [2019-09-08 05:39:57,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:39:57,275 INFO L276 IsEmpty]: Start isEmpty. Operand 78128 states and 122657 transitions. [2019-09-08 05:39:57,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-08 05:39:57,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:57,327 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:39:57,327 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:57,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:57,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1644509355, now seen corresponding path program 1 times [2019-09-08 05:39:57,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:57,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:57,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:57,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:57,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-09-08 05:39:57,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:57,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 05:39:57,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 05:39:57,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 05:39:57,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:39:57,632 INFO L87 Difference]: Start difference. First operand 78128 states and 122657 transitions. Second operand 17 states. [2019-09-08 05:40:07,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:40:07,366 INFO L93 Difference]: Finished difference Result 147351 states and 238312 transitions. [2019-09-08 05:40:07,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-08 05:40:07,366 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 315 [2019-09-08 05:40:07,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:40:07,707 INFO L225 Difference]: With dead ends: 147351 [2019-09-08 05:40:07,708 INFO L226 Difference]: Without dead ends: 76828 [2019-09-08 05:40:07,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=273, Invalid=2697, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 05:40:07,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76828 states. [2019-09-08 05:40:10,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76828 to 75883. [2019-09-08 05:40:10,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75883 states. [2019-09-08 05:40:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75883 states to 75883 states and 117363 transitions. [2019-09-08 05:40:10,975 INFO L78 Accepts]: Start accepts. Automaton has 75883 states and 117363 transitions. Word has length 315 [2019-09-08 05:40:10,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:40:10,976 INFO L475 AbstractCegarLoop]: Abstraction has 75883 states and 117363 transitions. [2019-09-08 05:40:10,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 05:40:10,976 INFO L276 IsEmpty]: Start isEmpty. Operand 75883 states and 117363 transitions. [2019-09-08 05:40:11,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 05:40:11,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:40:11,027 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:40:11,027 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:40:11,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:40:11,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1852816405, now seen corresponding path program 1 times [2019-09-08 05:40:11,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:40:11,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:40:11,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:11,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:40:11,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:40:11,254 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-09-08 05:40:11,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:40:11,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:40:11,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:40:11,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:40:11,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:40:11,256 INFO L87 Difference]: Start difference. First operand 75883 states and 117363 transitions. Second operand 7 states. [2019-09-08 05:40:24,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:40:24,023 INFO L93 Difference]: Finished difference Result 222993 states and 353838 transitions. [2019-09-08 05:40:24,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:40:24,023 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 324 [2019-09-08 05:40:24,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:40:24,668 INFO L225 Difference]: With dead ends: 222993 [2019-09-08 05:40:24,669 INFO L226 Difference]: Without dead ends: 153679 [2019-09-08 05:40:24,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:40:24,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153679 states. [2019-09-08 05:40:35,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153679 to 151200. [2019-09-08 05:40:35,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151200 states. [2019-09-08 05:40:36,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151200 states to 151200 states and 232953 transitions. [2019-09-08 05:40:36,423 INFO L78 Accepts]: Start accepts. Automaton has 151200 states and 232953 transitions. Word has length 324 [2019-09-08 05:40:36,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:40:36,423 INFO L475 AbstractCegarLoop]: Abstraction has 151200 states and 232953 transitions. [2019-09-08 05:40:36,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:40:36,424 INFO L276 IsEmpty]: Start isEmpty. Operand 151200 states and 232953 transitions. [2019-09-08 05:40:36,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 05:40:36,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:40:36,492 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:40:36,492 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:40:36,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:40:36,492 INFO L82 PathProgramCache]: Analyzing trace with hash -528163511, now seen corresponding path program 2 times [2019-09-08 05:40:36,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:40:36,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:40:36,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:36,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:40:36,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:40:36,804 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-09-08 05:40:36,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:40:36,805 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:40:36,828 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:40:37,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 05:40:37,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 05:40:37,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 3822 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 05:40:37,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:40:37,822 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-09-08 05:40:37,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:40:37,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 22 [2019-09-08 05:40:37,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 05:40:37,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 05:40:37,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2019-09-08 05:40:37,835 INFO L87 Difference]: Start difference. First operand 151200 states and 232953 transitions. Second operand 22 states. [2019-09-08 05:40:52,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:40:52,270 INFO L93 Difference]: Finished difference Result 303108 states and 467701 transitions. [2019-09-08 05:40:52,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 05:40:52,270 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 324 [2019-09-08 05:40:52,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:40:53,205 INFO L225 Difference]: With dead ends: 303108 [2019-09-08 05:40:53,205 INFO L226 Difference]: Without dead ends: 152024 [2019-09-08 05:40:53,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=1461, Unknown=0, NotChecked=0, Total=1640 [2019-09-08 05:40:53,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152024 states. [2019-09-08 05:41:01,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152024 to 151558. [2019-09-08 05:41:01,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151558 states. [2019-09-08 05:41:02,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151558 states to 151558 states and 233437 transitions. [2019-09-08 05:41:02,352 INFO L78 Accepts]: Start accepts. Automaton has 151558 states and 233437 transitions. Word has length 324 [2019-09-08 05:41:02,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:02,353 INFO L475 AbstractCegarLoop]: Abstraction has 151558 states and 233437 transitions. [2019-09-08 05:41:02,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 05:41:02,353 INFO L276 IsEmpty]: Start isEmpty. Operand 151558 states and 233437 transitions. [2019-09-08 05:41:02,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 05:41:02,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:02,557 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:41:02,557 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:02,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:02,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1800084952, now seen corresponding path program 1 times [2019-09-08 05:41:02,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:02,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:02,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:02,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:41:02,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:02,818 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-09-08 05:41:02,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:41:02,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:41:02,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:41:02,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:41:02,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:41:02,820 INFO L87 Difference]: Start difference. First operand 151558 states and 233437 transitions. Second operand 7 states. [2019-09-08 05:41:25,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:25,350 INFO L93 Difference]: Finished difference Result 442144 states and 695151 transitions. [2019-09-08 05:41:25,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:41:25,350 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 326 [2019-09-08 05:41:25,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:26,769 INFO L225 Difference]: With dead ends: 442144 [2019-09-08 05:41:26,770 INFO L226 Difference]: Without dead ends: 304617 [2019-09-08 05:41:27,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:41:27,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304617 states. [2019-09-08 05:41:47,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304617 to 299154. [2019-09-08 05:41:47,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299154 states. [2019-09-08 05:41:49,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299154 states to 299154 states and 457782 transitions. [2019-09-08 05:41:49,454 INFO L78 Accepts]: Start accepts. Automaton has 299154 states and 457782 transitions. Word has length 326 [2019-09-08 05:41:49,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:49,454 INFO L475 AbstractCegarLoop]: Abstraction has 299154 states and 457782 transitions. [2019-09-08 05:41:49,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:41:49,455 INFO L276 IsEmpty]: Start isEmpty. Operand 299154 states and 457782 transitions. [2019-09-08 05:41:49,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-08 05:41:49,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:49,636 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:41:49,636 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:49,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:49,637 INFO L82 PathProgramCache]: Analyzing trace with hash -637166982, now seen corresponding path program 1 times [2019-09-08 05:41:49,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:49,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:49,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:49,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:49,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:49,894 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-09-08 05:41:49,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:41:49,895 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:41:49,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:50,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 3742 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:41:50,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:41:50,880 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-09-08 05:41:50,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:41:50,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2019-09-08 05:41:50,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:41:50,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:41:50,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:41:50,901 INFO L87 Difference]: Start difference. First operand 299154 states and 457782 transitions. Second operand 13 states. [2019-09-08 05:42:21,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:42:21,018 INFO L93 Difference]: Finished difference Result 673002 states and 1040818 transitions. [2019-09-08 05:42:21,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 05:42:21,019 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 317 [2019-09-08 05:42:21,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:42:23,600 INFO L225 Difference]: With dead ends: 673002 [2019-09-08 05:42:23,600 INFO L226 Difference]: Without dead ends: 381929 [2019-09-08 05:42:24,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2019-09-08 05:42:24,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381929 states. [2019-09-08 05:42:52,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381929 to 375079. [2019-09-08 05:42:52,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375079 states. [2019-09-08 05:42:54,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375079 states to 375079 states and 557121 transitions. [2019-09-08 05:42:54,154 INFO L78 Accepts]: Start accepts. Automaton has 375079 states and 557121 transitions. Word has length 317 [2019-09-08 05:42:54,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:42:54,155 INFO L475 AbstractCegarLoop]: Abstraction has 375079 states and 557121 transitions. [2019-09-08 05:42:54,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:42:54,155 INFO L276 IsEmpty]: Start isEmpty. Operand 375079 states and 557121 transitions. [2019-09-08 05:42:56,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-09-08 05:42:56,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:42:56,212 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:42:56,212 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:42:56,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:42:56,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1137711334, now seen corresponding path program 1 times [2019-09-08 05:42:56,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:42:56,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:42:56,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:56,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:42:56,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:42:56,422 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-09-08 05:42:56,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:42:56,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:42:56,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:42:56,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:42:56,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:42:56,424 INFO L87 Difference]: Start difference. First operand 375079 states and 557121 transitions. Second operand 3 states. [2019-09-08 05:43:19,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:43:19,172 INFO L93 Difference]: Finished difference Result 754745 states and 1123389 transitions. [2019-09-08 05:43:19,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:43:19,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 353 [2019-09-08 05:43:19,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:43:20,746 INFO L225 Difference]: With dead ends: 754745 [2019-09-08 05:43:20,746 INFO L226 Difference]: Without dead ends: 380119 [2019-09-08 05:43:22,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:43:22,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380119 states. [2019-09-08 05:43:51,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380119 to 380071. [2019-09-08 05:43:51,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380071 states. [2019-09-08 05:43:53,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380071 states to 380071 states and 566673 transitions. [2019-09-08 05:43:53,357 INFO L78 Accepts]: Start accepts. Automaton has 380071 states and 566673 transitions. Word has length 353 [2019-09-08 05:43:53,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:43:53,357 INFO L475 AbstractCegarLoop]: Abstraction has 380071 states and 566673 transitions. [2019-09-08 05:43:53,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:43:53,357 INFO L276 IsEmpty]: Start isEmpty. Operand 380071 states and 566673 transitions. [2019-09-08 05:44:02,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-08 05:44:02,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:44:02,518 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:44:02,518 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:44:02,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:44:02,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1485653412, now seen corresponding path program 1 times [2019-09-08 05:44:02,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:44:02,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:44:02,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:44:02,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:44:02,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:44:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:44:02,688 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-08 05:44:02,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:44:02,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:44:02,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:44:02,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:44:02,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:44:02,691 INFO L87 Difference]: Start difference. First operand 380071 states and 566673 transitions. Second operand 3 states. [2019-09-08 05:44:20,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:44:20,198 INFO L93 Difference]: Finished difference Result 769337 states and 1151181 transitions. [2019-09-08 05:44:20,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:44:20,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 325 [2019-09-08 05:44:20,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:44:21,805 INFO L225 Difference]: With dead ends: 769337 [2019-09-08 05:44:21,805 INFO L226 Difference]: Without dead ends: 389719 [2019-09-08 05:44:32,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:44:32,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389719 states. [2019-09-08 05:44:51,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389719 to 389671. [2019-09-08 05:44:51,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389671 states. [2019-09-08 05:44:54,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389671 states to 389671 states and 584817 transitions. [2019-09-08 05:44:54,765 INFO L78 Accepts]: Start accepts. Automaton has 389671 states and 584817 transitions. Word has length 325 [2019-09-08 05:44:54,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:44:54,766 INFO L475 AbstractCegarLoop]: Abstraction has 389671 states and 584817 transitions. [2019-09-08 05:44:54,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:44:54,766 INFO L276 IsEmpty]: Start isEmpty. Operand 389671 states and 584817 transitions. [2019-09-08 05:44:54,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-09-08 05:44:54,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:44:54,998 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:44:54,998 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:44:54,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:44:54,998 INFO L82 PathProgramCache]: Analyzing trace with hash -340815518, now seen corresponding path program 1 times [2019-09-08 05:44:54,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:44:54,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:44:54,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:44:54,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:44:55,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:44:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:44:55,294 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-08 05:44:55,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:44:55,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:44:55,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:44:55,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:44:55,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:44:55,296 INFO L87 Difference]: Start difference. First operand 389671 states and 584817 transitions. Second operand 8 states. [2019-09-08 05:45:50,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:45:50,939 INFO L93 Difference]: Finished difference Result 1174059 states and 1784361 transitions. [2019-09-08 05:45:50,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:45:50,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 343 [2019-09-08 05:45:50,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:45:54,044 INFO L225 Difference]: With dead ends: 1174059 [2019-09-08 05:45:54,044 INFO L226 Difference]: Without dead ends: 784841 [2019-09-08 05:45:54,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:45:55,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784841 states. [2019-09-08 05:46:56,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784841 to 572511. [2019-09-08 05:46:56,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572511 states. [2019-09-08 05:47:00,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572511 states to 572511 states and 868521 transitions. [2019-09-08 05:47:00,326 INFO L78 Accepts]: Start accepts. Automaton has 572511 states and 868521 transitions. Word has length 343 [2019-09-08 05:47:00,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:47:00,327 INFO L475 AbstractCegarLoop]: Abstraction has 572511 states and 868521 transitions. [2019-09-08 05:47:00,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:47:00,327 INFO L276 IsEmpty]: Start isEmpty. Operand 572511 states and 868521 transitions. [2019-09-08 05:47:00,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 05:47:00,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:47:00,778 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:47:00,779 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:47:00,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:47:00,779 INFO L82 PathProgramCache]: Analyzing trace with hash -754528819, now seen corresponding path program 1 times [2019-09-08 05:47:00,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:47:00,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:47:00,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:00,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:47:00,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:47:01,926 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-08 05:47:01,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:47:01,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:47:01,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:47:01,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:47:01,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:47:01,928 INFO L87 Difference]: Start difference. First operand 572511 states and 868521 transitions. Second operand 8 states. [2019-09-08 05:48:23,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:48:23,330 INFO L93 Difference]: Finished difference Result 1729011 states and 2667825 transitions. [2019-09-08 05:48:23,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:48:23,330 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 327 [2019-09-08 05:48:23,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:48:29,304 INFO L225 Difference]: With dead ends: 1729011 [2019-09-08 05:48:29,305 INFO L226 Difference]: Without dead ends: 1156953 [2019-09-08 05:48:31,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 05:48:32,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156953 states.