/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.07.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 11:40:59,132 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:40:59,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:40:59,194 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:40:59,195 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:40:59,199 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:40:59,202 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:40:59,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:40:59,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:40:59,216 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:40:59,219 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:40:59,220 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:40:59,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:40:59,224 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:40:59,225 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:40:59,227 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:40:59,228 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:40:59,232 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:40:59,241 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:40:59,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:40:59,249 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:40:59,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:40:59,253 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:40:59,255 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:40:59,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:40:59,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:40:59,266 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:40:59,268 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:40:59,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:40:59,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:40:59,271 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:40:59,272 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:40:59,273 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:40:59,274 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:40:59,275 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:40:59,276 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:40:59,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:40:59,280 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:40:59,280 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:40:59,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:40:59,285 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:40:59,286 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 11:40:59,337 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:40:59,338 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:40:59,343 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:40:59,343 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:40:59,343 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:40:59,344 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:40:59,344 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:40:59,344 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:40:59,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:40:59,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:40:59,346 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:40:59,346 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:40:59,347 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:40:59,347 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:40:59,347 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:40:59,347 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:40:59,348 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:40:59,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:40:59,348 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:40:59,348 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:40:59,349 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:40:59,349 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:40:59,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:40:59,349 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:40:59,350 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:40:59,350 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 [2021-01-06 11:40:59,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:40:59,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:40:59,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:40:59,853 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:40:59,854 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:40:59,855 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.07.i.cil-2.c [2021-01-06 11:40:59,935 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8818ac2f9/0d792fadad534d849714ad50d04838c5/FLAG02144a460 [2021-01-06 11:41:00,707 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:41:00,708 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.07.i.cil-2.c [2021-01-06 11:41:00,733 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8818ac2f9/0d792fadad534d849714ad50d04838c5/FLAG02144a460 [2021-01-06 11:41:00,890 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8818ac2f9/0d792fadad534d849714ad50d04838c5 [2021-01-06 11:41:00,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:41:00,895 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:41:00,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:41:00,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:41:00,904 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:41:00,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:41:00" (1/1) ... [2021-01-06 11:41:00,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6df08a93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:41:00, skipping insertion in model container [2021-01-06 11:41:00,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:41:00" (1/1) ... [2021-01-06 11:41:00,915 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:41:01,015 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: 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: 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[~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: 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: 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: 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: 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: 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,] [2021-01-06 11:41:01,485 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.07.i.cil-2.c[73189,73202] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2021-01-06 11:41:01,498 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:41:01,522 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: 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: 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[~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: 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: 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: 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: 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: 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,] [2021-01-06 11:41:01,721 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.07.i.cil-2.c[73189,73202] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~method~0,],base],StructAccessExpression[IdentifierExpression[~method~0,],offset]]] [2021-01-06 11:41:01,726 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:41:01,752 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:41:01,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:41:01 WrapperNode [2021-01-06 11:41:01,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:41:01,754 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:41:01,754 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:41:01,754 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:41:01,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:41:01" (1/1) ... [2021-01-06 11:41:01,791 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:41:01" (1/1) ... [2021-01-06 11:41:01,872 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:41:01,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:41:01,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:41:01,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:41:01,895 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:41:01" (1/1) ... [2021-01-06 11:41:01,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:41:01" (1/1) ... [2021-01-06 11:41:01,922 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:41:01" (1/1) ... [2021-01-06 11:41:01,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:41:01" (1/1) ... [2021-01-06 11:41:01,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:41:01" (1/1) ... [2021-01-06 11:41:01,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:41:01" (1/1) ... [2021-01-06 11:41:01,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:41:01" (1/1) ... [2021-01-06 11:41:02,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:41:02,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:41:02,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:41:02,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:41:02,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:41:01" (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 [2021-01-06 11:41:02,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 11:41:02,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:41:02,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 11:41:02,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 11:41:02,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-06 11:41:02,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:41:02,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-06 11:41:02,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:41:02,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:41:02,417 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:41:03,505 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2021-01-06 11:41:03,505 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2021-01-06 11:41:03,516 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:41:03,516 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 11:41:03,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:41:03 BoogieIcfgContainer [2021-01-06 11:41:03,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:41:03,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:41:03,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:41:03,523 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:41:03,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:41:00" (1/3) ... [2021-01-06 11:41:03,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b34f83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:41:03, skipping insertion in model container [2021-01-06 11:41:03,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:41:01" (2/3) ... [2021-01-06 11:41:03,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b34f83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:41:03, skipping insertion in model container [2021-01-06 11:41:03,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:41:03" (3/3) ... [2021-01-06 11:41:03,527 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.07.i.cil-2.c [2021-01-06 11:41:03,534 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:41:03,540 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 11:41:03,560 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 11:41:03,589 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:41:03,590 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:41:03,590 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:41:03,590 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:41:03,590 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:41:03,590 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:41:03,590 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:41:03,591 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:41:03,609 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2021-01-06 11:41:03,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-06 11:41:03,619 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:03,620 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] [2021-01-06 11:41:03,621 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:03,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:03,627 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756973, now seen corresponding path program 1 times [2021-01-06 11:41:03,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:03,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601536774] [2021-01-06 11:41:03,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:04,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:04,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601536774] [2021-01-06 11:41:04,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:04,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:04,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847163191] [2021-01-06 11:41:04,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:04,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:04,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:04,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:04,128 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2021-01-06 11:41:04,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:04,731 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2021-01-06 11:41:04,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:04,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2021-01-06 11:41:04,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:04,751 INFO L225 Difference]: With dead ends: 323 [2021-01-06 11:41:04,752 INFO L226 Difference]: Without dead ends: 163 [2021-01-06 11:41:04,762 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 [2021-01-06 11:41:04,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-01-06 11:41:04,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2021-01-06 11:41:04,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:41:04,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2021-01-06 11:41:04,822 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 35 [2021-01-06 11:41:04,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:04,822 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2021-01-06 11:41:04,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:04,823 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2021-01-06 11:41:04,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-06 11:41:04,825 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:04,826 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] [2021-01-06 11:41:04,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:41:04,826 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:04,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:04,827 INFO L82 PathProgramCache]: Analyzing trace with hash 972749596, now seen corresponding path program 1 times [2021-01-06 11:41:04,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:04,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357307619] [2021-01-06 11:41:04,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:05,004 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:05,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357307619] [2021-01-06 11:41:05,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:05,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:05,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579228177] [2021-01-06 11:41:05,010 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:05,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:05,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:05,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:05,014 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand 4 states. [2021-01-06 11:41:05,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:05,604 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2021-01-06 11:41:05,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:05,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2021-01-06 11:41:05,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:05,610 INFO L225 Difference]: With dead ends: 290 [2021-01-06 11:41:05,610 INFO L226 Difference]: Without dead ends: 163 [2021-01-06 11:41:05,612 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 [2021-01-06 11:41:05,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-01-06 11:41:05,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2021-01-06 11:41:05,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:41:05,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2021-01-06 11:41:05,651 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 48 [2021-01-06 11:41:05,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:05,651 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2021-01-06 11:41:05,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:05,652 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2021-01-06 11:41:05,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-06 11:41:05,659 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:05,659 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] [2021-01-06 11:41:05,659 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:41:05,660 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:05,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:05,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1295428526, now seen corresponding path program 1 times [2021-01-06 11:41:05,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:05,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203294875] [2021-01-06 11:41:05,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:05,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:05,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203294875] [2021-01-06 11:41:05,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:05,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:05,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430528443] [2021-01-06 11:41:05,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:05,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:05,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:05,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:05,821 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand 4 states. [2021-01-06 11:41:06,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:06,249 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2021-01-06 11:41:06,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:06,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2021-01-06 11:41:06,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:06,251 INFO L225 Difference]: With dead ends: 289 [2021-01-06 11:41:06,252 INFO L226 Difference]: Without dead ends: 162 [2021-01-06 11:41:06,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 [2021-01-06 11:41:06,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-01-06 11:41:06,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2021-01-06 11:41:06,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:41:06,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2021-01-06 11:41:06,264 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 49 [2021-01-06 11:41:06,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:06,265 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2021-01-06 11:41:06,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:06,265 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2021-01-06 11:41:06,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-06 11:41:06,266 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:06,267 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] [2021-01-06 11:41:06,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 11:41:06,267 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:06,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:06,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1231677145, now seen corresponding path program 1 times [2021-01-06 11:41:06,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:06,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106557395] [2021-01-06 11:41:06,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:06,393 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:06,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106557395] [2021-01-06 11:41:06,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:06,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:06,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153455482] [2021-01-06 11:41:06,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:06,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:06,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:06,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:06,396 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand 4 states. [2021-01-06 11:41:06,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:06,761 INFO L93 Difference]: Finished difference Result 287 states and 438 transitions. [2021-01-06 11:41:06,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:06,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2021-01-06 11:41:06,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:06,764 INFO L225 Difference]: With dead ends: 287 [2021-01-06 11:41:06,764 INFO L226 Difference]: Without dead ends: 160 [2021-01-06 11:41:06,766 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 [2021-01-06 11:41:06,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-01-06 11:41:06,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2021-01-06 11:41:06,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:41:06,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2021-01-06 11:41:06,776 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 49 [2021-01-06 11:41:06,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:06,776 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2021-01-06 11:41:06,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:06,777 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2021-01-06 11:41:06,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-06 11:41:06,778 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:06,778 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] [2021-01-06 11:41:06,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:41:06,779 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:06,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:06,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1771822617, now seen corresponding path program 1 times [2021-01-06 11:41:06,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:06,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158812904] [2021-01-06 11:41:06,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:06,849 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:06,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158812904] [2021-01-06 11:41:06,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:06,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:06,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447166351] [2021-01-06 11:41:06,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:06,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:06,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:06,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:06,852 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand 4 states. [2021-01-06 11:41:07,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:07,196 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2021-01-06 11:41:07,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:07,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2021-01-06 11:41:07,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:07,198 INFO L225 Difference]: With dead ends: 286 [2021-01-06 11:41:07,198 INFO L226 Difference]: Without dead ends: 159 [2021-01-06 11:41:07,199 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 [2021-01-06 11:41:07,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-01-06 11:41:07,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2021-01-06 11:41:07,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:41:07,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2021-01-06 11:41:07,208 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 49 [2021-01-06 11:41:07,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:07,208 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2021-01-06 11:41:07,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:07,208 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2021-01-06 11:41:07,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-06 11:41:07,210 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:07,210 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] [2021-01-06 11:41:07,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 11:41:07,210 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:07,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:07,211 INFO L82 PathProgramCache]: Analyzing trace with hash -2133959614, now seen corresponding path program 1 times [2021-01-06 11:41:07,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:07,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693677503] [2021-01-06 11:41:07,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:07,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693677503] [2021-01-06 11:41:07,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:07,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:07,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051822968] [2021-01-06 11:41:07,333 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:07,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:07,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:07,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:07,334 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand 4 states. [2021-01-06 11:41:07,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:07,678 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2021-01-06 11:41:07,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:07,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2021-01-06 11:41:07,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:07,679 INFO L225 Difference]: With dead ends: 286 [2021-01-06 11:41:07,679 INFO L226 Difference]: Without dead ends: 159 [2021-01-06 11:41:07,680 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 [2021-01-06 11:41:07,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-01-06 11:41:07,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2021-01-06 11:41:07,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:41:07,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2021-01-06 11:41:07,688 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 49 [2021-01-06 11:41:07,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:07,688 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2021-01-06 11:41:07,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:07,689 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2021-01-06 11:41:07,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-06 11:41:07,690 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:07,690 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] [2021-01-06 11:41:07,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 11:41:07,690 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:07,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:07,691 INFO L82 PathProgramCache]: Analyzing trace with hash -824123675, now seen corresponding path program 1 times [2021-01-06 11:41:07,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:07,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771145477] [2021-01-06 11:41:07,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:07,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:07,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771145477] [2021-01-06 11:41:07,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:07,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:07,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685354156] [2021-01-06 11:41:07,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:07,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:07,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:07,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:07,755 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand 4 states. [2021-01-06 11:41:08,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:08,116 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2021-01-06 11:41:08,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:08,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2021-01-06 11:41:08,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:08,119 INFO L225 Difference]: With dead ends: 286 [2021-01-06 11:41:08,120 INFO L226 Difference]: Without dead ends: 159 [2021-01-06 11:41:08,120 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 [2021-01-06 11:41:08,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-01-06 11:41:08,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2021-01-06 11:41:08,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:41:08,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2021-01-06 11:41:08,127 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 50 [2021-01-06 11:41:08,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:08,127 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2021-01-06 11:41:08,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:08,128 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2021-01-06 11:41:08,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 11:41:08,129 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:08,130 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] [2021-01-06 11:41:08,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 11:41:08,130 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:08,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:08,132 INFO L82 PathProgramCache]: Analyzing trace with hash 807634151, now seen corresponding path program 1 times [2021-01-06 11:41:08,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:08,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139650253] [2021-01-06 11:41:08,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:08,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:08,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139650253] [2021-01-06 11:41:08,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:08,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:08,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114185705] [2021-01-06 11:41:08,238 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:08,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:08,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:08,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:08,240 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand 4 states. [2021-01-06 11:41:08,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:08,606 INFO L93 Difference]: Finished difference Result 286 states and 433 transitions. [2021-01-06 11:41:08,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:08,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2021-01-06 11:41:08,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:08,609 INFO L225 Difference]: With dead ends: 286 [2021-01-06 11:41:08,609 INFO L226 Difference]: Without dead ends: 159 [2021-01-06 11:41:08,610 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 [2021-01-06 11:41:08,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-01-06 11:41:08,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2021-01-06 11:41:08,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:41:08,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2021-01-06 11:41:08,615 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 51 [2021-01-06 11:41:08,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:08,616 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2021-01-06 11:41:08,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:08,616 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2021-01-06 11:41:08,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 11:41:08,617 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:08,617 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] [2021-01-06 11:41:08,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 11:41:08,618 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:08,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:08,618 INFO L82 PathProgramCache]: Analyzing trace with hash -465931414, now seen corresponding path program 1 times [2021-01-06 11:41:08,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:08,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778957046] [2021-01-06 11:41:08,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:08,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778957046] [2021-01-06 11:41:08,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:08,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:08,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863670810] [2021-01-06 11:41:08,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:08,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:08,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:08,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:08,677 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand 4 states. [2021-01-06 11:41:09,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:09,002 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2021-01-06 11:41:09,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:09,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2021-01-06 11:41:09,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:09,004 INFO L225 Difference]: With dead ends: 276 [2021-01-06 11:41:09,004 INFO L226 Difference]: Without dead ends: 149 [2021-01-06 11:41:09,005 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 [2021-01-06 11:41:09,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-01-06 11:41:09,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2021-01-06 11:41:09,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 11:41:09,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2021-01-06 11:41:09,018 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 52 [2021-01-06 11:41:09,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:09,018 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2021-01-06 11:41:09,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:09,019 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2021-01-06 11:41:09,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 11:41:09,019 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:09,020 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] [2021-01-06 11:41:09,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 11:41:09,020 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:09,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:09,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1405490990, now seen corresponding path program 1 times [2021-01-06 11:41:09,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:09,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658243902] [2021-01-06 11:41:09,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:09,163 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:09,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658243902] [2021-01-06 11:41:09,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:09,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:09,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438860928] [2021-01-06 11:41:09,165 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:09,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:09,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:09,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:09,166 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 4 states. [2021-01-06 11:41:09,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:09,530 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2021-01-06 11:41:09,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:09,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2021-01-06 11:41:09,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:09,532 INFO L225 Difference]: With dead ends: 316 [2021-01-06 11:41:09,532 INFO L226 Difference]: Without dead ends: 189 [2021-01-06 11:41:09,533 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 [2021-01-06 11:41:09,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-01-06 11:41:09,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2021-01-06 11:41:09,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:41:09,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2021-01-06 11:41:09,540 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 52 [2021-01-06 11:41:09,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:09,540 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2021-01-06 11:41:09,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:09,541 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2021-01-06 11:41:09,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 11:41:09,541 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:09,542 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] [2021-01-06 11:41:09,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 11:41:09,542 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:09,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:09,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1761497597, now seen corresponding path program 1 times [2021-01-06 11:41:09,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:09,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472014264] [2021-01-06 11:41:09,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:09,638 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:09,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472014264] [2021-01-06 11:41:09,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:09,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:09,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500369541] [2021-01-06 11:41:09,639 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:09,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:09,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:09,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:09,641 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand 4 states. [2021-01-06 11:41:09,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:09,996 INFO L93 Difference]: Finished difference Result 338 states and 517 transitions. [2021-01-06 11:41:09,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:09,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2021-01-06 11:41:09,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:09,999 INFO L225 Difference]: With dead ends: 338 [2021-01-06 11:41:09,999 INFO L226 Difference]: Without dead ends: 189 [2021-01-06 11:41:10,000 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 [2021-01-06 11:41:10,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-01-06 11:41:10,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2021-01-06 11:41:10,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:41:10,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2021-01-06 11:41:10,013 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 65 [2021-01-06 11:41:10,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:10,013 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2021-01-06 11:41:10,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:10,014 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2021-01-06 11:41:10,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 11:41:10,014 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:10,015 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] [2021-01-06 11:41:10,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 11:41:10,015 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:10,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:10,016 INFO L82 PathProgramCache]: Analyzing trace with hash -23187219, now seen corresponding path program 1 times [2021-01-06 11:41:10,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:10,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330614793] [2021-01-06 11:41:10,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:10,079 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:10,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330614793] [2021-01-06 11:41:10,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:10,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:10,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854947487] [2021-01-06 11:41:10,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:10,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:10,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:10,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:10,082 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand 4 states. [2021-01-06 11:41:10,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:10,434 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2021-01-06 11:41:10,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:10,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-01-06 11:41:10,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:10,436 INFO L225 Difference]: With dead ends: 337 [2021-01-06 11:41:10,436 INFO L226 Difference]: Without dead ends: 188 [2021-01-06 11:41:10,437 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 [2021-01-06 11:41:10,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-01-06 11:41:10,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2021-01-06 11:41:10,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:41:10,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2021-01-06 11:41:10,443 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 66 [2021-01-06 11:41:10,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:10,444 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2021-01-06 11:41:10,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:10,444 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2021-01-06 11:41:10,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 11:41:10,445 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:10,445 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] [2021-01-06 11:41:10,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 11:41:10,445 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:10,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:10,446 INFO L82 PathProgramCache]: Analyzing trace with hash -86938600, now seen corresponding path program 1 times [2021-01-06 11:41:10,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:10,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406658611] [2021-01-06 11:41:10,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:10,507 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:10,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406658611] [2021-01-06 11:41:10,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:10,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:10,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830445277] [2021-01-06 11:41:10,508 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:10,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:10,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:10,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:10,510 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand 4 states. [2021-01-06 11:41:10,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:10,847 INFO L93 Difference]: Finished difference Result 335 states and 510 transitions. [2021-01-06 11:41:10,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:10,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-01-06 11:41:10,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:10,849 INFO L225 Difference]: With dead ends: 335 [2021-01-06 11:41:10,849 INFO L226 Difference]: Without dead ends: 186 [2021-01-06 11:41:10,850 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 [2021-01-06 11:41:10,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-01-06 11:41:10,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2021-01-06 11:41:10,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:41:10,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2021-01-06 11:41:10,858 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 66 [2021-01-06 11:41:10,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:10,858 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2021-01-06 11:41:10,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2021-01-06 11:41:10,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 11:41:10,860 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:10,861 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] [2021-01-06 11:41:10,862 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 11:41:10,862 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:10,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:10,863 INFO L82 PathProgramCache]: Analyzing trace with hash 453206872, now seen corresponding path program 1 times [2021-01-06 11:41:10,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:10,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145975151] [2021-01-06 11:41:10,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:10,950 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:10,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145975151] [2021-01-06 11:41:10,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:10,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:10,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079767595] [2021-01-06 11:41:10,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:10,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:10,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:10,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:10,952 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand 4 states. [2021-01-06 11:41:11,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:11,288 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2021-01-06 11:41:11,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:11,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-01-06 11:41:11,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:11,290 INFO L225 Difference]: With dead ends: 334 [2021-01-06 11:41:11,290 INFO L226 Difference]: Without dead ends: 185 [2021-01-06 11:41:11,291 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 [2021-01-06 11:41:11,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-01-06 11:41:11,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2021-01-06 11:41:11,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:41:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2021-01-06 11:41:11,297 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 66 [2021-01-06 11:41:11,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:11,298 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2021-01-06 11:41:11,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:11,298 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2021-01-06 11:41:11,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-01-06 11:41:11,299 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:11,299 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] [2021-01-06 11:41:11,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 11:41:11,299 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:11,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:11,300 INFO L82 PathProgramCache]: Analyzing trace with hash 842391937, now seen corresponding path program 1 times [2021-01-06 11:41:11,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:11,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449586727] [2021-01-06 11:41:11,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:11,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449586727] [2021-01-06 11:41:11,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:11,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:11,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24703644] [2021-01-06 11:41:11,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:11,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:11,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:11,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:11,358 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand 4 states. [2021-01-06 11:41:11,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:11,707 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2021-01-06 11:41:11,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:11,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2021-01-06 11:41:11,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:11,710 INFO L225 Difference]: With dead ends: 334 [2021-01-06 11:41:11,710 INFO L226 Difference]: Without dead ends: 185 [2021-01-06 11:41:11,711 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 [2021-01-06 11:41:11,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-01-06 11:41:11,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2021-01-06 11:41:11,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:41:11,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2021-01-06 11:41:11,717 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 66 [2021-01-06 11:41:11,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:11,717 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2021-01-06 11:41:11,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:11,718 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2021-01-06 11:41:11,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 11:41:11,718 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:11,719 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] [2021-01-06 11:41:11,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 11:41:11,719 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:11,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:11,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1248461190, now seen corresponding path program 1 times [2021-01-06 11:41:11,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:11,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151040329] [2021-01-06 11:41:11,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:11,768 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:11,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151040329] [2021-01-06 11:41:11,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:11,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:11,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227132378] [2021-01-06 11:41:11,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:11,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:11,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:11,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:11,771 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand 4 states. [2021-01-06 11:41:12,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:12,104 INFO L93 Difference]: Finished difference Result 334 states and 503 transitions. [2021-01-06 11:41:12,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:12,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2021-01-06 11:41:12,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:12,107 INFO L225 Difference]: With dead ends: 334 [2021-01-06 11:41:12,107 INFO L226 Difference]: Without dead ends: 185 [2021-01-06 11:41:12,108 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 [2021-01-06 11:41:12,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-01-06 11:41:12,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2021-01-06 11:41:12,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:41:12,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2021-01-06 11:41:12,118 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 67 [2021-01-06 11:41:12,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:12,118 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2021-01-06 11:41:12,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:12,118 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2021-01-06 11:41:12,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-01-06 11:41:12,120 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:12,120 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] [2021-01-06 11:41:12,120 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 11:41:12,120 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:12,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:12,121 INFO L82 PathProgramCache]: Analyzing trace with hash 633255526, now seen corresponding path program 1 times [2021-01-06 11:41:12,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:12,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397014161] [2021-01-06 11:41:12,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:12,223 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:12,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397014161] [2021-01-06 11:41:12,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:12,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:12,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314720131] [2021-01-06 11:41:12,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:12,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:12,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:12,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:12,226 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 4 states. [2021-01-06 11:41:12,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:12,615 INFO L93 Difference]: Finished difference Result 334 states and 501 transitions. [2021-01-06 11:41:12,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:12,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2021-01-06 11:41:12,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:12,618 INFO L225 Difference]: With dead ends: 334 [2021-01-06 11:41:12,618 INFO L226 Difference]: Without dead ends: 185 [2021-01-06 11:41:12,620 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 [2021-01-06 11:41:12,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-01-06 11:41:12,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2021-01-06 11:41:12,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:41:12,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2021-01-06 11:41:12,628 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 68 [2021-01-06 11:41:12,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:12,628 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2021-01-06 11:41:12,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:12,628 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2021-01-06 11:41:12,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-01-06 11:41:12,629 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:12,629 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] [2021-01-06 11:41:12,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 11:41:12,629 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:12,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:12,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1576701493, now seen corresponding path program 1 times [2021-01-06 11:41:12,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:12,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31754625] [2021-01-06 11:41:12,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:12,692 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:41:12,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31754625] [2021-01-06 11:41:12,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:12,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:12,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090572314] [2021-01-06 11:41:12,696 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:12,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:12,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:12,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:12,697 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 4 states. [2021-01-06 11:41:13,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:13,031 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2021-01-06 11:41:13,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:13,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2021-01-06 11:41:13,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:13,033 INFO L225 Difference]: With dead ends: 324 [2021-01-06 11:41:13,033 INFO L226 Difference]: Without dead ends: 175 [2021-01-06 11:41:13,034 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 [2021-01-06 11:41:13,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-01-06 11:41:13,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2021-01-06 11:41:13,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2021-01-06 11:41:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2021-01-06 11:41:13,040 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 69 [2021-01-06 11:41:13,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:13,041 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2021-01-06 11:41:13,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:13,041 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2021-01-06 11:41:13,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 11:41:13,044 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:13,044 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] [2021-01-06 11:41:13,044 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 11:41:13,044 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:13,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:13,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1274616071, now seen corresponding path program 1 times [2021-01-06 11:41:13,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:13,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714068314] [2021-01-06 11:41:13,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:13,147 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:13,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714068314] [2021-01-06 11:41:13,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:13,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:13,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921734423] [2021-01-06 11:41:13,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:13,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:13,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:13,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:13,153 INFO L87 Difference]: Start difference. First operand 168 states and 248 transitions. Second operand 4 states. [2021-01-06 11:41:13,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:13,754 INFO L93 Difference]: Finished difference Result 422 states and 635 transitions. [2021-01-06 11:41:13,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:13,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2021-01-06 11:41:13,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:13,757 INFO L225 Difference]: With dead ends: 422 [2021-01-06 11:41:13,757 INFO L226 Difference]: Without dead ends: 273 [2021-01-06 11:41:13,758 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 [2021-01-06 11:41:13,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-01-06 11:41:13,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 198. [2021-01-06 11:41:13,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2021-01-06 11:41:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 300 transitions. [2021-01-06 11:41:13,768 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 300 transitions. Word has length 74 [2021-01-06 11:41:13,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:13,769 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 300 transitions. [2021-01-06 11:41:13,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:13,769 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 300 transitions. [2021-01-06 11:41:13,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 11:41:13,773 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:13,774 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] [2021-01-06 11:41:13,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 11:41:13,774 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:13,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:13,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1202229513, now seen corresponding path program 1 times [2021-01-06 11:41:13,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:13,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084075634] [2021-01-06 11:41:13,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:13,901 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:13,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084075634] [2021-01-06 11:41:13,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:13,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:13,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676561958] [2021-01-06 11:41:13,902 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:13,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:13,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:13,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:13,910 INFO L87 Difference]: Start difference. First operand 198 states and 300 transitions. Second operand 4 states. [2021-01-06 11:41:14,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:14,384 INFO L93 Difference]: Finished difference Result 427 states and 655 transitions. [2021-01-06 11:41:14,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:14,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2021-01-06 11:41:14,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:14,386 INFO L225 Difference]: With dead ends: 427 [2021-01-06 11:41:14,386 INFO L226 Difference]: Without dead ends: 248 [2021-01-06 11:41:14,388 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 [2021-01-06 11:41:14,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-01-06 11:41:14,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2021-01-06 11:41:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2021-01-06 11:41:14,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2021-01-06 11:41:14,402 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 342 transitions. Word has length 74 [2021-01-06 11:41:14,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:14,402 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 342 transitions. [2021-01-06 11:41:14,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:14,402 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 342 transitions. [2021-01-06 11:41:14,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 11:41:14,404 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:14,404 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] [2021-01-06 11:41:14,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 11:41:14,404 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:14,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:14,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1047936766, now seen corresponding path program 1 times [2021-01-06 11:41:14,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:14,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250303968] [2021-01-06 11:41:14,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:14,524 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:14,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250303968] [2021-01-06 11:41:14,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:14,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:14,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228449831] [2021-01-06 11:41:14,531 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:14,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:14,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:14,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:14,536 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. Second operand 4 states. [2021-01-06 11:41:15,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:15,026 INFO L93 Difference]: Finished difference Result 492 states and 757 transitions. [2021-01-06 11:41:15,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:15,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2021-01-06 11:41:15,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:15,031 INFO L225 Difference]: With dead ends: 492 [2021-01-06 11:41:15,031 INFO L226 Difference]: Without dead ends: 289 [2021-01-06 11:41:15,032 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 [2021-01-06 11:41:15,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-01-06 11:41:15,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 223. [2021-01-06 11:41:15,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2021-01-06 11:41:15,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2021-01-06 11:41:15,039 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 75 [2021-01-06 11:41:15,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:15,039 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2021-01-06 11:41:15,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:15,040 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2021-01-06 11:41:15,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-01-06 11:41:15,041 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:15,041 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] [2021-01-06 11:41:15,041 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 11:41:15,041 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:15,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:15,042 INFO L82 PathProgramCache]: Analyzing trace with hash -2006174842, now seen corresponding path program 1 times [2021-01-06 11:41:15,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:15,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913748399] [2021-01-06 11:41:15,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:15,125 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:15,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913748399] [2021-01-06 11:41:15,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:15,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:15,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048372293] [2021-01-06 11:41:15,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:15,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:15,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:15,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:15,128 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand 4 states. [2021-01-06 11:41:15,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:15,625 INFO L93 Difference]: Finished difference Result 493 states and 757 transitions. [2021-01-06 11:41:15,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:15,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2021-01-06 11:41:15,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:15,631 INFO L225 Difference]: With dead ends: 493 [2021-01-06 11:41:15,632 INFO L226 Difference]: Without dead ends: 289 [2021-01-06 11:41:15,632 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 [2021-01-06 11:41:15,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-01-06 11:41:15,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 233. [2021-01-06 11:41:15,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2021-01-06 11:41:15,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 362 transitions. [2021-01-06 11:41:15,640 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 362 transitions. Word has length 80 [2021-01-06 11:41:15,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:15,640 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 362 transitions. [2021-01-06 11:41:15,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:15,641 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 362 transitions. [2021-01-06 11:41:15,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-06 11:41:15,642 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:15,642 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] [2021-01-06 11:41:15,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 11:41:15,642 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:15,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:15,643 INFO L82 PathProgramCache]: Analyzing trace with hash -2068915140, now seen corresponding path program 1 times [2021-01-06 11:41:15,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:15,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556017243] [2021-01-06 11:41:15,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:15,759 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:15,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556017243] [2021-01-06 11:41:15,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:15,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:15,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499113002] [2021-01-06 11:41:15,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:15,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:15,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:15,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:15,764 INFO L87 Difference]: Start difference. First operand 233 states and 362 transitions. Second operand 4 states. [2021-01-06 11:41:16,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:16,215 INFO L93 Difference]: Finished difference Result 497 states and 768 transitions. [2021-01-06 11:41:16,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:16,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2021-01-06 11:41:16,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:16,218 INFO L225 Difference]: With dead ends: 497 [2021-01-06 11:41:16,218 INFO L226 Difference]: Without dead ends: 283 [2021-01-06 11:41:16,219 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 [2021-01-06 11:41:16,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-01-06 11:41:16,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2021-01-06 11:41:16,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-01-06 11:41:16,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 363 transitions. [2021-01-06 11:41:16,227 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 363 transitions. Word has length 81 [2021-01-06 11:41:16,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:16,227 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 363 transitions. [2021-01-06 11:41:16,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:16,227 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 363 transitions. [2021-01-06 11:41:16,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 11:41:16,228 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:16,228 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] [2021-01-06 11:41:16,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 11:41:16,228 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:16,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:16,229 INFO L82 PathProgramCache]: Analyzing trace with hash -262676504, now seen corresponding path program 1 times [2021-01-06 11:41:16,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:16,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837241847] [2021-01-06 11:41:16,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:16,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837241847] [2021-01-06 11:41:16,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:16,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:16,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637098025] [2021-01-06 11:41:16,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:16,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:16,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:16,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:16,318 INFO L87 Difference]: Start difference. First operand 234 states and 363 transitions. Second operand 4 states. [2021-01-06 11:41:16,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:16,907 INFO L93 Difference]: Finished difference Result 498 states and 768 transitions. [2021-01-06 11:41:16,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:16,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2021-01-06 11:41:16,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:16,910 INFO L225 Difference]: With dead ends: 498 [2021-01-06 11:41:16,910 INFO L226 Difference]: Without dead ends: 283 [2021-01-06 11:41:16,911 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 [2021-01-06 11:41:16,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-01-06 11:41:16,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2021-01-06 11:41:16,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-01-06 11:41:16,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2021-01-06 11:41:16,919 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 87 [2021-01-06 11:41:16,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:16,919 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2021-01-06 11:41:16,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:16,919 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2021-01-06 11:41:16,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 11:41:16,920 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:16,920 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] [2021-01-06 11:41:16,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 11:41:16,921 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:16,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:16,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1665596198, now seen corresponding path program 1 times [2021-01-06 11:41:16,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:16,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175621830] [2021-01-06 11:41:16,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:16,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:16,996 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:16,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175621830] [2021-01-06 11:41:16,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:16,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:16,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972661315] [2021-01-06 11:41:16,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:16,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:16,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:16,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:16,998 INFO L87 Difference]: Start difference. First operand 234 states and 362 transitions. Second operand 4 states. [2021-01-06 11:41:17,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:17,442 INFO L93 Difference]: Finished difference Result 475 states and 736 transitions. [2021-01-06 11:41:17,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:17,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2021-01-06 11:41:17,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:17,445 INFO L225 Difference]: With dead ends: 475 [2021-01-06 11:41:17,445 INFO L226 Difference]: Without dead ends: 260 [2021-01-06 11:41:17,446 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 [2021-01-06 11:41:17,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-01-06 11:41:17,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 234. [2021-01-06 11:41:17,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-01-06 11:41:17,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2021-01-06 11:41:17,453 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 87 [2021-01-06 11:41:17,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:17,453 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2021-01-06 11:41:17,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:17,454 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2021-01-06 11:41:17,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:41:17,455 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:17,455 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] [2021-01-06 11:41:17,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 11:41:17,455 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:17,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:17,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1651925090, now seen corresponding path program 1 times [2021-01-06 11:41:17,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:17,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729006698] [2021-01-06 11:41:17,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:17,526 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:17,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729006698] [2021-01-06 11:41:17,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:17,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:17,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160601161] [2021-01-06 11:41:17,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:17,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:17,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:17,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:17,529 INFO L87 Difference]: Start difference. First operand 234 states and 361 transitions. Second operand 4 states. [2021-01-06 11:41:18,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:18,040 INFO L93 Difference]: Finished difference Result 497 states and 763 transitions. [2021-01-06 11:41:18,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:18,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:41:18,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:18,042 INFO L225 Difference]: With dead ends: 497 [2021-01-06 11:41:18,043 INFO L226 Difference]: Without dead ends: 282 [2021-01-06 11:41:18,043 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 [2021-01-06 11:41:18,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-01-06 11:41:18,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 234. [2021-01-06 11:41:18,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-01-06 11:41:18,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 360 transitions. [2021-01-06 11:41:18,050 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 360 transitions. Word has length 88 [2021-01-06 11:41:18,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:18,051 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 360 transitions. [2021-01-06 11:41:18,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:18,051 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2021-01-06 11:41:18,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:41:18,052 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:18,052 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] [2021-01-06 11:41:18,052 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 11:41:18,052 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:18,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:18,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1588173709, now seen corresponding path program 1 times [2021-01-06 11:41:18,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:18,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148254293] [2021-01-06 11:41:18,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:18,122 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:18,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148254293] [2021-01-06 11:41:18,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:18,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:18,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507264500] [2021-01-06 11:41:18,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:18,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:18,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:18,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:18,124 INFO L87 Difference]: Start difference. First operand 234 states and 360 transitions. Second operand 4 states. [2021-01-06 11:41:18,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:18,602 INFO L93 Difference]: Finished difference Result 495 states and 759 transitions. [2021-01-06 11:41:18,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:18,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:41:18,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:18,604 INFO L225 Difference]: With dead ends: 495 [2021-01-06 11:41:18,605 INFO L226 Difference]: Without dead ends: 280 [2021-01-06 11:41:18,605 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 [2021-01-06 11:41:18,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-01-06 11:41:18,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 234. [2021-01-06 11:41:18,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-01-06 11:41:18,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 359 transitions. [2021-01-06 11:41:18,613 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 359 transitions. Word has length 88 [2021-01-06 11:41:18,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:18,613 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 359 transitions. [2021-01-06 11:41:18,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:18,613 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 359 transitions. [2021-01-06 11:41:18,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:41:18,614 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:18,614 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] [2021-01-06 11:41:18,615 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 11:41:18,615 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:18,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:18,615 INFO L82 PathProgramCache]: Analyzing trace with hash 2128319181, now seen corresponding path program 1 times [2021-01-06 11:41:18,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:18,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018660676] [2021-01-06 11:41:18,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:18,685 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:18,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018660676] [2021-01-06 11:41:18,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:18,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:18,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772379310] [2021-01-06 11:41:18,686 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:18,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:18,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:18,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:18,687 INFO L87 Difference]: Start difference. First operand 234 states and 359 transitions. Second operand 4 states. [2021-01-06 11:41:19,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:19,177 INFO L93 Difference]: Finished difference Result 494 states and 756 transitions. [2021-01-06 11:41:19,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:19,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:41:19,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:19,180 INFO L225 Difference]: With dead ends: 494 [2021-01-06 11:41:19,180 INFO L226 Difference]: Without dead ends: 279 [2021-01-06 11:41:19,181 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 [2021-01-06 11:41:19,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-01-06 11:41:19,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 234. [2021-01-06 11:41:19,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2021-01-06 11:41:19,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 358 transitions. [2021-01-06 11:41:19,189 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 358 transitions. Word has length 88 [2021-01-06 11:41:19,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:19,189 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 358 transitions. [2021-01-06 11:41:19,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:19,189 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2021-01-06 11:41:19,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:41:19,191 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:19,191 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] [2021-01-06 11:41:19,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 11:41:19,191 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:19,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:19,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1777463050, now seen corresponding path program 1 times [2021-01-06 11:41:19,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:19,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78479233] [2021-01-06 11:41:19,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:19,276 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-01-06 11:41:19,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78479233] [2021-01-06 11:41:19,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:19,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:41:19,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661052564] [2021-01-06 11:41:19,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:41:19,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:19,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:41:19,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:19,278 INFO L87 Difference]: Start difference. First operand 234 states and 358 transitions. Second operand 5 states. [2021-01-06 11:41:19,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:19,813 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2021-01-06 11:41:19,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 11:41:19,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2021-01-06 11:41:19,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:19,815 INFO L225 Difference]: With dead ends: 470 [2021-01-06 11:41:19,815 INFO L226 Difference]: Without dead ends: 255 [2021-01-06 11:41:19,816 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 [2021-01-06 11:41:19,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-01-06 11:41:19,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2021-01-06 11:41:19,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:41:19,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2021-01-06 11:41:19,824 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 88 [2021-01-06 11:41:19,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:19,824 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2021-01-06 11:41:19,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:41:19,824 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2021-01-06 11:41:19,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:41:19,825 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:19,825 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] [2021-01-06 11:41:19,825 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 11:41:19,826 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:19,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:19,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1235085327, now seen corresponding path program 1 times [2021-01-06 11:41:19,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:19,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741741768] [2021-01-06 11:41:19,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:19,888 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:19,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741741768] [2021-01-06 11:41:19,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:19,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:19,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318307721] [2021-01-06 11:41:19,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:19,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:19,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:19,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:19,890 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 4 states. [2021-01-06 11:41:20,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:20,284 INFO L93 Difference]: Finished difference Result 512 states and 776 transitions. [2021-01-06 11:41:20,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:20,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:41:20,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:20,287 INFO L225 Difference]: With dead ends: 512 [2021-01-06 11:41:20,287 INFO L226 Difference]: Without dead ends: 277 [2021-01-06 11:41:20,288 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 [2021-01-06 11:41:20,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-01-06 11:41:20,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 254. [2021-01-06 11:41:20,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:41:20,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2021-01-06 11:41:20,297 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 88 [2021-01-06 11:41:20,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:20,297 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2021-01-06 11:41:20,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:20,297 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2021-01-06 11:41:20,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 11:41:20,298 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:20,299 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] [2021-01-06 11:41:20,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 11:41:20,299 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:20,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:20,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1775230799, now seen corresponding path program 1 times [2021-01-06 11:41:20,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:20,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740221133] [2021-01-06 11:41:20,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:20,370 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:20,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740221133] [2021-01-06 11:41:20,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:20,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:20,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922671420] [2021-01-06 11:41:20,372 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:20,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:20,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:20,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:20,373 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand 4 states. [2021-01-06 11:41:20,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:20,737 INFO L93 Difference]: Finished difference Result 511 states and 773 transitions. [2021-01-06 11:41:20,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:20,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 11:41:20,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:20,740 INFO L225 Difference]: With dead ends: 511 [2021-01-06 11:41:20,740 INFO L226 Difference]: Without dead ends: 276 [2021-01-06 11:41:20,741 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 [2021-01-06 11:41:20,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-01-06 11:41:20,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2021-01-06 11:41:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:41:20,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2021-01-06 11:41:20,749 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 88 [2021-01-06 11:41:20,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:20,749 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2021-01-06 11:41:20,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:20,749 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2021-01-06 11:41:20,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 11:41:20,751 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:20,751 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] [2021-01-06 11:41:20,751 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 11:41:20,751 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:20,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:20,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1768485220, now seen corresponding path program 1 times [2021-01-06 11:41:20,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:20,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143333129] [2021-01-06 11:41:20,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:20,814 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:20,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143333129] [2021-01-06 11:41:20,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:20,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:20,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683641943] [2021-01-06 11:41:20,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:20,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:20,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:20,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:20,817 INFO L87 Difference]: Start difference. First operand 254 states and 382 transitions. Second operand 4 states. [2021-01-06 11:41:21,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:21,324 INFO L93 Difference]: Finished difference Result 534 states and 801 transitions. [2021-01-06 11:41:21,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:21,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2021-01-06 11:41:21,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:21,331 INFO L225 Difference]: With dead ends: 534 [2021-01-06 11:41:21,331 INFO L226 Difference]: Without dead ends: 299 [2021-01-06 11:41:21,333 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 [2021-01-06 11:41:21,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-01-06 11:41:21,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2021-01-06 11:41:21,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:41:21,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2021-01-06 11:41:21,348 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 89 [2021-01-06 11:41:21,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:21,349 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2021-01-06 11:41:21,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:21,349 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2021-01-06 11:41:21,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 11:41:21,350 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:21,350 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] [2021-01-06 11:41:21,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 11:41:21,350 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:21,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:21,351 INFO L82 PathProgramCache]: Analyzing trace with hash -587320030, now seen corresponding path program 1 times [2021-01-06 11:41:21,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:21,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134065247] [2021-01-06 11:41:21,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:21,436 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:21,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134065247] [2021-01-06 11:41:21,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:21,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:21,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341758676] [2021-01-06 11:41:21,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:21,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:21,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:21,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:21,439 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand 4 states. [2021-01-06 11:41:21,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:21,832 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2021-01-06 11:41:21,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:21,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2021-01-06 11:41:21,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:21,835 INFO L225 Difference]: With dead ends: 511 [2021-01-06 11:41:21,835 INFO L226 Difference]: Without dead ends: 276 [2021-01-06 11:41:21,836 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 [2021-01-06 11:41:21,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-01-06 11:41:21,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2021-01-06 11:41:21,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:41:21,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2021-01-06 11:41:21,844 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 89 [2021-01-06 11:41:21,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:21,844 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2021-01-06 11:41:21,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:21,844 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2021-01-06 11:41:21,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 11:41:21,846 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:21,846 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] [2021-01-06 11:41:21,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 11:41:21,846 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:21,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:21,847 INFO L82 PathProgramCache]: Analyzing trace with hash 253049097, now seen corresponding path program 1 times [2021-01-06 11:41:21,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:21,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337472282] [2021-01-06 11:41:21,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:21,913 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:21,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337472282] [2021-01-06 11:41:21,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:21,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:21,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058383181] [2021-01-06 11:41:21,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:21,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:21,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:21,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:21,915 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand 4 states. [2021-01-06 11:41:22,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:22,375 INFO L93 Difference]: Finished difference Result 534 states and 797 transitions. [2021-01-06 11:41:22,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:22,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2021-01-06 11:41:22,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:22,378 INFO L225 Difference]: With dead ends: 534 [2021-01-06 11:41:22,378 INFO L226 Difference]: Without dead ends: 299 [2021-01-06 11:41:22,378 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 [2021-01-06 11:41:22,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-01-06 11:41:22,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2021-01-06 11:41:22,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:41:22,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2021-01-06 11:41:22,388 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 90 [2021-01-06 11:41:22,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:22,403 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2021-01-06 11:41:22,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:22,403 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2021-01-06 11:41:22,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 11:41:22,404 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:22,404 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] [2021-01-06 11:41:22,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 11:41:22,405 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:22,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:22,406 INFO L82 PathProgramCache]: Analyzing trace with hash 237530379, now seen corresponding path program 1 times [2021-01-06 11:41:22,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:22,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531694158] [2021-01-06 11:41:22,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:22,474 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:22,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531694158] [2021-01-06 11:41:22,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:22,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:22,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200060286] [2021-01-06 11:41:22,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:22,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:22,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:22,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:22,478 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand 4 states. [2021-01-06 11:41:22,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:22,886 INFO L93 Difference]: Finished difference Result 511 states and 765 transitions. [2021-01-06 11:41:22,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:22,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2021-01-06 11:41:22,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:22,888 INFO L225 Difference]: With dead ends: 511 [2021-01-06 11:41:22,888 INFO L226 Difference]: Without dead ends: 276 [2021-01-06 11:41:22,889 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 [2021-01-06 11:41:22,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-01-06 11:41:22,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2021-01-06 11:41:22,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:41:22,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2021-01-06 11:41:22,897 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 90 [2021-01-06 11:41:22,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:22,897 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2021-01-06 11:41:22,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:22,898 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2021-01-06 11:41:22,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-01-06 11:41:22,899 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:22,899 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] [2021-01-06 11:41:22,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 11:41:22,899 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:22,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:22,900 INFO L82 PathProgramCache]: Analyzing trace with hash -762865057, now seen corresponding path program 1 times [2021-01-06 11:41:22,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:22,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178600526] [2021-01-06 11:41:22,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:22,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178600526] [2021-01-06 11:41:22,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:22,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:22,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844236805] [2021-01-06 11:41:22,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:22,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:22,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:22,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:22,970 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand 4 states. [2021-01-06 11:41:23,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:23,464 INFO L93 Difference]: Finished difference Result 534 states and 793 transitions. [2021-01-06 11:41:23,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:23,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2021-01-06 11:41:23,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:23,466 INFO L225 Difference]: With dead ends: 534 [2021-01-06 11:41:23,467 INFO L226 Difference]: Without dead ends: 299 [2021-01-06 11:41:23,467 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 [2021-01-06 11:41:23,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-01-06 11:41:23,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2021-01-06 11:41:23,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:41:23,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2021-01-06 11:41:23,477 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 91 [2021-01-06 11:41:23,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:23,477 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2021-01-06 11:41:23,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:23,477 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2021-01-06 11:41:23,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-01-06 11:41:23,478 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:23,478 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] [2021-01-06 11:41:23,479 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 11:41:23,479 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:23,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:23,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1243945315, now seen corresponding path program 1 times [2021-01-06 11:41:23,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:23,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872870495] [2021-01-06 11:41:23,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:23,562 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:23,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872870495] [2021-01-06 11:41:23,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:23,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:23,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704497092] [2021-01-06 11:41:23,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:23,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:23,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:23,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:23,564 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand 4 states. [2021-01-06 11:41:23,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:23,973 INFO L93 Difference]: Finished difference Result 511 states and 761 transitions. [2021-01-06 11:41:23,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:23,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2021-01-06 11:41:23,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:23,975 INFO L225 Difference]: With dead ends: 511 [2021-01-06 11:41:23,975 INFO L226 Difference]: Without dead ends: 276 [2021-01-06 11:41:23,976 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 [2021-01-06 11:41:23,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-01-06 11:41:23,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2021-01-06 11:41:23,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:41:23,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2021-01-06 11:41:23,984 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 91 [2021-01-06 11:41:23,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:23,985 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2021-01-06 11:41:23,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:23,985 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2021-01-06 11:41:23,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 11:41:23,986 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:23,986 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] [2021-01-06 11:41:23,986 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 11:41:23,986 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:23,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:23,987 INFO L82 PathProgramCache]: Analyzing trace with hash 821499940, now seen corresponding path program 1 times [2021-01-06 11:41:23,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:23,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846045217] [2021-01-06 11:41:23,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:24,054 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:24,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846045217] [2021-01-06 11:41:24,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:24,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:24,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238446231] [2021-01-06 11:41:24,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:24,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:24,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:24,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:24,056 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand 4 states. [2021-01-06 11:41:24,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:24,522 INFO L93 Difference]: Finished difference Result 524 states and 777 transitions. [2021-01-06 11:41:24,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:24,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2021-01-06 11:41:24,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:24,524 INFO L225 Difference]: With dead ends: 524 [2021-01-06 11:41:24,524 INFO L226 Difference]: Without dead ends: 289 [2021-01-06 11:41:24,525 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 [2021-01-06 11:41:24,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-01-06 11:41:24,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2021-01-06 11:41:24,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:41:24,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2021-01-06 11:41:24,535 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 92 [2021-01-06 11:41:24,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:24,536 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2021-01-06 11:41:24,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:24,536 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2021-01-06 11:41:24,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-01-06 11:41:24,537 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:24,537 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] [2021-01-06 11:41:24,537 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 11:41:24,537 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:24,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:24,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1207086170, now seen corresponding path program 1 times [2021-01-06 11:41:24,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:24,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983707434] [2021-01-06 11:41:24,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:24,630 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:24,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983707434] [2021-01-06 11:41:24,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:24,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:24,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118525115] [2021-01-06 11:41:24,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:24,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:24,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:24,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:24,632 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 4 states. [2021-01-06 11:41:24,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:24,998 INFO L93 Difference]: Finished difference Result 501 states and 745 transitions. [2021-01-06 11:41:24,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:24,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2021-01-06 11:41:24,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:25,001 INFO L225 Difference]: With dead ends: 501 [2021-01-06 11:41:25,001 INFO L226 Difference]: Without dead ends: 266 [2021-01-06 11:41:25,002 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 [2021-01-06 11:41:25,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-01-06 11:41:25,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2021-01-06 11:41:25,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:41:25,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 374 transitions. [2021-01-06 11:41:25,011 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 374 transitions. Word has length 92 [2021-01-06 11:41:25,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:25,011 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 374 transitions. [2021-01-06 11:41:25,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:25,011 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 374 transitions. [2021-01-06 11:41:25,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 11:41:25,013 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:25,013 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] [2021-01-06 11:41:25,013 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-01-06 11:41:25,013 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:25,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:25,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1797179946, now seen corresponding path program 1 times [2021-01-06 11:41:25,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:25,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938357356] [2021-01-06 11:41:25,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:25,081 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:25,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938357356] [2021-01-06 11:41:25,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:25,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:25,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028465839] [2021-01-06 11:41:25,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:25,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:25,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:25,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:25,083 INFO L87 Difference]: Start difference. First operand 254 states and 374 transitions. Second operand 4 states. [2021-01-06 11:41:25,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:25,528 INFO L93 Difference]: Finished difference Result 524 states and 773 transitions. [2021-01-06 11:41:25,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:25,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2021-01-06 11:41:25,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:25,530 INFO L225 Difference]: With dead ends: 524 [2021-01-06 11:41:25,530 INFO L226 Difference]: Without dead ends: 289 [2021-01-06 11:41:25,531 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 [2021-01-06 11:41:25,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-01-06 11:41:25,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2021-01-06 11:41:25,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2021-01-06 11:41:25,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2021-01-06 11:41:25,540 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 96 [2021-01-06 11:41:25,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:25,541 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2021-01-06 11:41:25,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:25,541 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2021-01-06 11:41:25,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 11:41:25,542 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:25,542 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] [2021-01-06 11:41:25,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-01-06 11:41:25,543 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:25,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:25,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1111001940, now seen corresponding path program 1 times [2021-01-06 11:41:25,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:25,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107111097] [2021-01-06 11:41:25,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:25,606 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-01-06 11:41:25,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107111097] [2021-01-06 11:41:25,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:25,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:41:25,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895204063] [2021-01-06 11:41:25,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:41:25,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:25,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:41:25,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:41:25,608 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 3 states. [2021-01-06 11:41:25,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:25,692 INFO L93 Difference]: Finished difference Result 717 states and 1067 transitions. [2021-01-06 11:41:25,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:41:25,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2021-01-06 11:41:25,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:25,695 INFO L225 Difference]: With dead ends: 717 [2021-01-06 11:41:25,695 INFO L226 Difference]: Without dead ends: 482 [2021-01-06 11:41:25,696 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 [2021-01-06 11:41:25,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-01-06 11:41:25,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2021-01-06 11:41:25,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2021-01-06 11:41:25,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 708 transitions. [2021-01-06 11:41:25,711 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 708 transitions. Word has length 96 [2021-01-06 11:41:25,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:25,711 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 708 transitions. [2021-01-06 11:41:25,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:41:25,712 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 708 transitions. [2021-01-06 11:41:25,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 11:41:25,713 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:25,713 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] [2021-01-06 11:41:25,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-01-06 11:41:25,713 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:25,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:25,714 INFO L82 PathProgramCache]: Analyzing trace with hash 149915310, now seen corresponding path program 1 times [2021-01-06 11:41:25,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:25,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763161798] [2021-01-06 11:41:25,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:25,759 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-01-06 11:41:25,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763161798] [2021-01-06 11:41:25,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:25,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:41:25,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584081171] [2021-01-06 11:41:25,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:41:25,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:25,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:41:25,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:41:25,761 INFO L87 Difference]: Start difference. First operand 482 states and 708 transitions. Second operand 3 states. [2021-01-06 11:41:25,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:25,822 INFO L93 Difference]: Finished difference Result 972 states and 1431 transitions. [2021-01-06 11:41:25,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:41:25,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2021-01-06 11:41:25,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:25,826 INFO L225 Difference]: With dead ends: 972 [2021-01-06 11:41:25,826 INFO L226 Difference]: Without dead ends: 509 [2021-01-06 11:41:25,827 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 [2021-01-06 11:41:25,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2021-01-06 11:41:25,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2021-01-06 11:41:25,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2021-01-06 11:41:25,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 743 transitions. [2021-01-06 11:41:25,848 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 743 transitions. Word has length 96 [2021-01-06 11:41:25,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:25,848 INFO L481 AbstractCegarLoop]: Abstraction has 509 states and 743 transitions. [2021-01-06 11:41:25,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:41:25,848 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 743 transitions. [2021-01-06 11:41:25,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-01-06 11:41:25,850 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:25,850 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] [2021-01-06 11:41:25,850 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-01-06 11:41:25,851 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:25,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:25,851 INFO L82 PathProgramCache]: Analyzing trace with hash 176980912, now seen corresponding path program 1 times [2021-01-06 11:41:25,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:25,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742066750] [2021-01-06 11:41:25,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:25,896 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-01-06 11:41:25,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742066750] [2021-01-06 11:41:25,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:25,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:41:25,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138757444] [2021-01-06 11:41:25,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:41:25,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:25,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:41:25,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:41:25,898 INFO L87 Difference]: Start difference. First operand 509 states and 743 transitions. Second operand 3 states. [2021-01-06 11:41:25,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:25,939 INFO L93 Difference]: Finished difference Result 1001 states and 1467 transitions. [2021-01-06 11:41:25,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:41:25,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2021-01-06 11:41:25,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:25,944 INFO L225 Difference]: With dead ends: 1001 [2021-01-06 11:41:25,944 INFO L226 Difference]: Without dead ends: 511 [2021-01-06 11:41:25,945 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 [2021-01-06 11:41:25,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2021-01-06 11:41:25,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2021-01-06 11:41:25,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2021-01-06 11:41:25,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 745 transitions. [2021-01-06 11:41:25,965 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 745 transitions. Word has length 96 [2021-01-06 11:41:25,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:25,966 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 745 transitions. [2021-01-06 11:41:25,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:41:25,966 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 745 transitions. [2021-01-06 11:41:25,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 11:41:25,968 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:25,968 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] [2021-01-06 11:41:25,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-01-06 11:41:25,968 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:25,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:25,969 INFO L82 PathProgramCache]: Analyzing trace with hash 870924278, now seen corresponding path program 1 times [2021-01-06 11:41:25,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:25,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621798364] [2021-01-06 11:41:25,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:26,034 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:41:26,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621798364] [2021-01-06 11:41:26,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:26,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:41:26,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868241320] [2021-01-06 11:41:26,036 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:41:26,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:26,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:41:26,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:41:26,037 INFO L87 Difference]: Start difference. First operand 511 states and 745 transitions. Second operand 3 states. [2021-01-06 11:41:26,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:26,110 INFO L93 Difference]: Finished difference Result 1236 states and 1817 transitions. [2021-01-06 11:41:26,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:41:26,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2021-01-06 11:41:26,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:26,115 INFO L225 Difference]: With dead ends: 1236 [2021-01-06 11:41:26,115 INFO L226 Difference]: Without dead ends: 746 [2021-01-06 11:41:26,116 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 [2021-01-06 11:41:26,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2021-01-06 11:41:26,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2021-01-06 11:41:26,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2021-01-06 11:41:26,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1093 transitions. [2021-01-06 11:41:26,145 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1093 transitions. Word has length 98 [2021-01-06 11:41:26,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:26,145 INFO L481 AbstractCegarLoop]: Abstraction has 744 states and 1093 transitions. [2021-01-06 11:41:26,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:41:26,145 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1093 transitions. [2021-01-06 11:41:26,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-01-06 11:41:26,147 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:26,147 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] [2021-01-06 11:41:26,147 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-01-06 11:41:26,148 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:26,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:26,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1276717877, now seen corresponding path program 1 times [2021-01-06 11:41:26,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:26,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951780766] [2021-01-06 11:41:26,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:26,259 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:41:26,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951780766] [2021-01-06 11:41:26,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:26,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:41:26,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077835974] [2021-01-06 11:41:26,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:41:26,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:26,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:41:26,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:41:26,261 INFO L87 Difference]: Start difference. First operand 744 states and 1093 transitions. Second operand 3 states. [2021-01-06 11:41:26,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:26,370 INFO L93 Difference]: Finished difference Result 1702 states and 2511 transitions. [2021-01-06 11:41:26,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:41:26,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2021-01-06 11:41:26,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:26,377 INFO L225 Difference]: With dead ends: 1702 [2021-01-06 11:41:26,378 INFO L226 Difference]: Without dead ends: 979 [2021-01-06 11:41:26,379 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 [2021-01-06 11:41:26,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2021-01-06 11:41:26,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 977. [2021-01-06 11:41:26,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2021-01-06 11:41:26,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1427 transitions. [2021-01-06 11:41:26,421 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1427 transitions. Word has length 104 [2021-01-06 11:41:26,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:26,422 INFO L481 AbstractCegarLoop]: Abstraction has 977 states and 1427 transitions. [2021-01-06 11:41:26,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:41:26,422 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1427 transitions. [2021-01-06 11:41:26,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 11:41:26,425 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:26,425 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] [2021-01-06 11:41:26,425 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-01-06 11:41:26,425 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:26,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:26,426 INFO L82 PathProgramCache]: Analyzing trace with hash 2010094734, now seen corresponding path program 1 times [2021-01-06 11:41:26,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:26,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994422378] [2021-01-06 11:41:26,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:26,502 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-01-06 11:41:26,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994422378] [2021-01-06 11:41:26,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:26,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:41:26,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200204502] [2021-01-06 11:41:26,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:41:26,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:26,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:41:26,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:41:26,504 INFO L87 Difference]: Start difference. First operand 977 states and 1427 transitions. Second operand 3 states. [2021-01-06 11:41:26,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:26,588 INFO L93 Difference]: Finished difference Result 2166 states and 3178 transitions. [2021-01-06 11:41:26,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:41:26,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2021-01-06 11:41:26,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:26,596 INFO L225 Difference]: With dead ends: 2166 [2021-01-06 11:41:26,597 INFO L226 Difference]: Without dead ends: 1210 [2021-01-06 11:41:26,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 [2021-01-06 11:41:26,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2021-01-06 11:41:26,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1210. [2021-01-06 11:41:26,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2021-01-06 11:41:26,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1772 transitions. [2021-01-06 11:41:26,648 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1772 transitions. Word has length 121 [2021-01-06 11:41:26,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:26,648 INFO L481 AbstractCegarLoop]: Abstraction has 1210 states and 1772 transitions. [2021-01-06 11:41:26,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:41:26,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1772 transitions. [2021-01-06 11:41:26,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 11:41:26,652 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:26,652 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] [2021-01-06 11:41:26,652 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-01-06 11:41:26,652 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:26,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:26,653 INFO L82 PathProgramCache]: Analyzing trace with hash 893597874, now seen corresponding path program 1 times [2021-01-06 11:41:26,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:26,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117589046] [2021-01-06 11:41:26,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:26,731 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-01-06 11:41:26,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117589046] [2021-01-06 11:41:26,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:26,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:41:26,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769706263] [2021-01-06 11:41:26,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:41:26,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:26,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:41:26,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:41:26,733 INFO L87 Difference]: Start difference. First operand 1210 states and 1772 transitions. Second operand 3 states. [2021-01-06 11:41:26,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:26,830 INFO L93 Difference]: Finished difference Result 1447 states and 2117 transitions. [2021-01-06 11:41:26,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:41:26,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2021-01-06 11:41:26,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:26,838 INFO L225 Difference]: With dead ends: 1447 [2021-01-06 11:41:26,838 INFO L226 Difference]: Without dead ends: 1445 [2021-01-06 11:41:26,839 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 [2021-01-06 11:41:26,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2021-01-06 11:41:26,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1443. [2021-01-06 11:41:26,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1443 states. [2021-01-06 11:41:26,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2114 transitions. [2021-01-06 11:41:26,901 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 2114 transitions. Word has length 127 [2021-01-06 11:41:26,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:26,901 INFO L481 AbstractCegarLoop]: Abstraction has 1443 states and 2114 transitions. [2021-01-06 11:41:26,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:41:26,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 2114 transitions. [2021-01-06 11:41:26,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-01-06 11:41:26,905 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:26,906 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] [2021-01-06 11:41:26,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-01-06 11:41:26,906 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:26,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:26,907 INFO L82 PathProgramCache]: Analyzing trace with hash 990449606, now seen corresponding path program 1 times [2021-01-06 11:41:26,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:26,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982579657] [2021-01-06 11:41:26,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:27,797 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 174 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:27,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982579657] [2021-01-06 11:41:27,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802857824] [2021-01-06 11:41:27,798 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 [2021-01-06 11:41:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:28,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 39 conjunts are in the unsatisfiable core [2021-01-06 11:41:28,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:41:28,321 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:41:28,321 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 [2021-01-06 11:41:28,331 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:41:28,391 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:41:28,395 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_162|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2021-01-06 11:41:28,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:28,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:28,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:28,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:28,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:28,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:28,442 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 [2021-01-06 11:41:28,444 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:41:28,485 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:41:28,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:28,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:28,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:28,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:28,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:28,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:28,508 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 [2021-01-06 11:41:28,512 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:41:28,532 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:41:28,577 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-01-06 11:41:28,578 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 [2021-01-06 11:41:28,581 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-06 11:41:28,595 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:41:28,598 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. [2021-01-06 11:41:28,598 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2021-01-06 11:41:28,667 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-01-06 11:41:28,668 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 [2021-01-06 11:41:28,676 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:41:28,684 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:41:28,686 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:41:28,687 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2021-01-06 11:41:28,785 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-01-06 11:41:28,786 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 [2021-01-06 11:41:28,790 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:41:28,798 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:41:28,799 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:41:28,799 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2021-01-06 11:41:28,821 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_178|], 2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_165|]} [2021-01-06 11:41:28,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:28,832 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 [2021-01-06 11:41:28,833 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:41:28,874 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:41:28,882 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:41:28,913 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:41:28,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:28,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:28,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:28,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:28,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:28,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:28,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:28,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:28,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:28,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:28,951 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 [2021-01-06 11:41:28,955 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 11:41:28,971 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:41:28,976 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:41:28,976 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:71 [2021-01-06 11:41:29,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:29,055 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 [2021-01-06 11:41:29,058 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:41:29,068 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:41:29,069 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:41:29,069 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:56 [2021-01-06 11:41:29,147 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-01-06 11:41:29,147 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 [2021-01-06 11:41:29,150 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:41:29,158 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:41:29,159 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:41:29,160 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2021-01-06 11:41:29,200 INFO L348 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2021-01-06 11:41:29,200 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 [2021-01-06 11:41:29,203 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:41:29,211 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:41:29,212 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:41:29,212 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2021-01-06 11:41:29,278 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_158|], 20=[|v_#memory_$Pointer$.base_168|]} [2021-01-06 11:41:29,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:29,283 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 [2021-01-06 11:41:29,284 INFO L547 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:41:29,296 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:41:29,521 WARN L197 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2021-01-06 11:41:29,523 INFO L348 Elim1Store]: treesize reduction 70, result has 72.8 percent of original size [2021-01-06 11:41:29,523 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 [2021-01-06 11:41:29,543 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:41:29,544 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 11:41:29,557 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:41:29,567 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:41:29,573 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:41:29,579 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:41:29,596 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 3, 2, 2, 2, 1] term [2021-01-06 11:41:29,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-06 11:41:29,604 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:41:29,609 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:41:29,618 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:41:29,621 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:41:29,640 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:41:29,673 INFO L625 ElimStorePlain]: treesize reduction 45, result has 64.0 percent of original size [2021-01-06 11:41:29,676 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 11:41:29,676 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:80 [2021-01-06 11:41:29,759 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 30=[|v_#memory_$Pointer$.base_169|]} [2021-01-06 11:41:29,764 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:41:29,797 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:41:30,023 WARN L197 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 61 [2021-01-06 11:41:30,024 INFO L348 Elim1Store]: treesize reduction 478, result has 19.7 percent of original size [2021-01-06 11:41:30,024 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 [2021-01-06 11:41:30,038 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 2, 1] term [2021-01-06 11:41:30,038 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:41:30,044 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:41:30,058 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:41:30,061 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. [2021-01-06 11:41:30,062 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:80 [2021-01-06 11:41:30,296 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_int_179|], 30=[|v_#memory_$Pointer$.base_170|]} [2021-01-06 11:41:30,302 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 [2021-01-06 11:41:30,303 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:41:30,325 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:41:30,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:30,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:30,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:30,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:30,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:30,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:30,503 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2021-01-06 11:41:30,504 INFO L348 Elim1Store]: treesize reduction 56, result has 73.5 percent of original size [2021-01-06 11:41:30,505 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 [2021-01-06 11:41:30,513 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 3, 2, 1] term [2021-01-06 11:41:30,513 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 11:41:30,515 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2021-01-06 11:41:30,515 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 11:41:30,517 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 1] term [2021-01-06 11:41:30,517 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:41:30,518 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 1] term [2021-01-06 11:41:30,518 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:41:30,519 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 1] term [2021-01-06 11:41:30,519 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:41:30,520 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 1] term [2021-01-06 11:41:30,520 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:41:30,521 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 1] term [2021-01-06 11:41:30,521 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:41:30,531 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:41:30,545 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:41:30,547 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. [2021-01-06 11:41:30,548 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:89 [2021-01-06 11:41:30,608 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_159|], 2=[|v_#memory_int_180|], 20=[|v_#memory_$Pointer$.base_171|]} [2021-01-06 11:41:30,613 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 [2021-01-06 11:41:30,615 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:41:30,635 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:41:30,639 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 [2021-01-06 11:41:30,641 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 11:41:30,660 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:41:30,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:30,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:30,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 11:41:30,724 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:41:30,725 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 [2021-01-06 11:41:30,734 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 3, 1] term [2021-01-06 11:41:30,735 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:41:30,736 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 1] term [2021-01-06 11:41:30,736 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:41:30,737 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 3, 1] term [2021-01-06 11:41:30,737 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:41:30,738 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 3, 1] term [2021-01-06 11:41:30,738 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:41:30,739 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 1] term [2021-01-06 11:41:30,739 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:41:30,743 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:41:30,743 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:41:30,744 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:41:30,746 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:41:30,747 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:41:30,748 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:41:30,751 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:41:30,754 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:41:30,755 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:41:30,755 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:41:30,756 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 11:41:30,760 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2021-01-06 11:41:30,761 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:41:30,762 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:41:30,763 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:41:30,766 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:41:30,767 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:41:30,770 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:41:30,771 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2021-01-06 11:41:30,772 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:41:30,773 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:41:30,776 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:41:30,778 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:41:30,779 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:41:30,781 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:41:30,782 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:41:30,784 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-06 11:41:30,785 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-06 11:41:30,787 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:41:30,789 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-06 11:41:30,790 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:41:30,791 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-06 11:41:30,792 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:41:30,793 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:41:30,796 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:41:30,798 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:41:30,799 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:41:30,801 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:41:30,802 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:41:30,804 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:41:30,805 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:41:30,806 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:41:30,809 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:41:30,810 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-06 11:41:30,811 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:41:30,812 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:41:30,815 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:41:30,816 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:41:30,817 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:41:30,820 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-06 11:41:30,821 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:41:30,822 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:41:30,825 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:41:30,826 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:41:30,827 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:41:30,829 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 11:41:30,830 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:41:30,832 INFO L639 QuantifierPusher]: Distributing 8 conjuncts over 3 disjuncts [2021-01-06 11:41:30,833 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:41:30,834 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-06 11:41:30,835 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:41:30,836 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:41:30,837 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:41:30,839 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:41:30,840 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 3 disjuncts [2021-01-06 11:41:30,841 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-01-06 11:41:30,842 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:41:30,843 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 11:41:30,844 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 11:41:30,846 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 11:41:30,849 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 11:41:30,855 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:41:30,857 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. [2021-01-06 11:41:30,857 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:120, output treesize:23 [2021-01-06 11:41:30,904 INFO L348 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-01-06 11:41:30,905 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 [2021-01-06 11:41:30,907 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:41:30,916 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:41:30,919 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. [2021-01-06 11:41:30,920 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2021-01-06 11:41:31,174 INFO L348 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-01-06 11:41:31,175 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 [2021-01-06 11:41:31,177 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 11:41:31,181 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 11:41:31,183 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 11:41:31,184 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2021-01-06 11:41:31,764 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 58 proven. 130 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:41:31,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:41:31,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2021-01-06 11:41:31,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248842597] [2021-01-06 11:41:31,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-01-06 11:41:31,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:31,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-01-06 11:41:31,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2021-01-06 11:41:31,767 INFO L87 Difference]: Start difference. First operand 1443 states and 2114 transitions. Second operand 17 states. [2021-01-06 11:41:41,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:41,647 INFO L93 Difference]: Finished difference Result 7061 states and 10434 transitions. [2021-01-06 11:41:41,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 11:41:41,648 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 164 [2021-01-06 11:41:41,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:41,677 INFO L225 Difference]: With dead ends: 7061 [2021-01-06 11:41:41,677 INFO L226 Difference]: Without dead ends: 5639 [2021-01-06 11:41:41,682 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2021-01-06 11:41:41,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2021-01-06 11:41:41,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 3127. [2021-01-06 11:41:41,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2021-01-06 11:41:41,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 4737 transitions. [2021-01-06 11:41:41,930 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 4737 transitions. Word has length 164 [2021-01-06 11:41:41,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:41,930 INFO L481 AbstractCegarLoop]: Abstraction has 3127 states and 4737 transitions. [2021-01-06 11:41:41,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-01-06 11:41:41,931 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 4737 transitions. [2021-01-06 11:41:41,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-01-06 11:41:41,938 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:41,939 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, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:42,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2021-01-06 11:41:42,153 INFO L429 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:42,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:42,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1277551777, now seen corresponding path program 1 times [2021-01-06 11:41:42,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:42,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474615776] [2021-01-06 11:41:42,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:42,286 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-01-06 11:41:42,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474615776] [2021-01-06 11:41:42,287 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:42,287 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:42,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441636033] [2021-01-06 11:41:42,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:42,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:42,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:42,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:42,292 INFO L87 Difference]: Start difference. First operand 3127 states and 4737 transitions. Second operand 4 states. [2021-01-06 11:41:42,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:42,947 INFO L93 Difference]: Finished difference Result 6929 states and 10530 transitions. [2021-01-06 11:41:42,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:42,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2021-01-06 11:41:42,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:42,969 INFO L225 Difference]: With dead ends: 6929 [2021-01-06 11:41:42,969 INFO L226 Difference]: Without dead ends: 3823 [2021-01-06 11:41:42,976 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 [2021-01-06 11:41:42,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3823 states. [2021-01-06 11:41:43,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3823 to 3463. [2021-01-06 11:41:43,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3463 states. [2021-01-06 11:41:43,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3463 states to 3463 states and 5325 transitions. [2021-01-06 11:41:43,208 INFO L78 Accepts]: Start accepts. Automaton has 3463 states and 5325 transitions. Word has length 170 [2021-01-06 11:41:43,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:43,209 INFO L481 AbstractCegarLoop]: Abstraction has 3463 states and 5325 transitions. [2021-01-06 11:41:43,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:43,209 INFO L276 IsEmpty]: Start isEmpty. Operand 3463 states and 5325 transitions. [2021-01-06 11:41:43,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 11:41:43,218 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:43,219 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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] [2021-01-06 11:41:43,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-01-06 11:41:43,219 INFO L429 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:43,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:43,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1034431756, now seen corresponding path program 1 times [2021-01-06 11:41:43,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:43,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176850003] [2021-01-06 11:41:43,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:43,417 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-01-06 11:41:43,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176850003] [2021-01-06 11:41:43,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:43,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:43,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444157884] [2021-01-06 11:41:43,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:43,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:43,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:43,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:43,420 INFO L87 Difference]: Start difference. First operand 3463 states and 5325 transitions. Second operand 4 states. [2021-01-06 11:41:44,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:44,212 INFO L93 Difference]: Finished difference Result 8047 states and 12373 transitions. [2021-01-06 11:41:44,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:44,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2021-01-06 11:41:44,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:44,225 INFO L225 Difference]: With dead ends: 8047 [2021-01-06 11:41:44,225 INFO L226 Difference]: Without dead ends: 4605 [2021-01-06 11:41:44,231 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 [2021-01-06 11:41:44,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4605 states. [2021-01-06 11:41:44,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4605 to 3931. [2021-01-06 11:41:44,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3931 states. [2021-01-06 11:41:44,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3931 states to 3931 states and 6177 transitions. [2021-01-06 11:41:44,457 INFO L78 Accepts]: Start accepts. Automaton has 3931 states and 6177 transitions. Word has length 178 [2021-01-06 11:41:44,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:44,458 INFO L481 AbstractCegarLoop]: Abstraction has 3931 states and 6177 transitions. [2021-01-06 11:41:44,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:44,458 INFO L276 IsEmpty]: Start isEmpty. Operand 3931 states and 6177 transitions. [2021-01-06 11:41:44,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-01-06 11:41:44,467 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:44,467 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2021-01-06 11:41:44,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-01-06 11:41:44,468 INFO L429 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:44,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:44,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1995576182, now seen corresponding path program 1 times [2021-01-06 11:41:44,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:44,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133985036] [2021-01-06 11:41:44,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-01-06 11:41:44,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133985036] [2021-01-06 11:41:44,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:44,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:44,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119961660] [2021-01-06 11:41:44,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:44,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:44,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:44,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:44,597 INFO L87 Difference]: Start difference. First operand 3931 states and 6177 transitions. Second operand 4 states. [2021-01-06 11:41:45,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:45,330 INFO L93 Difference]: Finished difference Result 8465 states and 13150 transitions. [2021-01-06 11:41:45,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:45,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2021-01-06 11:41:45,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:45,346 INFO L225 Difference]: With dead ends: 8465 [2021-01-06 11:41:45,346 INFO L226 Difference]: Without dead ends: 4555 [2021-01-06 11:41:45,354 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 [2021-01-06 11:41:45,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4555 states. [2021-01-06 11:41:45,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4555 to 3811. [2021-01-06 11:41:45,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3811 states. [2021-01-06 11:41:45,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3811 states to 3811 states and 5949 transitions. [2021-01-06 11:41:45,565 INFO L78 Accepts]: Start accepts. Automaton has 3811 states and 5949 transitions. Word has length 179 [2021-01-06 11:41:45,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:45,565 INFO L481 AbstractCegarLoop]: Abstraction has 3811 states and 5949 transitions. [2021-01-06 11:41:45,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:45,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3811 states and 5949 transitions. [2021-01-06 11:41:45,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-01-06 11:41:45,576 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:45,576 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, 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] [2021-01-06 11:41:45,576 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-01-06 11:41:45,577 INFO L429 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:45,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:45,577 INFO L82 PathProgramCache]: Analyzing trace with hash 289713635, now seen corresponding path program 1 times [2021-01-06 11:41:45,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:45,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747116468] [2021-01-06 11:41:45,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:45,757 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2021-01-06 11:41:45,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747116468] [2021-01-06 11:41:45,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:45,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:41:45,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612962993] [2021-01-06 11:41:45,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:41:45,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:45,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:41:45,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:45,760 INFO L87 Difference]: Start difference. First operand 3811 states and 5949 transitions. Second operand 5 states. [2021-01-06 11:41:46,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:46,513 INFO L93 Difference]: Finished difference Result 9115 states and 14237 transitions. [2021-01-06 11:41:46,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:46,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2021-01-06 11:41:46,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:46,526 INFO L225 Difference]: With dead ends: 9115 [2021-01-06 11:41:46,526 INFO L226 Difference]: Without dead ends: 5325 [2021-01-06 11:41:46,532 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 [2021-01-06 11:41:46,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5325 states. [2021-01-06 11:41:46,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5325 to 4285. [2021-01-06 11:41:46,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4285 states. [2021-01-06 11:41:46,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4285 states to 4285 states and 6807 transitions. [2021-01-06 11:41:46,741 INFO L78 Accepts]: Start accepts. Automaton has 4285 states and 6807 transitions. Word has length 179 [2021-01-06 11:41:46,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:46,742 INFO L481 AbstractCegarLoop]: Abstraction has 4285 states and 6807 transitions. [2021-01-06 11:41:46,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:41:46,742 INFO L276 IsEmpty]: Start isEmpty. Operand 4285 states and 6807 transitions. [2021-01-06 11:41:46,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-01-06 11:41:46,754 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:46,755 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, 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] [2021-01-06 11:41:46,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-01-06 11:41:46,755 INFO L429 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:46,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:46,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1455825383, now seen corresponding path program 2 times [2021-01-06 11:41:46,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:46,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334059461] [2021-01-06 11:41:46,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:46,867 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-01-06 11:41:46,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334059461] [2021-01-06 11:41:46,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:46,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:46,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015501121] [2021-01-06 11:41:46,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:46,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:46,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:46,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:46,869 INFO L87 Difference]: Start difference. First operand 4285 states and 6807 transitions. Second operand 4 states. [2021-01-06 11:41:47,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:47,631 INFO L93 Difference]: Finished difference Result 7439 states and 11734 transitions. [2021-01-06 11:41:47,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:47,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2021-01-06 11:41:47,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:47,651 INFO L225 Difference]: With dead ends: 7439 [2021-01-06 11:41:47,651 INFO L226 Difference]: Without dead ends: 5243 [2021-01-06 11:41:47,655 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 [2021-01-06 11:41:47,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5243 states. [2021-01-06 11:41:47,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5243 to 4405. [2021-01-06 11:41:47,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4405 states. [2021-01-06 11:41:47,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4405 states to 4405 states and 6977 transitions. [2021-01-06 11:41:47,917 INFO L78 Accepts]: Start accepts. Automaton has 4405 states and 6977 transitions. Word has length 179 [2021-01-06 11:41:47,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:47,917 INFO L481 AbstractCegarLoop]: Abstraction has 4405 states and 6977 transitions. [2021-01-06 11:41:47,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:47,918 INFO L276 IsEmpty]: Start isEmpty. Operand 4405 states and 6977 transitions. [2021-01-06 11:41:47,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-01-06 11:41:47,931 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:47,931 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2021-01-06 11:41:47,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-01-06 11:41:47,932 INFO L429 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:47,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:47,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1317975036, now seen corresponding path program 1 times [2021-01-06 11:41:47,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:47,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357588307] [2021-01-06 11:41:47,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:48,073 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-01-06 11:41:48,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357588307] [2021-01-06 11:41:48,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:48,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:48,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502578108] [2021-01-06 11:41:48,074 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:48,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:48,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:48,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:48,075 INFO L87 Difference]: Start difference. First operand 4405 states and 6977 transitions. Second operand 4 states. [2021-01-06 11:41:48,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:48,829 INFO L93 Difference]: Finished difference Result 7499 states and 11809 transitions. [2021-01-06 11:41:48,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:48,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2021-01-06 11:41:48,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:48,843 INFO L225 Difference]: With dead ends: 7499 [2021-01-06 11:41:48,843 INFO L226 Difference]: Without dead ends: 5243 [2021-01-06 11:41:48,848 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 [2021-01-06 11:41:48,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5243 states. [2021-01-06 11:41:49,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5243 to 4415. [2021-01-06 11:41:49,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4415 states. [2021-01-06 11:41:49,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4415 states to 4415 states and 6987 transitions. [2021-01-06 11:41:49,040 INFO L78 Accepts]: Start accepts. Automaton has 4415 states and 6987 transitions. Word has length 180 [2021-01-06 11:41:49,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:49,040 INFO L481 AbstractCegarLoop]: Abstraction has 4415 states and 6987 transitions. [2021-01-06 11:41:49,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:49,041 INFO L276 IsEmpty]: Start isEmpty. Operand 4415 states and 6987 transitions. [2021-01-06 11:41:49,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-01-06 11:41:49,051 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:49,051 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, 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, 1, 1, 1, 1, 1] [2021-01-06 11:41:49,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-01-06 11:41:49,051 INFO L429 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:49,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:49,052 INFO L82 PathProgramCache]: Analyzing trace with hash 384150911, now seen corresponding path program 1 times [2021-01-06 11:41:49,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:49,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254660038] [2021-01-06 11:41:49,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:49,276 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2021-01-06 11:41:49,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254660038] [2021-01-06 11:41:49,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:49,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:41:49,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28421117] [2021-01-06 11:41:49,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:41:49,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:49,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:41:49,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:41:49,279 INFO L87 Difference]: Start difference. First operand 4415 states and 6987 transitions. Second operand 5 states. [2021-01-06 11:41:50,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:50,085 INFO L93 Difference]: Finished difference Result 9987 states and 15767 transitions. [2021-01-06 11:41:50,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:50,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2021-01-06 11:41:50,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:50,103 INFO L225 Difference]: With dead ends: 9987 [2021-01-06 11:41:50,104 INFO L226 Difference]: Without dead ends: 5593 [2021-01-06 11:41:50,111 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 [2021-01-06 11:41:50,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5593 states. [2021-01-06 11:41:50,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5593 to 4283. [2021-01-06 11:41:50,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4283 states. [2021-01-06 11:41:50,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4283 states to 4283 states and 6807 transitions. [2021-01-06 11:41:50,322 INFO L78 Accepts]: Start accepts. Automaton has 4283 states and 6807 transitions. Word has length 180 [2021-01-06 11:41:50,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:50,323 INFO L481 AbstractCegarLoop]: Abstraction has 4283 states and 6807 transitions. [2021-01-06 11:41:50,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:41:50,323 INFO L276 IsEmpty]: Start isEmpty. Operand 4283 states and 6807 transitions. [2021-01-06 11:41:50,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-01-06 11:41:50,332 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:50,332 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2021-01-06 11:41:50,332 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-01-06 11:41:50,332 INFO L429 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:50,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:50,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1028551806, now seen corresponding path program 1 times [2021-01-06 11:41:50,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:50,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706258781] [2021-01-06 11:41:50,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-01-06 11:41:50,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706258781] [2021-01-06 11:41:50,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:50,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:50,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336999607] [2021-01-06 11:41:50,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:50,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:50,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:50,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:50,484 INFO L87 Difference]: Start difference. First operand 4283 states and 6807 transitions. Second operand 4 states. [2021-01-06 11:41:51,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:51,374 INFO L93 Difference]: Finished difference Result 7264 states and 11471 transitions. [2021-01-06 11:41:51,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:51,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2021-01-06 11:41:51,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:51,387 INFO L225 Difference]: With dead ends: 7264 [2021-01-06 11:41:51,388 INFO L226 Difference]: Without dead ends: 5069 [2021-01-06 11:41:51,393 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 [2021-01-06 11:41:51,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5069 states. [2021-01-06 11:41:51,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5069 to 4293. [2021-01-06 11:41:51,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4293 states. [2021-01-06 11:41:51,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4293 states to 4293 states and 6817 transitions. [2021-01-06 11:41:51,588 INFO L78 Accepts]: Start accepts. Automaton has 4293 states and 6817 transitions. Word has length 181 [2021-01-06 11:41:51,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:51,588 INFO L481 AbstractCegarLoop]: Abstraction has 4293 states and 6817 transitions. [2021-01-06 11:41:51,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:51,588 INFO L276 IsEmpty]: Start isEmpty. Operand 4293 states and 6817 transitions. [2021-01-06 11:41:51,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-01-06 11:41:51,597 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:51,597 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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] [2021-01-06 11:41:51,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-01-06 11:41:51,597 INFO L429 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:51,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:51,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1170394039, now seen corresponding path program 1 times [2021-01-06 11:41:51,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:51,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716041212] [2021-01-06 11:41:51,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:51,709 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-01-06 11:41:51,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716041212] [2021-01-06 11:41:51,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:51,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:51,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14415755] [2021-01-06 11:41:51,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:51,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:51,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:51,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:51,711 INFO L87 Difference]: Start difference. First operand 4293 states and 6817 transitions. Second operand 4 states. [2021-01-06 11:41:52,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:52,447 INFO L93 Difference]: Finished difference Result 7219 states and 11406 transitions. [2021-01-06 11:41:52,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:52,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2021-01-06 11:41:52,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:52,460 INFO L225 Difference]: With dead ends: 7219 [2021-01-06 11:41:52,461 INFO L226 Difference]: Without dead ends: 5019 [2021-01-06 11:41:52,466 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 [2021-01-06 11:41:52,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5019 states. [2021-01-06 11:41:52,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5019 to 4303. [2021-01-06 11:41:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4303 states. [2021-01-06 11:41:52,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4303 states to 4303 states and 6827 transitions. [2021-01-06 11:41:52,669 INFO L78 Accepts]: Start accepts. Automaton has 4303 states and 6827 transitions. Word has length 182 [2021-01-06 11:41:52,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:52,670 INFO L481 AbstractCegarLoop]: Abstraction has 4303 states and 6827 transitions. [2021-01-06 11:41:52,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:52,670 INFO L276 IsEmpty]: Start isEmpty. Operand 4303 states and 6827 transitions. [2021-01-06 11:41:52,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-01-06 11:41:52,679 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:52,680 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2021-01-06 11:41:52,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-01-06 11:41:52,680 INFO L429 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:52,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:52,681 INFO L82 PathProgramCache]: Analyzing trace with hash -983707367, now seen corresponding path program 1 times [2021-01-06 11:41:52,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:52,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139364640] [2021-01-06 11:41:52,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:52,805 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:41:52,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139364640] [2021-01-06 11:41:52,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:52,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:52,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930733627] [2021-01-06 11:41:52,806 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:52,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:52,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:52,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:52,807 INFO L87 Difference]: Start difference. First operand 4303 states and 6827 transitions. Second operand 4 states. [2021-01-06 11:41:53,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:53,638 INFO L93 Difference]: Finished difference Result 8933 states and 14098 transitions. [2021-01-06 11:41:53,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:53,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2021-01-06 11:41:53,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:53,646 INFO L225 Difference]: With dead ends: 8933 [2021-01-06 11:41:53,646 INFO L226 Difference]: Without dead ends: 4651 [2021-01-06 11:41:53,652 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 [2021-01-06 11:41:53,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4651 states. [2021-01-06 11:41:53,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4651 to 4303. [2021-01-06 11:41:53,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4303 states. [2021-01-06 11:41:53,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4303 states to 4303 states and 6815 transitions. [2021-01-06 11:41:53,880 INFO L78 Accepts]: Start accepts. Automaton has 4303 states and 6815 transitions. Word has length 184 [2021-01-06 11:41:53,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:53,880 INFO L481 AbstractCegarLoop]: Abstraction has 4303 states and 6815 transitions. [2021-01-06 11:41:53,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:53,881 INFO L276 IsEmpty]: Start isEmpty. Operand 4303 states and 6815 transitions. [2021-01-06 11:41:53,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-01-06 11:41:53,889 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:53,889 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, 1, 1, 1, 1, 1] [2021-01-06 11:41:53,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-01-06 11:41:53,890 INFO L429 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:53,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:53,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1263023272, now seen corresponding path program 1 times [2021-01-06 11:41:53,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:53,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721657375] [2021-01-06 11:41:53,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:53,999 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:41:54,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721657375] [2021-01-06 11:41:54,000 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:54,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:54,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290677529] [2021-01-06 11:41:54,001 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:54,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:54,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:54,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:54,002 INFO L87 Difference]: Start difference. First operand 4303 states and 6815 transitions. Second operand 4 states. [2021-01-06 11:41:54,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:54,674 INFO L93 Difference]: Finished difference Result 6856 states and 10757 transitions. [2021-01-06 11:41:54,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:54,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2021-01-06 11:41:54,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:54,683 INFO L225 Difference]: With dead ends: 6856 [2021-01-06 11:41:54,684 INFO L226 Difference]: Without dead ends: 4651 [2021-01-06 11:41:54,688 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 [2021-01-06 11:41:54,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4651 states. [2021-01-06 11:41:54,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4651 to 4303. [2021-01-06 11:41:54,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4303 states. [2021-01-06 11:41:54,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4303 states to 4303 states and 6803 transitions. [2021-01-06 11:41:54,862 INFO L78 Accepts]: Start accepts. Automaton has 4303 states and 6803 transitions. Word has length 185 [2021-01-06 11:41:54,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:54,863 INFO L481 AbstractCegarLoop]: Abstraction has 4303 states and 6803 transitions. [2021-01-06 11:41:54,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:54,863 INFO L276 IsEmpty]: Start isEmpty. Operand 4303 states and 6803 transitions. [2021-01-06 11:41:54,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2021-01-06 11:41:54,916 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:54,917 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:54,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-01-06 11:41:54,917 INFO L429 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:54,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:54,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1547746275, now seen corresponding path program 1 times [2021-01-06 11:41:54,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:54,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763464566] [2021-01-06 11:41:54,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:55,032 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:41:55,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763464566] [2021-01-06 11:41:55,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:55,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:55,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290900145] [2021-01-06 11:41:55,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:55,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:55,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:55,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:55,034 INFO L87 Difference]: Start difference. First operand 4303 states and 6803 transitions. Second operand 4 states. [2021-01-06 11:41:55,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:55,882 INFO L93 Difference]: Finished difference Result 6856 states and 10739 transitions. [2021-01-06 11:41:55,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:55,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2021-01-06 11:41:55,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:55,893 INFO L225 Difference]: With dead ends: 6856 [2021-01-06 11:41:55,893 INFO L226 Difference]: Without dead ends: 4651 [2021-01-06 11:41:55,899 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 [2021-01-06 11:41:55,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4651 states. [2021-01-06 11:41:56,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4651 to 4303. [2021-01-06 11:41:56,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4303 states. [2021-01-06 11:41:56,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4303 states to 4303 states and 6791 transitions. [2021-01-06 11:41:56,088 INFO L78 Accepts]: Start accepts. Automaton has 4303 states and 6791 transitions. Word has length 186 [2021-01-06 11:41:56,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:56,088 INFO L481 AbstractCegarLoop]: Abstraction has 4303 states and 6791 transitions. [2021-01-06 11:41:56,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:56,088 INFO L276 IsEmpty]: Start isEmpty. Operand 4303 states and 6791 transitions. [2021-01-06 11:41:56,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-01-06 11:41:56,097 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:56,097 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:56,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-01-06 11:41:56,098 INFO L429 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:56,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:56,098 INFO L82 PathProgramCache]: Analyzing trace with hash -619567939, now seen corresponding path program 1 times [2021-01-06 11:41:56,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:56,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485177246] [2021-01-06 11:41:56,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:56,225 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:41:56,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485177246] [2021-01-06 11:41:56,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:56,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:56,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813788375] [2021-01-06 11:41:56,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:56,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:56,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:56,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:56,227 INFO L87 Difference]: Start difference. First operand 4303 states and 6791 transitions. Second operand 4 states. [2021-01-06 11:41:56,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:56,915 INFO L93 Difference]: Finished difference Result 6856 states and 10721 transitions. [2021-01-06 11:41:56,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:56,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2021-01-06 11:41:56,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:56,923 INFO L225 Difference]: With dead ends: 6856 [2021-01-06 11:41:56,923 INFO L226 Difference]: Without dead ends: 4651 [2021-01-06 11:41:56,927 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 [2021-01-06 11:41:56,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4651 states. [2021-01-06 11:41:57,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4651 to 4303. [2021-01-06 11:41:57,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4303 states. [2021-01-06 11:41:57,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4303 states to 4303 states and 6779 transitions. [2021-01-06 11:41:57,048 INFO L78 Accepts]: Start accepts. Automaton has 4303 states and 6779 transitions. Word has length 187 [2021-01-06 11:41:57,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:57,049 INFO L481 AbstractCegarLoop]: Abstraction has 4303 states and 6779 transitions. [2021-01-06 11:41:57,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:57,049 INFO L276 IsEmpty]: Start isEmpty. Operand 4303 states and 6779 transitions. [2021-01-06 11:41:57,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2021-01-06 11:41:57,057 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:57,057 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:57,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-01-06 11:41:57,058 INFO L429 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:57,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:57,058 INFO L82 PathProgramCache]: Analyzing trace with hash -746153758, now seen corresponding path program 1 times [2021-01-06 11:41:57,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:57,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427136816] [2021-01-06 11:41:57,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:57,173 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:41:57,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427136816] [2021-01-06 11:41:57,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:57,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:57,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457079057] [2021-01-06 11:41:57,175 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:57,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:57,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:57,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:57,175 INFO L87 Difference]: Start difference. First operand 4303 states and 6779 transitions. Second operand 4 states. [2021-01-06 11:41:57,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:57,735 INFO L93 Difference]: Finished difference Result 6796 states and 10631 transitions. [2021-01-06 11:41:57,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:57,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2021-01-06 11:41:57,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:57,743 INFO L225 Difference]: With dead ends: 6796 [2021-01-06 11:41:57,743 INFO L226 Difference]: Without dead ends: 4591 [2021-01-06 11:41:57,746 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 [2021-01-06 11:41:57,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4591 states. [2021-01-06 11:41:57,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4591 to 4303. [2021-01-06 11:41:57,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4303 states. [2021-01-06 11:41:57,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4303 states to 4303 states and 6767 transitions. [2021-01-06 11:41:57,914 INFO L78 Accepts]: Start accepts. Automaton has 4303 states and 6767 transitions. Word has length 188 [2021-01-06 11:41:57,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:57,914 INFO L481 AbstractCegarLoop]: Abstraction has 4303 states and 6767 transitions. [2021-01-06 11:41:57,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:57,915 INFO L276 IsEmpty]: Start isEmpty. Operand 4303 states and 6767 transitions. [2021-01-06 11:41:57,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-01-06 11:41:57,919 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:57,920 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1] [2021-01-06 11:41:57,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-01-06 11:41:57,920 INFO L429 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:57,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:57,920 INFO L82 PathProgramCache]: Analyzing trace with hash 791063530, now seen corresponding path program 1 times [2021-01-06 11:41:57,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:57,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882913801] [2021-01-06 11:41:57,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:58,029 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2021-01-06 11:41:58,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882913801] [2021-01-06 11:41:58,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:58,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:58,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467034457] [2021-01-06 11:41:58,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:58,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:58,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:58,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:58,033 INFO L87 Difference]: Start difference. First operand 4303 states and 6767 transitions. Second operand 4 states. [2021-01-06 11:41:58,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:58,734 INFO L93 Difference]: Finished difference Result 9301 states and 14604 transitions. [2021-01-06 11:41:58,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:58,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2021-01-06 11:41:58,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:58,742 INFO L225 Difference]: With dead ends: 9301 [2021-01-06 11:41:58,742 INFO L226 Difference]: Without dead ends: 5019 [2021-01-06 11:41:58,748 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 [2021-01-06 11:41:58,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5019 states. [2021-01-06 11:41:58,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5019 to 4313. [2021-01-06 11:41:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4313 states. [2021-01-06 11:41:58,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4313 states to 4313 states and 6777 transitions. [2021-01-06 11:41:58,939 INFO L78 Accepts]: Start accepts. Automaton has 4313 states and 6777 transitions. Word has length 192 [2021-01-06 11:41:58,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:58,939 INFO L481 AbstractCegarLoop]: Abstraction has 4313 states and 6777 transitions. [2021-01-06 11:41:58,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:58,939 INFO L276 IsEmpty]: Start isEmpty. Operand 4313 states and 6777 transitions. [2021-01-06 11:41:58,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-01-06 11:41:58,946 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:58,946 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:58,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-01-06 11:41:58,947 INFO L429 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:58,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:58,947 INFO L82 PathProgramCache]: Analyzing trace with hash 426346312, now seen corresponding path program 1 times [2021-01-06 11:41:58,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:58,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861871883] [2021-01-06 11:41:58,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:41:59,076 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:41:59,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861871883] [2021-01-06 11:41:59,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:41:59,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:41:59,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884954115] [2021-01-06 11:41:59,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:41:59,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:41:59,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:41:59,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:41:59,079 INFO L87 Difference]: Start difference. First operand 4313 states and 6777 transitions. Second operand 4 states. [2021-01-06 11:41:59,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:41:59,779 INFO L93 Difference]: Finished difference Result 8893 states and 13926 transitions. [2021-01-06 11:41:59,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:41:59,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2021-01-06 11:41:59,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:41:59,788 INFO L225 Difference]: With dead ends: 8893 [2021-01-06 11:41:59,788 INFO L226 Difference]: Without dead ends: 4601 [2021-01-06 11:41:59,796 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 [2021-01-06 11:41:59,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4601 states. [2021-01-06 11:41:59,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4601 to 4313. [2021-01-06 11:41:59,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4313 states. [2021-01-06 11:41:59,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4313 states to 4313 states and 6765 transitions. [2021-01-06 11:41:59,947 INFO L78 Accepts]: Start accepts. Automaton has 4313 states and 6765 transitions. Word has length 192 [2021-01-06 11:41:59,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:41:59,947 INFO L481 AbstractCegarLoop]: Abstraction has 4313 states and 6765 transitions. [2021-01-06 11:41:59,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:41:59,948 INFO L276 IsEmpty]: Start isEmpty. Operand 4313 states and 6765 transitions. [2021-01-06 11:41:59,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2021-01-06 11:41:59,953 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:41:59,954 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:41:59,954 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-01-06 11:41:59,954 INFO L429 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:41:59,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:41:59,955 INFO L82 PathProgramCache]: Analyzing trace with hash 147913884, now seen corresponding path program 1 times [2021-01-06 11:41:59,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:41:59,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927454394] [2021-01-06 11:41:59,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:41:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:00,074 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:42:00,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927454394] [2021-01-06 11:42:00,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:00,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:00,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455374447] [2021-01-06 11:42:00,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:00,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:00,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:00,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:00,076 INFO L87 Difference]: Start difference. First operand 4313 states and 6765 transitions. Second operand 4 states. [2021-01-06 11:42:00,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:00,819 INFO L93 Difference]: Finished difference Result 8893 states and 13902 transitions. [2021-01-06 11:42:00,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:00,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2021-01-06 11:42:00,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:00,825 INFO L225 Difference]: With dead ends: 8893 [2021-01-06 11:42:00,826 INFO L226 Difference]: Without dead ends: 4601 [2021-01-06 11:42:00,832 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 [2021-01-06 11:42:00,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4601 states. [2021-01-06 11:42:01,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4601 to 4313. [2021-01-06 11:42:01,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4313 states. [2021-01-06 11:42:01,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4313 states to 4313 states and 6753 transitions. [2021-01-06 11:42:01,034 INFO L78 Accepts]: Start accepts. Automaton has 4313 states and 6753 transitions. Word has length 192 [2021-01-06 11:42:01,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:01,034 INFO L481 AbstractCegarLoop]: Abstraction has 4313 states and 6753 transitions. [2021-01-06 11:42:01,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:01,035 INFO L276 IsEmpty]: Start isEmpty. Operand 4313 states and 6753 transitions. [2021-01-06 11:42:01,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2021-01-06 11:42:01,042 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:01,042 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1] [2021-01-06 11:42:01,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-01-06 11:42:01,043 INFO L429 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:01,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:01,043 INFO L82 PathProgramCache]: Analyzing trace with hash 323502751, now seen corresponding path program 1 times [2021-01-06 11:42:01,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:01,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023636535] [2021-01-06 11:42:01,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:01,239 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2021-01-06 11:42:01,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023636535] [2021-01-06 11:42:01,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:01,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:01,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709583444] [2021-01-06 11:42:01,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:01,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:01,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:01,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:01,242 INFO L87 Difference]: Start difference. First operand 4313 states and 6753 transitions. Second operand 4 states. [2021-01-06 11:42:01,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:01,992 INFO L93 Difference]: Finished difference Result 9291 states and 14536 transitions. [2021-01-06 11:42:01,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:01,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2021-01-06 11:42:01,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:01,999 INFO L225 Difference]: With dead ends: 9291 [2021-01-06 11:42:01,999 INFO L226 Difference]: Without dead ends: 4999 [2021-01-06 11:42:02,003 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 [2021-01-06 11:42:02,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4999 states. [2021-01-06 11:42:02,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4999 to 4323. [2021-01-06 11:42:02,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4323 states. [2021-01-06 11:42:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4323 states to 4323 states and 6763 transitions. [2021-01-06 11:42:02,145 INFO L78 Accepts]: Start accepts. Automaton has 4323 states and 6763 transitions. Word has length 193 [2021-01-06 11:42:02,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:02,146 INFO L481 AbstractCegarLoop]: Abstraction has 4323 states and 6763 transitions. [2021-01-06 11:42:02,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:02,146 INFO L276 IsEmpty]: Start isEmpty. Operand 4323 states and 6763 transitions. [2021-01-06 11:42:02,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2021-01-06 11:42:02,152 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:02,152 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 1, 1] [2021-01-06 11:42:02,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-01-06 11:42:02,152 INFO L429 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:02,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:02,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1478506975, now seen corresponding path program 1 times [2021-01-06 11:42:02,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:02,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768968792] [2021-01-06 11:42:02,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:42:02,269 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-01-06 11:42:02,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768968792] [2021-01-06 11:42:02,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:42:02,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:42:02,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202700197] [2021-01-06 11:42:02,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:42:02,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:42:02,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:42:02,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:42:02,271 INFO L87 Difference]: Start difference. First operand 4323 states and 6763 transitions. Second operand 4 states. [2021-01-06 11:42:03,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:42:03,063 INFO L93 Difference]: Finished difference Result 7630 states and 11871 transitions. [2021-01-06 11:42:03,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:42:03,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2021-01-06 11:42:03,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:42:03,070 INFO L225 Difference]: With dead ends: 7630 [2021-01-06 11:42:03,070 INFO L226 Difference]: Without dead ends: 5415 [2021-01-06 11:42:03,073 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 [2021-01-06 11:42:03,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5415 states. [2021-01-06 11:42:03,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5415 to 4467. [2021-01-06 11:42:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4467 states. [2021-01-06 11:42:03,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4467 states to 4467 states and 6967 transitions. [2021-01-06 11:42:03,200 INFO L78 Accepts]: Start accepts. Automaton has 4467 states and 6967 transitions. Word has length 193 [2021-01-06 11:42:03,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:42:03,200 INFO L481 AbstractCegarLoop]: Abstraction has 4467 states and 6967 transitions. [2021-01-06 11:42:03,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:42:03,201 INFO L276 IsEmpty]: Start isEmpty. Operand 4467 states and 6967 transitions. [2021-01-06 11:42:03,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2021-01-06 11:42:03,205 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:42:03,206 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] [2021-01-06 11:42:03,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-01-06 11:42:03,206 INFO L429 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:42:03,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:42:03,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1815772062, now seen corresponding path program 1 times [2021-01-06 11:42:03,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:42:03,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749569285] [2021-01-06 11:42:03,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:42:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:42:03,322 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:42:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:42:03,450 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:42:03,585 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 11:42:03,585 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 11:42:03,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-01-06 11:42:03,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:42:03 BoogieIcfgContainer [2021-01-06 11:42:03,777 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 11:42:03,777 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 11:42:03,777 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 11:42:03,778 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 11:42:03,781 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:41:03" (3/4) ... [2021-01-06 11:42:03,786 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-01-06 11:42:03,786 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 11:42:03,788 INFO L168 Benchmark]: Toolchain (without parser) took 62892.71 ms. Allocated memory was 154.1 MB in the beginning and 771.8 MB in the end (delta: 617.6 MB). Free memory was 127.6 MB in the beginning and 555.8 MB in the end (delta: -428.2 MB). Peak memory consumption was 190.5 MB. Max. memory is 8.0 GB. [2021-01-06 11:42:03,788 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 154.1 MB. Free memory is still 132.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:42:03,789 INFO L168 Benchmark]: CACSL2BoogieTranslator took 853.30 ms. Allocated memory is still 154.1 MB. Free memory was 127.2 MB in the beginning and 95.7 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 8.0 GB. [2021-01-06 11:42:03,789 INFO L168 Benchmark]: Boogie Procedure Inliner took 118.87 ms. Allocated memory is still 154.1 MB. Free memory was 95.7 MB in the beginning and 91.1 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-01-06 11:42:03,789 INFO L168 Benchmark]: Boogie Preprocessor took 128.97 ms. Allocated memory is still 154.1 MB. Free memory was 91.1 MB in the beginning and 84.2 MB in the end (delta: 6.9 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. [2021-01-06 11:42:03,790 INFO L168 Benchmark]: RCFGBuilder took 1511.91 ms. Allocated memory is still 154.1 MB. Free memory was 84.2 MB in the beginning and 71.6 MB in the end (delta: 12.6 MB). Peak memory consumption was 39.7 MB. Max. memory is 8.0 GB. [2021-01-06 11:42:03,790 INFO L168 Benchmark]: TraceAbstraction took 60256.73 ms. Allocated memory was 154.1 MB in the beginning and 771.8 MB in the end (delta: 617.6 MB). Free memory was 71.1 MB in the beginning and 556.3 MB in the end (delta: -485.2 MB). Peak memory consumption was 132.9 MB. Max. memory is 8.0 GB. [2021-01-06 11:42:03,791 INFO L168 Benchmark]: Witness Printer took 9.21 ms. Allocated memory is still 771.8 MB. Free memory was 556.3 MB in the beginning and 555.8 MB in the end (delta: 499.9 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:42:03,793 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.17 ms. Allocated memory is still 154.1 MB. Free memory is still 132.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 853.30 ms. Allocated memory is still 154.1 MB. Free memory was 127.2 MB in the beginning and 95.7 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 118.87 ms. Allocated memory is still 154.1 MB. Free memory was 95.7 MB in the beginning and 91.1 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 128.97 ms. Allocated memory is still 154.1 MB. Free memory was 91.1 MB in the beginning and 84.2 MB in the end (delta: 6.9 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1511.91 ms. Allocated memory is still 154.1 MB. Free memory was 84.2 MB in the beginning and 71.6 MB in the end (delta: 12.6 MB). Peak memory consumption was 39.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 60256.73 ms. Allocated memory was 154.1 MB in the beginning and 771.8 MB in the end (delta: 617.6 MB). Free memory was 71.1 MB in the beginning and 556.3 MB in the end (delta: -485.2 MB). Peak memory consumption was 132.9 MB. Max. memory is 8.0 GB. * Witness Printer took 9.21 ms. Allocated memory is still 771.8 MB. Free memory was 556.3 MB in the beginning and 555.8 MB in the end (delta: 499.9 kB). There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1728]: 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}] [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] 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}] [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] 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 [L1572] EXPR s->session [L1572] EXPR s->s3 [L1572] EXPR (s->s3)->tmp.new_cipher [L1572] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1573] COND FALSE !(! tmp___9) [L1579] ret = __VERIFIER_nondet_int() [L1580] COND TRUE blastFlag == 2 [L1581] blastFlag = 3 VAL [init=1, SSLv3_server_data={6:0}] [L1593] COND FALSE !(ret <= 0) [L1598] s->state = 8672 [L1599] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1600] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={6:0}] [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] 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 [L1609] ret = __VERIFIER_nondet_int() [L1610] COND TRUE blastFlag == 3 [L1611] blastFlag = 4 VAL [init=1, SSLv3_server_data={6:0}] [L1615] COND FALSE !(ret <= 0) [L1620] s->state = 8448 [L1621] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1621] COND TRUE s->hit [L1622] EXPR s->s3 [L1622] (s->s3)->tmp.next_state = 8640 [L1626] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] 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 [L1687] EXPR s->s3 [L1687] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1687] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1716] 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 [L1552] ret = __VERIFIER_nondet_int() [L1553] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={6:0}] [L1728] reach_error() VAL [init=1, SSLv3_server_data={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 59.9s, OverallIterations: 68, TraceHistogramMax: 7, AutomataDifference: 42.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 14505 SDtfs, 5635 SDslu, 22825 SDs, 0 SdLazy, 15457 SolverSat, 950 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 545 GetRequests, 296 SyntacticMatches, 33 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4467occurred in iteration=67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.5s AutomataMinimizationTime, 67 MinimizatonAttempts, 15479 StatesRemovedByMinimization, 63 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 7682 NumberOfCodeBlocks, 7682 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 7421 ConstructedInterpolants, 80 QuantifiedInterpolants, 4203943 SizeOfPredicates, 13 NumberOfNonLiveVariables, 627 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 68 InterpolantComputations, 66 PerfectInterpolantSequences, 7636/7940 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...