/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/openssl/s3_srvr.blast.06.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 01:46:29,848 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 01:46:29,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 01:46:29,911 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 01:46:29,912 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 01:46:29,918 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 01:46:29,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 01:46:29,929 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 01:46:29,933 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 01:46:29,939 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 01:46:29,943 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 01:46:29,945 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 01:46:29,946 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 01:46:29,950 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 01:46:29,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 01:46:29,954 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 01:46:29,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 01:46:29,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 01:46:29,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 01:46:29,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 01:46:29,987 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 01:46:29,988 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 01:46:29,989 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 01:46:29,993 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 01:46:29,997 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 01:46:29,997 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 01:46:29,997 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 01:46:29,999 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 01:46:29,999 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 01:46:30,000 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 01:46:30,001 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 01:46:30,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 01:46:30,003 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 01:46:30,004 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 01:46:30,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 01:46:30,006 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 01:46:30,007 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 01:46:30,007 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 01:46:30,007 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 01:46:30,009 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 01:46:30,010 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 01:46:30,011 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 01:46:30,038 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 01:46:30,039 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 01:46:30,040 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 01:46:30,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 01:46:30,041 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 01:46:30,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 01:46:30,041 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 01:46:30,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 01:46:30,042 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 01:46:30,042 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 01:46:30,042 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 01:46:30,043 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 01:46:30,043 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 01:46:30,043 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 01:46:30,043 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 01:46:30,043 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 01:46:30,044 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 01:46:30,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 01:46:30,044 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 01:46:30,044 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 01:46:30,045 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 01:46:30,045 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 01:46:30,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 01:46:30,045 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 01:46:30,046 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 01:46:30,046 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 01:46:30,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 01:46:30,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 01:46:30,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 01:46:30,461 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 01:46:30,462 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 01:46:30,463 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.06.i.cil-1.c [2020-12-23 01:46:30,542 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ee94e0fbb/05b7b921aa914ddebea2b9acfa7ad79a/FLAG2a79e673d [2020-12-23 01:46:31,352 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 01:46:31,352 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.06.i.cil-1.c [2020-12-23 01:46:31,376 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ee94e0fbb/05b7b921aa914ddebea2b9acfa7ad79a/FLAG2a79e673d [2020-12-23 01:46:31,488 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ee94e0fbb/05b7b921aa914ddebea2b9acfa7ad79a [2020-12-23 01:46:31,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 01:46:31,496 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 01:46:31,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 01:46:31,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 01:46:31,503 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 01:46:31,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:46:31" (1/1) ... [2020-12-23 01:46:31,506 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7463da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:31, skipping insertion in model container [2020-12-23 01:46:31,506 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:46:31" (1/1) ... [2020-12-23 01:46:31,515 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 01:46:31,583 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~SSLv3_server_data~0,GLOBAL],ssl_accept] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~SSLv3_server_data~0,GLOBAL],get_ssl_method] left hand side expression in assignment: lhs: VariableLHS[~init~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[288],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[248],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~Time~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem75,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem75,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem87,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem87,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem88,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem88,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem104,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem104,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem109,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem109,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem110,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem110,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem112,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem112,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem113,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem113,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem115,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem115,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem124,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[#t~mem124,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem130,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem131,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem131,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2020-12-23 01:46:32,088 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.06.i.cil-1.c[77339,77352] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2020-12-23 01:46:32,102 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:46:32,120 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#SSLv3_server_data~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~#SSLv3_server_data~0,GLOBAL],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#SSLv3_server_data~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[148],StructAccessExpression[IdentifierExpression[~#SSLv3_server_data~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~init~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[116],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[288],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[248],StructAccessExpression[IdentifierExpression[~s~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[128],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~Time~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: lhs: VariableLHS[~cb~0,] left hand side expression in assignment: lhs: VariableLHS[~state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~buf~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem75,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem75,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~got_new_session~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~l~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem87,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem87,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem88,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[935],StructAccessExpression[IdentifierExpression[#t~mem88,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem104,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem104,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem109,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem109,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem110,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem110,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem112,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem112,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem113,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[975],StructAccessExpression[IdentifierExpression[#t~mem113,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem115,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem115,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~num1~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem124,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[192],StructAccessExpression[IdentifierExpression[#t~mem124,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: lhs: VariableLHS[~blastFlag~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem130,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem130,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem131,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[904],StructAccessExpression[IdentifierExpression[#t~mem131,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~new_state~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~s,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~s,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~skip~0,] [2020-12-23 01:46:32,344 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.06.i.cil-1.c[77339,77352] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2020-12-23 01:46:32,356 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:46:32,395 INFO L208 MainTranslator]: Completed translation [2020-12-23 01:46:32,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:32 WrapperNode [2020-12-23 01:46:32,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 01:46:32,397 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 01:46:32,397 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 01:46:32,397 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 01:46:32,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:32" (1/1) ... [2020-12-23 01:46:32,447 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:32" (1/1) ... [2020-12-23 01:46:32,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 01:46:32,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 01:46:32,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 01:46:32,514 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 01:46:32,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:32" (1/1) ... [2020-12-23 01:46:32,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:32" (1/1) ... [2020-12-23 01:46:32,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:32" (1/1) ... [2020-12-23 01:46:32,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:32" (1/1) ... [2020-12-23 01:46:32,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:32" (1/1) ... [2020-12-23 01:46:32,623 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:32" (1/1) ... [2020-12-23 01:46:32,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:32" (1/1) ... [2020-12-23 01:46:32,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 01:46:32,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 01:46:32,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 01:46:32,650 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 01:46:32,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:32" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/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 [2020-12-23 01:46:32,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 01:46:32,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 01:46:32,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 01:46:32,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 01:46:32,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 01:46:32,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 01:46:32,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 01:46:32,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 01:46:32,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 01:46:33,082 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 01:46:34,293 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2020-12-23 01:46:34,294 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2020-12-23 01:46:34,306 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 01:46:34,306 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-23 01:46:34,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:46:34 BoogieIcfgContainer [2020-12-23 01:46:34,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 01:46:34,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 01:46:34,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 01:46:34,315 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 01:46:34,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 01:46:31" (1/3) ... [2020-12-23 01:46:34,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446ba2f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:46:34, skipping insertion in model container [2020-12-23 01:46:34,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:46:32" (2/3) ... [2020-12-23 01:46:34,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446ba2f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:46:34, skipping insertion in model container [2020-12-23 01:46:34,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:46:34" (3/3) ... [2020-12-23 01:46:34,319 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.06.i.cil-1.c [2020-12-23 01:46:34,327 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 01:46:34,333 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 01:46:34,355 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 01:46:34,387 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 01:46:34,387 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 01:46:34,387 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 01:46:34,388 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 01:46:34,388 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 01:46:34,388 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 01:46:34,388 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 01:46:34,388 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 01:46:34,409 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2020-12-23 01:46:34,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-23 01:46:34,420 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:34,421 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:34,421 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:34,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:34,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1128889119, now seen corresponding path program 1 times [2020-12-23 01:46:34,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:34,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434477180] [2020-12-23 01:46:34,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:34,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434477180] [2020-12-23 01:46:34,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:34,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:34,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812374114] [2020-12-23 01:46:34,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:34,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:34,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:34,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:34,910 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 4 states. [2020-12-23 01:46:35,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:35,513 INFO L93 Difference]: Finished difference Result 345 states and 591 transitions. [2020-12-23 01:46:35,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:35,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2020-12-23 01:46:35,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:35,531 INFO L225 Difference]: With dead ends: 345 [2020-12-23 01:46:35,532 INFO L226 Difference]: Without dead ends: 174 [2020-12-23 01:46:35,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:35,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-12-23 01:46:35,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 157. [2020-12-23 01:46:35,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-12-23 01:46:35,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 248 transitions. [2020-12-23 01:46:35,597 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 248 transitions. Word has length 44 [2020-12-23 01:46:35,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:35,598 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 248 transitions. [2020-12-23 01:46:35,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:35,599 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 248 transitions. [2020-12-23 01:46:35,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-12-23 01:46:35,602 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:35,602 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 01:46:35,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 01:46:35,603 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:35,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:35,604 INFO L82 PathProgramCache]: Analyzing trace with hash -829622597, now seen corresponding path program 1 times [2020-12-23 01:46:35,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:35,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901745424] [2020-12-23 01:46:35,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:35,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901745424] [2020-12-23 01:46:35,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:35,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:35,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542043065] [2020-12-23 01:46:35,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:35,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:35,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:35,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:35,804 INFO L87 Difference]: Start difference. First operand 157 states and 248 transitions. Second operand 4 states. [2020-12-23 01:46:36,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:36,223 INFO L93 Difference]: Finished difference Result 312 states and 487 transitions. [2020-12-23 01:46:36,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:36,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2020-12-23 01:46:36,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:36,232 INFO L225 Difference]: With dead ends: 312 [2020-12-23 01:46:36,232 INFO L226 Difference]: Without dead ends: 174 [2020-12-23 01:46:36,234 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:36,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-12-23 01:46:36,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 157. [2020-12-23 01:46:36,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-12-23 01:46:36,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 247 transitions. [2020-12-23 01:46:36,263 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 247 transitions. Word has length 57 [2020-12-23 01:46:36,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:36,263 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 247 transitions. [2020-12-23 01:46:36,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:36,263 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 247 transitions. [2020-12-23 01:46:36,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-12-23 01:46:36,269 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:36,270 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:36,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 01:46:36,271 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:36,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:36,271 INFO L82 PathProgramCache]: Analyzing trace with hash -44447127, now seen corresponding path program 1 times [2020-12-23 01:46:36,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:36,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54581891] [2020-12-23 01:46:36,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:36,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:36,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54581891] [2020-12-23 01:46:36,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:36,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:36,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851838857] [2020-12-23 01:46:36,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:36,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:36,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:36,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:36,413 INFO L87 Difference]: Start difference. First operand 157 states and 247 transitions. Second operand 4 states. [2020-12-23 01:46:36,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:36,846 INFO L93 Difference]: Finished difference Result 311 states and 485 transitions. [2020-12-23 01:46:36,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:36,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-12-23 01:46:36,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:36,849 INFO L225 Difference]: With dead ends: 311 [2020-12-23 01:46:36,849 INFO L226 Difference]: Without dead ends: 173 [2020-12-23 01:46:36,850 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:36,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-12-23 01:46:36,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 157. [2020-12-23 01:46:36,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-12-23 01:46:36,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 246 transitions. [2020-12-23 01:46:36,861 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 246 transitions. Word has length 58 [2020-12-23 01:46:36,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:36,861 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 246 transitions. [2020-12-23 01:46:36,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:36,862 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 246 transitions. [2020-12-23 01:46:36,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-12-23 01:46:36,864 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:36,864 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 01:46:36,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 01:46:36,865 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:36,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:36,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1118306, now seen corresponding path program 1 times [2020-12-23 01:46:36,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:36,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448712992] [2020-12-23 01:46:36,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:36,950 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:36,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448712992] [2020-12-23 01:46:36,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:36,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:36,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877174888] [2020-12-23 01:46:36,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:36,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:36,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:36,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:36,958 INFO L87 Difference]: Start difference. First operand 157 states and 246 transitions. Second operand 4 states. [2020-12-23 01:46:37,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:37,372 INFO L93 Difference]: Finished difference Result 309 states and 482 transitions. [2020-12-23 01:46:37,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:37,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-12-23 01:46:37,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:37,376 INFO L225 Difference]: With dead ends: 309 [2020-12-23 01:46:37,376 INFO L226 Difference]: Without dead ends: 171 [2020-12-23 01:46:37,377 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:37,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-12-23 01:46:37,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 157. [2020-12-23 01:46:37,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-12-23 01:46:37,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 245 transitions. [2020-12-23 01:46:37,396 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 245 transitions. Word has length 58 [2020-12-23 01:46:37,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:37,397 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 245 transitions. [2020-12-23 01:46:37,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:37,400 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 245 transitions. [2020-12-23 01:46:37,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-12-23 01:46:37,402 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:37,402 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 01:46:37,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 01:46:37,403 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:37,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:37,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1969168478, now seen corresponding path program 1 times [2020-12-23 01:46:37,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:37,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513637368] [2020-12-23 01:46:37,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:37,541 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:37,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513637368] [2020-12-23 01:46:37,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:37,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:37,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556500182] [2020-12-23 01:46:37,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:37,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:37,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:37,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:37,548 INFO L87 Difference]: Start difference. First operand 157 states and 245 transitions. Second operand 4 states. [2020-12-23 01:46:37,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:37,919 INFO L93 Difference]: Finished difference Result 308 states and 480 transitions. [2020-12-23 01:46:37,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:37,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-12-23 01:46:37,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:37,921 INFO L225 Difference]: With dead ends: 308 [2020-12-23 01:46:37,921 INFO L226 Difference]: Without dead ends: 170 [2020-12-23 01:46:37,922 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:37,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-12-23 01:46:37,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2020-12-23 01:46:37,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-12-23 01:46:37,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 244 transitions. [2020-12-23 01:46:37,930 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 244 transitions. Word has length 58 [2020-12-23 01:46:37,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:37,931 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 244 transitions. [2020-12-23 01:46:37,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:37,931 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 244 transitions. [2020-12-23 01:46:37,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-12-23 01:46:37,932 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:37,932 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 01:46:37,933 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 01:46:37,933 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:37,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:37,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1679982507, now seen corresponding path program 1 times [2020-12-23 01:46:37,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:37,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975380019] [2020-12-23 01:46:37,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:38,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:38,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975380019] [2020-12-23 01:46:38,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:38,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:38,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717567457] [2020-12-23 01:46:38,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:38,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:38,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:38,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:38,019 INFO L87 Difference]: Start difference. First operand 157 states and 244 transitions. Second operand 4 states. [2020-12-23 01:46:38,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:38,401 INFO L93 Difference]: Finished difference Result 308 states and 479 transitions. [2020-12-23 01:46:38,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:38,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-12-23 01:46:38,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:38,408 INFO L225 Difference]: With dead ends: 308 [2020-12-23 01:46:38,408 INFO L226 Difference]: Without dead ends: 170 [2020-12-23 01:46:38,409 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:38,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-12-23 01:46:38,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2020-12-23 01:46:38,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-12-23 01:46:38,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 243 transitions. [2020-12-23 01:46:38,422 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 243 transitions. Word has length 58 [2020-12-23 01:46:38,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:38,423 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 243 transitions. [2020-12-23 01:46:38,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:38,423 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 243 transitions. [2020-12-23 01:46:38,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-23 01:46:38,424 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:38,424 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:38,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 01:46:38,425 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:38,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:38,432 INFO L82 PathProgramCache]: Analyzing trace with hash -666876654, now seen corresponding path program 1 times [2020-12-23 01:46:38,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:38,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569856553] [2020-12-23 01:46:38,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:38,546 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:38,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569856553] [2020-12-23 01:46:38,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:38,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:38,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261290936] [2020-12-23 01:46:38,548 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:38,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:38,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:38,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:38,549 INFO L87 Difference]: Start difference. First operand 157 states and 243 transitions. Second operand 4 states. [2020-12-23 01:46:38,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:38,927 INFO L93 Difference]: Finished difference Result 308 states and 478 transitions. [2020-12-23 01:46:38,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:38,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-12-23 01:46:38,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:38,930 INFO L225 Difference]: With dead ends: 308 [2020-12-23 01:46:38,930 INFO L226 Difference]: Without dead ends: 170 [2020-12-23 01:46:38,931 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:38,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-12-23 01:46:38,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2020-12-23 01:46:38,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-12-23 01:46:38,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 242 transitions. [2020-12-23 01:46:38,937 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 242 transitions. Word has length 59 [2020-12-23 01:46:38,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:38,938 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 242 transitions. [2020-12-23 01:46:38,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:38,938 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 242 transitions. [2020-12-23 01:46:38,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-23 01:46:38,939 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:38,939 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 01:46:38,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 01:46:38,939 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:38,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:38,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1227571536, now seen corresponding path program 1 times [2020-12-23 01:46:38,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:38,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658168284] [2020-12-23 01:46:38,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:39,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:39,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658168284] [2020-12-23 01:46:39,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:39,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:39,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115079134] [2020-12-23 01:46:39,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:39,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:39,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:39,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:39,017 INFO L87 Difference]: Start difference. First operand 157 states and 242 transitions. Second operand 4 states. [2020-12-23 01:46:39,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:39,355 INFO L93 Difference]: Finished difference Result 308 states and 477 transitions. [2020-12-23 01:46:39,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:39,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2020-12-23 01:46:39,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:39,357 INFO L225 Difference]: With dead ends: 308 [2020-12-23 01:46:39,357 INFO L226 Difference]: Without dead ends: 170 [2020-12-23 01:46:39,358 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:39,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-12-23 01:46:39,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2020-12-23 01:46:39,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-12-23 01:46:39,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 241 transitions. [2020-12-23 01:46:39,364 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 241 transitions. Word has length 60 [2020-12-23 01:46:39,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:39,365 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 241 transitions. [2020-12-23 01:46:39,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:39,365 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 241 transitions. [2020-12-23 01:46:39,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 01:46:39,366 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:39,366 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 01:46:39,367 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 01:46:39,367 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:39,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:39,368 INFO L82 PathProgramCache]: Analyzing trace with hash 378861101, now seen corresponding path program 1 times [2020-12-23 01:46:39,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:39,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515210736] [2020-12-23 01:46:39,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:39,452 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:39,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515210736] [2020-12-23 01:46:39,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:39,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:39,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505195565] [2020-12-23 01:46:39,454 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:39,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:39,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:39,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:39,455 INFO L87 Difference]: Start difference. First operand 157 states and 241 transitions. Second operand 4 states. [2020-12-23 01:46:39,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:39,773 INFO L93 Difference]: Finished difference Result 298 states and 463 transitions. [2020-12-23 01:46:39,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:39,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-12-23 01:46:39,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:39,775 INFO L225 Difference]: With dead ends: 298 [2020-12-23 01:46:39,777 INFO L226 Difference]: Without dead ends: 160 [2020-12-23 01:46:39,780 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:39,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-12-23 01:46:39,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2020-12-23 01:46:39,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-12-23 01:46:39,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 240 transitions. [2020-12-23 01:46:39,791 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 240 transitions. Word has length 61 [2020-12-23 01:46:39,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:39,791 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 240 transitions. [2020-12-23 01:46:39,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:39,791 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 240 transitions. [2020-12-23 01:46:39,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 01:46:39,792 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:39,792 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 01:46:39,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 01:46:39,793 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:39,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:39,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1409346107, now seen corresponding path program 1 times [2020-12-23 01:46:39,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:39,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327852708] [2020-12-23 01:46:39,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:39,925 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:39,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327852708] [2020-12-23 01:46:39,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:39,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:39,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264019163] [2020-12-23 01:46:39,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:39,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:39,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:39,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:39,938 INFO L87 Difference]: Start difference. First operand 157 states and 240 transitions. Second operand 4 states. [2020-12-23 01:46:40,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:40,309 INFO L93 Difference]: Finished difference Result 338 states and 524 transitions. [2020-12-23 01:46:40,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:40,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-12-23 01:46:40,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:40,311 INFO L225 Difference]: With dead ends: 338 [2020-12-23 01:46:40,311 INFO L226 Difference]: Without dead ends: 200 [2020-12-23 01:46:40,312 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:40,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-12-23 01:46:40,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 179. [2020-12-23 01:46:40,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-12-23 01:46:40,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 278 transitions. [2020-12-23 01:46:40,323 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 278 transitions. Word has length 61 [2020-12-23 01:46:40,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:40,326 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 278 transitions. [2020-12-23 01:46:40,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:40,326 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 278 transitions. [2020-12-23 01:46:40,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-23 01:46:40,329 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:40,330 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:46:40,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 01:46:40,330 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:40,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:40,332 INFO L82 PathProgramCache]: Analyzing trace with hash -550111145, now seen corresponding path program 1 times [2020-12-23 01:46:40,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:40,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23455200] [2020-12-23 01:46:40,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:40,434 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:40,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23455200] [2020-12-23 01:46:40,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:40,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:40,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354693057] [2020-12-23 01:46:40,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:40,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:40,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:40,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:40,440 INFO L87 Difference]: Start difference. First operand 179 states and 278 transitions. Second operand 4 states. [2020-12-23 01:46:40,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:40,788 INFO L93 Difference]: Finished difference Result 360 states and 561 transitions. [2020-12-23 01:46:40,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:40,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2020-12-23 01:46:40,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:40,791 INFO L225 Difference]: With dead ends: 360 [2020-12-23 01:46:40,791 INFO L226 Difference]: Without dead ends: 200 [2020-12-23 01:46:40,792 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:40,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-12-23 01:46:40,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 179. [2020-12-23 01:46:40,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-12-23 01:46:40,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 277 transitions. [2020-12-23 01:46:40,799 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 277 transitions. Word has length 74 [2020-12-23 01:46:40,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:40,799 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 277 transitions. [2020-12-23 01:46:40,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:40,800 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 277 transitions. [2020-12-23 01:46:40,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-23 01:46:40,801 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:40,801 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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] [2020-12-23 01:46:40,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 01:46:40,802 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:40,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:40,802 INFO L82 PathProgramCache]: Analyzing trace with hash 30473293, now seen corresponding path program 1 times [2020-12-23 01:46:40,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:40,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128294414] [2020-12-23 01:46:40,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:40,876 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:40,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128294414] [2020-12-23 01:46:40,876 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:40,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:40,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052417803] [2020-12-23 01:46:40,877 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:40,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:40,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:40,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:40,879 INFO L87 Difference]: Start difference. First operand 179 states and 277 transitions. Second operand 4 states. [2020-12-23 01:46:41,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:41,222 INFO L93 Difference]: Finished difference Result 359 states and 558 transitions. [2020-12-23 01:46:41,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:41,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-12-23 01:46:41,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:41,224 INFO L225 Difference]: With dead ends: 359 [2020-12-23 01:46:41,224 INFO L226 Difference]: Without dead ends: 199 [2020-12-23 01:46:41,225 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:41,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-12-23 01:46:41,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 179. [2020-12-23 01:46:41,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-12-23 01:46:41,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 276 transitions. [2020-12-23 01:46:41,232 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 276 transitions. Word has length 75 [2020-12-23 01:46:41,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:41,232 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 276 transitions. [2020-12-23 01:46:41,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:41,232 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 276 transitions. [2020-12-23 01:46:41,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-23 01:46:41,233 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:41,233 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:46:41,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 01:46:41,234 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:41,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:41,234 INFO L82 PathProgramCache]: Analyzing trace with hash 73802114, now seen corresponding path program 1 times [2020-12-23 01:46:41,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:41,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827860723] [2020-12-23 01:46:41,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:41,334 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:41,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827860723] [2020-12-23 01:46:41,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:41,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:41,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873940804] [2020-12-23 01:46:41,336 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:41,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:41,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:41,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:41,338 INFO L87 Difference]: Start difference. First operand 179 states and 276 transitions. Second operand 4 states. [2020-12-23 01:46:41,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:41,664 INFO L93 Difference]: Finished difference Result 357 states and 554 transitions. [2020-12-23 01:46:41,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:41,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-12-23 01:46:41,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:41,667 INFO L225 Difference]: With dead ends: 357 [2020-12-23 01:46:41,667 INFO L226 Difference]: Without dead ends: 197 [2020-12-23 01:46:41,668 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:41,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-12-23 01:46:41,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 179. [2020-12-23 01:46:41,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-12-23 01:46:41,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 275 transitions. [2020-12-23 01:46:41,675 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 275 transitions. Word has length 75 [2020-12-23 01:46:41,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:41,677 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 275 transitions. [2020-12-23 01:46:41,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:41,677 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 275 transitions. [2020-12-23 01:46:41,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-23 01:46:41,678 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:41,678 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2020-12-23 01:46:41,679 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 01:46:41,679 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:41,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:41,679 INFO L82 PathProgramCache]: Analyzing trace with hash 2044088898, now seen corresponding path program 1 times [2020-12-23 01:46:41,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:41,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258083768] [2020-12-23 01:46:41,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:41,781 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:41,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258083768] [2020-12-23 01:46:41,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:41,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:41,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160038151] [2020-12-23 01:46:41,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:41,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:41,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:41,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:41,783 INFO L87 Difference]: Start difference. First operand 179 states and 275 transitions. Second operand 4 states. [2020-12-23 01:46:42,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:42,118 INFO L93 Difference]: Finished difference Result 356 states and 551 transitions. [2020-12-23 01:46:42,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:42,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-12-23 01:46:42,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:42,122 INFO L225 Difference]: With dead ends: 356 [2020-12-23 01:46:42,122 INFO L226 Difference]: Without dead ends: 196 [2020-12-23 01:46:42,123 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:42,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-12-23 01:46:42,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 179. [2020-12-23 01:46:42,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-12-23 01:46:42,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 274 transitions. [2020-12-23 01:46:42,133 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 274 transitions. Word has length 75 [2020-12-23 01:46:42,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:42,133 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 274 transitions. [2020-12-23 01:46:42,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:42,133 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 274 transitions. [2020-12-23 01:46:42,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-23 01:46:42,134 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:42,134 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 01:46:42,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 01:46:42,135 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:42,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:42,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1605062087, now seen corresponding path program 1 times [2020-12-23 01:46:42,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:42,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328183783] [2020-12-23 01:46:42,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:42,200 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:42,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328183783] [2020-12-23 01:46:42,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:42,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:42,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394716703] [2020-12-23 01:46:42,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:42,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:42,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:42,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:42,202 INFO L87 Difference]: Start difference. First operand 179 states and 274 transitions. Second operand 4 states. [2020-12-23 01:46:42,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:42,525 INFO L93 Difference]: Finished difference Result 356 states and 549 transitions. [2020-12-23 01:46:42,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:42,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2020-12-23 01:46:42,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:42,527 INFO L225 Difference]: With dead ends: 356 [2020-12-23 01:46:42,528 INFO L226 Difference]: Without dead ends: 196 [2020-12-23 01:46:42,528 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:42,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-12-23 01:46:42,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 179. [2020-12-23 01:46:42,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-12-23 01:46:42,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 273 transitions. [2020-12-23 01:46:42,534 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 273 transitions. Word has length 75 [2020-12-23 01:46:42,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:42,535 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 273 transitions. [2020-12-23 01:46:42,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:42,535 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 273 transitions. [2020-12-23 01:46:42,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 01:46:42,536 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:42,536 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 01:46:42,536 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 01:46:42,536 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:42,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:42,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1655656366, now seen corresponding path program 1 times [2020-12-23 01:46:42,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:42,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500036544] [2020-12-23 01:46:42,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:42,590 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:42,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500036544] [2020-12-23 01:46:42,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:42,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:42,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506891428] [2020-12-23 01:46:42,592 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:42,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:42,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:42,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:42,593 INFO L87 Difference]: Start difference. First operand 179 states and 273 transitions. Second operand 4 states. [2020-12-23 01:46:42,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:42,931 INFO L93 Difference]: Finished difference Result 356 states and 547 transitions. [2020-12-23 01:46:42,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:42,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2020-12-23 01:46:42,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:42,933 INFO L225 Difference]: With dead ends: 356 [2020-12-23 01:46:42,933 INFO L226 Difference]: Without dead ends: 196 [2020-12-23 01:46:42,934 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:42,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-12-23 01:46:42,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 179. [2020-12-23 01:46:42,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-12-23 01:46:42,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 272 transitions. [2020-12-23 01:46:42,943 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 272 transitions. Word has length 76 [2020-12-23 01:46:42,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:42,944 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 272 transitions. [2020-12-23 01:46:42,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:42,944 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 272 transitions. [2020-12-23 01:46:42,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-23 01:46:42,945 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:42,945 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:42,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 01:46:42,945 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:42,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:42,946 INFO L82 PathProgramCache]: Analyzing trace with hash 211651124, now seen corresponding path program 1 times [2020-12-23 01:46:42,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:42,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936067233] [2020-12-23 01:46:42,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:43,023 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:43,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936067233] [2020-12-23 01:46:43,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:43,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:43,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839529549] [2020-12-23 01:46:43,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:43,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:43,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:43,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:43,026 INFO L87 Difference]: Start difference. First operand 179 states and 272 transitions. Second operand 4 states. [2020-12-23 01:46:43,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:43,377 INFO L93 Difference]: Finished difference Result 356 states and 545 transitions. [2020-12-23 01:46:43,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:43,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2020-12-23 01:46:43,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:43,379 INFO L225 Difference]: With dead ends: 356 [2020-12-23 01:46:43,379 INFO L226 Difference]: Without dead ends: 196 [2020-12-23 01:46:43,380 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:43,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-12-23 01:46:43,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 179. [2020-12-23 01:46:43,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-12-23 01:46:43,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 271 transitions. [2020-12-23 01:46:43,386 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 271 transitions. Word has length 77 [2020-12-23 01:46:43,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:43,386 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 271 transitions. [2020-12-23 01:46:43,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:43,386 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 271 transitions. [2020-12-23 01:46:43,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-12-23 01:46:43,387 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:43,387 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 01:46:43,387 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 01:46:43,387 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:43,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:43,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1049900599, now seen corresponding path program 1 times [2020-12-23 01:46:43,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:43,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100268335] [2020-12-23 01:46:43,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:43,449 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:46:43,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100268335] [2020-12-23 01:46:43,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:43,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:43,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223046450] [2020-12-23 01:46:43,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:43,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:43,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:43,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:43,453 INFO L87 Difference]: Start difference. First operand 179 states and 271 transitions. Second operand 4 states. [2020-12-23 01:46:43,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:43,794 INFO L93 Difference]: Finished difference Result 346 states and 530 transitions. [2020-12-23 01:46:43,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:43,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2020-12-23 01:46:43,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:43,797 INFO L225 Difference]: With dead ends: 346 [2020-12-23 01:46:43,797 INFO L226 Difference]: Without dead ends: 186 [2020-12-23 01:46:43,798 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:43,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-12-23 01:46:43,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 179. [2020-12-23 01:46:43,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-12-23 01:46:43,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 270 transitions. [2020-12-23 01:46:43,806 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 270 transitions. Word has length 78 [2020-12-23 01:46:43,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:43,806 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 270 transitions. [2020-12-23 01:46:43,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:43,807 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 270 transitions. [2020-12-23 01:46:43,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-23 01:46:43,817 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:43,818 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:46:43,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 01:46:43,818 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:43,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:43,819 INFO L82 PathProgramCache]: Analyzing trace with hash -614883725, now seen corresponding path program 1 times [2020-12-23 01:46:43,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:43,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571593436] [2020-12-23 01:46:43,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:43,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571593436] [2020-12-23 01:46:43,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:43,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:43,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215746600] [2020-12-23 01:46:43,911 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:43,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:43,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:43,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:43,912 INFO L87 Difference]: Start difference. First operand 179 states and 270 transitions. Second operand 4 states. [2020-12-23 01:46:44,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:44,480 INFO L93 Difference]: Finished difference Result 454 states and 699 transitions. [2020-12-23 01:46:44,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:44,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2020-12-23 01:46:44,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:44,483 INFO L225 Difference]: With dead ends: 454 [2020-12-23 01:46:44,484 INFO L226 Difference]: Without dead ends: 294 [2020-12-23 01:46:44,485 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:44,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-12-23 01:46:44,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 220. [2020-12-23 01:46:44,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-12-23 01:46:44,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 344 transitions. [2020-12-23 01:46:44,493 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 344 transitions. Word has length 83 [2020-12-23 01:46:44,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:44,494 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 344 transitions. [2020-12-23 01:46:44,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:44,494 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 344 transitions. [2020-12-23 01:46:44,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-23 01:46:44,495 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:44,495 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:46:44,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 01:46:44,496 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:44,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:44,496 INFO L82 PathProgramCache]: Analyzing trace with hash -366737231, now seen corresponding path program 1 times [2020-12-23 01:46:44,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:44,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122986657] [2020-12-23 01:46:44,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:44,572 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:44,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122986657] [2020-12-23 01:46:44,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:44,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:44,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593864964] [2020-12-23 01:46:44,573 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:44,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:44,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:44,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:44,574 INFO L87 Difference]: Start difference. First operand 220 states and 344 transitions. Second operand 4 states. [2020-12-23 01:46:45,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:45,016 INFO L93 Difference]: Finished difference Result 471 states and 743 transitions. [2020-12-23 01:46:45,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:45,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2020-12-23 01:46:45,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:45,019 INFO L225 Difference]: With dead ends: 471 [2020-12-23 01:46:45,019 INFO L226 Difference]: Without dead ends: 270 [2020-12-23 01:46:45,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:45,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2020-12-23 01:46:45,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 244. [2020-12-23 01:46:45,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2020-12-23 01:46:45,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 386 transitions. [2020-12-23 01:46:45,027 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 386 transitions. Word has length 83 [2020-12-23 01:46:45,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:45,027 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 386 transitions. [2020-12-23 01:46:45,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:45,028 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 386 transitions. [2020-12-23 01:46:45,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-12-23 01:46:45,029 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:45,029 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:46:45,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 01:46:45,029 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:45,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:45,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1739674319, now seen corresponding path program 1 times [2020-12-23 01:46:45,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:45,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987982431] [2020-12-23 01:46:45,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:45,124 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:45,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987982431] [2020-12-23 01:46:45,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:45,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:45,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316660434] [2020-12-23 01:46:45,125 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:45,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:45,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:45,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:45,126 INFO L87 Difference]: Start difference. First operand 244 states and 386 transitions. Second operand 4 states. [2020-12-23 01:46:45,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:45,703 INFO L93 Difference]: Finished difference Result 534 states and 843 transitions. [2020-12-23 01:46:45,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:45,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2020-12-23 01:46:45,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:45,706 INFO L225 Difference]: With dead ends: 534 [2020-12-23 01:46:45,706 INFO L226 Difference]: Without dead ends: 309 [2020-12-23 01:46:45,707 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:45,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2020-12-23 01:46:45,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 245. [2020-12-23 01:46:45,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2020-12-23 01:46:45,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 387 transitions. [2020-12-23 01:46:45,716 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 387 transitions. Word has length 84 [2020-12-23 01:46:45,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:45,716 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 387 transitions. [2020-12-23 01:46:45,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:45,716 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 387 transitions. [2020-12-23 01:46:45,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-12-23 01:46:45,718 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:45,718 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2020-12-23 01:46:45,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 01:46:45,719 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:45,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:45,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1240955497, now seen corresponding path program 1 times [2020-12-23 01:46:45,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:45,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79441683] [2020-12-23 01:46:45,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:45,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79441683] [2020-12-23 01:46:45,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:45,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:45,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450525765] [2020-12-23 01:46:45,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:45,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:45,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:45,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:45,797 INFO L87 Difference]: Start difference. First operand 245 states and 387 transitions. Second operand 4 states. [2020-12-23 01:46:46,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:46,382 INFO L93 Difference]: Finished difference Result 535 states and 843 transitions. [2020-12-23 01:46:46,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:46,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2020-12-23 01:46:46,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:46,385 INFO L225 Difference]: With dead ends: 535 [2020-12-23 01:46:46,385 INFO L226 Difference]: Without dead ends: 309 [2020-12-23 01:46:46,386 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:46,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2020-12-23 01:46:46,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 245. [2020-12-23 01:46:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2020-12-23 01:46:46,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 386 transitions. [2020-12-23 01:46:46,394 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 386 transitions. Word has length 96 [2020-12-23 01:46:46,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:46,394 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 386 transitions. [2020-12-23 01:46:46,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:46,394 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 386 transitions. [2020-12-23 01:46:46,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-12-23 01:46:46,395 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:46,396 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2020-12-23 01:46:46,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 01:46:46,396 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:46,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:46,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1667226389, now seen corresponding path program 1 times [2020-12-23 01:46:46,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:46,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843098562] [2020-12-23 01:46:46,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:46,471 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:46,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843098562] [2020-12-23 01:46:46,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:46,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:46,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166349753] [2020-12-23 01:46:46,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:46,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:46,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:46,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:46,474 INFO L87 Difference]: Start difference. First operand 245 states and 386 transitions. Second operand 4 states. [2020-12-23 01:46:46,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:46,937 INFO L93 Difference]: Finished difference Result 497 states and 784 transitions. [2020-12-23 01:46:46,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:46,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2020-12-23 01:46:46,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:46,941 INFO L225 Difference]: With dead ends: 497 [2020-12-23 01:46:46,941 INFO L226 Difference]: Without dead ends: 271 [2020-12-23 01:46:46,942 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:46,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-12-23 01:46:46,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 245. [2020-12-23 01:46:46,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2020-12-23 01:46:46,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 385 transitions. [2020-12-23 01:46:46,957 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 385 transitions. Word has length 96 [2020-12-23 01:46:46,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:46,957 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 385 transitions. [2020-12-23 01:46:46,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:46,957 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 385 transitions. [2020-12-23 01:46:46,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 01:46:46,959 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:46,959 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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] [2020-12-23 01:46:46,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 01:46:46,959 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:46,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:46,960 INFO L82 PathProgramCache]: Analyzing trace with hash -281035653, now seen corresponding path program 1 times [2020-12-23 01:46:46,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:46,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608257730] [2020-12-23 01:46:46,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:47,070 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:47,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608257730] [2020-12-23 01:46:47,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:47,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:47,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399513696] [2020-12-23 01:46:47,072 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:47,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:47,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:47,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:47,073 INFO L87 Difference]: Start difference. First operand 245 states and 385 transitions. Second operand 4 states. [2020-12-23 01:46:47,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:47,669 INFO L93 Difference]: Finished difference Result 534 states and 838 transitions. [2020-12-23 01:46:47,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:47,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2020-12-23 01:46:47,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:47,672 INFO L225 Difference]: With dead ends: 534 [2020-12-23 01:46:47,672 INFO L226 Difference]: Without dead ends: 308 [2020-12-23 01:46:47,673 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:47,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2020-12-23 01:46:47,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 245. [2020-12-23 01:46:47,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2020-12-23 01:46:47,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 384 transitions. [2020-12-23 01:46:47,682 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 384 transitions. Word has length 97 [2020-12-23 01:46:47,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:47,682 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 384 transitions. [2020-12-23 01:46:47,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:47,682 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 384 transitions. [2020-12-23 01:46:47,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 01:46:47,684 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:47,684 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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] [2020-12-23 01:46:47,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 01:46:47,684 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:47,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:47,685 INFO L82 PathProgramCache]: Analyzing trace with hash -237706832, now seen corresponding path program 1 times [2020-12-23 01:46:47,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:47,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624399683] [2020-12-23 01:46:47,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:47,768 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:47,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624399683] [2020-12-23 01:46:47,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:47,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:47,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147628444] [2020-12-23 01:46:47,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:47,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:47,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:47,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:47,771 INFO L87 Difference]: Start difference. First operand 245 states and 384 transitions. Second operand 4 states. [2020-12-23 01:46:48,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:48,257 INFO L93 Difference]: Finished difference Result 532 states and 834 transitions. [2020-12-23 01:46:48,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:48,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2020-12-23 01:46:48,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:48,260 INFO L225 Difference]: With dead ends: 532 [2020-12-23 01:46:48,260 INFO L226 Difference]: Without dead ends: 306 [2020-12-23 01:46:48,261 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:48,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-12-23 01:46:48,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 245. [2020-12-23 01:46:48,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2020-12-23 01:46:48,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 383 transitions. [2020-12-23 01:46:48,284 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 383 transitions. Word has length 97 [2020-12-23 01:46:48,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:48,285 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 383 transitions. [2020-12-23 01:46:48,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:48,285 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 383 transitions. [2020-12-23 01:46:48,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 01:46:48,286 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:48,286 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2020-12-23 01:46:48,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 01:46:48,287 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:48,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:48,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1732579952, now seen corresponding path program 1 times [2020-12-23 01:46:48,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:48,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409887327] [2020-12-23 01:46:48,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:48,353 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:48,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409887327] [2020-12-23 01:46:48,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:48,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:48,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993324349] [2020-12-23 01:46:48,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:48,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:48,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:48,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:48,356 INFO L87 Difference]: Start difference. First operand 245 states and 383 transitions. Second operand 4 states. [2020-12-23 01:46:48,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:48,867 INFO L93 Difference]: Finished difference Result 531 states and 831 transitions. [2020-12-23 01:46:48,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:48,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2020-12-23 01:46:48,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:48,870 INFO L225 Difference]: With dead ends: 531 [2020-12-23 01:46:48,870 INFO L226 Difference]: Without dead ends: 305 [2020-12-23 01:46:48,870 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:48,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-12-23 01:46:48,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 245. [2020-12-23 01:46:48,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2020-12-23 01:46:48,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 382 transitions. [2020-12-23 01:46:48,879 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 382 transitions. Word has length 97 [2020-12-23 01:46:48,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:48,879 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 382 transitions. [2020-12-23 01:46:48,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:48,879 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 382 transitions. [2020-12-23 01:46:48,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 01:46:48,880 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:48,880 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 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] [2020-12-23 01:46:48,880 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 01:46:48,881 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:48,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:48,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1916571033, now seen corresponding path program 1 times [2020-12-23 01:46:48,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:48,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487583649] [2020-12-23 01:46:48,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:48,973 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-23 01:46:48,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487583649] [2020-12-23 01:46:48,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:48,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 01:46:48,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685418121] [2020-12-23 01:46:48,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 01:46:48,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:48,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 01:46:48,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:48,975 INFO L87 Difference]: Start difference. First operand 245 states and 382 transitions. Second operand 5 states. [2020-12-23 01:46:49,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:49,503 INFO L93 Difference]: Finished difference Result 492 states and 772 transitions. [2020-12-23 01:46:49,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 01:46:49,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2020-12-23 01:46:49,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:49,505 INFO L225 Difference]: With dead ends: 492 [2020-12-23 01:46:49,506 INFO L226 Difference]: Without dead ends: 266 [2020-12-23 01:46:49,506 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-23 01:46:49,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-12-23 01:46:49,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2020-12-23 01:46:49,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2020-12-23 01:46:49,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 408 transitions. [2020-12-23 01:46:49,515 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 408 transitions. Word has length 97 [2020-12-23 01:46:49,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:49,516 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 408 transitions. [2020-12-23 01:46:49,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 01:46:49,516 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 408 transitions. [2020-12-23 01:46:49,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 01:46:49,517 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:49,518 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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] [2020-12-23 01:46:49,518 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 01:46:49,518 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:49,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:49,519 INFO L82 PathProgramCache]: Analyzing trace with hash -197032082, now seen corresponding path program 1 times [2020-12-23 01:46:49,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:49,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758138561] [2020-12-23 01:46:49,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:49,592 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:49,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758138561] [2020-12-23 01:46:49,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:49,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:49,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431311829] [2020-12-23 01:46:49,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:49,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:49,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:49,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:49,594 INFO L87 Difference]: Start difference. First operand 265 states and 408 transitions. Second operand 4 states. [2020-12-23 01:46:49,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:49,994 INFO L93 Difference]: Finished difference Result 534 states and 824 transitions. [2020-12-23 01:46:49,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:49,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2020-12-23 01:46:49,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:49,997 INFO L225 Difference]: With dead ends: 534 [2020-12-23 01:46:49,997 INFO L226 Difference]: Without dead ends: 288 [2020-12-23 01:46:49,998 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:49,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2020-12-23 01:46:50,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 265. [2020-12-23 01:46:50,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2020-12-23 01:46:50,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 407 transitions. [2020-12-23 01:46:50,008 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 407 transitions. Word has length 97 [2020-12-23 01:46:50,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:50,009 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 407 transitions. [2020-12-23 01:46:50,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:50,009 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 407 transitions. [2020-12-23 01:46:50,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-12-23 01:46:50,010 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:50,011 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2020-12-23 01:46:50,011 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 01:46:50,011 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:50,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:50,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1773254702, now seen corresponding path program 1 times [2020-12-23 01:46:50,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:50,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122210290] [2020-12-23 01:46:50,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:50,080 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:50,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122210290] [2020-12-23 01:46:50,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:50,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:50,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415084000] [2020-12-23 01:46:50,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:50,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:50,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:50,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:50,082 INFO L87 Difference]: Start difference. First operand 265 states and 407 transitions. Second operand 4 states. [2020-12-23 01:46:50,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:50,474 INFO L93 Difference]: Finished difference Result 533 states and 821 transitions. [2020-12-23 01:46:50,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:50,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2020-12-23 01:46:50,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:50,476 INFO L225 Difference]: With dead ends: 533 [2020-12-23 01:46:50,476 INFO L226 Difference]: Without dead ends: 287 [2020-12-23 01:46:50,477 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:50,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2020-12-23 01:46:50,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2020-12-23 01:46:50,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2020-12-23 01:46:50,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 406 transitions. [2020-12-23 01:46:50,486 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 406 transitions. Word has length 97 [2020-12-23 01:46:50,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:50,486 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 406 transitions. [2020-12-23 01:46:50,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:50,486 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 406 transitions. [2020-12-23 01:46:50,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 01:46:50,488 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:50,488 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 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] [2020-12-23 01:46:50,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 01:46:50,488 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:50,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:50,489 INFO L82 PathProgramCache]: Analyzing trace with hash -352879123, now seen corresponding path program 1 times [2020-12-23 01:46:50,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:50,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392177276] [2020-12-23 01:46:50,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:50,551 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:50,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392177276] [2020-12-23 01:46:50,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:50,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:50,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752736527] [2020-12-23 01:46:50,553 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:50,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:50,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:50,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:50,554 INFO L87 Difference]: Start difference. First operand 265 states and 406 transitions. Second operand 4 states. [2020-12-23 01:46:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:51,046 INFO L93 Difference]: Finished difference Result 571 states and 876 transitions. [2020-12-23 01:46:51,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:51,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-23 01:46:51,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:51,048 INFO L225 Difference]: With dead ends: 571 [2020-12-23 01:46:51,048 INFO L226 Difference]: Without dead ends: 325 [2020-12-23 01:46:51,049 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:51,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-12-23 01:46:51,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 265. [2020-12-23 01:46:51,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2020-12-23 01:46:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 405 transitions. [2020-12-23 01:46:51,059 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 405 transitions. Word has length 98 [2020-12-23 01:46:51,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:51,059 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 405 transitions. [2020-12-23 01:46:51,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:51,060 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 405 transitions. [2020-12-23 01:46:51,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 01:46:51,061 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:51,061 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 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] [2020-12-23 01:46:51,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-23 01:46:51,061 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:51,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:51,062 INFO L82 PathProgramCache]: Analyzing trace with hash 908038127, now seen corresponding path program 1 times [2020-12-23 01:46:51,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:51,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650898932] [2020-12-23 01:46:51,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:51,139 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:51,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650898932] [2020-12-23 01:46:51,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:51,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:51,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458357213] [2020-12-23 01:46:51,140 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:51,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:51,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:51,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:51,141 INFO L87 Difference]: Start difference. First operand 265 states and 405 transitions. Second operand 4 states. [2020-12-23 01:46:51,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:51,530 INFO L93 Difference]: Finished difference Result 533 states and 817 transitions. [2020-12-23 01:46:51,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:51,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-12-23 01:46:51,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:51,533 INFO L225 Difference]: With dead ends: 533 [2020-12-23 01:46:51,533 INFO L226 Difference]: Without dead ends: 287 [2020-12-23 01:46:51,534 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:51,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2020-12-23 01:46:51,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2020-12-23 01:46:51,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2020-12-23 01:46:51,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 404 transitions. [2020-12-23 01:46:51,544 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 404 transitions. Word has length 98 [2020-12-23 01:46:51,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:51,544 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 404 transitions. [2020-12-23 01:46:51,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:51,544 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 404 transitions. [2020-12-23 01:46:51,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-23 01:46:51,546 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:51,546 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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] [2020-12-23 01:46:51,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-23 01:46:51,546 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:51,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:51,547 INFO L82 PathProgramCache]: Analyzing trace with hash 4634164, now seen corresponding path program 1 times [2020-12-23 01:46:51,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:51,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056586574] [2020-12-23 01:46:51,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:51,617 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:51,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056586574] [2020-12-23 01:46:51,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:51,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:51,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490281317] [2020-12-23 01:46:51,618 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:51,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:51,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:51,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:51,619 INFO L87 Difference]: Start difference. First operand 265 states and 404 transitions. Second operand 4 states. [2020-12-23 01:46:52,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:52,145 INFO L93 Difference]: Finished difference Result 571 states and 872 transitions. [2020-12-23 01:46:52,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:52,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2020-12-23 01:46:52,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:52,148 INFO L225 Difference]: With dead ends: 571 [2020-12-23 01:46:52,148 INFO L226 Difference]: Without dead ends: 325 [2020-12-23 01:46:52,149 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:52,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-12-23 01:46:52,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 265. [2020-12-23 01:46:52,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2020-12-23 01:46:52,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 403 transitions. [2020-12-23 01:46:52,159 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 403 transitions. Word has length 99 [2020-12-23 01:46:52,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:52,159 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 403 transitions. [2020-12-23 01:46:52,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:52,159 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 403 transitions. [2020-12-23 01:46:52,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-23 01:46:52,161 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:52,161 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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] [2020-12-23 01:46:52,161 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-23 01:46:52,161 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:52,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:52,162 INFO L82 PathProgramCache]: Analyzing trace with hash 438363250, now seen corresponding path program 1 times [2020-12-23 01:46:52,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:52,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869492542] [2020-12-23 01:46:52,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:52,251 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:52,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869492542] [2020-12-23 01:46:52,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:52,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:52,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152857809] [2020-12-23 01:46:52,252 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:52,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:52,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:52,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:52,253 INFO L87 Difference]: Start difference. First operand 265 states and 403 transitions. Second operand 4 states. [2020-12-23 01:46:52,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:52,667 INFO L93 Difference]: Finished difference Result 533 states and 813 transitions. [2020-12-23 01:46:52,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:52,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2020-12-23 01:46:52,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:52,670 INFO L225 Difference]: With dead ends: 533 [2020-12-23 01:46:52,670 INFO L226 Difference]: Without dead ends: 287 [2020-12-23 01:46:52,672 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:52,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2020-12-23 01:46:52,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2020-12-23 01:46:52,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2020-12-23 01:46:52,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 402 transitions. [2020-12-23 01:46:52,682 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 402 transitions. Word has length 99 [2020-12-23 01:46:52,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:52,682 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 402 transitions. [2020-12-23 01:46:52,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:52,683 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 402 transitions. [2020-12-23 01:46:52,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 01:46:52,684 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:52,684 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2020-12-23 01:46:52,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-23 01:46:52,685 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:52,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:52,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1836152622, now seen corresponding path program 1 times [2020-12-23 01:46:52,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:52,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953329096] [2020-12-23 01:46:52,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:52,752 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:52,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953329096] [2020-12-23 01:46:52,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:52,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:52,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078818387] [2020-12-23 01:46:52,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:52,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:52,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:52,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:52,754 INFO L87 Difference]: Start difference. First operand 265 states and 402 transitions. Second operand 4 states. [2020-12-23 01:46:53,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:53,250 INFO L93 Difference]: Finished difference Result 571 states and 868 transitions. [2020-12-23 01:46:53,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:53,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2020-12-23 01:46:53,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:53,253 INFO L225 Difference]: With dead ends: 571 [2020-12-23 01:46:53,253 INFO L226 Difference]: Without dead ends: 325 [2020-12-23 01:46:53,253 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:53,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2020-12-23 01:46:53,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 265. [2020-12-23 01:46:53,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2020-12-23 01:46:53,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 401 transitions. [2020-12-23 01:46:53,264 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 401 transitions. Word has length 100 [2020-12-23 01:46:53,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:53,264 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 401 transitions. [2020-12-23 01:46:53,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:53,264 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 401 transitions. [2020-12-23 01:46:53,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 01:46:53,266 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:53,266 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2020-12-23 01:46:53,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-23 01:46:53,266 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:53,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:53,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1275452844, now seen corresponding path program 1 times [2020-12-23 01:46:53,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:53,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077156587] [2020-12-23 01:46:53,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:53,354 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:53,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077156587] [2020-12-23 01:46:53,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:53,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:53,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47181024] [2020-12-23 01:46:53,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:53,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:53,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:53,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:53,356 INFO L87 Difference]: Start difference. First operand 265 states and 401 transitions. Second operand 4 states. [2020-12-23 01:46:53,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:53,730 INFO L93 Difference]: Finished difference Result 533 states and 809 transitions. [2020-12-23 01:46:53,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:53,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2020-12-23 01:46:53,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:53,734 INFO L225 Difference]: With dead ends: 533 [2020-12-23 01:46:53,734 INFO L226 Difference]: Without dead ends: 287 [2020-12-23 01:46:53,735 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:53,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2020-12-23 01:46:53,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2020-12-23 01:46:53,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2020-12-23 01:46:53,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 400 transitions. [2020-12-23 01:46:53,744 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 400 transitions. Word has length 100 [2020-12-23 01:46:53,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:53,744 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 400 transitions. [2020-12-23 01:46:53,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:53,745 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 400 transitions. [2020-12-23 01:46:53,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-23 01:46:53,746 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:53,746 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 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] [2020-12-23 01:46:53,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-23 01:46:53,746 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:53,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:53,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1190202361, now seen corresponding path program 1 times [2020-12-23 01:46:53,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:53,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804050421] [2020-12-23 01:46:53,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:53,809 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:53,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804050421] [2020-12-23 01:46:53,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:53,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:53,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826111934] [2020-12-23 01:46:53,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:53,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:53,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:53,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:53,811 INFO L87 Difference]: Start difference. First operand 265 states and 400 transitions. Second operand 4 states. [2020-12-23 01:46:54,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:54,285 INFO L93 Difference]: Finished difference Result 561 states and 852 transitions. [2020-12-23 01:46:54,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:54,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2020-12-23 01:46:54,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:54,292 INFO L225 Difference]: With dead ends: 561 [2020-12-23 01:46:54,292 INFO L226 Difference]: Without dead ends: 315 [2020-12-23 01:46:54,293 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:54,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-12-23 01:46:54,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 265. [2020-12-23 01:46:54,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2020-12-23 01:46:54,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 399 transitions. [2020-12-23 01:46:54,303 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 399 transitions. Word has length 101 [2020-12-23 01:46:54,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:54,303 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 399 transitions. [2020-12-23 01:46:54,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:54,303 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 399 transitions. [2020-12-23 01:46:54,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-23 01:46:54,304 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:54,304 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 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] [2020-12-23 01:46:54,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-23 01:46:54,305 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:54,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:54,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1392026295, now seen corresponding path program 1 times [2020-12-23 01:46:54,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:54,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522178519] [2020-12-23 01:46:54,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:54,392 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:54,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522178519] [2020-12-23 01:46:54,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:54,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:54,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293145592] [2020-12-23 01:46:54,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:54,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:54,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:54,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:54,398 INFO L87 Difference]: Start difference. First operand 265 states and 399 transitions. Second operand 4 states. [2020-12-23 01:46:54,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:54,781 INFO L93 Difference]: Finished difference Result 523 states and 793 transitions. [2020-12-23 01:46:54,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:54,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2020-12-23 01:46:54,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:54,783 INFO L225 Difference]: With dead ends: 523 [2020-12-23 01:46:54,783 INFO L226 Difference]: Without dead ends: 277 [2020-12-23 01:46:54,784 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:54,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-12-23 01:46:54,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 265. [2020-12-23 01:46:54,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2020-12-23 01:46:54,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 398 transitions. [2020-12-23 01:46:54,794 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 398 transitions. Word has length 101 [2020-12-23 01:46:54,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:54,794 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 398 transitions. [2020-12-23 01:46:54,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:54,794 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 398 transitions. [2020-12-23 01:46:54,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 01:46:54,795 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:54,795 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:46:54,795 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-23 01:46:54,796 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:54,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:54,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1404579251, now seen corresponding path program 1 times [2020-12-23 01:46:54,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:54,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486832812] [2020-12-23 01:46:54,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:54,863 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:54,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486832812] [2020-12-23 01:46:54,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:54,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:54,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76020992] [2020-12-23 01:46:54,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:54,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:54,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:54,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:54,865 INFO L87 Difference]: Start difference. First operand 265 states and 398 transitions. Second operand 4 states. [2020-12-23 01:46:55,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:55,353 INFO L93 Difference]: Finished difference Result 561 states and 848 transitions. [2020-12-23 01:46:55,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:55,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2020-12-23 01:46:55,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:55,356 INFO L225 Difference]: With dead ends: 561 [2020-12-23 01:46:55,356 INFO L226 Difference]: Without dead ends: 315 [2020-12-23 01:46:55,357 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:55,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-12-23 01:46:55,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 265. [2020-12-23 01:46:55,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2020-12-23 01:46:55,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 397 transitions. [2020-12-23 01:46:55,368 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 397 transitions. Word has length 105 [2020-12-23 01:46:55,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:55,368 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 397 transitions. [2020-12-23 01:46:55,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:55,368 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 397 transitions. [2020-12-23 01:46:55,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-23 01:46:55,369 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:55,370 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:46:55,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-23 01:46:55,370 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:55,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:55,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1350186353, now seen corresponding path program 1 times [2020-12-23 01:46:55,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:55,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351145661] [2020-12-23 01:46:55,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:55,463 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:46:55,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351145661] [2020-12-23 01:46:55,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:55,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:55,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876081726] [2020-12-23 01:46:55,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:55,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:55,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:55,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:55,465 INFO L87 Difference]: Start difference. First operand 265 states and 397 transitions. Second operand 4 states. [2020-12-23 01:46:55,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:55,869 INFO L93 Difference]: Finished difference Result 564 states and 853 transitions. [2020-12-23 01:46:55,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:55,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2020-12-23 01:46:55,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:55,872 INFO L225 Difference]: With dead ends: 564 [2020-12-23 01:46:55,872 INFO L226 Difference]: Without dead ends: 318 [2020-12-23 01:46:55,872 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:55,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2020-12-23 01:46:55,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 291. [2020-12-23 01:46:55,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-12-23 01:46:55,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 442 transitions. [2020-12-23 01:46:55,883 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 442 transitions. Word has length 105 [2020-12-23 01:46:55,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:55,883 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 442 transitions. [2020-12-23 01:46:55,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:55,884 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 442 transitions. [2020-12-23 01:46:55,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-12-23 01:46:55,885 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:55,885 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:46:55,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-23 01:46:55,885 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:55,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:55,886 INFO L82 PathProgramCache]: Analyzing trace with hash 2023363820, now seen corresponding path program 1 times [2020-12-23 01:46:55,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:55,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916995706] [2020-12-23 01:46:55,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:55,976 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:55,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916995706] [2020-12-23 01:46:55,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:55,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:55,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101490912] [2020-12-23 01:46:55,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:55,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:55,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:55,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:55,978 INFO L87 Difference]: Start difference. First operand 291 states and 442 transitions. Second operand 4 states. [2020-12-23 01:46:56,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:56,477 INFO L93 Difference]: Finished difference Result 613 states and 936 transitions. [2020-12-23 01:46:56,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:56,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2020-12-23 01:46:56,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:56,479 INFO L225 Difference]: With dead ends: 613 [2020-12-23 01:46:56,480 INFO L226 Difference]: Without dead ends: 341 [2020-12-23 01:46:56,480 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:56,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-12-23 01:46:56,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 291. [2020-12-23 01:46:56,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-12-23 01:46:56,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 441 transitions. [2020-12-23 01:46:56,493 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 441 transitions. Word has length 108 [2020-12-23 01:46:56,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:56,493 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 441 transitions. [2020-12-23 01:46:56,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:56,493 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 441 transitions. [2020-12-23 01:46:56,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-12-23 01:46:56,494 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:56,495 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2020-12-23 01:46:56,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-23 01:46:56,495 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:56,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:56,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1505475213, now seen corresponding path program 1 times [2020-12-23 01:46:56,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:56,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48126912] [2020-12-23 01:46:56,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:56,574 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:56,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48126912] [2020-12-23 01:46:56,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:56,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:56,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946905336] [2020-12-23 01:46:56,575 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:56,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:56,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:56,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:56,576 INFO L87 Difference]: Start difference. First operand 291 states and 441 transitions. Second operand 4 states. [2020-12-23 01:46:57,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:57,030 INFO L93 Difference]: Finished difference Result 605 states and 921 transitions. [2020-12-23 01:46:57,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:57,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2020-12-23 01:46:57,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:57,033 INFO L225 Difference]: With dead ends: 605 [2020-12-23 01:46:57,033 INFO L226 Difference]: Without dead ends: 333 [2020-12-23 01:46:57,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:57,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-12-23 01:46:57,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 291. [2020-12-23 01:46:57,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-12-23 01:46:57,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 440 transitions. [2020-12-23 01:46:57,044 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 440 transitions. Word has length 109 [2020-12-23 01:46:57,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:57,044 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 440 transitions. [2020-12-23 01:46:57,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:57,044 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 440 transitions. [2020-12-23 01:46:57,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-12-23 01:46:57,045 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:57,046 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:46:57,046 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-12-23 01:46:57,046 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:57,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:57,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1509096972, now seen corresponding path program 1 times [2020-12-23 01:46:57,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:57,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989289757] [2020-12-23 01:46:57,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:57,129 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:57,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989289757] [2020-12-23 01:46:57,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:57,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:57,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643817609] [2020-12-23 01:46:57,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:57,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:57,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:57,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:57,131 INFO L87 Difference]: Start difference. First operand 291 states and 440 transitions. Second operand 4 states. [2020-12-23 01:46:57,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:57,584 INFO L93 Difference]: Finished difference Result 605 states and 919 transitions. [2020-12-23 01:46:57,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:57,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2020-12-23 01:46:57,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:57,587 INFO L225 Difference]: With dead ends: 605 [2020-12-23 01:46:57,587 INFO L226 Difference]: Without dead ends: 333 [2020-12-23 01:46:57,588 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:57,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-12-23 01:46:57,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 291. [2020-12-23 01:46:57,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-12-23 01:46:57,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 439 transitions. [2020-12-23 01:46:57,599 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 439 transitions. Word has length 110 [2020-12-23 01:46:57,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:57,599 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 439 transitions. [2020-12-23 01:46:57,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:57,599 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 439 transitions. [2020-12-23 01:46:57,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-23 01:46:57,600 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:57,601 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2020-12-23 01:46:57,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-12-23 01:46:57,601 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:57,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:57,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1658939710, now seen corresponding path program 1 times [2020-12-23 01:46:57,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:57,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924059617] [2020-12-23 01:46:57,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:57,681 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:57,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924059617] [2020-12-23 01:46:57,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:57,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:57,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297355036] [2020-12-23 01:46:57,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:57,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:57,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:57,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:57,683 INFO L87 Difference]: Start difference. First operand 291 states and 439 transitions. Second operand 4 states. [2020-12-23 01:46:58,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:58,183 INFO L93 Difference]: Finished difference Result 605 states and 917 transitions. [2020-12-23 01:46:58,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:58,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2020-12-23 01:46:58,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:58,186 INFO L225 Difference]: With dead ends: 605 [2020-12-23 01:46:58,186 INFO L226 Difference]: Without dead ends: 333 [2020-12-23 01:46:58,186 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:58,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2020-12-23 01:46:58,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 291. [2020-12-23 01:46:58,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-12-23 01:46:58,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 438 transitions. [2020-12-23 01:46:58,197 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 438 transitions. Word has length 111 [2020-12-23 01:46:58,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:58,198 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 438 transitions. [2020-12-23 01:46:58,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:58,198 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 438 transitions. [2020-12-23 01:46:58,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-23 01:46:58,199 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:58,199 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2020-12-23 01:46:58,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-12-23 01:46:58,199 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:58,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:58,200 INFO L82 PathProgramCache]: Analyzing trace with hash 246964595, now seen corresponding path program 1 times [2020-12-23 01:46:58,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:58,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820743213] [2020-12-23 01:46:58,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:58,278 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:58,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820743213] [2020-12-23 01:46:58,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:58,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:58,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759793129] [2020-12-23 01:46:58,279 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:58,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:58,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:58,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:58,280 INFO L87 Difference]: Start difference. First operand 291 states and 438 transitions. Second operand 4 states. [2020-12-23 01:46:58,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:58,719 INFO L93 Difference]: Finished difference Result 603 states and 913 transitions. [2020-12-23 01:46:58,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:58,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2020-12-23 01:46:58,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:58,722 INFO L225 Difference]: With dead ends: 603 [2020-12-23 01:46:58,722 INFO L226 Difference]: Without dead ends: 331 [2020-12-23 01:46:58,723 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:58,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2020-12-23 01:46:58,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 291. [2020-12-23 01:46:58,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-12-23 01:46:58,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 437 transitions. [2020-12-23 01:46:58,734 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 437 transitions. Word has length 111 [2020-12-23 01:46:58,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:58,734 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 437 transitions. [2020-12-23 01:46:58,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:58,734 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 437 transitions. [2020-12-23 01:46:58,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-12-23 01:46:58,735 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:58,736 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:46:58,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-12-23 01:46:58,736 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:58,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:58,736 INFO L82 PathProgramCache]: Analyzing trace with hash -2008149001, now seen corresponding path program 1 times [2020-12-23 01:46:58,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:58,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079352839] [2020-12-23 01:46:58,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:58,811 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:58,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079352839] [2020-12-23 01:46:58,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:58,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:58,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292368096] [2020-12-23 01:46:58,812 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:58,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:58,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:58,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:58,813 INFO L87 Difference]: Start difference. First operand 291 states and 437 transitions. Second operand 4 states. [2020-12-23 01:46:59,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:59,269 INFO L93 Difference]: Finished difference Result 601 states and 908 transitions. [2020-12-23 01:46:59,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:59,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2020-12-23 01:46:59,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:59,271 INFO L225 Difference]: With dead ends: 601 [2020-12-23 01:46:59,271 INFO L226 Difference]: Without dead ends: 329 [2020-12-23 01:46:59,272 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:59,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2020-12-23 01:46:59,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 291. [2020-12-23 01:46:59,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-12-23 01:46:59,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 436 transitions. [2020-12-23 01:46:59,284 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 436 transitions. Word has length 112 [2020-12-23 01:46:59,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:59,284 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 436 transitions. [2020-12-23 01:46:59,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:59,284 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 436 transitions. [2020-12-23 01:46:59,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-12-23 01:46:59,285 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:59,286 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2020-12-23 01:46:59,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-12-23 01:46:59,286 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:59,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:59,286 INFO L82 PathProgramCache]: Analyzing trace with hash 123475374, now seen corresponding path program 1 times [2020-12-23 01:46:59,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:59,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090539056] [2020-12-23 01:46:59,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:59,371 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:59,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090539056] [2020-12-23 01:46:59,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:59,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:59,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196302121] [2020-12-23 01:46:59,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:59,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:59,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:59,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:59,373 INFO L87 Difference]: Start difference. First operand 291 states and 436 transitions. Second operand 4 states. [2020-12-23 01:46:59,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:46:59,810 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2020-12-23 01:46:59,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:46:59,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2020-12-23 01:46:59,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:46:59,813 INFO L225 Difference]: With dead ends: 598 [2020-12-23 01:46:59,814 INFO L226 Difference]: Without dead ends: 326 [2020-12-23 01:46:59,814 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:46:59,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-12-23 01:46:59,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 291. [2020-12-23 01:46:59,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-12-23 01:46:59,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 435 transitions. [2020-12-23 01:46:59,825 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 435 transitions. Word has length 112 [2020-12-23 01:46:59,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:46:59,826 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 435 transitions. [2020-12-23 01:46:59,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:46:59,826 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 435 transitions. [2020-12-23 01:46:59,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-12-23 01:46:59,827 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:46:59,827 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:46:59,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-12-23 01:46:59,827 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:46:59,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:46:59,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1099399623, now seen corresponding path program 1 times [2020-12-23 01:46:59,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:46:59,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990004430] [2020-12-23 01:46:59,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:46:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:46:59,935 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:46:59,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990004430] [2020-12-23 01:46:59,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:46:59,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:46:59,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343039930] [2020-12-23 01:46:59,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:46:59,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:46:59,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:46:59,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:46:59,938 INFO L87 Difference]: Start difference. First operand 291 states and 435 transitions. Second operand 4 states. [2020-12-23 01:47:00,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:00,392 INFO L93 Difference]: Finished difference Result 598 states and 900 transitions. [2020-12-23 01:47:00,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:00,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2020-12-23 01:47:00,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:00,394 INFO L225 Difference]: With dead ends: 598 [2020-12-23 01:47:00,395 INFO L226 Difference]: Without dead ends: 326 [2020-12-23 01:47:00,396 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:00,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-12-23 01:47:00,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 291. [2020-12-23 01:47:00,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-12-23 01:47:00,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 434 transitions. [2020-12-23 01:47:00,408 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 434 transitions. Word has length 115 [2020-12-23 01:47:00,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:00,409 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 434 transitions. [2020-12-23 01:47:00,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:00,409 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 434 transitions. [2020-12-23 01:47:00,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-23 01:47:00,410 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:00,410 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2020-12-23 01:47:00,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-12-23 01:47:00,411 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:00,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:00,411 INFO L82 PathProgramCache]: Analyzing trace with hash -868715753, now seen corresponding path program 1 times [2020-12-23 01:47:00,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:00,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96677245] [2020-12-23 01:47:00,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:00,490 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:00,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96677245] [2020-12-23 01:47:00,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:00,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:00,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183381345] [2020-12-23 01:47:00,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:00,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:00,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:00,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:00,492 INFO L87 Difference]: Start difference. First operand 291 states and 434 transitions. Second operand 4 states. [2020-12-23 01:47:00,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:00,907 INFO L93 Difference]: Finished difference Result 592 states and 889 transitions. [2020-12-23 01:47:00,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:00,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2020-12-23 01:47:00,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:00,911 INFO L225 Difference]: With dead ends: 592 [2020-12-23 01:47:00,911 INFO L226 Difference]: Without dead ends: 320 [2020-12-23 01:47:00,912 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:00,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2020-12-23 01:47:00,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 291. [2020-12-23 01:47:00,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-12-23 01:47:00,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 433 transitions. [2020-12-23 01:47:00,923 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 433 transitions. Word has length 116 [2020-12-23 01:47:00,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:00,923 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 433 transitions. [2020-12-23 01:47:00,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:00,923 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 433 transitions. [2020-12-23 01:47:00,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-23 01:47:00,924 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:00,925 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2020-12-23 01:47:00,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-12-23 01:47:00,925 INFO L429 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:00,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:00,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1364168669, now seen corresponding path program 1 times [2020-12-23 01:47:00,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:00,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801075301] [2020-12-23 01:47:00,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:01,015 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:01,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801075301] [2020-12-23 01:47:01,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:01,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:01,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603380059] [2020-12-23 01:47:01,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:01,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:01,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:01,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:01,017 INFO L87 Difference]: Start difference. First operand 291 states and 433 transitions. Second operand 4 states. [2020-12-23 01:47:01,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:01,478 INFO L93 Difference]: Finished difference Result 592 states and 887 transitions. [2020-12-23 01:47:01,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:01,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2020-12-23 01:47:01,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:01,480 INFO L225 Difference]: With dead ends: 592 [2020-12-23 01:47:01,480 INFO L226 Difference]: Without dead ends: 320 [2020-12-23 01:47:01,481 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:01,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2020-12-23 01:47:01,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 291. [2020-12-23 01:47:01,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-12-23 01:47:01,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 432 transitions. [2020-12-23 01:47:01,493 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 432 transitions. Word has length 116 [2020-12-23 01:47:01,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:01,493 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 432 transitions. [2020-12-23 01:47:01,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:01,493 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 432 transitions. [2020-12-23 01:47:01,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-12-23 01:47:01,495 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:01,495 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2020-12-23 01:47:01,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-12-23 01:47:01,495 INFO L429 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:01,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:01,496 INFO L82 PathProgramCache]: Analyzing trace with hash -816836065, now seen corresponding path program 1 times [2020-12-23 01:47:01,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:01,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260069151] [2020-12-23 01:47:01,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:01,588 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:01,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260069151] [2020-12-23 01:47:01,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:01,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:01,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165008690] [2020-12-23 01:47:01,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:01,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:01,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:01,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:01,590 INFO L87 Difference]: Start difference. First operand 291 states and 432 transitions. Second operand 4 states. [2020-12-23 01:47:02,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:02,048 INFO L93 Difference]: Finished difference Result 589 states and 881 transitions. [2020-12-23 01:47:02,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:02,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2020-12-23 01:47:02,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:02,051 INFO L225 Difference]: With dead ends: 589 [2020-12-23 01:47:02,051 INFO L226 Difference]: Without dead ends: 317 [2020-12-23 01:47:02,052 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:02,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-12-23 01:47:02,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 291. [2020-12-23 01:47:02,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-12-23 01:47:02,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 431 transitions. [2020-12-23 01:47:02,063 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 431 transitions. Word has length 117 [2020-12-23 01:47:02,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:02,063 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 431 transitions. [2020-12-23 01:47:02,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:02,064 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 431 transitions. [2020-12-23 01:47:02,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-23 01:47:02,065 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:02,065 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2020-12-23 01:47:02,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-12-23 01:47:02,065 INFO L429 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:02,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:02,066 INFO L82 PathProgramCache]: Analyzing trace with hash 144074853, now seen corresponding path program 1 times [2020-12-23 01:47:02,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:02,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886654134] [2020-12-23 01:47:02,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:02,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886654134] [2020-12-23 01:47:02,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:02,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:02,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852321157] [2020-12-23 01:47:02,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:02,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:02,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:02,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:02,163 INFO L87 Difference]: Start difference. First operand 291 states and 431 transitions. Second operand 4 states. [2020-12-23 01:47:02,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:02,576 INFO L93 Difference]: Finished difference Result 589 states and 879 transitions. [2020-12-23 01:47:02,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:02,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2020-12-23 01:47:02,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:02,579 INFO L225 Difference]: With dead ends: 589 [2020-12-23 01:47:02,579 INFO L226 Difference]: Without dead ends: 317 [2020-12-23 01:47:02,580 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:02,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-12-23 01:47:02,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 291. [2020-12-23 01:47:02,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2020-12-23 01:47:02,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 430 transitions. [2020-12-23 01:47:02,590 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 430 transitions. Word has length 118 [2020-12-23 01:47:02,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:02,590 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 430 transitions. [2020-12-23 01:47:02,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:02,590 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 430 transitions. [2020-12-23 01:47:02,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-23 01:47:02,591 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:02,592 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2020-12-23 01:47:02,592 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-12-23 01:47:02,592 INFO L429 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:02,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:02,592 INFO L82 PathProgramCache]: Analyzing trace with hash 923316267, now seen corresponding path program 1 times [2020-12-23 01:47:02,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:02,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371766670] [2020-12-23 01:47:02,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:02,676 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-12-23 01:47:02,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371766670] [2020-12-23 01:47:02,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:02,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:02,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405628352] [2020-12-23 01:47:02,677 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:02,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:02,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:02,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:02,678 INFO L87 Difference]: Start difference. First operand 291 states and 430 transitions. Second operand 4 states. [2020-12-23 01:47:03,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:03,136 INFO L93 Difference]: Finished difference Result 635 states and 950 transitions. [2020-12-23 01:47:03,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:03,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2020-12-23 01:47:03,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:03,138 INFO L225 Difference]: With dead ends: 635 [2020-12-23 01:47:03,138 INFO L226 Difference]: Without dead ends: 363 [2020-12-23 01:47:03,139 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:03,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2020-12-23 01:47:03,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 323. [2020-12-23 01:47:03,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-12-23 01:47:03,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 487 transitions. [2020-12-23 01:47:03,150 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 487 transitions. Word has length 118 [2020-12-23 01:47:03,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:03,150 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 487 transitions. [2020-12-23 01:47:03,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:03,150 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 487 transitions. [2020-12-23 01:47:03,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-12-23 01:47:03,151 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:03,152 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:47:03,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2020-12-23 01:47:03,152 INFO L429 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:03,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:03,152 INFO L82 PathProgramCache]: Analyzing trace with hash -599704185, now seen corresponding path program 1 times [2020-12-23 01:47:03,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:03,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794006736] [2020-12-23 01:47:03,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:03,248 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:03,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794006736] [2020-12-23 01:47:03,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:03,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:03,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805343665] [2020-12-23 01:47:03,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:03,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:03,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:03,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:03,250 INFO L87 Difference]: Start difference. First operand 323 states and 487 transitions. Second operand 4 states. [2020-12-23 01:47:03,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:03,665 INFO L93 Difference]: Finished difference Result 650 states and 987 transitions. [2020-12-23 01:47:03,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:03,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2020-12-23 01:47:03,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:03,668 INFO L225 Difference]: With dead ends: 650 [2020-12-23 01:47:03,668 INFO L226 Difference]: Without dead ends: 346 [2020-12-23 01:47:03,669 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:03,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-12-23 01:47:03,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 323. [2020-12-23 01:47:03,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-12-23 01:47:03,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 486 transitions. [2020-12-23 01:47:03,680 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 486 transitions. Word has length 119 [2020-12-23 01:47:03,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:03,690 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 486 transitions. [2020-12-23 01:47:03,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:03,691 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 486 transitions. [2020-12-23 01:47:03,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-12-23 01:47:03,692 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:03,692 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 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] [2020-12-23 01:47:03,692 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2020-12-23 01:47:03,692 INFO L429 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:03,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:03,693 INFO L82 PathProgramCache]: Analyzing trace with hash 475698414, now seen corresponding path program 1 times [2020-12-23 01:47:03,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:03,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334785991] [2020-12-23 01:47:03,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:03,785 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:47:03,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334785991] [2020-12-23 01:47:03,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:03,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:03,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096728727] [2020-12-23 01:47:03,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:03,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:03,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:03,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:03,787 INFO L87 Difference]: Start difference. First operand 323 states and 486 transitions. Second operand 4 states. [2020-12-23 01:47:04,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:04,353 INFO L93 Difference]: Finished difference Result 739 states and 1126 transitions. [2020-12-23 01:47:04,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:04,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2020-12-23 01:47:04,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:04,356 INFO L225 Difference]: With dead ends: 739 [2020-12-23 01:47:04,357 INFO L226 Difference]: Without dead ends: 435 [2020-12-23 01:47:04,357 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:04,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2020-12-23 01:47:04,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 362. [2020-12-23 01:47:04,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2020-12-23 01:47:04,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 557 transitions. [2020-12-23 01:47:04,370 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 557 transitions. Word has length 119 [2020-12-23 01:47:04,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:04,370 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 557 transitions. [2020-12-23 01:47:04,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:04,370 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 557 transitions. [2020-12-23 01:47:04,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-23 01:47:04,371 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:04,372 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 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] [2020-12-23 01:47:04,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2020-12-23 01:47:04,372 INFO L429 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:04,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:04,372 INFO L82 PathProgramCache]: Analyzing trace with hash 2003600918, now seen corresponding path program 1 times [2020-12-23 01:47:04,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:04,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497020140] [2020-12-23 01:47:04,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:04,450 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:47:04,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497020140] [2020-12-23 01:47:04,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:04,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:04,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526924202] [2020-12-23 01:47:04,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:04,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:04,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:04,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:04,452 INFO L87 Difference]: Start difference. First operand 362 states and 557 transitions. Second operand 4 states. [2020-12-23 01:47:05,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:05,000 INFO L93 Difference]: Finished difference Result 769 states and 1183 transitions. [2020-12-23 01:47:05,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:05,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2020-12-23 01:47:05,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:05,003 INFO L225 Difference]: With dead ends: 769 [2020-12-23 01:47:05,003 INFO L226 Difference]: Without dead ends: 426 [2020-12-23 01:47:05,004 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:05,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2020-12-23 01:47:05,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 361. [2020-12-23 01:47:05,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2020-12-23 01:47:05,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 556 transitions. [2020-12-23 01:47:05,024 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 556 transitions. Word has length 120 [2020-12-23 01:47:05,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:05,025 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 556 transitions. [2020-12-23 01:47:05,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:05,025 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 556 transitions. [2020-12-23 01:47:05,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-23 01:47:05,026 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:05,027 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2020-12-23 01:47:05,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2020-12-23 01:47:05,027 INFO L429 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:05,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:05,027 INFO L82 PathProgramCache]: Analyzing trace with hash -661501137, now seen corresponding path program 1 times [2020-12-23 01:47:05,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:05,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685017591] [2020-12-23 01:47:05,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:05,108 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:47:05,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685017591] [2020-12-23 01:47:05,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:05,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:05,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090163120] [2020-12-23 01:47:05,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:05,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:05,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:05,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:05,110 INFO L87 Difference]: Start difference. First operand 361 states and 556 transitions. Second operand 4 states. [2020-12-23 01:47:05,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:05,466 INFO L93 Difference]: Finished difference Result 730 states and 1125 transitions. [2020-12-23 01:47:05,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:05,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2020-12-23 01:47:05,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:05,476 INFO L225 Difference]: With dead ends: 730 [2020-12-23 01:47:05,476 INFO L226 Difference]: Without dead ends: 388 [2020-12-23 01:47:05,477 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:05,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2020-12-23 01:47:05,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 361. [2020-12-23 01:47:05,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2020-12-23 01:47:05,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 555 transitions. [2020-12-23 01:47:05,490 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 555 transitions. Word has length 120 [2020-12-23 01:47:05,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:05,490 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 555 transitions. [2020-12-23 01:47:05,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:05,490 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 555 transitions. [2020-12-23 01:47:05,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-12-23 01:47:05,492 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:05,492 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2020-12-23 01:47:05,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2020-12-23 01:47:05,492 INFO L429 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:05,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:05,493 INFO L82 PathProgramCache]: Analyzing trace with hash -972713678, now seen corresponding path program 1 times [2020-12-23 01:47:05,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:05,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983246139] [2020-12-23 01:47:05,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:05,568 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:47:05,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983246139] [2020-12-23 01:47:05,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:05,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:05,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069037127] [2020-12-23 01:47:05,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:05,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:05,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:05,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:05,570 INFO L87 Difference]: Start difference. First operand 361 states and 555 transitions. Second operand 4 states. [2020-12-23 01:47:06,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:06,008 INFO L93 Difference]: Finished difference Result 730 states and 1123 transitions. [2020-12-23 01:47:06,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:06,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2020-12-23 01:47:06,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:06,010 INFO L225 Difference]: With dead ends: 730 [2020-12-23 01:47:06,010 INFO L226 Difference]: Without dead ends: 388 [2020-12-23 01:47:06,011 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:06,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2020-12-23 01:47:06,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 361. [2020-12-23 01:47:06,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2020-12-23 01:47:06,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 554 transitions. [2020-12-23 01:47:06,027 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 554 transitions. Word has length 121 [2020-12-23 01:47:06,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:06,027 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 554 transitions. [2020-12-23 01:47:06,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:06,028 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 554 transitions. [2020-12-23 01:47:06,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-12-23 01:47:06,029 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:06,029 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2020-12-23 01:47:06,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2020-12-23 01:47:06,029 INFO L429 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:06,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:06,030 INFO L82 PathProgramCache]: Analyzing trace with hash -2069164652, now seen corresponding path program 1 times [2020-12-23 01:47:06,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:06,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456344501] [2020-12-23 01:47:06,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:06,121 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:47:06,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456344501] [2020-12-23 01:47:06,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:06,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:06,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092579562] [2020-12-23 01:47:06,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:06,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:06,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:06,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:06,123 INFO L87 Difference]: Start difference. First operand 361 states and 554 transitions. Second operand 4 states. [2020-12-23 01:47:06,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:06,563 INFO L93 Difference]: Finished difference Result 730 states and 1121 transitions. [2020-12-23 01:47:06,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:06,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2020-12-23 01:47:06,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:06,565 INFO L225 Difference]: With dead ends: 730 [2020-12-23 01:47:06,565 INFO L226 Difference]: Without dead ends: 388 [2020-12-23 01:47:06,566 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:06,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2020-12-23 01:47:06,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 361. [2020-12-23 01:47:06,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2020-12-23 01:47:06,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 553 transitions. [2020-12-23 01:47:06,579 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 553 transitions. Word has length 122 [2020-12-23 01:47:06,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:06,579 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 553 transitions. [2020-12-23 01:47:06,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:06,580 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 553 transitions. [2020-12-23 01:47:06,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-12-23 01:47:06,581 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:06,581 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2020-12-23 01:47:06,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2020-12-23 01:47:06,581 INFO L429 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:06,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:06,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1738203273, now seen corresponding path program 1 times [2020-12-23 01:47:06,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:06,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508953203] [2020-12-23 01:47:06,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:06,655 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:47:06,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508953203] [2020-12-23 01:47:06,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:06,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:06,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936510297] [2020-12-23 01:47:06,656 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:06,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:06,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:06,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:06,657 INFO L87 Difference]: Start difference. First operand 361 states and 553 transitions. Second operand 4 states. [2020-12-23 01:47:07,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:07,028 INFO L93 Difference]: Finished difference Result 720 states and 1107 transitions. [2020-12-23 01:47:07,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:07,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2020-12-23 01:47:07,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:07,030 INFO L225 Difference]: With dead ends: 720 [2020-12-23 01:47:07,030 INFO L226 Difference]: Without dead ends: 378 [2020-12-23 01:47:07,031 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:07,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2020-12-23 01:47:07,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 361. [2020-12-23 01:47:07,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2020-12-23 01:47:07,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 552 transitions. [2020-12-23 01:47:07,043 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 552 transitions. Word has length 123 [2020-12-23 01:47:07,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:07,044 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 552 transitions. [2020-12-23 01:47:07,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:07,044 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 552 transitions. [2020-12-23 01:47:07,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-12-23 01:47:07,045 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:07,045 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2020-12-23 01:47:07,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2020-12-23 01:47:07,046 INFO L429 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:07,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:07,046 INFO L82 PathProgramCache]: Analyzing trace with hash -213721941, now seen corresponding path program 1 times [2020-12-23 01:47:07,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:07,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861537592] [2020-12-23 01:47:07,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:07,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861537592] [2020-12-23 01:47:07,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:07,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:47:07,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023274137] [2020-12-23 01:47:07,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:47:07,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:07,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:47:07,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:47:07,116 INFO L87 Difference]: Start difference. First operand 361 states and 552 transitions. Second operand 3 states. [2020-12-23 01:47:07,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:07,257 INFO L93 Difference]: Finished difference Result 1040 states and 1606 transitions. [2020-12-23 01:47:07,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:47:07,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2020-12-23 01:47:07,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:07,262 INFO L225 Difference]: With dead ends: 1040 [2020-12-23 01:47:07,262 INFO L226 Difference]: Without dead ends: 698 [2020-12-23 01:47:07,263 INFO L677 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 [2020-12-23 01:47:07,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2020-12-23 01:47:07,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2020-12-23 01:47:07,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2020-12-23 01:47:07,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1054 transitions. [2020-12-23 01:47:07,295 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1054 transitions. Word has length 124 [2020-12-23 01:47:07,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:07,295 INFO L481 AbstractCegarLoop]: Abstraction has 696 states and 1054 transitions. [2020-12-23 01:47:07,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:47:07,295 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1054 transitions. [2020-12-23 01:47:07,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-12-23 01:47:07,297 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:07,298 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2020-12-23 01:47:07,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2020-12-23 01:47:07,298 INFO L429 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:07,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:07,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1662760877, now seen corresponding path program 1 times [2020-12-23 01:47:07,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:07,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416806762] [2020-12-23 01:47:07,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:07,351 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-12-23 01:47:07,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416806762] [2020-12-23 01:47:07,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:07,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:47:07,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669552119] [2020-12-23 01:47:07,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:47:07,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:07,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:47:07,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:47:07,352 INFO L87 Difference]: Start difference. First operand 696 states and 1054 transitions. Second operand 3 states. [2020-12-23 01:47:07,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:07,444 INFO L93 Difference]: Finished difference Result 1400 states and 2123 transitions. [2020-12-23 01:47:07,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:47:07,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2020-12-23 01:47:07,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:07,449 INFO L225 Difference]: With dead ends: 1400 [2020-12-23 01:47:07,449 INFO L226 Difference]: Without dead ends: 723 [2020-12-23 01:47:07,450 INFO L677 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 [2020-12-23 01:47:07,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2020-12-23 01:47:07,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2020-12-23 01:47:07,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2020-12-23 01:47:07,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1089 transitions. [2020-12-23 01:47:07,476 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1089 transitions. Word has length 124 [2020-12-23 01:47:07,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:07,477 INFO L481 AbstractCegarLoop]: Abstraction has 723 states and 1089 transitions. [2020-12-23 01:47:07,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:47:07,477 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1089 transitions. [2020-12-23 01:47:07,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-12-23 01:47:07,479 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:07,479 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2020-12-23 01:47:07,479 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2020-12-23 01:47:07,479 INFO L429 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:07,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:07,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1781202351, now seen corresponding path program 1 times [2020-12-23 01:47:07,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:07,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099499516] [2020-12-23 01:47:07,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:07,527 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2020-12-23 01:47:07,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099499516] [2020-12-23 01:47:07,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:07,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:47:07,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107851568] [2020-12-23 01:47:07,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:47:07,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:07,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:47:07,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:47:07,528 INFO L87 Difference]: Start difference. First operand 723 states and 1089 transitions. Second operand 3 states. [2020-12-23 01:47:07,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:07,594 INFO L93 Difference]: Finished difference Result 1429 states and 2159 transitions. [2020-12-23 01:47:07,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:47:07,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2020-12-23 01:47:07,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:07,598 INFO L225 Difference]: With dead ends: 1429 [2020-12-23 01:47:07,598 INFO L226 Difference]: Without dead ends: 725 [2020-12-23 01:47:07,599 INFO L677 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 [2020-12-23 01:47:07,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2020-12-23 01:47:07,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2020-12-23 01:47:07,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2020-12-23 01:47:07,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1091 transitions. [2020-12-23 01:47:07,626 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1091 transitions. Word has length 124 [2020-12-23 01:47:07,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:07,626 INFO L481 AbstractCegarLoop]: Abstraction has 725 states and 1091 transitions. [2020-12-23 01:47:07,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:47:07,627 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1091 transitions. [2020-12-23 01:47:07,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-12-23 01:47:07,629 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:07,629 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2020-12-23 01:47:07,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2020-12-23 01:47:07,629 INFO L429 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:07,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:07,630 INFO L82 PathProgramCache]: Analyzing trace with hash -181093733, now seen corresponding path program 1 times [2020-12-23 01:47:07,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:07,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084387594] [2020-12-23 01:47:07,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:07,712 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:47:07,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084387594] [2020-12-23 01:47:07,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:07,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:07,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935728785] [2020-12-23 01:47:07,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:07,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:07,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:07,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:07,714 INFO L87 Difference]: Start difference. First operand 725 states and 1091 transitions. Second operand 4 states. [2020-12-23 01:47:08,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:08,345 INFO L93 Difference]: Finished difference Result 1649 states and 2491 transitions. [2020-12-23 01:47:08,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:08,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2020-12-23 01:47:08,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:08,350 INFO L225 Difference]: With dead ends: 1649 [2020-12-23 01:47:08,350 INFO L226 Difference]: Without dead ends: 945 [2020-12-23 01:47:08,351 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:08,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2020-12-23 01:47:08,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 803. [2020-12-23 01:47:08,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-12-23 01:47:08,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1233 transitions. [2020-12-23 01:47:08,378 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1233 transitions. Word has length 127 [2020-12-23 01:47:08,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:08,378 INFO L481 AbstractCegarLoop]: Abstraction has 803 states and 1233 transitions. [2020-12-23 01:47:08,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:08,379 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1233 transitions. [2020-12-23 01:47:08,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-12-23 01:47:08,381 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:08,381 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 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] [2020-12-23 01:47:08,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2020-12-23 01:47:08,381 INFO L429 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:08,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:08,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1177086455, now seen corresponding path program 1 times [2020-12-23 01:47:08,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:08,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881711907] [2020-12-23 01:47:08,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:08,464 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:47:08,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881711907] [2020-12-23 01:47:08,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:08,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:08,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162103412] [2020-12-23 01:47:08,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:08,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:08,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:08,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:08,466 INFO L87 Difference]: Start difference. First operand 803 states and 1233 transitions. Second operand 4 states. [2020-12-23 01:47:09,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:09,031 INFO L93 Difference]: Finished difference Result 1713 states and 2613 transitions. [2020-12-23 01:47:09,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:09,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2020-12-23 01:47:09,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:09,037 INFO L225 Difference]: With dead ends: 1713 [2020-12-23 01:47:09,037 INFO L226 Difference]: Without dead ends: 931 [2020-12-23 01:47:09,038 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:09,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2020-12-23 01:47:09,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 725. [2020-12-23 01:47:09,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2020-12-23 01:47:09,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1091 transitions. [2020-12-23 01:47:09,066 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1091 transitions. Word has length 128 [2020-12-23 01:47:09,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:09,066 INFO L481 AbstractCegarLoop]: Abstraction has 725 states and 1091 transitions. [2020-12-23 01:47:09,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:09,066 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1091 transitions. [2020-12-23 01:47:09,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-12-23 01:47:09,068 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:09,068 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2020-12-23 01:47:09,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2020-12-23 01:47:09,069 INFO L429 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:09,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:09,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1073512160, now seen corresponding path program 1 times [2020-12-23 01:47:09,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:09,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053664229] [2020-12-23 01:47:09,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:09,185 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:09,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053664229] [2020-12-23 01:47:09,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:09,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:09,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164002300] [2020-12-23 01:47:09,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:09,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:09,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:09,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:09,186 INFO L87 Difference]: Start difference. First operand 725 states and 1091 transitions. Second operand 4 states. [2020-12-23 01:47:09,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:09,635 INFO L93 Difference]: Finished difference Result 1461 states and 2199 transitions. [2020-12-23 01:47:09,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:09,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2020-12-23 01:47:09,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:09,640 INFO L225 Difference]: With dead ends: 1461 [2020-12-23 01:47:09,641 INFO L226 Difference]: Without dead ends: 757 [2020-12-23 01:47:09,642 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:09,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2020-12-23 01:47:09,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 731. [2020-12-23 01:47:09,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2020-12-23 01:47:09,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1097 transitions. [2020-12-23 01:47:09,672 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1097 transitions. Word has length 129 [2020-12-23 01:47:09,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:09,672 INFO L481 AbstractCegarLoop]: Abstraction has 731 states and 1097 transitions. [2020-12-23 01:47:09,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:09,672 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1097 transitions. [2020-12-23 01:47:09,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 01:47:09,674 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:09,675 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 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] [2020-12-23 01:47:09,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2020-12-23 01:47:09,675 INFO L429 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:09,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:09,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1409563339, now seen corresponding path program 1 times [2020-12-23 01:47:09,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:09,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884361223] [2020-12-23 01:47:09,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:09,751 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-12-23 01:47:09,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884361223] [2020-12-23 01:47:09,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:09,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:09,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733287615] [2020-12-23 01:47:09,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:09,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:09,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:09,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:09,753 INFO L87 Difference]: Start difference. First operand 731 states and 1097 transitions. Second operand 4 states. [2020-12-23 01:47:10,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:10,154 INFO L93 Difference]: Finished difference Result 1475 states and 2213 transitions. [2020-12-23 01:47:10,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:10,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2020-12-23 01:47:10,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:10,159 INFO L225 Difference]: With dead ends: 1475 [2020-12-23 01:47:10,159 INFO L226 Difference]: Without dead ends: 765 [2020-12-23 01:47:10,160 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:10,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2020-12-23 01:47:10,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 731. [2020-12-23 01:47:10,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2020-12-23 01:47:10,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1095 transitions. [2020-12-23 01:47:10,189 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1095 transitions. Word has length 133 [2020-12-23 01:47:10,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:10,190 INFO L481 AbstractCegarLoop]: Abstraction has 731 states and 1095 transitions. [2020-12-23 01:47:10,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:10,190 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1095 transitions. [2020-12-23 01:47:10,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 01:47:10,191 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:10,192 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2020-12-23 01:47:10,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2020-12-23 01:47:10,192 INFO L429 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:10,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:10,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1255557316, now seen corresponding path program 1 times [2020-12-23 01:47:10,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:10,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710416848] [2020-12-23 01:47:10,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:10,299 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-12-23 01:47:10,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710416848] [2020-12-23 01:47:10,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:10,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:10,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958790897] [2020-12-23 01:47:10,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:10,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:10,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:10,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:10,301 INFO L87 Difference]: Start difference. First operand 731 states and 1095 transitions. Second operand 4 states. [2020-12-23 01:47:10,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:10,783 INFO L93 Difference]: Finished difference Result 1567 states and 2359 transitions. [2020-12-23 01:47:10,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:10,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2020-12-23 01:47:10,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:10,788 INFO L225 Difference]: With dead ends: 1567 [2020-12-23 01:47:10,788 INFO L226 Difference]: Without dead ends: 857 [2020-12-23 01:47:10,789 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:10,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2020-12-23 01:47:10,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 787. [2020-12-23 01:47:10,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-12-23 01:47:10,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1193 transitions. [2020-12-23 01:47:10,812 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1193 transitions. Word has length 133 [2020-12-23 01:47:10,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:10,813 INFO L481 AbstractCegarLoop]: Abstraction has 787 states and 1193 transitions. [2020-12-23 01:47:10,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:10,813 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1193 transitions. [2020-12-23 01:47:10,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-12-23 01:47:10,815 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:10,815 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 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] [2020-12-23 01:47:10,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2020-12-23 01:47:10,815 INFO L429 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:10,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:10,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1833882926, now seen corresponding path program 1 times [2020-12-23 01:47:10,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:10,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872523209] [2020-12-23 01:47:10,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:10,895 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-12-23 01:47:10,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872523209] [2020-12-23 01:47:10,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:10,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:10,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888007100] [2020-12-23 01:47:10,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:10,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:10,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:10,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:10,897 INFO L87 Difference]: Start difference. First operand 787 states and 1193 transitions. Second operand 4 states. [2020-12-23 01:47:11,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:11,284 INFO L93 Difference]: Finished difference Result 1583 states and 2401 transitions. [2020-12-23 01:47:11,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:11,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2020-12-23 01:47:11,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:11,289 INFO L225 Difference]: With dead ends: 1583 [2020-12-23 01:47:11,289 INFO L226 Difference]: Without dead ends: 817 [2020-12-23 01:47:11,290 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:11,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2020-12-23 01:47:11,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 787. [2020-12-23 01:47:11,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-12-23 01:47:11,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1191 transitions. [2020-12-23 01:47:11,330 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1191 transitions. Word has length 134 [2020-12-23 01:47:11,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:11,331 INFO L481 AbstractCegarLoop]: Abstraction has 787 states and 1191 transitions. [2020-12-23 01:47:11,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:11,331 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1191 transitions. [2020-12-23 01:47:11,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2020-12-23 01:47:11,333 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:11,333 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 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] [2020-12-23 01:47:11,333 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2020-12-23 01:47:11,333 INFO L429 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:11,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:11,334 INFO L82 PathProgramCache]: Analyzing trace with hash 373383698, now seen corresponding path program 1 times [2020-12-23 01:47:11,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:11,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096704099] [2020-12-23 01:47:11,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:11,399 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:47:11,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096704099] [2020-12-23 01:47:11,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:11,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:11,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577996580] [2020-12-23 01:47:11,400 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:11,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:11,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:11,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:11,415 INFO L87 Difference]: Start difference. First operand 787 states and 1191 transitions. Second operand 4 states. [2020-12-23 01:47:11,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:11,907 INFO L93 Difference]: Finished difference Result 1759 states and 2669 transitions. [2020-12-23 01:47:11,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:11,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2020-12-23 01:47:11,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:11,912 INFO L225 Difference]: With dead ends: 1759 [2020-12-23 01:47:11,913 INFO L226 Difference]: Without dead ends: 993 [2020-12-23 01:47:11,914 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:11,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2020-12-23 01:47:11,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 811. [2020-12-23 01:47:11,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2020-12-23 01:47:11,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1225 transitions. [2020-12-23 01:47:11,945 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1225 transitions. Word has length 134 [2020-12-23 01:47:11,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:11,945 INFO L481 AbstractCegarLoop]: Abstraction has 811 states and 1225 transitions. [2020-12-23 01:47:11,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:11,945 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1225 transitions. [2020-12-23 01:47:11,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-12-23 01:47:11,947 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:11,948 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 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] [2020-12-23 01:47:11,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2020-12-23 01:47:11,948 INFO L429 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:11,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:11,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1043945135, now seen corresponding path program 1 times [2020-12-23 01:47:11,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:11,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047906750] [2020-12-23 01:47:11,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:12,021 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:47:12,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047906750] [2020-12-23 01:47:12,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:12,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:12,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022765337] [2020-12-23 01:47:12,022 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:12,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:12,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:12,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:12,023 INFO L87 Difference]: Start difference. First operand 811 states and 1225 transitions. Second operand 4 states. [2020-12-23 01:47:12,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:12,576 INFO L93 Difference]: Finished difference Result 1783 states and 2701 transitions. [2020-12-23 01:47:12,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:12,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2020-12-23 01:47:12,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:12,582 INFO L225 Difference]: With dead ends: 1783 [2020-12-23 01:47:12,582 INFO L226 Difference]: Without dead ends: 993 [2020-12-23 01:47:12,583 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:12,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2020-12-23 01:47:12,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 813. [2020-12-23 01:47:12,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2020-12-23 01:47:12,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1227 transitions. [2020-12-23 01:47:12,626 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1227 transitions. Word has length 135 [2020-12-23 01:47:12,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:12,626 INFO L481 AbstractCegarLoop]: Abstraction has 813 states and 1227 transitions. [2020-12-23 01:47:12,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:12,627 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1227 transitions. [2020-12-23 01:47:12,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-12-23 01:47:12,629 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:12,629 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 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] [2020-12-23 01:47:12,630 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2020-12-23 01:47:12,630 INFO L429 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:12,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:12,630 INFO L82 PathProgramCache]: Analyzing trace with hash 317716407, now seen corresponding path program 1 times [2020-12-23 01:47:12,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:12,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752988323] [2020-12-23 01:47:12,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:12,724 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:47:12,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752988323] [2020-12-23 01:47:12,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:12,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:12,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360014717] [2020-12-23 01:47:12,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:12,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:12,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:12,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:12,726 INFO L87 Difference]: Start difference. First operand 813 states and 1227 transitions. Second operand 4 states. [2020-12-23 01:47:13,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:13,245 INFO L93 Difference]: Finished difference Result 1785 states and 2701 transitions. [2020-12-23 01:47:13,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:13,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2020-12-23 01:47:13,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:13,249 INFO L225 Difference]: With dead ends: 1785 [2020-12-23 01:47:13,249 INFO L226 Difference]: Without dead ends: 993 [2020-12-23 01:47:13,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:13,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2020-12-23 01:47:13,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 815. [2020-12-23 01:47:13,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2020-12-23 01:47:13,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1229 transitions. [2020-12-23 01:47:13,277 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1229 transitions. Word has length 136 [2020-12-23 01:47:13,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:13,277 INFO L481 AbstractCegarLoop]: Abstraction has 815 states and 1229 transitions. [2020-12-23 01:47:13,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:13,277 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1229 transitions. [2020-12-23 01:47:13,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-12-23 01:47:13,279 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:13,280 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 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] [2020-12-23 01:47:13,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2020-12-23 01:47:13,280 INFO L429 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:13,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:13,280 INFO L82 PathProgramCache]: Analyzing trace with hash -759334476, now seen corresponding path program 1 times [2020-12-23 01:47:13,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:13,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268385348] [2020-12-23 01:47:13,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:13,355 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:47:13,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268385348] [2020-12-23 01:47:13,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:13,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:13,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693986279] [2020-12-23 01:47:13,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:13,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:13,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:13,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:13,357 INFO L87 Difference]: Start difference. First operand 815 states and 1229 transitions. Second operand 4 states. [2020-12-23 01:47:13,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:13,924 INFO L93 Difference]: Finished difference Result 1767 states and 2677 transitions. [2020-12-23 01:47:13,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:13,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2020-12-23 01:47:13,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:13,927 INFO L225 Difference]: With dead ends: 1767 [2020-12-23 01:47:13,927 INFO L226 Difference]: Without dead ends: 973 [2020-12-23 01:47:13,928 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:13,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2020-12-23 01:47:13,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 817. [2020-12-23 01:47:13,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2020-12-23 01:47:13,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1231 transitions. [2020-12-23 01:47:13,961 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1231 transitions. Word has length 137 [2020-12-23 01:47:13,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:13,961 INFO L481 AbstractCegarLoop]: Abstraction has 817 states and 1231 transitions. [2020-12-23 01:47:13,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:13,961 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1231 transitions. [2020-12-23 01:47:13,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-12-23 01:47:13,963 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:13,963 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2020-12-23 01:47:13,963 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2020-12-23 01:47:13,964 INFO L429 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:13,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:13,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1295283003, now seen corresponding path program 1 times [2020-12-23 01:47:13,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:13,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185667397] [2020-12-23 01:47:13,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:14,045 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:47:14,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185667397] [2020-12-23 01:47:14,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:14,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:14,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891348148] [2020-12-23 01:47:14,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:14,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:14,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:14,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:14,047 INFO L87 Difference]: Start difference. First operand 817 states and 1231 transitions. Second operand 4 states. [2020-12-23 01:47:14,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:14,655 INFO L93 Difference]: Finished difference Result 1789 states and 2701 transitions. [2020-12-23 01:47:14,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:14,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2020-12-23 01:47:14,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:14,666 INFO L225 Difference]: With dead ends: 1789 [2020-12-23 01:47:14,666 INFO L226 Difference]: Without dead ends: 993 [2020-12-23 01:47:14,667 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:14,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2020-12-23 01:47:14,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 817. [2020-12-23 01:47:14,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2020-12-23 01:47:14,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1229 transitions. [2020-12-23 01:47:14,700 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1229 transitions. Word has length 142 [2020-12-23 01:47:14,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:14,700 INFO L481 AbstractCegarLoop]: Abstraction has 817 states and 1229 transitions. [2020-12-23 01:47:14,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:14,700 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1229 transitions. [2020-12-23 01:47:14,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2020-12-23 01:47:14,702 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:14,702 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2020-12-23 01:47:14,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2020-12-23 01:47:14,702 INFO L429 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:14,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:14,703 INFO L82 PathProgramCache]: Analyzing trace with hash 854884956, now seen corresponding path program 1 times [2020-12-23 01:47:14,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:14,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491960272] [2020-12-23 01:47:14,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:14,779 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:47:14,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491960272] [2020-12-23 01:47:14,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:14,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:14,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081534922] [2020-12-23 01:47:14,780 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:14,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:14,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:14,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:14,780 INFO L87 Difference]: Start difference. First operand 817 states and 1229 transitions. Second operand 4 states. [2020-12-23 01:47:15,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:15,379 INFO L93 Difference]: Finished difference Result 1789 states and 2697 transitions. [2020-12-23 01:47:15,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:15,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2020-12-23 01:47:15,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:15,385 INFO L225 Difference]: With dead ends: 1789 [2020-12-23 01:47:15,385 INFO L226 Difference]: Without dead ends: 993 [2020-12-23 01:47:15,386 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:15,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2020-12-23 01:47:15,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 817. [2020-12-23 01:47:15,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2020-12-23 01:47:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1227 transitions. [2020-12-23 01:47:15,411 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1227 transitions. Word has length 143 [2020-12-23 01:47:15,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:15,412 INFO L481 AbstractCegarLoop]: Abstraction has 817 states and 1227 transitions. [2020-12-23 01:47:15,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:15,412 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1227 transitions. [2020-12-23 01:47:15,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-23 01:47:15,414 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:15,414 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2020-12-23 01:47:15,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2020-12-23 01:47:15,415 INFO L429 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:15,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:15,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1248181846, now seen corresponding path program 1 times [2020-12-23 01:47:15,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:15,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273080878] [2020-12-23 01:47:15,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:15,491 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:47:15,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273080878] [2020-12-23 01:47:15,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:15,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:15,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867189099] [2020-12-23 01:47:15,492 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:15,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:15,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:15,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:15,493 INFO L87 Difference]: Start difference. First operand 817 states and 1227 transitions. Second operand 4 states. [2020-12-23 01:47:16,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:16,069 INFO L93 Difference]: Finished difference Result 1789 states and 2693 transitions. [2020-12-23 01:47:16,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:16,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2020-12-23 01:47:16,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:16,071 INFO L225 Difference]: With dead ends: 1789 [2020-12-23 01:47:16,071 INFO L226 Difference]: Without dead ends: 993 [2020-12-23 01:47:16,072 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:16,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2020-12-23 01:47:16,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 817. [2020-12-23 01:47:16,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2020-12-23 01:47:16,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1225 transitions. [2020-12-23 01:47:16,100 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1225 transitions. Word has length 144 [2020-12-23 01:47:16,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:16,100 INFO L481 AbstractCegarLoop]: Abstraction has 817 states and 1225 transitions. [2020-12-23 01:47:16,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:16,100 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1225 transitions. [2020-12-23 01:47:16,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-12-23 01:47:16,102 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:16,102 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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] [2020-12-23 01:47:16,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2020-12-23 01:47:16,102 INFO L429 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:16,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:16,103 INFO L82 PathProgramCache]: Analyzing trace with hash 283430609, now seen corresponding path program 1 times [2020-12-23 01:47:16,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:16,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954324338] [2020-12-23 01:47:16,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:16,183 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:47:16,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954324338] [2020-12-23 01:47:16,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:16,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:16,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564364702] [2020-12-23 01:47:16,184 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:16,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:16,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:16,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:16,185 INFO L87 Difference]: Start difference. First operand 817 states and 1225 transitions. Second operand 4 states. [2020-12-23 01:47:16,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:16,707 INFO L93 Difference]: Finished difference Result 1769 states and 2665 transitions. [2020-12-23 01:47:16,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:16,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2020-12-23 01:47:16,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:16,709 INFO L225 Difference]: With dead ends: 1769 [2020-12-23 01:47:16,709 INFO L226 Difference]: Without dead ends: 973 [2020-12-23 01:47:16,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:16,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2020-12-23 01:47:16,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 843. [2020-12-23 01:47:16,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2020-12-23 01:47:16,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1275 transitions. [2020-12-23 01:47:16,742 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1275 transitions. Word has length 144 [2020-12-23 01:47:16,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:16,742 INFO L481 AbstractCegarLoop]: Abstraction has 843 states and 1275 transitions. [2020-12-23 01:47:16,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:16,742 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1275 transitions. [2020-12-23 01:47:16,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 01:47:16,744 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:16,744 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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] [2020-12-23 01:47:16,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2020-12-23 01:47:16,745 INFO L429 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:16,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:16,745 INFO L82 PathProgramCache]: Analyzing trace with hash -2057540063, now seen corresponding path program 1 times [2020-12-23 01:47:16,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:16,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109639806] [2020-12-23 01:47:16,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:16,820 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:47:16,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109639806] [2020-12-23 01:47:16,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:16,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:16,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056925007] [2020-12-23 01:47:16,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:16,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:16,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:16,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:16,822 INFO L87 Difference]: Start difference. First operand 843 states and 1275 transitions. Second operand 4 states. [2020-12-23 01:47:17,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:17,377 INFO L93 Difference]: Finished difference Result 1795 states and 2713 transitions. [2020-12-23 01:47:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:17,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2020-12-23 01:47:17,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:17,383 INFO L225 Difference]: With dead ends: 1795 [2020-12-23 01:47:17,383 INFO L226 Difference]: Without dead ends: 973 [2020-12-23 01:47:17,384 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:17,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2020-12-23 01:47:17,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 843. [2020-12-23 01:47:17,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2020-12-23 01:47:17,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1273 transitions. [2020-12-23 01:47:17,417 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1273 transitions. Word has length 145 [2020-12-23 01:47:17,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:17,417 INFO L481 AbstractCegarLoop]: Abstraction has 843 states and 1273 transitions. [2020-12-23 01:47:17,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:17,418 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1273 transitions. [2020-12-23 01:47:17,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 01:47:17,419 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:17,420 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2020-12-23 01:47:17,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2020-12-23 01:47:17,420 INFO L429 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:17,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:17,421 INFO L82 PathProgramCache]: Analyzing trace with hash 391170094, now seen corresponding path program 1 times [2020-12-23 01:47:17,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:17,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290142384] [2020-12-23 01:47:17,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:17,504 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:47:17,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290142384] [2020-12-23 01:47:17,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:17,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:17,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710064544] [2020-12-23 01:47:17,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:17,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:17,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:17,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:17,505 INFO L87 Difference]: Start difference. First operand 843 states and 1273 transitions. Second operand 4 states. [2020-12-23 01:47:18,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:18,016 INFO L93 Difference]: Finished difference Result 1779 states and 2683 transitions. [2020-12-23 01:47:18,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:18,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2020-12-23 01:47:18,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:18,019 INFO L225 Difference]: With dead ends: 1779 [2020-12-23 01:47:18,019 INFO L226 Difference]: Without dead ends: 957 [2020-12-23 01:47:18,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:18,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2020-12-23 01:47:18,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 845. [2020-12-23 01:47:18,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2020-12-23 01:47:18,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1275 transitions. [2020-12-23 01:47:18,055 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1275 transitions. Word has length 145 [2020-12-23 01:47:18,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:18,055 INFO L481 AbstractCegarLoop]: Abstraction has 845 states and 1275 transitions. [2020-12-23 01:47:18,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:18,055 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1275 transitions. [2020-12-23 01:47:18,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-12-23 01:47:18,057 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:18,057 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 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] [2020-12-23 01:47:18,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2020-12-23 01:47:18,058 INFO L429 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:18,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:18,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1180027086, now seen corresponding path program 1 times [2020-12-23 01:47:18,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:18,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48233390] [2020-12-23 01:47:18,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2020-12-23 01:47:18,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48233390] [2020-12-23 01:47:18,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:18,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:18,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403673868] [2020-12-23 01:47:18,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:18,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:18,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:18,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:18,140 INFO L87 Difference]: Start difference. First operand 845 states and 1275 transitions. Second operand 4 states. [2020-12-23 01:47:18,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:18,629 INFO L93 Difference]: Finished difference Result 1781 states and 2683 transitions. [2020-12-23 01:47:18,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:18,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2020-12-23 01:47:18,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:18,633 INFO L225 Difference]: With dead ends: 1781 [2020-12-23 01:47:18,633 INFO L226 Difference]: Without dead ends: 957 [2020-12-23 01:47:18,634 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:18,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2020-12-23 01:47:18,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 845. [2020-12-23 01:47:18,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2020-12-23 01:47:18,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1273 transitions. [2020-12-23 01:47:18,658 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1273 transitions. Word has length 147 [2020-12-23 01:47:18,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:18,659 INFO L481 AbstractCegarLoop]: Abstraction has 845 states and 1273 transitions. [2020-12-23 01:47:18,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:18,659 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1273 transitions. [2020-12-23 01:47:18,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-23 01:47:18,661 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:18,661 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 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] [2020-12-23 01:47:18,661 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2020-12-23 01:47:18,661 INFO L429 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:18,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:18,662 INFO L82 PathProgramCache]: Analyzing trace with hash 986773621, now seen corresponding path program 1 times [2020-12-23 01:47:18,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:18,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375280841] [2020-12-23 01:47:18,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:18,757 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2020-12-23 01:47:18,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375280841] [2020-12-23 01:47:18,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:18,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:18,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199164970] [2020-12-23 01:47:18,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:18,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:18,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:18,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:18,760 INFO L87 Difference]: Start difference. First operand 845 states and 1273 transitions. Second operand 4 states. [2020-12-23 01:47:19,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:19,233 INFO L93 Difference]: Finished difference Result 1777 states and 2675 transitions. [2020-12-23 01:47:19,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:19,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2020-12-23 01:47:19,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:19,236 INFO L225 Difference]: With dead ends: 1777 [2020-12-23 01:47:19,236 INFO L226 Difference]: Without dead ends: 953 [2020-12-23 01:47:19,237 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:19,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2020-12-23 01:47:19,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 845. [2020-12-23 01:47:19,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2020-12-23 01:47:19,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1271 transitions. [2020-12-23 01:47:19,264 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1271 transitions. Word has length 148 [2020-12-23 01:47:19,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:19,264 INFO L481 AbstractCegarLoop]: Abstraction has 845 states and 1271 transitions. [2020-12-23 01:47:19,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:19,264 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1271 transitions. [2020-12-23 01:47:19,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-23 01:47:19,265 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:19,266 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:47:19,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2020-12-23 01:47:19,266 INFO L429 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:19,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:19,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1505929965, now seen corresponding path program 1 times [2020-12-23 01:47:19,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:19,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042012586] [2020-12-23 01:47:19,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:19,349 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:47:19,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042012586] [2020-12-23 01:47:19,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:19,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:19,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618881386] [2020-12-23 01:47:19,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:19,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:19,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:19,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:19,351 INFO L87 Difference]: Start difference. First operand 845 states and 1271 transitions. Second operand 4 states. [2020-12-23 01:47:19,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:19,830 INFO L93 Difference]: Finished difference Result 1771 states and 2663 transitions. [2020-12-23 01:47:19,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:19,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2020-12-23 01:47:19,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:19,832 INFO L225 Difference]: With dead ends: 1771 [2020-12-23 01:47:19,833 INFO L226 Difference]: Without dead ends: 947 [2020-12-23 01:47:19,833 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:19,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2020-12-23 01:47:19,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 851. [2020-12-23 01:47:19,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2020-12-23 01:47:19,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1281 transitions. [2020-12-23 01:47:19,858 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1281 transitions. Word has length 148 [2020-12-23 01:47:19,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:19,858 INFO L481 AbstractCegarLoop]: Abstraction has 851 states and 1281 transitions. [2020-12-23 01:47:19,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:19,858 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1281 transitions. [2020-12-23 01:47:19,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-23 01:47:19,861 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:19,861 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2020-12-23 01:47:19,861 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2020-12-23 01:47:19,861 INFO L429 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:19,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:19,862 INFO L82 PathProgramCache]: Analyzing trace with hash -8676860, now seen corresponding path program 1 times [2020-12-23 01:47:19,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:19,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811912289] [2020-12-23 01:47:19,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:19,949 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-12-23 01:47:19,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811912289] [2020-12-23 01:47:19,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:19,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:19,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559632987] [2020-12-23 01:47:19,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:19,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:19,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:19,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:19,951 INFO L87 Difference]: Start difference. First operand 851 states and 1281 transitions. Second operand 4 states. [2020-12-23 01:47:20,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:20,424 INFO L93 Difference]: Finished difference Result 1751 states and 2631 transitions. [2020-12-23 01:47:20,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:20,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2020-12-23 01:47:20,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:20,427 INFO L225 Difference]: With dead ends: 1751 [2020-12-23 01:47:20,427 INFO L226 Difference]: Without dead ends: 921 [2020-12-23 01:47:20,428 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:20,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2020-12-23 01:47:20,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 851. [2020-12-23 01:47:20,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2020-12-23 01:47:20,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1279 transitions. [2020-12-23 01:47:20,451 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1279 transitions. Word has length 148 [2020-12-23 01:47:20,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:20,451 INFO L481 AbstractCegarLoop]: Abstraction has 851 states and 1279 transitions. [2020-12-23 01:47:20,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:20,451 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1279 transitions. [2020-12-23 01:47:20,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-12-23 01:47:20,453 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:20,453 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2020-12-23 01:47:20,453 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2020-12-23 01:47:20,453 INFO L429 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:20,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:20,454 INFO L82 PathProgramCache]: Analyzing trace with hash 2084969725, now seen corresponding path program 1 times [2020-12-23 01:47:20,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:20,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974391776] [2020-12-23 01:47:20,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-12-23 01:47:20,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974391776] [2020-12-23 01:47:20,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:20,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:20,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272918898] [2020-12-23 01:47:20,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:20,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:20,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:20,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:20,533 INFO L87 Difference]: Start difference. First operand 851 states and 1279 transitions. Second operand 4 states. [2020-12-23 01:47:21,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:21,015 INFO L93 Difference]: Finished difference Result 1751 states and 2627 transitions. [2020-12-23 01:47:21,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:21,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2020-12-23 01:47:21,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:21,019 INFO L225 Difference]: With dead ends: 1751 [2020-12-23 01:47:21,019 INFO L226 Difference]: Without dead ends: 921 [2020-12-23 01:47:21,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:21,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2020-12-23 01:47:21,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 851. [2020-12-23 01:47:21,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2020-12-23 01:47:21,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1277 transitions. [2020-12-23 01:47:21,048 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1277 transitions. Word has length 149 [2020-12-23 01:47:21,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:21,048 INFO L481 AbstractCegarLoop]: Abstraction has 851 states and 1277 transitions. [2020-12-23 01:47:21,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:21,049 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1277 transitions. [2020-12-23 01:47:21,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-12-23 01:47:21,050 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:21,050 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2020-12-23 01:47:21,050 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2020-12-23 01:47:21,050 INFO L429 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:21,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:21,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1770259671, now seen corresponding path program 1 times [2020-12-23 01:47:21,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:21,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560037560] [2020-12-23 01:47:21,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:21,154 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-12-23 01:47:21,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560037560] [2020-12-23 01:47:21,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:21,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:21,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280777343] [2020-12-23 01:47:21,156 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:21,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:21,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:21,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:21,157 INFO L87 Difference]: Start difference. First operand 851 states and 1277 transitions. Second operand 4 states. [2020-12-23 01:47:21,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:21,640 INFO L93 Difference]: Finished difference Result 1751 states and 2623 transitions. [2020-12-23 01:47:21,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:21,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2020-12-23 01:47:21,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:21,642 INFO L225 Difference]: With dead ends: 1751 [2020-12-23 01:47:21,642 INFO L226 Difference]: Without dead ends: 921 [2020-12-23 01:47:21,643 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:21,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2020-12-23 01:47:21,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 851. [2020-12-23 01:47:21,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2020-12-23 01:47:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1275 transitions. [2020-12-23 01:47:21,678 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1275 transitions. Word has length 150 [2020-12-23 01:47:21,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:21,678 INFO L481 AbstractCegarLoop]: Abstraction has 851 states and 1275 transitions. [2020-12-23 01:47:21,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1275 transitions. [2020-12-23 01:47:21,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-12-23 01:47:21,680 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:21,681 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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] [2020-12-23 01:47:21,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2020-12-23 01:47:21,681 INFO L429 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:21,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:21,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1890867658, now seen corresponding path program 1 times [2020-12-23 01:47:21,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:21,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927834877] [2020-12-23 01:47:21,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:21,766 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:47:21,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927834877] [2020-12-23 01:47:21,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:21,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:21,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19269537] [2020-12-23 01:47:21,767 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:21,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:21,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:21,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:21,768 INFO L87 Difference]: Start difference. First operand 851 states and 1275 transitions. Second operand 4 states. [2020-12-23 01:47:22,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:22,271 INFO L93 Difference]: Finished difference Result 1777 states and 2659 transitions. [2020-12-23 01:47:22,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:22,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2020-12-23 01:47:22,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:22,276 INFO L225 Difference]: With dead ends: 1777 [2020-12-23 01:47:22,276 INFO L226 Difference]: Without dead ends: 947 [2020-12-23 01:47:22,277 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:22,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2020-12-23 01:47:22,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 853. [2020-12-23 01:47:22,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2020-12-23 01:47:22,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1277 transitions. [2020-12-23 01:47:22,323 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1277 transitions. Word has length 151 [2020-12-23 01:47:22,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:22,323 INFO L481 AbstractCegarLoop]: Abstraction has 853 states and 1277 transitions. [2020-12-23 01:47:22,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:22,324 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1277 transitions. [2020-12-23 01:47:22,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-12-23 01:47:22,327 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:22,329 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2020-12-23 01:47:22,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2020-12-23 01:47:22,331 INFO L429 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:22,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:22,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1062083454, now seen corresponding path program 1 times [2020-12-23 01:47:22,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:22,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165770140] [2020-12-23 01:47:22,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:22,481 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-12-23 01:47:22,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165770140] [2020-12-23 01:47:22,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:22,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:22,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135613303] [2020-12-23 01:47:22,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:22,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:22,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:22,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:22,484 INFO L87 Difference]: Start difference. First operand 853 states and 1277 transitions. Second operand 4 states. [2020-12-23 01:47:23,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:23,007 INFO L93 Difference]: Finished difference Result 1735 states and 2599 transitions. [2020-12-23 01:47:23,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:23,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2020-12-23 01:47:23,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:23,014 INFO L225 Difference]: With dead ends: 1735 [2020-12-23 01:47:23,014 INFO L226 Difference]: Without dead ends: 903 [2020-12-23 01:47:23,016 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:23,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2020-12-23 01:47:23,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 853. [2020-12-23 01:47:23,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2020-12-23 01:47:23,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1275 transitions. [2020-12-23 01:47:23,061 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1275 transitions. Word has length 151 [2020-12-23 01:47:23,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:23,062 INFO L481 AbstractCegarLoop]: Abstraction has 853 states and 1275 transitions. [2020-12-23 01:47:23,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:23,063 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1275 transitions. [2020-12-23 01:47:23,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-12-23 01:47:23,066 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:23,066 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:47:23,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2020-12-23 01:47:23,066 INFO L429 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:23,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:23,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1439992380, now seen corresponding path program 1 times [2020-12-23 01:47:23,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:23,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766931441] [2020-12-23 01:47:23,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:23,177 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:47:23,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766931441] [2020-12-23 01:47:23,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:23,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:23,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848656256] [2020-12-23 01:47:23,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:23,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:23,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:23,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:23,179 INFO L87 Difference]: Start difference. First operand 853 states and 1275 transitions. Second operand 4 states. [2020-12-23 01:47:23,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:23,739 INFO L93 Difference]: Finished difference Result 1805 states and 2693 transitions. [2020-12-23 01:47:23,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:23,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2020-12-23 01:47:23,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:23,756 INFO L225 Difference]: With dead ends: 1805 [2020-12-23 01:47:23,756 INFO L226 Difference]: Without dead ends: 973 [2020-12-23 01:47:23,757 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:23,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2020-12-23 01:47:23,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 853. [2020-12-23 01:47:23,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2020-12-23 01:47:23,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1273 transitions. [2020-12-23 01:47:23,792 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1273 transitions. Word has length 152 [2020-12-23 01:47:23,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:23,792 INFO L481 AbstractCegarLoop]: Abstraction has 853 states and 1273 transitions. [2020-12-23 01:47:23,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:23,792 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1273 transitions. [2020-12-23 01:47:23,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-12-23 01:47:23,794 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:23,794 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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] [2020-12-23 01:47:23,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2020-12-23 01:47:23,794 INFO L429 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:23,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:23,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1517573502, now seen corresponding path program 1 times [2020-12-23 01:47:23,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:23,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11434508] [2020-12-23 01:47:23,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:23,905 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:47:23,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11434508] [2020-12-23 01:47:23,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:23,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:23,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830939582] [2020-12-23 01:47:23,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:23,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:23,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:23,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:23,907 INFO L87 Difference]: Start difference. First operand 853 states and 1273 transitions. Second operand 4 states. [2020-12-23 01:47:24,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:24,450 INFO L93 Difference]: Finished difference Result 1767 states and 2635 transitions. [2020-12-23 01:47:24,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:24,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2020-12-23 01:47:24,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:24,453 INFO L225 Difference]: With dead ends: 1767 [2020-12-23 01:47:24,453 INFO L226 Difference]: Without dead ends: 935 [2020-12-23 01:47:24,455 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:24,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2020-12-23 01:47:24,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 855. [2020-12-23 01:47:24,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2020-12-23 01:47:24,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1275 transitions. [2020-12-23 01:47:24,498 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1275 transitions. Word has length 152 [2020-12-23 01:47:24,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:24,498 INFO L481 AbstractCegarLoop]: Abstraction has 855 states and 1275 transitions. [2020-12-23 01:47:24,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:24,498 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1275 transitions. [2020-12-23 01:47:24,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-12-23 01:47:24,500 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:24,500 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2020-12-23 01:47:24,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2020-12-23 01:47:24,501 INFO L429 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:24,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:24,501 INFO L82 PathProgramCache]: Analyzing trace with hash 601030400, now seen corresponding path program 1 times [2020-12-23 01:47:24,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:24,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918939048] [2020-12-23 01:47:24,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:24,588 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:47:24,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918939048] [2020-12-23 01:47:24,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:24,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:24,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529122304] [2020-12-23 01:47:24,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:24,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:24,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:24,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:24,590 INFO L87 Difference]: Start difference. First operand 855 states and 1275 transitions. Second operand 4 states. [2020-12-23 01:47:25,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:25,101 INFO L93 Difference]: Finished difference Result 1769 states and 2635 transitions. [2020-12-23 01:47:25,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:25,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2020-12-23 01:47:25,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:25,105 INFO L225 Difference]: With dead ends: 1769 [2020-12-23 01:47:25,105 INFO L226 Difference]: Without dead ends: 935 [2020-12-23 01:47:25,107 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:25,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2020-12-23 01:47:25,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 857. [2020-12-23 01:47:25,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2020-12-23 01:47:25,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1277 transitions. [2020-12-23 01:47:25,149 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1277 transitions. Word has length 152 [2020-12-23 01:47:25,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:25,149 INFO L481 AbstractCegarLoop]: Abstraction has 857 states and 1277 transitions. [2020-12-23 01:47:25,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:25,149 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1277 transitions. [2020-12-23 01:47:25,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-12-23 01:47:25,151 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:25,151 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 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] [2020-12-23 01:47:25,151 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2020-12-23 01:47:25,151 INFO L429 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:25,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:25,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1495335013, now seen corresponding path program 1 times [2020-12-23 01:47:25,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:25,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92376510] [2020-12-23 01:47:25,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:25,241 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:47:25,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92376510] [2020-12-23 01:47:25,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:25,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:25,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986756814] [2020-12-23 01:47:25,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:25,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:25,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:25,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:25,243 INFO L87 Difference]: Start difference. First operand 857 states and 1277 transitions. Second operand 4 states. [2020-12-23 01:47:25,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:25,748 INFO L93 Difference]: Finished difference Result 1793 states and 2663 transitions. [2020-12-23 01:47:25,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:25,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2020-12-23 01:47:25,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:25,751 INFO L225 Difference]: With dead ends: 1793 [2020-12-23 01:47:25,751 INFO L226 Difference]: Without dead ends: 957 [2020-12-23 01:47:25,752 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:25,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2020-12-23 01:47:25,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 857. [2020-12-23 01:47:25,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2020-12-23 01:47:25,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1275 transitions. [2020-12-23 01:47:25,791 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1275 transitions. Word has length 153 [2020-12-23 01:47:25,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:25,791 INFO L481 AbstractCegarLoop]: Abstraction has 857 states and 1275 transitions. [2020-12-23 01:47:25,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:25,791 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1275 transitions. [2020-12-23 01:47:25,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-12-23 01:47:25,793 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:25,793 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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] [2020-12-23 01:47:25,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2020-12-23 01:47:25,793 INFO L429 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:25,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:25,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1853746152, now seen corresponding path program 1 times [2020-12-23 01:47:25,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:25,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120522026] [2020-12-23 01:47:25,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:25,871 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:47:25,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120522026] [2020-12-23 01:47:25,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:25,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:25,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426687911] [2020-12-23 01:47:25,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:25,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:25,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:25,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:25,873 INFO L87 Difference]: Start difference. First operand 857 states and 1275 transitions. Second operand 4 states. [2020-12-23 01:47:26,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:26,306 INFO L93 Difference]: Finished difference Result 1765 states and 2624 transitions. [2020-12-23 01:47:26,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:26,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2020-12-23 01:47:26,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:26,309 INFO L225 Difference]: With dead ends: 1765 [2020-12-23 01:47:26,309 INFO L226 Difference]: Without dead ends: 929 [2020-12-23 01:47:26,311 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:26,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2020-12-23 01:47:26,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 859. [2020-12-23 01:47:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2020-12-23 01:47:26,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1277 transitions. [2020-12-23 01:47:26,340 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1277 transitions. Word has length 153 [2020-12-23 01:47:26,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:26,340 INFO L481 AbstractCegarLoop]: Abstraction has 859 states and 1277 transitions. [2020-12-23 01:47:26,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:26,340 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1277 transitions. [2020-12-23 01:47:26,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-12-23 01:47:26,342 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:26,342 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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] [2020-12-23 01:47:26,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2020-12-23 01:47:26,342 INFO L429 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:26,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:26,343 INFO L82 PathProgramCache]: Analyzing trace with hash -789827000, now seen corresponding path program 1 times [2020-12-23 01:47:26,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:26,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048351006] [2020-12-23 01:47:26,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:26,439 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:47:26,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048351006] [2020-12-23 01:47:26,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:26,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:26,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109048479] [2020-12-23 01:47:26,440 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:26,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:26,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:26,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:26,440 INFO L87 Difference]: Start difference. First operand 859 states and 1277 transitions. Second operand 4 states. [2020-12-23 01:47:26,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:26,906 INFO L93 Difference]: Finished difference Result 1767 states and 2624 transitions. [2020-12-23 01:47:26,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:26,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2020-12-23 01:47:26,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:26,908 INFO L225 Difference]: With dead ends: 1767 [2020-12-23 01:47:26,908 INFO L226 Difference]: Without dead ends: 929 [2020-12-23 01:47:26,909 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:26,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2020-12-23 01:47:26,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 861. [2020-12-23 01:47:26,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2020-12-23 01:47:26,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1279 transitions. [2020-12-23 01:47:26,946 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1279 transitions. Word has length 154 [2020-12-23 01:47:26,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:26,946 INFO L481 AbstractCegarLoop]: Abstraction has 861 states and 1279 transitions. [2020-12-23 01:47:26,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:26,946 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1279 transitions. [2020-12-23 01:47:26,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-12-23 01:47:26,948 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:26,949 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2020-12-23 01:47:26,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2020-12-23 01:47:26,949 INFO L429 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:26,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:26,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1635236001, now seen corresponding path program 1 times [2020-12-23 01:47:26,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:26,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27643069] [2020-12-23 01:47:26,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:27,027 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-12-23 01:47:27,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27643069] [2020-12-23 01:47:27,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:27,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:27,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250479894] [2020-12-23 01:47:27,028 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:27,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:27,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:27,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:27,029 INFO L87 Difference]: Start difference. First operand 861 states and 1279 transitions. Second operand 4 states. [2020-12-23 01:47:27,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:27,499 INFO L93 Difference]: Finished difference Result 1797 states and 2659 transitions. [2020-12-23 01:47:27,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:27,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2020-12-23 01:47:27,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:27,502 INFO L225 Difference]: With dead ends: 1797 [2020-12-23 01:47:27,503 INFO L226 Difference]: Without dead ends: 957 [2020-12-23 01:47:27,504 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:27,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2020-12-23 01:47:27,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 861. [2020-12-23 01:47:27,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2020-12-23 01:47:27,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1277 transitions. [2020-12-23 01:47:27,546 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1277 transitions. Word has length 155 [2020-12-23 01:47:27,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:27,546 INFO L481 AbstractCegarLoop]: Abstraction has 861 states and 1277 transitions. [2020-12-23 01:47:27,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:27,546 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1277 transitions. [2020-12-23 01:47:27,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-12-23 01:47:27,548 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:27,549 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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] [2020-12-23 01:47:27,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2020-12-23 01:47:27,549 INFO L429 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:27,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:27,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1659649216, now seen corresponding path program 1 times [2020-12-23 01:47:27,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:27,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740133939] [2020-12-23 01:47:27,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:27,662 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:47:27,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740133939] [2020-12-23 01:47:27,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:27,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:27,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578985040] [2020-12-23 01:47:27,663 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:27,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:27,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:27,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:27,664 INFO L87 Difference]: Start difference. First operand 861 states and 1277 transitions. Second operand 4 states. [2020-12-23 01:47:28,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:28,173 INFO L93 Difference]: Finished difference Result 1763 states and 2613 transitions. [2020-12-23 01:47:28,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:28,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2020-12-23 01:47:28,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:28,176 INFO L225 Difference]: With dead ends: 1763 [2020-12-23 01:47:28,176 INFO L226 Difference]: Without dead ends: 923 [2020-12-23 01:47:28,177 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:28,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2020-12-23 01:47:28,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 863. [2020-12-23 01:47:28,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2020-12-23 01:47:28,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1279 transitions. [2020-12-23 01:47:28,216 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1279 transitions. Word has length 155 [2020-12-23 01:47:28,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:28,217 INFO L481 AbstractCegarLoop]: Abstraction has 863 states and 1279 transitions. [2020-12-23 01:47:28,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:28,217 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1279 transitions. [2020-12-23 01:47:28,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-12-23 01:47:28,219 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:28,219 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2020-12-23 01:47:28,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2020-12-23 01:47:28,220 INFO L429 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:28,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:28,221 INFO L82 PathProgramCache]: Analyzing trace with hash -239800856, now seen corresponding path program 1 times [2020-12-23 01:47:28,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:28,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075318153] [2020-12-23 01:47:28,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:28,302 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-12-23 01:47:28,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075318153] [2020-12-23 01:47:28,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:28,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:28,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002699231] [2020-12-23 01:47:28,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:28,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:28,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:28,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:28,304 INFO L87 Difference]: Start difference. First operand 863 states and 1279 transitions. Second operand 4 states. [2020-12-23 01:47:28,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:28,810 INFO L93 Difference]: Finished difference Result 1795 states and 2651 transitions. [2020-12-23 01:47:28,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:28,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2020-12-23 01:47:28,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:28,814 INFO L225 Difference]: With dead ends: 1795 [2020-12-23 01:47:28,814 INFO L226 Difference]: Without dead ends: 953 [2020-12-23 01:47:28,815 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:28,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2020-12-23 01:47:28,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 863. [2020-12-23 01:47:28,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2020-12-23 01:47:28,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1277 transitions. [2020-12-23 01:47:28,866 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1277 transitions. Word has length 156 [2020-12-23 01:47:28,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:28,866 INFO L481 AbstractCegarLoop]: Abstraction has 863 states and 1277 transitions. [2020-12-23 01:47:28,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:28,866 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1277 transitions. [2020-12-23 01:47:28,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-12-23 01:47:28,869 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:28,869 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2020-12-23 01:47:28,869 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2020-12-23 01:47:28,869 INFO L429 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:28,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:28,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1562462854, now seen corresponding path program 1 times [2020-12-23 01:47:28,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:28,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873593095] [2020-12-23 01:47:28,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:29,004 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:47:29,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873593095] [2020-12-23 01:47:29,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:29,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:29,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743659255] [2020-12-23 01:47:29,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:29,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:29,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:29,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:29,007 INFO L87 Difference]: Start difference. First operand 863 states and 1277 transitions. Second operand 4 states. [2020-12-23 01:47:29,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:29,588 INFO L93 Difference]: Finished difference Result 1789 states and 2639 transitions. [2020-12-23 01:47:29,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:29,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2020-12-23 01:47:29,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:29,591 INFO L225 Difference]: With dead ends: 1789 [2020-12-23 01:47:29,591 INFO L226 Difference]: Without dead ends: 947 [2020-12-23 01:47:29,593 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:29,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2020-12-23 01:47:29,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 863. [2020-12-23 01:47:29,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2020-12-23 01:47:29,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1275 transitions. [2020-12-23 01:47:29,655 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1275 transitions. Word has length 156 [2020-12-23 01:47:29,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:29,655 INFO L481 AbstractCegarLoop]: Abstraction has 863 states and 1275 transitions. [2020-12-23 01:47:29,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:29,656 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1275 transitions. [2020-12-23 01:47:29,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-12-23 01:47:29,658 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:29,658 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2020-12-23 01:47:29,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2020-12-23 01:47:29,658 INFO L429 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:29,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:29,659 INFO L82 PathProgramCache]: Analyzing trace with hash 473382979, now seen corresponding path program 1 times [2020-12-23 01:47:29,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:29,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706346532] [2020-12-23 01:47:29,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:29,766 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2020-12-23 01:47:29,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706346532] [2020-12-23 01:47:29,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:29,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:29,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704143374] [2020-12-23 01:47:29,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:29,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:29,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:29,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:29,769 INFO L87 Difference]: Start difference. First operand 863 states and 1275 transitions. Second operand 4 states. [2020-12-23 01:47:30,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:30,337 INFO L93 Difference]: Finished difference Result 1839 states and 2731 transitions. [2020-12-23 01:47:30,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:30,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2020-12-23 01:47:30,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:30,340 INFO L225 Difference]: With dead ends: 1839 [2020-12-23 01:47:30,340 INFO L226 Difference]: Without dead ends: 997 [2020-12-23 01:47:30,341 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:30,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2020-12-23 01:47:30,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 923. [2020-12-23 01:47:30,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2020-12-23 01:47:30,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1381 transitions. [2020-12-23 01:47:30,378 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1381 transitions. Word has length 158 [2020-12-23 01:47:30,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:30,378 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1381 transitions. [2020-12-23 01:47:30,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:30,378 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1381 transitions. [2020-12-23 01:47:30,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-12-23 01:47:30,380 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:30,381 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:47:30,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2020-12-23 01:47:30,381 INFO L429 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:30,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:30,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1189357597, now seen corresponding path program 1 times [2020-12-23 01:47:30,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:30,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573841618] [2020-12-23 01:47:30,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:30,469 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:47:30,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573841618] [2020-12-23 01:47:30,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:30,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:30,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639245967] [2020-12-23 01:47:30,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:30,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:30,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:30,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:30,471 INFO L87 Difference]: Start difference. First operand 923 states and 1381 transitions. Second operand 4 states. [2020-12-23 01:47:30,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:30,991 INFO L93 Difference]: Finished difference Result 1909 states and 2847 transitions. [2020-12-23 01:47:30,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:30,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2020-12-23 01:47:30,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:30,995 INFO L225 Difference]: With dead ends: 1909 [2020-12-23 01:47:30,995 INFO L226 Difference]: Without dead ends: 1007 [2020-12-23 01:47:30,996 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:30,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2020-12-23 01:47:31,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 923. [2020-12-23 01:47:31,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2020-12-23 01:47:31,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1379 transitions. [2020-12-23 01:47:31,046 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1379 transitions. Word has length 159 [2020-12-23 01:47:31,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:31,046 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1379 transitions. [2020-12-23 01:47:31,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:31,046 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1379 transitions. [2020-12-23 01:47:31,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-12-23 01:47:31,049 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:31,049 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:47:31,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2020-12-23 01:47:31,049 INFO L429 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:31,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:31,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1789548913, now seen corresponding path program 1 times [2020-12-23 01:47:31,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:31,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658571484] [2020-12-23 01:47:31,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:31,147 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:47:31,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658571484] [2020-12-23 01:47:31,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:31,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:31,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541319] [2020-12-23 01:47:31,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:31,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:31,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:31,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:31,149 INFO L87 Difference]: Start difference. First operand 923 states and 1379 transitions. Second operand 4 states. [2020-12-23 01:47:31,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:31,688 INFO L93 Difference]: Finished difference Result 1897 states and 2827 transitions. [2020-12-23 01:47:31,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:31,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2020-12-23 01:47:31,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:31,691 INFO L225 Difference]: With dead ends: 1897 [2020-12-23 01:47:31,691 INFO L226 Difference]: Without dead ends: 995 [2020-12-23 01:47:31,692 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:31,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2020-12-23 01:47:31,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 923. [2020-12-23 01:47:31,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2020-12-23 01:47:31,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1377 transitions. [2020-12-23 01:47:31,725 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1377 transitions. Word has length 160 [2020-12-23 01:47:31,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:31,725 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1377 transitions. [2020-12-23 01:47:31,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:31,725 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1377 transitions. [2020-12-23 01:47:31,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-12-23 01:47:31,727 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:31,727 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:47:31,727 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2020-12-23 01:47:31,728 INFO L429 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:31,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:31,728 INFO L82 PathProgramCache]: Analyzing trace with hash 873005811, now seen corresponding path program 1 times [2020-12-23 01:47:31,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:31,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509062352] [2020-12-23 01:47:31,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:31,820 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:47:31,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509062352] [2020-12-23 01:47:31,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:31,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:31,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138793797] [2020-12-23 01:47:31,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:31,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:31,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:31,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:31,822 INFO L87 Difference]: Start difference. First operand 923 states and 1377 transitions. Second operand 4 states. [2020-12-23 01:47:32,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:32,328 INFO L93 Difference]: Finished difference Result 1897 states and 2823 transitions. [2020-12-23 01:47:32,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:32,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2020-12-23 01:47:32,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:32,330 INFO L225 Difference]: With dead ends: 1897 [2020-12-23 01:47:32,330 INFO L226 Difference]: Without dead ends: 995 [2020-12-23 01:47:32,331 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:32,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2020-12-23 01:47:32,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 923. [2020-12-23 01:47:32,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2020-12-23 01:47:32,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1375 transitions. [2020-12-23 01:47:32,368 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1375 transitions. Word has length 160 [2020-12-23 01:47:32,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:32,368 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1375 transitions. [2020-12-23 01:47:32,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:32,368 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1375 transitions. [2020-12-23 01:47:32,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-12-23 01:47:32,369 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:32,370 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:47:32,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2020-12-23 01:47:32,370 INFO L429 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:32,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:32,370 INFO L82 PathProgramCache]: Analyzing trace with hash -2012443003, now seen corresponding path program 1 times [2020-12-23 01:47:32,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:32,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989771040] [2020-12-23 01:47:32,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:32,476 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:47:32,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989771040] [2020-12-23 01:47:32,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:32,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:32,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594435713] [2020-12-23 01:47:32,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:32,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:32,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:32,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:32,478 INFO L87 Difference]: Start difference. First operand 923 states and 1375 transitions. Second operand 4 states. [2020-12-23 01:47:33,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:33,008 INFO L93 Difference]: Finished difference Result 1891 states and 2812 transitions. [2020-12-23 01:47:33,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:33,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2020-12-23 01:47:33,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:33,011 INFO L225 Difference]: With dead ends: 1891 [2020-12-23 01:47:33,011 INFO L226 Difference]: Without dead ends: 989 [2020-12-23 01:47:33,012 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:33,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2020-12-23 01:47:33,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 923. [2020-12-23 01:47:33,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2020-12-23 01:47:33,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1373 transitions. [2020-12-23 01:47:33,045 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1373 transitions. Word has length 161 [2020-12-23 01:47:33,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:33,045 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1373 transitions. [2020-12-23 01:47:33,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:33,046 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1373 transitions. [2020-12-23 01:47:33,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-12-23 01:47:33,047 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:33,047 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 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] [2020-12-23 01:47:33,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2020-12-23 01:47:33,047 INFO L429 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:33,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:33,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1084196335, now seen corresponding path program 1 times [2020-12-23 01:47:33,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:33,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216509331] [2020-12-23 01:47:33,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:33,125 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2020-12-23 01:47:33,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216509331] [2020-12-23 01:47:33,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:33,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:33,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454341989] [2020-12-23 01:47:33,127 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:33,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:33,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:33,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:33,127 INFO L87 Difference]: Start difference. First operand 923 states and 1373 transitions. Second operand 4 states. [2020-12-23 01:47:33,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:33,659 INFO L93 Difference]: Finished difference Result 1885 states and 2801 transitions. [2020-12-23 01:47:33,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:33,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2020-12-23 01:47:33,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:33,661 INFO L225 Difference]: With dead ends: 1885 [2020-12-23 01:47:33,661 INFO L226 Difference]: Without dead ends: 983 [2020-12-23 01:47:33,662 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:33,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2020-12-23 01:47:33,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 923. [2020-12-23 01:47:33,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2020-12-23 01:47:33,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1371 transitions. [2020-12-23 01:47:33,696 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1371 transitions. Word has length 161 [2020-12-23 01:47:33,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:33,696 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1371 transitions. [2020-12-23 01:47:33,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:33,696 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1371 transitions. [2020-12-23 01:47:33,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-12-23 01:47:33,697 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:33,698 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2020-12-23 01:47:33,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2020-12-23 01:47:33,698 INFO L429 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:33,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:33,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1219098752, now seen corresponding path program 1 times [2020-12-23 01:47:33,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:33,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930577159] [2020-12-23 01:47:33,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:33,783 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2020-12-23 01:47:33,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930577159] [2020-12-23 01:47:33,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:33,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:33,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423642421] [2020-12-23 01:47:33,784 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:33,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:33,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:33,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:33,784 INFO L87 Difference]: Start difference. First operand 923 states and 1371 transitions. Second operand 4 states. [2020-12-23 01:47:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:34,296 INFO L93 Difference]: Finished difference Result 1875 states and 2787 transitions. [2020-12-23 01:47:34,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:34,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2020-12-23 01:47:34,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:34,299 INFO L225 Difference]: With dead ends: 1875 [2020-12-23 01:47:34,299 INFO L226 Difference]: Without dead ends: 973 [2020-12-23 01:47:34,300 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:34,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2020-12-23 01:47:34,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 923. [2020-12-23 01:47:34,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2020-12-23 01:47:34,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1369 transitions. [2020-12-23 01:47:34,335 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1369 transitions. Word has length 161 [2020-12-23 01:47:34,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:34,336 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1369 transitions. [2020-12-23 01:47:34,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:34,336 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1369 transitions. [2020-12-23 01:47:34,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2020-12-23 01:47:34,337 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:34,337 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:47:34,337 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2020-12-23 01:47:34,337 INFO L429 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:34,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:34,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1414462085, now seen corresponding path program 1 times [2020-12-23 01:47:34,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:34,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197129197] [2020-12-23 01:47:34,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:34,435 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:47:34,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197129197] [2020-12-23 01:47:34,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:34,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:34,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220941847] [2020-12-23 01:47:34,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:34,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:34,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:34,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:34,437 INFO L87 Difference]: Start difference. First operand 923 states and 1369 transitions. Second operand 4 states. [2020-12-23 01:47:34,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:34,978 INFO L93 Difference]: Finished difference Result 1891 states and 2800 transitions. [2020-12-23 01:47:34,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:34,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2020-12-23 01:47:34,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:34,980 INFO L225 Difference]: With dead ends: 1891 [2020-12-23 01:47:34,980 INFO L226 Difference]: Without dead ends: 989 [2020-12-23 01:47:34,981 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:34,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2020-12-23 01:47:35,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 923. [2020-12-23 01:47:35,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2020-12-23 01:47:35,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1367 transitions. [2020-12-23 01:47:35,040 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1367 transitions. Word has length 162 [2020-12-23 01:47:35,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:35,041 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1367 transitions. [2020-12-23 01:47:35,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:35,041 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1367 transitions. [2020-12-23 01:47:35,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2020-12-23 01:47:35,043 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:35,043 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 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] [2020-12-23 01:47:35,044 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2020-12-23 01:47:35,044 INFO L429 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:35,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:35,044 INFO L82 PathProgramCache]: Analyzing trace with hash -541964910, now seen corresponding path program 1 times [2020-12-23 01:47:35,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:35,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24041965] [2020-12-23 01:47:35,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:35,144 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2020-12-23 01:47:35,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24041965] [2020-12-23 01:47:35,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:35,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:35,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295179031] [2020-12-23 01:47:35,145 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:35,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:35,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:35,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:35,146 INFO L87 Difference]: Start difference. First operand 923 states and 1367 transitions. Second operand 4 states. [2020-12-23 01:47:35,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:35,610 INFO L93 Difference]: Finished difference Result 1881 states and 2785 transitions. [2020-12-23 01:47:35,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:35,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2020-12-23 01:47:35,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:35,613 INFO L225 Difference]: With dead ends: 1881 [2020-12-23 01:47:35,613 INFO L226 Difference]: Without dead ends: 979 [2020-12-23 01:47:35,614 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:35,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2020-12-23 01:47:35,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 923. [2020-12-23 01:47:35,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2020-12-23 01:47:35,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1365 transitions. [2020-12-23 01:47:35,647 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1365 transitions. Word has length 162 [2020-12-23 01:47:35,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:35,647 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1365 transitions. [2020-12-23 01:47:35,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:35,648 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1365 transitions. [2020-12-23 01:47:35,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2020-12-23 01:47:35,649 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:35,653 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 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] [2020-12-23 01:47:35,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2020-12-23 01:47:35,653 INFO L429 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:35,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:35,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1949736729, now seen corresponding path program 1 times [2020-12-23 01:47:35,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:35,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719619662] [2020-12-23 01:47:35,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:35,761 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2020-12-23 01:47:35,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719619662] [2020-12-23 01:47:35,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:35,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:35,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859961278] [2020-12-23 01:47:35,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:35,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:35,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:35,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:35,764 INFO L87 Difference]: Start difference. First operand 923 states and 1365 transitions. Second operand 4 states. [2020-12-23 01:47:36,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:36,172 INFO L93 Difference]: Finished difference Result 1871 states and 2771 transitions. [2020-12-23 01:47:36,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:36,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2020-12-23 01:47:36,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:36,175 INFO L225 Difference]: With dead ends: 1871 [2020-12-23 01:47:36,175 INFO L226 Difference]: Without dead ends: 969 [2020-12-23 01:47:36,177 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:36,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2020-12-23 01:47:36,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 923. [2020-12-23 01:47:36,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2020-12-23 01:47:36,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1363 transitions. [2020-12-23 01:47:36,222 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1363 transitions. Word has length 162 [2020-12-23 01:47:36,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:36,222 INFO L481 AbstractCegarLoop]: Abstraction has 923 states and 1363 transitions. [2020-12-23 01:47:36,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:36,222 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1363 transitions. [2020-12-23 01:47:36,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2020-12-23 01:47:36,224 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:36,224 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:47:36,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2020-12-23 01:47:36,224 INFO L429 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:36,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:36,225 INFO L82 PathProgramCache]: Analyzing trace with hash -524169235, now seen corresponding path program 1 times [2020-12-23 01:47:36,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:36,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643137230] [2020-12-23 01:47:36,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:36,323 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2020-12-23 01:47:36,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643137230] [2020-12-23 01:47:36,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:36,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:36,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403444730] [2020-12-23 01:47:36,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:36,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:36,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:36,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:36,325 INFO L87 Difference]: Start difference. First operand 923 states and 1363 transitions. Second operand 4 states. [2020-12-23 01:47:36,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:36,921 INFO L93 Difference]: Finished difference Result 1885 states and 2781 transitions. [2020-12-23 01:47:36,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:36,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2020-12-23 01:47:36,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:36,923 INFO L225 Difference]: With dead ends: 1885 [2020-12-23 01:47:36,924 INFO L226 Difference]: Without dead ends: 983 [2020-12-23 01:47:36,925 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:36,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2020-12-23 01:47:36,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 909. [2020-12-23 01:47:36,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2020-12-23 01:47:36,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1347 transitions. [2020-12-23 01:47:36,980 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1347 transitions. Word has length 163 [2020-12-23 01:47:36,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:36,980 INFO L481 AbstractCegarLoop]: Abstraction has 909 states and 1347 transitions. [2020-12-23 01:47:36,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:36,980 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1347 transitions. [2020-12-23 01:47:36,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-12-23 01:47:36,981 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:36,982 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2020-12-23 01:47:36,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2020-12-23 01:47:36,982 INFO L429 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:36,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:36,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1590245114, now seen corresponding path program 1 times [2020-12-23 01:47:36,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:36,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18826267] [2020-12-23 01:47:36,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:37,245 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2020-12-23 01:47:37,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18826267] [2020-12-23 01:47:37,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:37,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 01:47:37,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274735435] [2020-12-23 01:47:37,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 01:47:37,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:37,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 01:47:37,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:37,246 INFO L87 Difference]: Start difference. First operand 909 states and 1347 transitions. Second operand 5 states. [2020-12-23 01:47:38,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:38,117 INFO L93 Difference]: Finished difference Result 1955 states and 2911 transitions. [2020-12-23 01:47:38,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 01:47:38,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 164 [2020-12-23 01:47:38,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:38,120 INFO L225 Difference]: With dead ends: 1955 [2020-12-23 01:47:38,120 INFO L226 Difference]: Without dead ends: 1067 [2020-12-23 01:47:38,121 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 01:47:38,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2020-12-23 01:47:38,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 975. [2020-12-23 01:47:38,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 975 states. [2020-12-23 01:47:38,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1465 transitions. [2020-12-23 01:47:38,165 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1465 transitions. Word has length 164 [2020-12-23 01:47:38,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:38,165 INFO L481 AbstractCegarLoop]: Abstraction has 975 states and 1465 transitions. [2020-12-23 01:47:38,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 01:47:38,165 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1465 transitions. [2020-12-23 01:47:38,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-12-23 01:47:38,166 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:38,166 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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] [2020-12-23 01:47:38,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2020-12-23 01:47:38,167 INFO L429 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:38,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:38,167 INFO L82 PathProgramCache]: Analyzing trace with hash 363705902, now seen corresponding path program 1 times [2020-12-23 01:47:38,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:38,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384301609] [2020-12-23 01:47:38,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:38,281 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-12-23 01:47:38,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384301609] [2020-12-23 01:47:38,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:38,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:47:38,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393124604] [2020-12-23 01:47:38,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:47:38,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:38,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:47:38,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:47:38,284 INFO L87 Difference]: Start difference. First operand 975 states and 1465 transitions. Second operand 3 states. [2020-12-23 01:47:38,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:38,497 INFO L93 Difference]: Finished difference Result 2392 states and 3618 transitions. [2020-12-23 01:47:38,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:47:38,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2020-12-23 01:47:38,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:38,500 INFO L225 Difference]: With dead ends: 2392 [2020-12-23 01:47:38,501 INFO L226 Difference]: Without dead ends: 1438 [2020-12-23 01:47:38,501 INFO L677 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 [2020-12-23 01:47:38,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-12-23 01:47:38,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1431. [2020-12-23 01:47:38,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2020-12-23 01:47:38,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 2154 transitions. [2020-12-23 01:47:38,592 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 2154 transitions. Word has length 164 [2020-12-23 01:47:38,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:38,592 INFO L481 AbstractCegarLoop]: Abstraction has 1431 states and 2154 transitions. [2020-12-23 01:47:38,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:47:38,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 2154 transitions. [2020-12-23 01:47:38,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2020-12-23 01:47:38,594 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:38,594 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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] [2020-12-23 01:47:38,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2020-12-23 01:47:38,595 INFO L429 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:38,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:38,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1821420005, now seen corresponding path program 1 times [2020-12-23 01:47:38,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:38,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584973687] [2020-12-23 01:47:38,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:38,728 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:47:38,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584973687] [2020-12-23 01:47:38,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:38,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:38,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639048467] [2020-12-23 01:47:38,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:38,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:38,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:38,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:38,730 INFO L87 Difference]: Start difference. First operand 1431 states and 2154 transitions. Second operand 4 states. [2020-12-23 01:47:39,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:39,383 INFO L93 Difference]: Finished difference Result 2946 states and 4417 transitions. [2020-12-23 01:47:39,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:39,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2020-12-23 01:47:39,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:39,387 INFO L225 Difference]: With dead ends: 2946 [2020-12-23 01:47:39,388 INFO L226 Difference]: Without dead ends: 1536 [2020-12-23 01:47:39,390 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:39,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2020-12-23 01:47:39,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1467. [2020-12-23 01:47:39,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1467 states. [2020-12-23 01:47:39,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 2196 transitions. [2020-12-23 01:47:39,494 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 2196 transitions. Word has length 165 [2020-12-23 01:47:39,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:39,494 INFO L481 AbstractCegarLoop]: Abstraction has 1467 states and 2196 transitions. [2020-12-23 01:47:39,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:39,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2196 transitions. [2020-12-23 01:47:39,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2020-12-23 01:47:39,496 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:39,496 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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] [2020-12-23 01:47:39,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2020-12-23 01:47:39,496 INFO L429 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:39,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:39,497 INFO L82 PathProgramCache]: Analyzing trace with hash 2127321731, now seen corresponding path program 1 times [2020-12-23 01:47:39,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:39,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124568939] [2020-12-23 01:47:39,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:39,602 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2020-12-23 01:47:39,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124568939] [2020-12-23 01:47:39,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:39,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:39,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209988195] [2020-12-23 01:47:39,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:39,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:39,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:39,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:39,604 INFO L87 Difference]: Start difference. First operand 1467 states and 2196 transitions. Second operand 4 states. [2020-12-23 01:47:40,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:40,169 INFO L93 Difference]: Finished difference Result 2964 states and 4434 transitions. [2020-12-23 01:47:40,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:40,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2020-12-23 01:47:40,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:40,172 INFO L225 Difference]: With dead ends: 2964 [2020-12-23 01:47:40,172 INFO L226 Difference]: Without dead ends: 1512 [2020-12-23 01:47:40,174 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:40,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2020-12-23 01:47:40,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1464. [2020-12-23 01:47:40,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1464 states. [2020-12-23 01:47:40,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2190 transitions. [2020-12-23 01:47:40,235 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2190 transitions. Word has length 166 [2020-12-23 01:47:40,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:40,235 INFO L481 AbstractCegarLoop]: Abstraction has 1464 states and 2190 transitions. [2020-12-23 01:47:40,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:40,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2190 transitions. [2020-12-23 01:47:40,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 01:47:40,236 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:40,237 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2020-12-23 01:47:40,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2020-12-23 01:47:40,237 INFO L429 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:40,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:40,237 INFO L82 PathProgramCache]: Analyzing trace with hash -885832868, now seen corresponding path program 1 times [2020-12-23 01:47:40,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:40,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457612208] [2020-12-23 01:47:40,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-12-23 01:47:40,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457612208] [2020-12-23 01:47:40,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:40,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:40,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292332949] [2020-12-23 01:47:40,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:40,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:40,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:40,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:40,345 INFO L87 Difference]: Start difference. First operand 1464 states and 2190 transitions. Second operand 4 states. [2020-12-23 01:47:40,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:40,913 INFO L93 Difference]: Finished difference Result 2991 states and 4468 transitions. [2020-12-23 01:47:40,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:40,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2020-12-23 01:47:40,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:40,915 INFO L225 Difference]: With dead ends: 2991 [2020-12-23 01:47:40,916 INFO L226 Difference]: Without dead ends: 1548 [2020-12-23 01:47:40,917 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:40,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2020-12-23 01:47:40,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1464. [2020-12-23 01:47:40,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1464 states. [2020-12-23 01:47:40,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2187 transitions. [2020-12-23 01:47:40,975 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2187 transitions. Word has length 169 [2020-12-23 01:47:40,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:40,975 INFO L481 AbstractCegarLoop]: Abstraction has 1464 states and 2187 transitions. [2020-12-23 01:47:40,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:40,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2187 transitions. [2020-12-23 01:47:40,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2020-12-23 01:47:40,977 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:40,977 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:47:40,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2020-12-23 01:47:40,977 INFO L429 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:40,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:40,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1483328059, now seen corresponding path program 1 times [2020-12-23 01:47:40,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:40,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363476819] [2020-12-23 01:47:40,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:41,107 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-12-23 01:47:41,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363476819] [2020-12-23 01:47:41,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:41,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:41,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428139233] [2020-12-23 01:47:41,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:41,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:41,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:41,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:41,110 INFO L87 Difference]: Start difference. First operand 1464 states and 2187 transitions. Second operand 4 states. [2020-12-23 01:47:41,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:41,788 INFO L93 Difference]: Finished difference Result 2985 states and 4456 transitions. [2020-12-23 01:47:41,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:41,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2020-12-23 01:47:41,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:41,791 INFO L225 Difference]: With dead ends: 2985 [2020-12-23 01:47:41,792 INFO L226 Difference]: Without dead ends: 1542 [2020-12-23 01:47:41,793 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:41,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2020-12-23 01:47:41,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1464. [2020-12-23 01:47:41,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1464 states. [2020-12-23 01:47:41,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2184 transitions. [2020-12-23 01:47:41,888 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2184 transitions. Word has length 170 [2020-12-23 01:47:41,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:41,889 INFO L481 AbstractCegarLoop]: Abstraction has 1464 states and 2184 transitions. [2020-12-23 01:47:41,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:41,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2184 transitions. [2020-12-23 01:47:41,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-12-23 01:47:41,891 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:41,891 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:47:41,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2020-12-23 01:47:41,891 INFO L429 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:41,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:41,892 INFO L82 PathProgramCache]: Analyzing trace with hash 165451016, now seen corresponding path program 1 times [2020-12-23 01:47:41,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:41,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671549708] [2020-12-23 01:47:41,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:42,610 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:47:42,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671549708] [2020-12-23 01:47:42,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856213260] [2020-12-23 01:47:42,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:47:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:42,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 37 conjunts are in the unsatisfiable core [2020-12-23 01:47:42,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:47:43,126 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:43,127 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2020-12-23 01:47:43,144 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:43,254 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2020-12-23 01:47:43,255 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:43,261 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_162|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2020-12-23 01:47:43,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:43,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:43,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:43,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:43,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:43,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:43,344 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2020-12-23 01:47:43,346 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:43,409 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:43,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:43,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:43,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:43,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:43,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:43,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:43,432 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2020-12-23 01:47:43,437 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:43,493 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:43,544 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2020-12-23 01:47:43,544 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2020-12-23 01:47:43,547 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:43,562 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:43,565 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:47:43,565 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2020-12-23 01:47:43,656 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2020-12-23 01:47:43,656 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2020-12-23 01:47:43,661 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:43,674 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:43,675 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:47:43,676 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2020-12-23 01:47:43,769 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2020-12-23 01:47:43,769 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2020-12-23 01:47:43,773 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:43,786 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:43,788 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:47:43,788 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2020-12-23 01:47:43,804 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_178|], 2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_165|]} [2020-12-23 01:47:43,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:43,815 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2020-12-23 01:47:43,817 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:43,870 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:43,878 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 01:47:43,917 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:43,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:43,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:43,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:43,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:43,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:43,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:43,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:43,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:43,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:43,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:43,940 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 53 [2020-12-23 01:47:43,943 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:43,964 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:43,966 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:47:43,967 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:71 [2020-12-23 01:47:44,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:44,071 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2020-12-23 01:47:44,074 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:44,089 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:44,090 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:47:44,091 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:56 [2020-12-23 01:47:44,186 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2020-12-23 01:47:44,187 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2020-12-23 01:47:44,190 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:44,200 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:44,202 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:47:44,202 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2020-12-23 01:47:44,250 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2020-12-23 01:47:44,250 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2020-12-23 01:47:44,252 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:44,261 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:44,262 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:47:44,262 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2020-12-23 01:47:44,329 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_158|], 20=[|v_#memory_$Pointer$.base_168|]} [2020-12-23 01:47:44,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:44,333 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2020-12-23 01:47:44,335 INFO L547 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 01:47:44,348 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:44,574 WARN L197 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2020-12-23 01:47:44,575 INFO L348 Elim1Store]: treesize reduction 70, result has 72.8 percent of original size [2020-12-23 01:47:44,576 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 218 [2020-12-23 01:47:44,590 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:44,592 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 01:47:44,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 01:47:44,601 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 01:47:44,603 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 01:47:44,606 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:44,612 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 3, 2, 2, 2, 1] term [2020-12-23 01:47:44,615 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-12-23 01:47:44,618 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 01:47:44,619 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 01:47:44,621 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 01:47:44,623 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:44,631 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:47:44,659 INFO L625 ElimStorePlain]: treesize reduction 45, result has 64.0 percent of original size [2020-12-23 01:47:44,661 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 01:47:44,661 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:80 [2020-12-23 01:47:44,751 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 30=[|v_#memory_$Pointer$.base_169|]} [2020-12-23 01:47:44,755 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 01:47:44,789 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:45,016 WARN L197 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 61 [2020-12-23 01:47:45,017 INFO L348 Elim1Store]: treesize reduction 478, result has 19.7 percent of original size [2020-12-23 01:47:45,017 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 104 treesize of output 142 [2020-12-23 01:47:45,023 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 2, 1] term [2020-12-23 01:47:45,023 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:47:45,026 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:45,041 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:45,043 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 01:47:45,044 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:80 [2020-12-23 01:47:45,229 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_179|], 30=[|v_#memory_$Pointer$.base_170|]} [2020-12-23 01:47:45,236 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-12-23 01:47:45,236 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:45,259 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:45,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:45,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:45,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:45,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:45,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:45,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:45,434 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2020-12-23 01:47:45,435 INFO L348 Elim1Store]: treesize reduction 56, result has 73.5 percent of original size [2020-12-23 01:47:45,436 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 207 [2020-12-23 01:47:45,442 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2020-12-23 01:47:45,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 01:47:45,444 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-12-23 01:47:45,444 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 01:47:45,445 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 1] term [2020-12-23 01:47:45,445 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 01:47:45,446 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 1] term [2020-12-23 01:47:45,446 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 01:47:45,447 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 1] term [2020-12-23 01:47:45,447 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:45,448 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 1] term [2020-12-23 01:47:45,448 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:45,449 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 1] term [2020-12-23 01:47:45,449 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:47:45,456 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:45,471 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:45,472 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 01:47:45,472 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:89 [2020-12-23 01:47:45,531 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_159|], 2=[|v_#memory_int_180|], 20=[|v_#memory_$Pointer$.base_171|]} [2020-12-23 01:47:45,536 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2020-12-23 01:47:45,537 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 01:47:45,556 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:45,560 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2020-12-23 01:47:45,562 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:45,579 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:45,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:45,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:45,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:47:45,640 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:45,641 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 95 treesize of output 147 [2020-12-23 01:47:45,649 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 1] term [2020-12-23 01:47:45,649 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 01:47:45,650 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 1] term [2020-12-23 01:47:45,650 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 01:47:45,651 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 1] term [2020-12-23 01:47:45,651 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:45,652 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 1] term [2020-12-23 01:47:45,652 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:45,653 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 1] term [2020-12-23 01:47:45,653 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:47:45,656 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:47:45,657 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:47:45,658 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:47:45,659 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:45,660 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:45,661 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:47:45,663 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:47:45,665 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 01:47:45,666 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:45,666 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:45,667 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-23 01:47:45,670 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-23 01:47:45,671 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 01:47:45,672 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:45,673 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:45,675 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:45,676 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:45,679 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:45,679 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-23 01:47:45,680 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:45,681 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:45,684 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:45,685 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 01:47:45,686 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:45,687 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:45,688 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:45,690 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-12-23 01:47:45,691 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-12-23 01:47:45,692 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 01:47:45,694 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 01:47:45,694 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:45,695 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 01:47:45,696 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:45,697 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:45,700 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:45,701 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:45,702 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:45,703 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:45,704 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:45,706 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 01:47:45,707 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:45,708 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:45,710 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:45,711 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 01:47:45,712 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:45,712 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:45,715 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:45,716 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:45,717 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:45,719 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 01:47:45,720 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:45,721 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:45,723 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:45,725 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:45,725 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:45,727 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-12-23 01:47:45,728 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:45,730 INFO L639 QuantifierPusher]: Distributing 8 conjuncts over 3 disjuncts [2020-12-23 01:47:45,730 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 01:47:45,731 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 01:47:45,732 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:45,733 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 01:47:45,734 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 01:47:45,735 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:45,736 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 3 disjuncts [2020-12-23 01:47:45,737 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-23 01:47:45,738 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:45,739 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 01:47:45,740 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 01:47:45,741 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-23 01:47:45,744 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 01:47:45,750 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:45,752 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 01:47:45,752 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:120, output treesize:23 [2020-12-23 01:47:45,797 INFO L348 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2020-12-23 01:47:45,797 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2020-12-23 01:47:45,799 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:45,806 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:45,808 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 01:47:45,808 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2020-12-23 01:47:46,042 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2020-12-23 01:47:46,043 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2020-12-23 01:47:46,045 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:47:46,049 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:47:46,050 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:47:46,051 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2020-12-23 01:47:46,548 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 58 proven. 130 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:47:46,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 01:47:46,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2020-12-23 01:47:46,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483886950] [2020-12-23 01:47:46,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-23 01:47:46,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:46,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-23 01:47:46,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2020-12-23 01:47:46,551 INFO L87 Difference]: Start difference. First operand 1464 states and 2184 transitions. Second operand 17 states. [2020-12-23 01:47:56,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:56,495 INFO L93 Difference]: Finished difference Result 5566 states and 8244 transitions. [2020-12-23 01:47:56,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 01:47:56,496 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 173 [2020-12-23 01:47:56,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:56,505 INFO L225 Difference]: With dead ends: 5566 [2020-12-23 01:47:56,506 INFO L226 Difference]: Without dead ends: 4123 [2020-12-23 01:47:56,508 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=195, Invalid=675, Unknown=0, NotChecked=0, Total=870 [2020-12-23 01:47:56,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4123 states. [2020-12-23 01:47:56,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4123 to 2741. [2020-12-23 01:47:56,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2741 states. [2020-12-23 01:47:56,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2741 states to 2741 states and 4086 transitions. [2020-12-23 01:47:56,792 INFO L78 Accepts]: Start accepts. Automaton has 2741 states and 4086 transitions. Word has length 173 [2020-12-23 01:47:56,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:56,793 INFO L481 AbstractCegarLoop]: Abstraction has 2741 states and 4086 transitions. [2020-12-23 01:47:56,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-23 01:47:56,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2741 states and 4086 transitions. [2020-12-23 01:47:56,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-12-23 01:47:56,799 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:56,800 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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] [2020-12-23 01:47:57,013 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable113 [2020-12-23 01:47:57,014 INFO L429 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:57,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:57,015 INFO L82 PathProgramCache]: Analyzing trace with hash 931660317, now seen corresponding path program 1 times [2020-12-23 01:47:57,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:57,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982460] [2020-12-23 01:47:57,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:57,118 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2020-12-23 01:47:57,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982460] [2020-12-23 01:47:57,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:57,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:57,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966421859] [2020-12-23 01:47:57,120 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:57,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:57,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:57,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:57,120 INFO L87 Difference]: Start difference. First operand 2741 states and 4086 transitions. Second operand 4 states. [2020-12-23 01:47:57,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:57,900 INFO L93 Difference]: Finished difference Result 4376 states and 6504 transitions. [2020-12-23 01:47:57,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:57,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2020-12-23 01:47:57,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:57,908 INFO L225 Difference]: With dead ends: 4376 [2020-12-23 01:47:57,908 INFO L226 Difference]: Without dead ends: 2933 [2020-12-23 01:47:57,911 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:57,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-12-23 01:47:58,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 2741. [2020-12-23 01:47:58,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2741 states. [2020-12-23 01:47:58,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2741 states to 2741 states and 4080 transitions. [2020-12-23 01:47:58,114 INFO L78 Accepts]: Start accepts. Automaton has 2741 states and 4080 transitions. Word has length 173 [2020-12-23 01:47:58,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:58,114 INFO L481 AbstractCegarLoop]: Abstraction has 2741 states and 4080 transitions. [2020-12-23 01:47:58,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:58,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2741 states and 4080 transitions. [2020-12-23 01:47:58,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-12-23 01:47:58,118 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:58,118 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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] [2020-12-23 01:47:58,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2020-12-23 01:47:58,118 INFO L429 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:58,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:58,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1170651140, now seen corresponding path program 1 times [2020-12-23 01:47:58,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:58,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232260808] [2020-12-23 01:47:58,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:58,209 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2020-12-23 01:47:58,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232260808] [2020-12-23 01:47:58,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:58,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:58,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9983610] [2020-12-23 01:47:58,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:58,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:58,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:58,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:58,211 INFO L87 Difference]: Start difference. First operand 2741 states and 4080 transitions. Second operand 4 states. [2020-12-23 01:47:58,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:58,908 INFO L93 Difference]: Finished difference Result 4376 states and 6495 transitions. [2020-12-23 01:47:58,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:58,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2020-12-23 01:47:58,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:58,913 INFO L225 Difference]: With dead ends: 4376 [2020-12-23 01:47:58,913 INFO L226 Difference]: Without dead ends: 2933 [2020-12-23 01:47:58,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:58,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-12-23 01:47:59,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 2741. [2020-12-23 01:47:59,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2741 states. [2020-12-23 01:47:59,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2741 states to 2741 states and 4074 transitions. [2020-12-23 01:47:59,126 INFO L78 Accepts]: Start accepts. Automaton has 2741 states and 4074 transitions. Word has length 174 [2020-12-23 01:47:59,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:47:59,126 INFO L481 AbstractCegarLoop]: Abstraction has 2741 states and 4074 transitions. [2020-12-23 01:47:59,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:47:59,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2741 states and 4074 transitions. [2020-12-23 01:47:59,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-12-23 01:47:59,131 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:47:59,131 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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] [2020-12-23 01:47:59,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2020-12-23 01:47:59,131 INFO L429 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:47:59,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:47:59,132 INFO L82 PathProgramCache]: Analyzing trace with hash -49364734, now seen corresponding path program 1 times [2020-12-23 01:47:59,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:47:59,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545857858] [2020-12-23 01:47:59,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:47:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:47:59,234 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2020-12-23 01:47:59,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545857858] [2020-12-23 01:47:59,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:47:59,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:47:59,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237142409] [2020-12-23 01:47:59,235 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:47:59,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:47:59,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:47:59,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:47:59,236 INFO L87 Difference]: Start difference. First operand 2741 states and 4074 transitions. Second operand 4 states. [2020-12-23 01:47:59,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:47:59,922 INFO L93 Difference]: Finished difference Result 4376 states and 6486 transitions. [2020-12-23 01:47:59,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:47:59,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2020-12-23 01:47:59,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:47:59,927 INFO L225 Difference]: With dead ends: 4376 [2020-12-23 01:47:59,927 INFO L226 Difference]: Without dead ends: 2933 [2020-12-23 01:47:59,929 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:47:59,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2020-12-23 01:48:00,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 2741. [2020-12-23 01:48:00,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2741 states. [2020-12-23 01:48:00,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2741 states to 2741 states and 4068 transitions. [2020-12-23 01:48:00,144 INFO L78 Accepts]: Start accepts. Automaton has 2741 states and 4068 transitions. Word has length 175 [2020-12-23 01:48:00,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:00,144 INFO L481 AbstractCegarLoop]: Abstraction has 2741 states and 4068 transitions. [2020-12-23 01:48:00,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:00,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2741 states and 4068 transitions. [2020-12-23 01:48:00,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-12-23 01:48:00,148 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:00,148 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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] [2020-12-23 01:48:00,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2020-12-23 01:48:00,148 INFO L429 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:00,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:00,149 INFO L82 PathProgramCache]: Analyzing trace with hash 746052041, now seen corresponding path program 1 times [2020-12-23 01:48:00,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:00,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901798177] [2020-12-23 01:48:00,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:00,284 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2020-12-23 01:48:00,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901798177] [2020-12-23 01:48:00,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:00,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:00,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847257576] [2020-12-23 01:48:00,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:00,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:00,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:00,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:00,286 INFO L87 Difference]: Start difference. First operand 2741 states and 4068 transitions. Second operand 4 states. [2020-12-23 01:48:01,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:01,008 INFO L93 Difference]: Finished difference Result 4346 states and 6441 transitions. [2020-12-23 01:48:01,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:01,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2020-12-23 01:48:01,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:01,012 INFO L225 Difference]: With dead ends: 4346 [2020-12-23 01:48:01,012 INFO L226 Difference]: Without dead ends: 2903 [2020-12-23 01:48:01,013 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:01,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2020-12-23 01:48:01,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 2741. [2020-12-23 01:48:01,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2741 states. [2020-12-23 01:48:01,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2741 states to 2741 states and 4062 transitions. [2020-12-23 01:48:01,225 INFO L78 Accepts]: Start accepts. Automaton has 2741 states and 4062 transitions. Word has length 176 [2020-12-23 01:48:01,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:01,226 INFO L481 AbstractCegarLoop]: Abstraction has 2741 states and 4062 transitions. [2020-12-23 01:48:01,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:01,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2741 states and 4062 transitions. [2020-12-23 01:48:01,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-12-23 01:48:01,229 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:01,229 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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] [2020-12-23 01:48:01,230 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2020-12-23 01:48:01,230 INFO L429 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:01,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:01,230 INFO L82 PathProgramCache]: Analyzing trace with hash -2069660934, now seen corresponding path program 1 times [2020-12-23 01:48:01,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:01,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598301519] [2020-12-23 01:48:01,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:01,402 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2020-12-23 01:48:01,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598301519] [2020-12-23 01:48:01,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:01,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 01:48:01,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485416892] [2020-12-23 01:48:01,404 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 01:48:01,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:01,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 01:48:01,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:01,405 INFO L87 Difference]: Start difference. First operand 2741 states and 4062 transitions. Second operand 5 states. [2020-12-23 01:48:02,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:02,447 INFO L93 Difference]: Finished difference Result 6256 states and 9343 transitions. [2020-12-23 01:48:02,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:02,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2020-12-23 01:48:02,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:02,452 INFO L225 Difference]: With dead ends: 6256 [2020-12-23 01:48:02,452 INFO L226 Difference]: Without dead ends: 3536 [2020-12-23 01:48:02,454 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 01:48:02,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3536 states. [2020-12-23 01:48:02,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3536 to 2978. [2020-12-23 01:48:02,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2978 states. [2020-12-23 01:48:02,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2978 states to 2978 states and 4491 transitions. [2020-12-23 01:48:02,663 INFO L78 Accepts]: Start accepts. Automaton has 2978 states and 4491 transitions. Word has length 179 [2020-12-23 01:48:02,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:02,663 INFO L481 AbstractCegarLoop]: Abstraction has 2978 states and 4491 transitions. [2020-12-23 01:48:02,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 01:48:02,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2978 states and 4491 transitions. [2020-12-23 01:48:02,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-12-23 01:48:02,667 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:02,667 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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] [2020-12-23 01:48:02,667 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2020-12-23 01:48:02,667 INFO L429 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:02,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:02,668 INFO L82 PathProgramCache]: Analyzing trace with hash 406872458, now seen corresponding path program 1 times [2020-12-23 01:48:02,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:02,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798321905] [2020-12-23 01:48:02,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:02,809 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2020-12-23 01:48:02,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798321905] [2020-12-23 01:48:02,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:02,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 01:48:02,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634761198] [2020-12-23 01:48:02,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 01:48:02,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:02,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 01:48:02,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:02,811 INFO L87 Difference]: Start difference. First operand 2978 states and 4491 transitions. Second operand 5 states. [2020-12-23 01:48:03,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:03,816 INFO L93 Difference]: Finished difference Result 6562 states and 9928 transitions. [2020-12-23 01:48:03,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:03,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2020-12-23 01:48:03,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:03,819 INFO L225 Difference]: With dead ends: 6562 [2020-12-23 01:48:03,820 INFO L226 Difference]: Without dead ends: 3605 [2020-12-23 01:48:03,822 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 01:48:03,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3605 states. [2020-12-23 01:48:04,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3605 to 3140. [2020-12-23 01:48:04,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2020-12-23 01:48:04,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 4821 transitions. [2020-12-23 01:48:04,008 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 4821 transitions. Word has length 180 [2020-12-23 01:48:04,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:04,009 INFO L481 AbstractCegarLoop]: Abstraction has 3140 states and 4821 transitions. [2020-12-23 01:48:04,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 01:48:04,009 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 4821 transitions. [2020-12-23 01:48:04,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-12-23 01:48:04,012 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:04,012 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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] [2020-12-23 01:48:04,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2020-12-23 01:48:04,013 INFO L429 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:04,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:04,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1106098171, now seen corresponding path program 1 times [2020-12-23 01:48:04,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:04,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33796534] [2020-12-23 01:48:04,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:04,356 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2020-12-23 01:48:04,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33796534] [2020-12-23 01:48:04,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:04,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 01:48:04,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55382798] [2020-12-23 01:48:04,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 01:48:04,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:04,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 01:48:04,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:04,358 INFO L87 Difference]: Start difference. First operand 3140 states and 4821 transitions. Second operand 5 states. [2020-12-23 01:48:06,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:06,027 INFO L93 Difference]: Finished difference Result 9055 states and 13912 transitions. [2020-12-23 01:48:06,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 01:48:06,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 193 [2020-12-23 01:48:06,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:06,034 INFO L225 Difference]: With dead ends: 9055 [2020-12-23 01:48:06,034 INFO L226 Difference]: Without dead ends: 5936 [2020-12-23 01:48:06,037 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 01:48:06,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5936 states. [2020-12-23 01:48:06,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5936 to 4390. [2020-12-23 01:48:06,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4390 states. [2020-12-23 01:48:06,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4390 states to 4390 states and 6812 transitions. [2020-12-23 01:48:06,277 INFO L78 Accepts]: Start accepts. Automaton has 4390 states and 6812 transitions. Word has length 193 [2020-12-23 01:48:06,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:06,278 INFO L481 AbstractCegarLoop]: Abstraction has 4390 states and 6812 transitions. [2020-12-23 01:48:06,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 01:48:06,278 INFO L276 IsEmpty]: Start isEmpty. Operand 4390 states and 6812 transitions. [2020-12-23 01:48:06,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-12-23 01:48:06,283 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:06,283 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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] [2020-12-23 01:48:06,283 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2020-12-23 01:48:06,283 INFO L429 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:06,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:06,284 INFO L82 PathProgramCache]: Analyzing trace with hash 482816569, now seen corresponding path program 1 times [2020-12-23 01:48:06,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:06,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928339878] [2020-12-23 01:48:06,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:06,778 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2020-12-23 01:48:06,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928339878] [2020-12-23 01:48:06,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605207483] [2020-12-23 01:48:06,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:48:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:07,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 49 conjunts are in the unsatisfiable core [2020-12-23 01:48:07,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:48:07,151 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-12-23 01:48:07,153 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:07,209 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:07,211 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_179|], 2=[|v_#memory_$Pointer$.base_173|, |v_#memory_$Pointer$.base_172|]} [2020-12-23 01:48:07,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:07,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:07,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:07,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:07,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:07,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:07,246 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2020-12-23 01:48:07,248 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:07,292 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:07,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:07,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:07,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:07,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:07,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:07,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:07,314 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2020-12-23 01:48:07,317 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:07,341 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:07,389 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2020-12-23 01:48:07,390 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2020-12-23 01:48:07,392 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:07,402 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:07,404 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:48:07,404 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:81, output treesize:10 [2020-12-23 01:48:07,425 INFO L348 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2020-12-23 01:48:07,426 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2020-12-23 01:48:07,427 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:07,430 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:07,431 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:48:07,431 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:10 [2020-12-23 01:48:07,467 INFO L348 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2020-12-23 01:48:07,467 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2020-12-23 01:48:07,468 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:07,471 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:07,471 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:48:07,472 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:10 [2020-12-23 01:48:07,483 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 01:48:07,494 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:07,524 INFO L348 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2020-12-23 01:48:07,524 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 23 [2020-12-23 01:48:07,528 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:07,535 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:07,537 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:48:07,537 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:10 [2020-12-23 01:48:07,581 INFO L348 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2020-12-23 01:48:07,582 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2020-12-23 01:48:07,583 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:07,586 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:07,587 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:48:07,587 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:10 [2020-12-23 01:48:07,605 INFO L348 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2020-12-23 01:48:07,605 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2020-12-23 01:48:07,609 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:07,612 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:07,613 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:48:07,613 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:10 [2020-12-23 01:48:07,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:07,653 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2020-12-23 01:48:07,654 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:07,662 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:07,678 INFO L348 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2020-12-23 01:48:07,678 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2020-12-23 01:48:07,679 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:07,682 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:07,683 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:48:07,683 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:10 [2020-12-23 01:48:07,717 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_162|], 2=[|v_#memory_$Pointer$.base_186|]} [2020-12-23 01:48:07,721 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2020-12-23 01:48:07,724 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 01:48:07,733 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:07,763 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:07,763 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2020-12-23 01:48:07,767 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 2, 1] term [2020-12-23 01:48:07,768 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 01:48:07,772 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:07,774 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:07,775 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:48:07,775 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:10 [2020-12-23 01:48:07,789 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 01:48:07,801 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:07,835 INFO L348 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2020-12-23 01:48:07,835 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 23 [2020-12-23 01:48:07,838 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:07,845 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:07,847 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:48:07,847 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:10 [2020-12-23 01:48:07,893 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_163|], 2=[|v_#memory_$Pointer$.base_188|]} [2020-12-23 01:48:07,901 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2020-12-23 01:48:07,903 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 01:48:07,912 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:07,941 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:07,942 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2020-12-23 01:48:07,946 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 2, 1] term [2020-12-23 01:48:07,946 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 01:48:07,948 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:07,950 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:07,951 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:48:07,951 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:10 [2020-12-23 01:48:07,963 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_182|], 2=[|v_#memory_$Pointer$.offset_160|, |v_#memory_$Pointer$.offset_161|, |v_#memory_$Pointer$.base_189|, |v_#memory_$Pointer$.base_177|], 6=[|v_#memory_$Pointer$.base_178|]} [2020-12-23 01:48:07,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:07,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:07,986 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 40 [2020-12-23 01:48:07,987 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:08,074 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:08,081 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 01:48:08,175 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:08,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:08,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:08,188 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 80 [2020-12-23 01:48:08,191 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:08,243 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:08,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:08,255 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2020-12-23 01:48:08,258 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:08,287 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:08,292 INFO L547 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 01:48:08,317 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:08,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-23 01:48:08,382 INFO L348 Elim1Store]: treesize reduction 68, result has 47.3 percent of original size [2020-12-23 01:48:08,383 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 98 [2020-12-23 01:48:08,385 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 2, 1] term [2020-12-23 01:48:08,386 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 01:48:08,387 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:08,408 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:08,410 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:48:08,410 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:275, output treesize:50 [2020-12-23 01:48:08,497 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_190|, |v_#memory_$Pointer$.offset_164|], 12=[|v_#memory_int_183|]} [2020-12-23 01:48:08,501 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 45 [2020-12-23 01:48:08,503 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 01:48:08,521 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:08,526 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2020-12-23 01:48:08,527 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-23 01:48:08,545 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:08,562 INFO L348 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2020-12-23 01:48:08,562 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 37 [2020-12-23 01:48:08,565 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:08,576 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:08,578 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-23 01:48:08,578 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:81, output treesize:38 [2020-12-23 01:48:08,768 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2020-12-23 01:48:08,768 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 13 [2020-12-23 01:48:08,770 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-23 01:48:08,775 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-23 01:48:08,776 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-23 01:48:08,777 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:47, output treesize:3 [2020-12-23 01:48:08,979 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2020-12-23 01:48:08,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 01:48:08,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-12-23 01:48:08,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44536037] [2020-12-23 01:48:08,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 01:48:08,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:08,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 01:48:08,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-23 01:48:08,981 INFO L87 Difference]: Start difference. First operand 4390 states and 6812 transitions. Second operand 9 states. [2020-12-23 01:48:15,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:15,955 INFO L93 Difference]: Finished difference Result 10965 states and 16849 transitions. [2020-12-23 01:48:15,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 01:48:15,956 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 193 [2020-12-23 01:48:15,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:15,966 INFO L225 Difference]: With dead ends: 10965 [2020-12-23 01:48:15,966 INFO L226 Difference]: Without dead ends: 6596 [2020-12-23 01:48:15,970 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-12-23 01:48:15,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6596 states. [2020-12-23 01:48:16,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6596 to 4858. [2020-12-23 01:48:16,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4858 states. [2020-12-23 01:48:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4858 states to 4858 states and 7638 transitions. [2020-12-23 01:48:16,272 INFO L78 Accepts]: Start accepts. Automaton has 4858 states and 7638 transitions. Word has length 193 [2020-12-23 01:48:16,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:16,272 INFO L481 AbstractCegarLoop]: Abstraction has 4858 states and 7638 transitions. [2020-12-23 01:48:16,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 01:48:16,272 INFO L276 IsEmpty]: Start isEmpty. Operand 4858 states and 7638 transitions. [2020-12-23 01:48:16,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2020-12-23 01:48:16,278 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:16,278 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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] [2020-12-23 01:48:16,478 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:48:16,479 INFO L429 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:16,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:16,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1510111414, now seen corresponding path program 1 times [2020-12-23 01:48:16,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:16,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382986987] [2020-12-23 01:48:16,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:16,611 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2020-12-23 01:48:16,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382986987] [2020-12-23 01:48:16,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:16,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:16,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126235504] [2020-12-23 01:48:16,613 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:16,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:16,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:16,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:16,614 INFO L87 Difference]: Start difference. First operand 4858 states and 7638 transitions. Second operand 4 states. [2020-12-23 01:48:17,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:17,771 INFO L93 Difference]: Finished difference Result 9938 states and 15585 transitions. [2020-12-23 01:48:17,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:17,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2020-12-23 01:48:17,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:17,777 INFO L225 Difference]: With dead ends: 9938 [2020-12-23 01:48:17,778 INFO L226 Difference]: Without dead ends: 5101 [2020-12-23 01:48:17,781 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:17,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5101 states. [2020-12-23 01:48:18,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5101 to 4858. [2020-12-23 01:48:18,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4858 states. [2020-12-23 01:48:18,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4858 states to 4858 states and 7629 transitions. [2020-12-23 01:48:18,050 INFO L78 Accepts]: Start accepts. Automaton has 4858 states and 7629 transitions. Word has length 200 [2020-12-23 01:48:18,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:18,050 INFO L481 AbstractCegarLoop]: Abstraction has 4858 states and 7629 transitions. [2020-12-23 01:48:18,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:18,051 INFO L276 IsEmpty]: Start isEmpty. Operand 4858 states and 7629 transitions. [2020-12-23 01:48:18,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2020-12-23 01:48:18,056 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:18,056 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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] [2020-12-23 01:48:18,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2020-12-23 01:48:18,056 INFO L429 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:18,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:18,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1115664385, now seen corresponding path program 1 times [2020-12-23 01:48:18,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:18,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114980083] [2020-12-23 01:48:18,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:48:18,160 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2020-12-23 01:48:18,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114980083] [2020-12-23 01:48:18,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:48:18,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:48:18,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737358930] [2020-12-23 01:48:18,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:48:18,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:48:18,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:48:18,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:48:18,162 INFO L87 Difference]: Start difference. First operand 4858 states and 7629 transitions. Second operand 4 states. [2020-12-23 01:48:18,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:48:18,978 INFO L93 Difference]: Finished difference Result 9920 states and 15549 transitions. [2020-12-23 01:48:18,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:48:18,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2020-12-23 01:48:18,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:48:18,985 INFO L225 Difference]: With dead ends: 9920 [2020-12-23 01:48:18,985 INFO L226 Difference]: Without dead ends: 5083 [2020-12-23 01:48:18,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:48:18,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5083 states. [2020-12-23 01:48:19,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5083 to 4858. [2020-12-23 01:48:19,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4858 states. [2020-12-23 01:48:19,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4858 states to 4858 states and 7620 transitions. [2020-12-23 01:48:19,265 INFO L78 Accepts]: Start accepts. Automaton has 4858 states and 7620 transitions. Word has length 201 [2020-12-23 01:48:19,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:48:19,265 INFO L481 AbstractCegarLoop]: Abstraction has 4858 states and 7620 transitions. [2020-12-23 01:48:19,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:48:19,265 INFO L276 IsEmpty]: Start isEmpty. Operand 4858 states and 7620 transitions. [2020-12-23 01:48:19,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2020-12-23 01:48:19,270 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:48:19,270 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-23 01:48:19,271 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2020-12-23 01:48:19,271 INFO L429 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:48:19,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:48:19,271 INFO L82 PathProgramCache]: Analyzing trace with hash 293913401, now seen corresponding path program 1 times [2020-12-23 01:48:19,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:48:19,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646918265] [2020-12-23 01:48:19,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:48:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 01:48:19,382 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 01:48:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 01:48:19,577 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 01:48:19,744 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 01:48:19,744 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 01:48:19,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2020-12-23 01:48:19,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 01:48:19 BoogieIcfgContainer [2020-12-23 01:48:19,992 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 01:48:19,993 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 01:48:19,993 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 01:48:19,993 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 01:48:19,994 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:46:34" (3/4) ... [2020-12-23 01:48:19,998 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-23 01:48:19,998 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 01:48:19,999 INFO L168 Benchmark]: Toolchain (without parser) took 108503.46 ms. Allocated memory was 151.0 MB in the beginning and 792.7 MB in the end (delta: 641.7 MB). Free memory was 124.0 MB in the beginning and 686.0 MB in the end (delta: -562.0 MB). Peak memory consumption was 80.6 MB. Max. memory is 8.0 GB. [2020-12-23 01:48:20,000 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 151.0 MB. Free memory was 123.6 MB in the beginning and 123.5 MB in the end (delta: 80.1 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 01:48:20,000 INFO L168 Benchmark]: CACSL2BoogieTranslator took 898.05 ms. Allocated memory is still 151.0 MB. Free memory was 123.8 MB in the beginning and 122.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 28.6 MB. Max. memory is 8.0 GB. [2020-12-23 01:48:20,000 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.39 ms. Allocated memory is still 151.0 MB. Free memory was 122.5 MB in the beginning and 117.8 MB in the end (delta: 4.7 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. [2020-12-23 01:48:20,001 INFO L168 Benchmark]: Boogie Preprocessor took 134.89 ms. Allocated memory is still 151.0 MB. Free memory was 117.8 MB in the beginning and 110.9 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. [2020-12-23 01:48:20,001 INFO L168 Benchmark]: RCFGBuilder took 1659.28 ms. Allocated memory is still 151.0 MB. Free memory was 110.9 MB in the beginning and 96.4 MB in the end (delta: 14.5 MB). Peak memory consumption was 71.2 MB. Max. memory is 8.0 GB. [2020-12-23 01:48:20,001 INFO L168 Benchmark]: TraceAbstraction took 105681.32 ms. Allocated memory was 151.0 MB in the beginning and 792.7 MB in the end (delta: 641.7 MB). Free memory was 95.9 MB in the beginning and 686.6 MB in the end (delta: -590.7 MB). Peak memory consumption was 447.4 MB. Max. memory is 8.0 GB. [2020-12-23 01:48:20,002 INFO L168 Benchmark]: Witness Printer took 5.74 ms. Allocated memory is still 792.7 MB. Free memory was 686.6 MB in the beginning and 686.0 MB in the end (delta: 522.2 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 01:48:20,004 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 151.0 MB. Free memory was 123.6 MB in the beginning and 123.5 MB in the end (delta: 80.1 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 898.05 ms. Allocated memory is still 151.0 MB. Free memory was 123.8 MB in the beginning and 122.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 28.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 116.39 ms. Allocated memory is still 151.0 MB. Free memory was 122.5 MB in the beginning and 117.8 MB in the end (delta: 4.7 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 134.89 ms. Allocated memory is still 151.0 MB. Free memory was 117.8 MB in the beginning and 110.9 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1659.28 ms. Allocated memory is still 151.0 MB. Free memory was 110.9 MB in the beginning and 96.4 MB in the end (delta: 14.5 MB). Peak memory consumption was 71.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 105681.32 ms. Allocated memory was 151.0 MB in the beginning and 792.7 MB in the end (delta: 641.7 MB). Free memory was 95.9 MB in the beginning and 686.6 MB in the end (delta: -590.7 MB). Peak memory consumption was 447.4 MB. Max. memory is 8.0 GB. * Witness Printer took 5.74 ms. Allocated memory is still 792.7 MB. Free memory was 686.6 MB in the beginning and 686.0 MB in the end (delta: 522.2 kB). There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1776]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1123. Possible FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={6:0}] [L1067] SSL *s ; [L1068] int tmp ; [L1072] s = malloc(sizeof(SSL)) [L1073] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1074] s->ctx = malloc(sizeof(SSL_CTX)) [L1075] s->session = malloc(sizeof(SSL_SESSION)) [L1082] BUF_MEM *buf ; [L1083] unsigned long l ; [L1084] unsigned long Time ; [L1085] unsigned long tmp ; [L1086] void (*cb)() ; [L1087] long num1 ; [L1088] int ret ; [L1089] int new_state ; [L1090] int state ; [L1091] int skip ; [L1092] int got_new_session ; [L1093] int tmp___1 = __VERIFIER_nondet_int() ; [L1094] int tmp___2 = __VERIFIER_nondet_int() ; [L1095] int tmp___3 = __VERIFIER_nondet_int() ; [L1096] int tmp___4 = __VERIFIER_nondet_int() ; [L1097] int tmp___5 = __VERIFIER_nondet_int() ; [L1098] int tmp___6 = __VERIFIER_nondet_int() ; [L1099] int tmp___7 ; [L1100] long tmp___8 = __VERIFIER_nondet_long() ; [L1101] int tmp___9 = __VERIFIER_nondet_int() ; [L1102] int tmp___10 = __VERIFIER_nondet_int() ; [L1103] int blastFlag ; [L1107] s->state = 8464 [L1108] blastFlag = 0 [L1109] s->hit=__VERIFIER_nondet_int () [L1110] s->state = 8464 [L1111] tmp = __VERIFIER_nondet_int() [L1112] Time = tmp [L1113] cb = (void (*)())((void *)0) [L1114] ret = -1 [L1115] skip = 0 [L1116] got_new_session = 0 [L1117] EXPR s->info_callback VAL [init=1, SSLv3_server_data={6:0}] [L1117] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1118] EXPR s->info_callback [L1118] cb = s->info_callback [L1122] EXPR s->in_handshake [L1122] s->in_handshake += 1 [L1123] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={6:0}] [L1132] EXPR s->cert VAL [init=1, SSLv3_server_data={6:0}] [L1132] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND TRUE s->state == 8464 [L1325] s->shutdown = 0 [L1326] ret = __VERIFIER_nondet_int() [L1327] COND TRUE blastFlag == 0 [L1328] blastFlag = 1 VAL [init=1, SSLv3_server_data={6:0}] [L1332] COND FALSE !(ret <= 0) [L1337] got_new_session = 1 [L1338] s->state = 8496 [L1339] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1735] EXPR s->s3 [L1735] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1735] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1764] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND TRUE s->state == 8496 [L1343] ret = __VERIFIER_nondet_int() [L1344] COND TRUE blastFlag == 1 [L1345] blastFlag = 2 VAL [init=1, SSLv3_server_data={6:0}] [L1349] COND FALSE !(ret <= 0) [L1354] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1354] COND TRUE s->hit [L1355] s->state = 8656 VAL [init=1, SSLv3_server_data={6:0}] [L1359] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1735] EXPR s->s3 [L1735] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1735] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1764] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1231] COND TRUE s->state == 8656 [L1604] EXPR s->session [L1604] EXPR s->s3 [L1604] EXPR (s->s3)->tmp.new_cipher [L1604] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1605] COND FALSE !(! tmp___9) [L1611] ret = __VERIFIER_nondet_int() [L1612] COND FALSE !(blastFlag == 10) VAL [init=1, SSLv3_server_data={6:0}] [L1615] COND FALSE !(blastFlag == 13) VAL [init=1, SSLv3_server_data={6:0}] [L1618] COND FALSE !(blastFlag == 16) VAL [init=1, SSLv3_server_data={6:0}] [L1621] COND FALSE !(blastFlag == 19) VAL [init=1, SSLv3_server_data={6:0}] [L1629] COND FALSE !(ret <= 0) [L1634] s->state = 8672 [L1635] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1636] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={6:0}] [L1735] EXPR s->s3 [L1735] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1735] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1764] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1225] COND FALSE !(s->state == 8640) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1228] COND FALSE !(s->state == 8641) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1231] COND FALSE !(s->state == 8656) [L1234] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1234] COND FALSE !(s->state == 8657) [L1237] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1237] COND TRUE s->state == 8672 [L1645] ret = __VERIFIER_nondet_int() [L1646] COND FALSE !(blastFlag == 11) VAL [init=1, SSLv3_server_data={6:0}] [L1649] COND FALSE !(blastFlag == 14) VAL [init=1, SSLv3_server_data={6:0}] [L1652] COND FALSE !(blastFlag == 17) VAL [init=1, SSLv3_server_data={6:0}] [L1655] COND FALSE !(blastFlag == 20) VAL [init=1, SSLv3_server_data={6:0}] [L1663] COND FALSE !(ret <= 0) [L1668] s->state = 8448 [L1669] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1669] COND TRUE s->hit [L1670] EXPR s->s3 [L1670] (s->s3)->tmp.next_state = 8640 [L1674] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1735] EXPR s->s3 [L1735] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1735] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1764] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND TRUE s->state == 8448 [L1492] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={6:0}] [L1505] EXPR s->s3 [L1505] EXPR (s->s3)->tmp.next_state [L1505] s->state = (s->s3)->tmp.next_state [L1735] EXPR s->s3 [L1735] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1735] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1764] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1138] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1140] EXPR s->state [L1140] state = s->state [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1141] COND FALSE !(s->state == 12292) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1144] COND FALSE !(s->state == 16384) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1147] COND FALSE !(s->state == 8192) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1150] COND FALSE !(s->state == 24576) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1153] COND FALSE !(s->state == 8195) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1156] COND FALSE !(s->state == 8480) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1159] COND FALSE !(s->state == 8481) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1162] COND FALSE !(s->state == 8482) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1165] COND FALSE !(s->state == 8464) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1168] COND FALSE !(s->state == 8465) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1171] COND FALSE !(s->state == 8466) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1174] COND FALSE !(s->state == 8496) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1177] COND FALSE !(s->state == 8497) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1180] COND FALSE !(s->state == 8512) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1183] COND FALSE !(s->state == 8513) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1186] COND FALSE !(s->state == 8528) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1189] COND FALSE !(s->state == 8529) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1192] COND FALSE !(s->state == 8544) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1195] COND FALSE !(s->state == 8545) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1198] COND FALSE !(s->state == 8560) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1201] COND FALSE !(s->state == 8561) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1204] COND FALSE !(s->state == 8448) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1207] COND FALSE !(s->state == 8576) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1210] COND FALSE !(s->state == 8577) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1213] COND FALSE !(s->state == 8592) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1216] COND FALSE !(s->state == 8593) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1219] COND FALSE !(s->state == 8608) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1222] COND FALSE !(s->state == 8609) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1225] COND TRUE s->state == 8640 [L1572] ret = __VERIFIER_nondet_int() [L1573] COND FALSE !(blastFlag == 9) VAL [init=1, SSLv3_server_data={6:0}] [L1576] COND FALSE !(blastFlag == 12) VAL [init=1, SSLv3_server_data={6:0}] [L1579] COND FALSE !(blastFlag == 15) VAL [init=1, SSLv3_server_data={6:0}] [L1582] COND FALSE !(blastFlag == 18) VAL [init=1, SSLv3_server_data={6:0}] [L1776] reach_error() VAL [init=1, SSLv3_server_data={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 159 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 105.3s, OverallIterations: 125, TraceHistogramMax: 8, AutomataDifference: 78.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 30037 SDtfs, 10916 SDslu, 49396 SDs, 0 SdLazy, 30109 SolverSat, 1590 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 54.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1078 GetRequests, 627 SyntacticMatches, 45 SemanticMatches, 406 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4858occurred in iteration=122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.4s AutomataMinimizationTime, 124 MinimizatonAttempts, 13491 StatesRemovedByMinimization, 122 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 16169 NumberOfCodeBlocks, 16169 NumberOfCodeBlocksAsserted, 127 NumberOfCheckSat, 15841 ConstructedInterpolants, 119 QuantifiedInterpolants, 8254502 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1354 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 126 InterpolantComputations, 122 PerfectInterpolantSequences, 17350/17992 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...