./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 782042467f0cb3a7476d3c48a134dfd084f9a32e ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 782042467f0cb3a7476d3c48a134dfd084f9a32e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:17:41,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:17:41,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:17:41,991 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:17:41,992 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:17:41,994 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:17:41,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:17:42,000 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:17:42,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:17:42,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:17:42,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:17:42,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:17:42,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:17:42,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:17:42,015 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:17:42,018 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:17:42,019 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:17:42,020 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:17:42,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:17:42,027 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:17:42,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:17:42,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:17:42,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:17:42,032 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:17:42,038 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:17:42,038 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:17:42,039 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:17:42,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:17:42,041 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:17:42,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:17:42,042 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:17:42,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:17:42,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:17:42,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:17:42,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:17:42,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:17:42,047 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:17:42,047 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:17:42,047 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:17:42,048 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:17:42,049 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:17:42,053 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-25 20:17:42,090 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:17:42,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:17:42,092 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:17:42,092 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:17:42,094 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:17:42,094 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:17:42,094 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:17:42,095 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:17:42,095 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:17:42,095 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 20:17:42,096 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:17:42,096 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:17:42,096 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:17:42,096 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:17:42,096 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:17:42,097 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:17:42,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:17:42,097 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:17:42,097 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:17:42,097 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:17:42,097 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:17:42,098 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:17:42,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:17:42,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:17:42,098 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:17:42,104 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:17:42,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 20:17:42,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 20:17:42,105 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:17:42,105 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:17:42,105 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/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 782042467f0cb3a7476d3c48a134dfd084f9a32e [2021-08-25 20:17:42,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:17:42,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:17:42,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:17:42,462 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:17:42,462 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:17:42,463 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c [2021-08-25 20:17:42,530 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2aedf5f3/071031c128a6469aadc02a07aac0e8ee/FLAG8319eaba9 [2021-08-25 20:17:43,080 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:17:43,081 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c [2021-08-25 20:17:43,103 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2aedf5f3/071031c128a6469aadc02a07aac0e8ee/FLAG8319eaba9 [2021-08-25 20:17:43,542 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2aedf5f3/071031c128a6469aadc02a07aac0e8ee [2021-08-25 20:17:43,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:17:43,546 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:17:43,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:17:43,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:17:43,554 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:17:43,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:17:43" (1/1) ... [2021-08-25 20:17:43,555 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21e68c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:17:43, skipping insertion in model container [2021-08-25 20:17:43,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:17:43" (1/1) ... [2021-08-25 20:17:43,560 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:17:43,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:17:43,945 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c[64476,64489] [2021-08-25 20:17:43,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:17:43,979 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:17:44,076 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c[64476,64489] [2021-08-25 20:17:44,084 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:17:44,110 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:17:44,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:17:44 WrapperNode [2021-08-25 20:17:44,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:17:44,118 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:17:44,118 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:17:44,118 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:17:44,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:17:44" (1/1) ... [2021-08-25 20:17:44,169 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:17:44" (1/1) ... [2021-08-25 20:17:44,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:17:44,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:17:44,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:17:44,205 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:17:44,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:17:44" (1/1) ... [2021-08-25 20:17:44,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:17:44" (1/1) ... [2021-08-25 20:17:44,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:17:44" (1/1) ... [2021-08-25 20:17:44,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:17:44" (1/1) ... [2021-08-25 20:17:44,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:17:44" (1/1) ... [2021-08-25 20:17:44,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:17:44" (1/1) ... [2021-08-25 20:17:44,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:17:44" (1/1) ... [2021-08-25 20:17:44,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:17:44,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:17:44,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:17:44,314 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:17:44,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:17:44" (1/1) ... [2021-08-25 20:17:44,322 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:17:44,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:17:44,346 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-25 20:17:44,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 20:17:44,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-25 20:17:44,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:17:44,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-25 20:17:44,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-25 20:17:44,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-25 20:17:44,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 20:17:44,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-25 20:17:44,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:17:44,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:17:44,659 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:17:45,470 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-08-25 20:17:45,470 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-08-25 20:17:45,483 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:17:45,484 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:17:45,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:17:45 BoogieIcfgContainer [2021-08-25 20:17:45,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:17:45,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:17:45,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:17:45,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:17:45,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:17:43" (1/3) ... [2021-08-25 20:17:45,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb4b6e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:17:45, skipping insertion in model container [2021-08-25 20:17:45,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:17:44" (2/3) ... [2021-08-25 20:17:45,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb4b6e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:17:45, skipping insertion in model container [2021-08-25 20:17:45,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:17:45" (3/3) ... [2021-08-25 20:17:45,494 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-2.c [2021-08-25 20:17:45,499 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:17:45,499 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:17:45,538 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:17:45,545 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 20:17:45,545 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:17:45,570 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:45,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-25 20:17:45,585 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:45,586 INFO L512 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] [2021-08-25 20:17:45,586 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:45,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:45,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2021-08-25 20:17:45,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:45,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660364454] [2021-08-25 20:17:45,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:45,600 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:45,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:17:45,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:45,913 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660364454] [2021-08-25 20:17:45,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660364454] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:45,914 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:45,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:17:45,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321940049] [2021-08-25 20:17:45,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:17:45,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:45,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:17:45,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:17:45,935 INFO L87 Difference]: Start difference. First operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:46,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:46,373 INFO L93 Difference]: Finished difference Result 259 states and 432 transitions. [2021-08-25 20:17:46,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:17:46,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-08-25 20:17:46,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:46,383 INFO L225 Difference]: With dead ends: 259 [2021-08-25 20:17:46,383 INFO L226 Difference]: Without dead ends: 118 [2021-08-25 20:17:46,386 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:17:46,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-08-25 20:17:46,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2021-08-25 20:17:46,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 174 transitions. [2021-08-25 20:17:46,419 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 174 transitions. Word has length 24 [2021-08-25 20:17:46,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:46,419 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 174 transitions. [2021-08-25 20:17:46,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:46,420 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 174 transitions. [2021-08-25 20:17:46,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-25 20:17:46,425 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:46,425 INFO L512 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] [2021-08-25 20:17:46,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 20:17:46,426 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:46,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:46,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1411658380, now seen corresponding path program 1 times [2021-08-25 20:17:46,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:46,427 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064489380] [2021-08-25 20:17:46,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:46,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:46,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-25 20:17:46,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:46,587 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064489380] [2021-08-25 20:17:46,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064489380] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:46,588 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:46,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:17:46,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869774573] [2021-08-25 20:17:46,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:17:46,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:46,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:17:46,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:17:46,594 INFO L87 Difference]: Start difference. First operand 117 states and 174 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:46,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:46,660 INFO L93 Difference]: Finished difference Result 327 states and 490 transitions. [2021-08-25 20:17:46,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:17:46,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-08-25 20:17:46,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:46,667 INFO L225 Difference]: With dead ends: 327 [2021-08-25 20:17:46,667 INFO L226 Difference]: Without dead ends: 220 [2021-08-25 20:17:46,669 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:17:46,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-08-25 20:17:46,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2021-08-25 20:17:46,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.4794520547945205) internal successors, (324), 219 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:46,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 324 transitions. [2021-08-25 20:17:46,697 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 324 transitions. Word has length 39 [2021-08-25 20:17:46,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:46,698 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 324 transitions. [2021-08-25 20:17:46,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:46,700 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 324 transitions. [2021-08-25 20:17:46,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-08-25 20:17:46,708 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:46,708 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-25 20:17:46,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 20:17:46,710 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:46,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:46,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1352249408, now seen corresponding path program 1 times [2021-08-25 20:17:46,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:46,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578127087] [2021-08-25 20:17:46,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:46,714 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:46,864 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-25 20:17:46,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:46,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578127087] [2021-08-25 20:17:46,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578127087] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:46,865 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:46,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:17:46,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129149332] [2021-08-25 20:17:46,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:17:46,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:46,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:17:46,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:17:46,867 INFO L87 Difference]: Start difference. First operand 220 states and 324 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:46,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:46,964 INFO L93 Difference]: Finished difference Result 429 states and 639 transitions. [2021-08-25 20:17:46,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:17:46,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-08-25 20:17:46,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:46,967 INFO L225 Difference]: With dead ends: 429 [2021-08-25 20:17:46,967 INFO L226 Difference]: Without dead ends: 322 [2021-08-25 20:17:46,968 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:17:46,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-08-25 20:17:46,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2021-08-25 20:17:46,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 321 states have (on average 1.4735202492211839) internal successors, (473), 321 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:46,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 473 transitions. [2021-08-25 20:17:46,983 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 473 transitions. Word has length 54 [2021-08-25 20:17:46,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:46,984 INFO L470 AbstractCegarLoop]: Abstraction has 322 states and 473 transitions. [2021-08-25 20:17:46,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:46,984 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 473 transitions. [2021-08-25 20:17:46,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-25 20:17:46,986 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:46,986 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 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] [2021-08-25 20:17:46,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 20:17:46,987 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:46,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:46,987 INFO L82 PathProgramCache]: Analyzing trace with hash 210697016, now seen corresponding path program 1 times [2021-08-25 20:17:46,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:46,988 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26086316] [2021-08-25 20:17:46,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:46,988 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:47,102 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-25 20:17:47,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:47,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26086316] [2021-08-25 20:17:47,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26086316] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:47,103 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:47,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:17:47,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737854066] [2021-08-25 20:17:47,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:17:47,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:47,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:17:47,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:17:47,105 INFO L87 Difference]: Start difference. First operand 322 states and 473 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:47,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:47,727 INFO L93 Difference]: Finished difference Result 822 states and 1213 transitions. [2021-08-25 20:17:47,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:17:47,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-08-25 20:17:47,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:47,733 INFO L225 Difference]: With dead ends: 822 [2021-08-25 20:17:47,733 INFO L226 Difference]: Without dead ends: 510 [2021-08-25 20:17:47,737 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:17:47,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2021-08-25 20:17:47,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 372. [2021-08-25 20:17:47,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 371 states have (on average 1.5067385444743935) internal successors, (559), 371 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:47,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 559 transitions. [2021-08-25 20:17:47,768 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 559 transitions. Word has length 72 [2021-08-25 20:17:47,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:47,769 INFO L470 AbstractCegarLoop]: Abstraction has 372 states and 559 transitions. [2021-08-25 20:17:47,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:47,769 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 559 transitions. [2021-08-25 20:17:47,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-25 20:17:47,771 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:47,771 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 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] [2021-08-25 20:17:47,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 20:17:47,771 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:47,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:47,772 INFO L82 PathProgramCache]: Analyzing trace with hash 76683510, now seen corresponding path program 1 times [2021-08-25 20:17:47,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:47,772 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475248029] [2021-08-25 20:17:47,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:47,773 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:47,857 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-25 20:17:47,857 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:47,857 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475248029] [2021-08-25 20:17:47,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475248029] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:47,858 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:47,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:17:47,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748338561] [2021-08-25 20:17:47,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:17:47,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:47,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:17:47,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:17:47,859 INFO L87 Difference]: Start difference. First operand 372 states and 559 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:48,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:48,248 INFO L93 Difference]: Finished difference Result 818 states and 1229 transitions. [2021-08-25 20:17:48,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:17:48,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-08-25 20:17:48,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:48,251 INFO L225 Difference]: With dead ends: 818 [2021-08-25 20:17:48,251 INFO L226 Difference]: Without dead ends: 456 [2021-08-25 20:17:48,252 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:17:48,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2021-08-25 20:17:48,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 412. [2021-08-25 20:17:48,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.5255474452554745) internal successors, (627), 411 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:48,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 627 transitions. [2021-08-25 20:17:48,271 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 627 transitions. Word has length 72 [2021-08-25 20:17:48,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:48,271 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 627 transitions. [2021-08-25 20:17:48,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:48,272 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 627 transitions. [2021-08-25 20:17:48,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-25 20:17:48,273 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:48,273 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 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-08-25 20:17:48,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 20:17:48,274 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:48,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:48,274 INFO L82 PathProgramCache]: Analyzing trace with hash -2062745025, now seen corresponding path program 1 times [2021-08-25 20:17:48,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:48,275 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429659059] [2021-08-25 20:17:48,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:48,275 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:48,400 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-25 20:17:48,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:48,403 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429659059] [2021-08-25 20:17:48,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429659059] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:48,404 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:48,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:17:48,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894623163] [2021-08-25 20:17:48,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:17:48,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:48,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:17:48,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:17:48,413 INFO L87 Difference]: Start difference. First operand 412 states and 627 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:48,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:48,863 INFO L93 Difference]: Finished difference Result 946 states and 1426 transitions. [2021-08-25 20:17:48,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:17:48,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-08-25 20:17:48,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:48,872 INFO L225 Difference]: With dead ends: 946 [2021-08-25 20:17:48,872 INFO L226 Difference]: Without dead ends: 544 [2021-08-25 20:17:48,873 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:17:48,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2021-08-25 20:17:48,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 414. [2021-08-25 20:17:48,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 413 states have (on average 1.523002421307506) internal successors, (629), 413 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:48,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 629 transitions. [2021-08-25 20:17:48,885 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 629 transitions. Word has length 73 [2021-08-25 20:17:48,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:48,885 INFO L470 AbstractCegarLoop]: Abstraction has 414 states and 629 transitions. [2021-08-25 20:17:48,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:48,885 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 629 transitions. [2021-08-25 20:17:48,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-25 20:17:48,886 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:48,887 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 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] [2021-08-25 20:17:48,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-25 20:17:48,887 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:48,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:48,888 INFO L82 PathProgramCache]: Analyzing trace with hash 475156595, now seen corresponding path program 1 times [2021-08-25 20:17:48,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:48,888 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903169664] [2021-08-25 20:17:48,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:48,888 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:48,988 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-25 20:17:48,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:48,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903169664] [2021-08-25 20:17:48,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903169664] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:48,989 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:48,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:17:48,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221746965] [2021-08-25 20:17:48,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:17:48,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:48,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:17:48,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:17:48,991 INFO L87 Difference]: Start difference. First operand 414 states and 629 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:49,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:49,417 INFO L93 Difference]: Finished difference Result 948 states and 1426 transitions. [2021-08-25 20:17:49,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:17:49,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-08-25 20:17:49,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:49,420 INFO L225 Difference]: With dead ends: 948 [2021-08-25 20:17:49,420 INFO L226 Difference]: Without dead ends: 544 [2021-08-25 20:17:49,421 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:17:49,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2021-08-25 20:17:49,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 416. [2021-08-25 20:17:49,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 1.5204819277108435) internal successors, (631), 415 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:49,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 631 transitions. [2021-08-25 20:17:49,443 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 631 transitions. Word has length 74 [2021-08-25 20:17:49,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:49,444 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 631 transitions. [2021-08-25 20:17:49,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:49,444 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 631 transitions. [2021-08-25 20:17:49,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-25 20:17:49,445 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:49,445 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 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] [2021-08-25 20:17:49,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-25 20:17:49,446 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:49,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:49,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1840475418, now seen corresponding path program 1 times [2021-08-25 20:17:49,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:49,447 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310075825] [2021-08-25 20:17:49,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:49,447 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:49,507 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-25 20:17:49,508 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:49,508 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310075825] [2021-08-25 20:17:49,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310075825] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:49,508 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:49,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:17:49,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560627890] [2021-08-25 20:17:49,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:17:49,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:49,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:17:49,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:17:49,510 INFO L87 Difference]: Start difference. First operand 416 states and 631 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:49,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:49,970 INFO L93 Difference]: Finished difference Result 940 states and 1414 transitions. [2021-08-25 20:17:49,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:17:49,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-08-25 20:17:49,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:49,973 INFO L225 Difference]: With dead ends: 940 [2021-08-25 20:17:49,973 INFO L226 Difference]: Without dead ends: 534 [2021-08-25 20:17:49,974 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:17:49,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2021-08-25 20:17:49,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 418. [2021-08-25 20:17:49,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 1.5179856115107915) internal successors, (633), 417 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:49,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 633 transitions. [2021-08-25 20:17:49,984 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 633 transitions. Word has length 75 [2021-08-25 20:17:49,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:49,985 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 633 transitions. [2021-08-25 20:17:49,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:49,985 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 633 transitions. [2021-08-25 20:17:49,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-08-25 20:17:49,986 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:49,986 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:17:49,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 20:17:49,987 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:49,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:49,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1935805867, now seen corresponding path program 2 times [2021-08-25 20:17:49,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:49,987 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119100477] [2021-08-25 20:17:49,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:49,988 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:50,063 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-25 20:17:50,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:50,064 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119100477] [2021-08-25 20:17:50,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119100477] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:50,064 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:50,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:17:50,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351078563] [2021-08-25 20:17:50,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:17:50,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:50,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:17:50,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:17:50,068 INFO L87 Difference]: Start difference. First operand 418 states and 633 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:50,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:50,459 INFO L93 Difference]: Finished difference Result 940 states and 1412 transitions. [2021-08-25 20:17:50,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:17:50,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-08-25 20:17:50,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:50,462 INFO L225 Difference]: With dead ends: 940 [2021-08-25 20:17:50,462 INFO L226 Difference]: Without dead ends: 532 [2021-08-25 20:17:50,463 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:17:50,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-08-25 20:17:50,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 418. [2021-08-25 20:17:50,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 1.513189448441247) internal successors, (631), 417 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:50,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 631 transitions. [2021-08-25 20:17:50,474 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 631 transitions. Word has length 87 [2021-08-25 20:17:50,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:50,475 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 631 transitions. [2021-08-25 20:17:50,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:50,475 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 631 transitions. [2021-08-25 20:17:50,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-08-25 20:17:50,476 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:50,477 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:17:50,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 20:17:50,477 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:50,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:50,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1954461325, now seen corresponding path program 1 times [2021-08-25 20:17:50,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:50,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691630585] [2021-08-25 20:17:50,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:50,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:50,541 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-25 20:17:50,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:50,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691630585] [2021-08-25 20:17:50,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691630585] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:50,542 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:50,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:17:50,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498969038] [2021-08-25 20:17:50,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:17:50,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:50,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:17:50,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:17:50,544 INFO L87 Difference]: Start difference. First operand 418 states and 631 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:50,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:50,944 INFO L93 Difference]: Finished difference Result 940 states and 1408 transitions. [2021-08-25 20:17:50,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:17:50,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-08-25 20:17:50,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:50,946 INFO L225 Difference]: With dead ends: 940 [2021-08-25 20:17:50,946 INFO L226 Difference]: Without dead ends: 532 [2021-08-25 20:17:50,947 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:17:50,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-08-25 20:17:50,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 418. [2021-08-25 20:17:50,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 1.5083932853717026) internal successors, (629), 417 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:50,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 629 transitions. [2021-08-25 20:17:50,969 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 629 transitions. Word has length 87 [2021-08-25 20:17:50,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:50,969 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 629 transitions. [2021-08-25 20:17:50,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:50,969 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 629 transitions. [2021-08-25 20:17:50,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-08-25 20:17:50,970 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:50,971 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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-08-25 20:17:50,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 20:17:50,971 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:50,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:50,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1635005334, now seen corresponding path program 1 times [2021-08-25 20:17:50,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:50,972 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172813481] [2021-08-25 20:17:50,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:50,973 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:51,042 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-25 20:17:51,044 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:51,044 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172813481] [2021-08-25 20:17:51,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172813481] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:51,044 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:51,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:17:51,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770927848] [2021-08-25 20:17:51,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:17:51,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:51,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:17:51,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:17:51,046 INFO L87 Difference]: Start difference. First operand 418 states and 629 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:51,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:51,435 INFO L93 Difference]: Finished difference Result 791 states and 1178 transitions. [2021-08-25 20:17:51,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:17:51,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-08-25 20:17:51,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:51,438 INFO L225 Difference]: With dead ends: 791 [2021-08-25 20:17:51,438 INFO L226 Difference]: Without dead ends: 532 [2021-08-25 20:17:51,439 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:17:51,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-08-25 20:17:51,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 418. [2021-08-25 20:17:51,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 1.5035971223021583) internal successors, (627), 417 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:51,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 627 transitions. [2021-08-25 20:17:51,449 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 627 transitions. Word has length 87 [2021-08-25 20:17:51,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:51,450 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 627 transitions. [2021-08-25 20:17:51,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:51,450 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 627 transitions. [2021-08-25 20:17:51,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-08-25 20:17:51,451 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:51,451 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:17:51,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 20:17:51,452 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:51,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:51,452 INFO L82 PathProgramCache]: Analyzing trace with hash 513794263, now seen corresponding path program 2 times [2021-08-25 20:17:51,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:51,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895791148] [2021-08-25 20:17:51,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:51,453 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:51,520 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-25 20:17:51,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:51,521 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895791148] [2021-08-25 20:17:51,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895791148] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:51,521 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:51,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:17:51,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683831774] [2021-08-25 20:17:51,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:17:51,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:51,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:17:51,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:17:51,523 INFO L87 Difference]: Start difference. First operand 418 states and 627 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:51,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:51,826 INFO L93 Difference]: Finished difference Result 868 states and 1293 transitions. [2021-08-25 20:17:51,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:17:51,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-08-25 20:17:51,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:51,829 INFO L225 Difference]: With dead ends: 868 [2021-08-25 20:17:51,829 INFO L226 Difference]: Without dead ends: 460 [2021-08-25 20:17:51,830 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:17:51,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2021-08-25 20:17:51,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 418. [2021-08-25 20:17:51,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 1.498800959232614) internal successors, (625), 417 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:51,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 625 transitions. [2021-08-25 20:17:51,840 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 625 transitions. Word has length 87 [2021-08-25 20:17:51,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:51,840 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 625 transitions. [2021-08-25 20:17:51,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:51,841 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 625 transitions. [2021-08-25 20:17:51,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-08-25 20:17:51,842 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:51,842 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:17:51,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 20:17:51,843 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:51,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:51,843 INFO L82 PathProgramCache]: Analyzing trace with hash 495138805, now seen corresponding path program 1 times [2021-08-25 20:17:51,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:51,843 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954722872] [2021-08-25 20:17:51,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:51,844 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:51,908 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-25 20:17:51,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:51,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954722872] [2021-08-25 20:17:51,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954722872] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:51,909 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:51,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:17:51,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235818207] [2021-08-25 20:17:51,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:17:51,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:51,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:17:51,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:17:51,910 INFO L87 Difference]: Start difference. First operand 418 states and 625 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:52,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:52,222 INFO L93 Difference]: Finished difference Result 868 states and 1289 transitions. [2021-08-25 20:17:52,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:17:52,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-08-25 20:17:52,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:52,224 INFO L225 Difference]: With dead ends: 868 [2021-08-25 20:17:52,224 INFO L226 Difference]: Without dead ends: 460 [2021-08-25 20:17:52,225 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:17:52,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2021-08-25 20:17:52,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 418. [2021-08-25 20:17:52,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 1.4940047961630696) internal successors, (623), 417 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 623 transitions. [2021-08-25 20:17:52,235 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 623 transitions. Word has length 87 [2021-08-25 20:17:52,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:52,235 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 623 transitions. [2021-08-25 20:17:52,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:52,236 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 623 transitions. [2021-08-25 20:17:52,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-08-25 20:17:52,237 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:52,237 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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-08-25 20:17:52,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-25 20:17:52,237 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:52,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:52,238 INFO L82 PathProgramCache]: Analyzing trace with hash -210361832, now seen corresponding path program 1 times [2021-08-25 20:17:52,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:52,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155253208] [2021-08-25 20:17:52,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:52,238 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:52,291 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-25 20:17:52,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:52,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155253208] [2021-08-25 20:17:52,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155253208] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:52,292 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:52,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:17:52,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910380934] [2021-08-25 20:17:52,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:17:52,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:52,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:17:52,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:17:52,294 INFO L87 Difference]: Start difference. First operand 418 states and 623 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:52,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:52,625 INFO L93 Difference]: Finished difference Result 719 states and 1062 transitions. [2021-08-25 20:17:52,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:17:52,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-08-25 20:17:52,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:52,628 INFO L225 Difference]: With dead ends: 719 [2021-08-25 20:17:52,628 INFO L226 Difference]: Without dead ends: 460 [2021-08-25 20:17:52,629 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:17:52,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2021-08-25 20:17:52,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 418. [2021-08-25 20:17:52,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 1.4892086330935252) internal successors, (621), 417 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:52,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 621 transitions. [2021-08-25 20:17:52,639 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 621 transitions. Word has length 87 [2021-08-25 20:17:52,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:52,639 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 621 transitions. [2021-08-25 20:17:52,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:52,640 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 621 transitions. [2021-08-25 20:17:52,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-25 20:17:52,641 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:52,641 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2021-08-25 20:17:52,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-25 20:17:52,641 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:52,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:52,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1668397004, now seen corresponding path program 1 times [2021-08-25 20:17:52,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:52,642 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994433628] [2021-08-25 20:17:52,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:52,643 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:52,709 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-25 20:17:52,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:52,709 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994433628] [2021-08-25 20:17:52,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994433628] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:52,709 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:52,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:17:52,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122921196] [2021-08-25 20:17:52,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:17:52,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:52,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:17:52,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:17:52,711 INFO L87 Difference]: Start difference. First operand 418 states and 621 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:53,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:53,130 INFO L93 Difference]: Finished difference Result 940 states and 1388 transitions. [2021-08-25 20:17:53,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:17:53,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-25 20:17:53,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:53,132 INFO L225 Difference]: With dead ends: 940 [2021-08-25 20:17:53,133 INFO L226 Difference]: Without dead ends: 532 [2021-08-25 20:17:53,135 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:17:53,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-08-25 20:17:53,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 418. [2021-08-25 20:17:53,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 1.484412470023981) internal successors, (619), 417 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:53,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 619 transitions. [2021-08-25 20:17:53,144 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 619 transitions. Word has length 88 [2021-08-25 20:17:53,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:53,145 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 619 transitions. [2021-08-25 20:17:53,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:53,145 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 619 transitions. [2021-08-25 20:17:53,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-25 20:17:53,146 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:53,146 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:17:53,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-25 20:17:53,147 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:53,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:53,147 INFO L82 PathProgramCache]: Analyzing trace with hash -570561745, now seen corresponding path program 1 times [2021-08-25 20:17:53,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:53,148 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964634372] [2021-08-25 20:17:53,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:53,149 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:53,204 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-25 20:17:53,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:53,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964634372] [2021-08-25 20:17:53,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964634372] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:53,206 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:53,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:17:53,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81481555] [2021-08-25 20:17:53,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:17:53,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:53,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:17:53,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:17:53,207 INFO L87 Difference]: Start difference. First operand 418 states and 619 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:53,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:53,617 INFO L93 Difference]: Finished difference Result 785 states and 1156 transitions. [2021-08-25 20:17:53,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:17:53,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-25 20:17:53,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:53,619 INFO L225 Difference]: With dead ends: 785 [2021-08-25 20:17:53,620 INFO L226 Difference]: Without dead ends: 526 [2021-08-25 20:17:53,620 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:17:53,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-08-25 20:17:53,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 418. [2021-08-25 20:17:53,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 1.4796163069544364) internal successors, (617), 417 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:53,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 617 transitions. [2021-08-25 20:17:53,632 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 617 transitions. Word has length 88 [2021-08-25 20:17:53,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:53,632 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 617 transitions. [2021-08-25 20:17:53,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:53,632 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 617 transitions. [2021-08-25 20:17:53,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-25 20:17:53,633 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:53,634 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2021-08-25 20:17:53,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-25 20:17:53,634 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:53,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:53,635 INFO L82 PathProgramCache]: Analyzing trace with hash 296589706, now seen corresponding path program 1 times [2021-08-25 20:17:53,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:53,635 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971344181] [2021-08-25 20:17:53,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:53,635 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:53,691 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-25 20:17:53,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:53,692 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971344181] [2021-08-25 20:17:53,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971344181] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:53,692 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:53,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:17:53,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502839539] [2021-08-25 20:17:53,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:17:53,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:53,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:17:53,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:17:53,694 INFO L87 Difference]: Start difference. First operand 418 states and 617 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:54,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:54,086 INFO L93 Difference]: Finished difference Result 868 states and 1273 transitions. [2021-08-25 20:17:54,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:17:54,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-25 20:17:54,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:54,089 INFO L225 Difference]: With dead ends: 868 [2021-08-25 20:17:54,089 INFO L226 Difference]: Without dead ends: 460 [2021-08-25 20:17:54,090 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:17:54,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2021-08-25 20:17:54,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 418. [2021-08-25 20:17:54,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 1.474820143884892) internal successors, (615), 417 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:54,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 615 transitions. [2021-08-25 20:17:54,100 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 615 transitions. Word has length 88 [2021-08-25 20:17:54,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:54,100 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 615 transitions. [2021-08-25 20:17:54,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:54,100 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 615 transitions. [2021-08-25 20:17:54,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-25 20:17:54,101 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:54,102 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:17:54,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-25 20:17:54,102 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:54,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:54,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1942369043, now seen corresponding path program 1 times [2021-08-25 20:17:54,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:54,103 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230663644] [2021-08-25 20:17:54,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:54,103 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:54,159 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-25 20:17:54,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:54,160 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230663644] [2021-08-25 20:17:54,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230663644] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:54,160 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:54,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:17:54,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601887184] [2021-08-25 20:17:54,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:17:54,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:54,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:17:54,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:17:54,163 INFO L87 Difference]: Start difference. First operand 418 states and 615 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:54,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:54,457 INFO L93 Difference]: Finished difference Result 713 states and 1043 transitions. [2021-08-25 20:17:54,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:17:54,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-08-25 20:17:54,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:54,459 INFO L225 Difference]: With dead ends: 713 [2021-08-25 20:17:54,459 INFO L226 Difference]: Without dead ends: 454 [2021-08-25 20:17:54,460 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:17:54,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2021-08-25 20:17:54,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 418. [2021-08-25 20:17:54,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 1.4700239808153477) internal successors, (613), 417 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:54,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 613 transitions. [2021-08-25 20:17:54,469 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 613 transitions. Word has length 88 [2021-08-25 20:17:54,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:54,470 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 613 transitions. [2021-08-25 20:17:54,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:54,470 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 613 transitions. [2021-08-25 20:17:54,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-25 20:17:54,471 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:54,471 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:17:54,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-25 20:17:54,472 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:54,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:54,472 INFO L82 PathProgramCache]: Analyzing trace with hash -233112104, now seen corresponding path program 1 times [2021-08-25 20:17:54,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:54,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942318060] [2021-08-25 20:17:54,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:54,473 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:54,529 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-25 20:17:54,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:54,529 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942318060] [2021-08-25 20:17:54,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942318060] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:54,530 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:54,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:17:54,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216283638] [2021-08-25 20:17:54,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:17:54,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:54,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:17:54,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:17:54,532 INFO L87 Difference]: Start difference. First operand 418 states and 613 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:54,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:54,938 INFO L93 Difference]: Finished difference Result 934 states and 1365 transitions. [2021-08-25 20:17:54,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:17:54,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-08-25 20:17:54,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:54,941 INFO L225 Difference]: With dead ends: 934 [2021-08-25 20:17:54,941 INFO L226 Difference]: Without dead ends: 526 [2021-08-25 20:17:54,941 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:17:54,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-08-25 20:17:54,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 418. [2021-08-25 20:17:54,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 1.4652278177458034) internal successors, (611), 417 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:54,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 611 transitions. [2021-08-25 20:17:54,953 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 611 transitions. Word has length 89 [2021-08-25 20:17:54,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:54,954 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 611 transitions. [2021-08-25 20:17:54,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:54,954 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 611 transitions. [2021-08-25 20:17:54,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-25 20:17:54,955 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:54,956 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:17:54,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-25 20:17:54,956 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:54,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:54,956 INFO L82 PathProgramCache]: Analyzing trace with hash 190534618, now seen corresponding path program 1 times [2021-08-25 20:17:54,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:54,957 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646416558] [2021-08-25 20:17:54,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:54,957 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:55,018 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-25 20:17:55,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:55,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646416558] [2021-08-25 20:17:55,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646416558] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:55,019 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:55,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:17:55,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668204870] [2021-08-25 20:17:55,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:17:55,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:55,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:17:55,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:17:55,022 INFO L87 Difference]: Start difference. First operand 418 states and 611 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:55,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:55,340 INFO L93 Difference]: Finished difference Result 862 states and 1254 transitions. [2021-08-25 20:17:55,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:17:55,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-08-25 20:17:55,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:55,342 INFO L225 Difference]: With dead ends: 862 [2021-08-25 20:17:55,342 INFO L226 Difference]: Without dead ends: 454 [2021-08-25 20:17:55,343 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:17:55,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2021-08-25 20:17:55,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 418. [2021-08-25 20:17:55,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 1.460431654676259) internal successors, (609), 417 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:55,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 609 transitions. [2021-08-25 20:17:55,353 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 609 transitions. Word has length 89 [2021-08-25 20:17:55,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:55,354 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 609 transitions. [2021-08-25 20:17:55,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:55,354 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 609 transitions. [2021-08-25 20:17:55,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-08-25 20:17:55,355 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:55,355 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2021-08-25 20:17:55,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-25 20:17:55,356 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:55,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:55,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1591319919, now seen corresponding path program 1 times [2021-08-25 20:17:55,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:55,357 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61242600] [2021-08-25 20:17:55,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:55,357 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:55,411 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-25 20:17:55,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:55,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61242600] [2021-08-25 20:17:55,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61242600] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:55,412 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:55,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:17:55,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081797263] [2021-08-25 20:17:55,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:17:55,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:55,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:17:55,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:17:55,414 INFO L87 Difference]: Start difference. First operand 418 states and 609 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:55,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:55,808 INFO L93 Difference]: Finished difference Result 916 states and 1335 transitions. [2021-08-25 20:17:55,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:17:55,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2021-08-25 20:17:55,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:55,810 INFO L225 Difference]: With dead ends: 916 [2021-08-25 20:17:55,810 INFO L226 Difference]: Without dead ends: 508 [2021-08-25 20:17:55,811 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:17:55,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-08-25 20:17:55,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 418. [2021-08-25 20:17:55,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 1.4556354916067147) internal successors, (607), 417 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:55,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 607 transitions. [2021-08-25 20:17:55,822 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 607 transitions. Word has length 90 [2021-08-25 20:17:55,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:55,823 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 607 transitions. [2021-08-25 20:17:55,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:55,823 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 607 transitions. [2021-08-25 20:17:55,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-08-25 20:17:55,824 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:55,824 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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] [2021-08-25 20:17:55,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-25 20:17:55,825 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:55,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:55,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1012220386, now seen corresponding path program 1 times [2021-08-25 20:17:55,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:55,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852662265] [2021-08-25 20:17:55,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:55,826 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:55,887 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-25 20:17:55,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:55,887 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852662265] [2021-08-25 20:17:55,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852662265] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:55,887 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:55,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:17:55,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835859889] [2021-08-25 20:17:55,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:17:55,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:55,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:17:55,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:17:55,889 INFO L87 Difference]: Start difference. First operand 418 states and 607 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:56,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:56,304 INFO L93 Difference]: Finished difference Result 916 states and 1331 transitions. [2021-08-25 20:17:56,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:17:56,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2021-08-25 20:17:56,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:56,309 INFO L225 Difference]: With dead ends: 916 [2021-08-25 20:17:56,309 INFO L226 Difference]: Without dead ends: 508 [2021-08-25 20:17:56,310 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:17:56,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-08-25 20:17:56,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 418. [2021-08-25 20:17:56,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 1.4508393285371703) internal successors, (605), 417 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:56,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 605 transitions. [2021-08-25 20:17:56,321 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 605 transitions. Word has length 90 [2021-08-25 20:17:56,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:56,321 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 605 transitions. [2021-08-25 20:17:56,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:56,321 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 605 transitions. [2021-08-25 20:17:56,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-08-25 20:17:56,322 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:56,323 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2021-08-25 20:17:56,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-25 20:17:56,323 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:56,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:56,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1343173425, now seen corresponding path program 1 times [2021-08-25 20:17:56,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:56,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249448569] [2021-08-25 20:17:56,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:56,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:56,396 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-25 20:17:56,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:56,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249448569] [2021-08-25 20:17:56,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249448569] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:56,397 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:56,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:17:56,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253885086] [2021-08-25 20:17:56,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:17:56,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:56,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:17:56,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:17:56,400 INFO L87 Difference]: Start difference. First operand 418 states and 605 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:56,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:56,726 INFO L93 Difference]: Finished difference Result 844 states and 1220 transitions. [2021-08-25 20:17:56,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:17:56,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2021-08-25 20:17:56,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:56,729 INFO L225 Difference]: With dead ends: 844 [2021-08-25 20:17:56,729 INFO L226 Difference]: Without dead ends: 436 [2021-08-25 20:17:56,729 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:17:56,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2021-08-25 20:17:56,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 418. [2021-08-25 20:17:56,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 1.4460431654676258) internal successors, (603), 417 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:56,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 603 transitions. [2021-08-25 20:17:56,741 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 603 transitions. Word has length 90 [2021-08-25 20:17:56,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:56,741 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 603 transitions. [2021-08-25 20:17:56,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:56,741 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 603 transitions. [2021-08-25 20:17:56,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-08-25 20:17:56,742 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:56,742 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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] [2021-08-25 20:17:56,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-25 20:17:56,743 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:56,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:56,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1260366880, now seen corresponding path program 1 times [2021-08-25 20:17:56,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:56,744 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760780767] [2021-08-25 20:17:56,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:56,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:56,794 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-08-25 20:17:56,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:56,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760780767] [2021-08-25 20:17:56,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760780767] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:56,795 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:56,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:17:56,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704790250] [2021-08-25 20:17:56,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:17:56,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:56,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:17:56,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:17:56,797 INFO L87 Difference]: Start difference. First operand 418 states and 603 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:56,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:56,902 INFO L93 Difference]: Finished difference Result 827 states and 1200 transitions. [2021-08-25 20:17:56,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:17:56,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2021-08-25 20:17:56,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:56,905 INFO L225 Difference]: With dead ends: 827 [2021-08-25 20:17:56,905 INFO L226 Difference]: Without dead ends: 570 [2021-08-25 20:17:56,906 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:17:56,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2021-08-25 20:17:56,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2021-08-25 20:17:56,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 569 states have (on average 1.4411247803163445) internal successors, (820), 569 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:56,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 820 transitions. [2021-08-25 20:17:56,918 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 820 transitions. Word has length 90 [2021-08-25 20:17:56,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:56,918 INFO L470 AbstractCegarLoop]: Abstraction has 570 states and 820 transitions. [2021-08-25 20:17:56,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:56,919 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 820 transitions. [2021-08-25 20:17:56,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-08-25 20:17:56,920 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:56,920 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 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] [2021-08-25 20:17:56,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-25 20:17:56,921 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:56,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:56,921 INFO L82 PathProgramCache]: Analyzing trace with hash -584407498, now seen corresponding path program 1 times [2021-08-25 20:17:56,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:56,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780252660] [2021-08-25 20:17:56,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:56,922 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:56,973 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-08-25 20:17:56,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:56,973 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780252660] [2021-08-25 20:17:56,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780252660] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:56,973 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:56,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:17:56,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63868453] [2021-08-25 20:17:56,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:17:56,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:56,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:17:56,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:17:56,975 INFO L87 Difference]: Start difference. First operand 570 states and 820 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:57,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:57,007 INFO L93 Difference]: Finished difference Result 725 states and 1045 transitions. [2021-08-25 20:17:57,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:17:57,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2021-08-25 20:17:57,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:57,010 INFO L225 Difference]: With dead ends: 725 [2021-08-25 20:17:57,010 INFO L226 Difference]: Without dead ends: 723 [2021-08-25 20:17:57,010 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:17:57,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2021-08-25 20:17:57,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2021-08-25 20:17:57,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 722 states have (on average 1.443213296398892) internal successors, (1042), 722 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:57,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1042 transitions. [2021-08-25 20:17:57,030 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1042 transitions. Word has length 92 [2021-08-25 20:17:57,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:57,030 INFO L470 AbstractCegarLoop]: Abstraction has 723 states and 1042 transitions. [2021-08-25 20:17:57,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:57,031 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1042 transitions. [2021-08-25 20:17:57,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-08-25 20:17:57,032 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:57,033 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 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] [2021-08-25 20:17:57,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-25 20:17:57,033 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:57,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:57,033 INFO L82 PathProgramCache]: Analyzing trace with hash -782701753, now seen corresponding path program 1 times [2021-08-25 20:17:57,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:57,034 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258339522] [2021-08-25 20:17:57,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:57,034 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:57,094 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:17:57,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:57,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258339522] [2021-08-25 20:17:57,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258339522] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:57,095 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:57,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:17:57,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987449568] [2021-08-25 20:17:57,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:17:57,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:57,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:17:57,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:17:57,096 INFO L87 Difference]: Start difference. First operand 723 states and 1042 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:57,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:57,119 INFO L93 Difference]: Finished difference Result 725 states and 1043 transitions. [2021-08-25 20:17:57,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:17:57,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2021-08-25 20:17:57,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:57,122 INFO L225 Difference]: With dead ends: 725 [2021-08-25 20:17:57,122 INFO L226 Difference]: Without dead ends: 723 [2021-08-25 20:17:57,123 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:17:57,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2021-08-25 20:17:57,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2021-08-25 20:17:57,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 722 states have (on average 1.4418282548476453) internal successors, (1041), 722 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:57,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1041 transitions. [2021-08-25 20:17:57,152 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1041 transitions. Word has length 113 [2021-08-25 20:17:57,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:57,152 INFO L470 AbstractCegarLoop]: Abstraction has 723 states and 1041 transitions. [2021-08-25 20:17:57,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:57,153 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1041 transitions. [2021-08-25 20:17:57,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-08-25 20:17:57,154 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:57,154 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 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] [2021-08-25 20:17:57,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-25 20:17:57,155 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:57,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:57,155 INFO L82 PathProgramCache]: Analyzing trace with hash -698320702, now seen corresponding path program 1 times [2021-08-25 20:17:57,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:57,156 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22220044] [2021-08-25 20:17:57,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:57,156 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:57,232 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:17:57,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:57,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22220044] [2021-08-25 20:17:57,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22220044] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:57,233 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:57,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:17:57,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261619295] [2021-08-25 20:17:57,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:17:57,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:57,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:17:57,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:17:57,235 INFO L87 Difference]: Start difference. First operand 723 states and 1041 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:57,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:57,572 INFO L93 Difference]: Finished difference Result 1692 states and 2446 transitions. [2021-08-25 20:17:57,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:17:57,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2021-08-25 20:17:57,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:57,577 INFO L225 Difference]: With dead ends: 1692 [2021-08-25 20:17:57,577 INFO L226 Difference]: Without dead ends: 979 [2021-08-25 20:17:57,578 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:17:57,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2021-08-25 20:17:57,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 843. [2021-08-25 20:17:57,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 842 states have (on average 1.4857482185273159) internal successors, (1251), 842 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:57,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1251 transitions. [2021-08-25 20:17:57,599 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1251 transitions. Word has length 115 [2021-08-25 20:17:57,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:57,599 INFO L470 AbstractCegarLoop]: Abstraction has 843 states and 1251 transitions. [2021-08-25 20:17:57,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:57,600 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1251 transitions. [2021-08-25 20:17:57,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-08-25 20:17:57,602 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:57,602 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:17:57,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-25 20:17:57,603 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:57,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:57,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1667253281, now seen corresponding path program 2 times [2021-08-25 20:17:57,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:57,603 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284837030] [2021-08-25 20:17:57,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:57,604 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:57,669 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:17:57,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:57,670 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284837030] [2021-08-25 20:17:57,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284837030] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:57,670 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:57,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:17:57,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142920880] [2021-08-25 20:17:57,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:17:57,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:57,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:17:57,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:17:57,672 INFO L87 Difference]: Start difference. First operand 843 states and 1251 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:58,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:58,079 INFO L93 Difference]: Finished difference Result 1807 states and 2646 transitions. [2021-08-25 20:17:58,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:17:58,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2021-08-25 20:17:58,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:58,083 INFO L225 Difference]: With dead ends: 1807 [2021-08-25 20:17:58,083 INFO L226 Difference]: Without dead ends: 974 [2021-08-25 20:17:58,084 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:17:58,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2021-08-25 20:17:58,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 843. [2021-08-25 20:17:58,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 842 states have (on average 1.479809976247031) internal successors, (1246), 842 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:58,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1246 transitions. [2021-08-25 20:17:58,104 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1246 transitions. Word has length 130 [2021-08-25 20:17:58,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:58,105 INFO L470 AbstractCegarLoop]: Abstraction has 843 states and 1246 transitions. [2021-08-25 20:17:58,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:58,105 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1246 transitions. [2021-08-25 20:17:58,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-08-25 20:17:58,107 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:58,107 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:17:58,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-25 20:17:58,108 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:58,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:58,108 INFO L82 PathProgramCache]: Analyzing trace with hash 919227327, now seen corresponding path program 1 times [2021-08-25 20:17:58,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:58,108 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184484008] [2021-08-25 20:17:58,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:58,109 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:58,180 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:17:58,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:58,180 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184484008] [2021-08-25 20:17:58,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184484008] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:58,180 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:58,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:17:58,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842739886] [2021-08-25 20:17:58,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:17:58,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:58,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:17:58,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:17:58,182 INFO L87 Difference]: Start difference. First operand 843 states and 1246 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:58,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:58,496 INFO L93 Difference]: Finished difference Result 1807 states and 2636 transitions. [2021-08-25 20:17:58,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:17:58,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2021-08-25 20:17:58,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:58,500 INFO L225 Difference]: With dead ends: 1807 [2021-08-25 20:17:58,500 INFO L226 Difference]: Without dead ends: 974 [2021-08-25 20:17:58,502 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:17:58,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2021-08-25 20:17:58,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 843. [2021-08-25 20:17:58,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 842 states have (on average 1.4738717339667458) internal successors, (1241), 842 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:58,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1241 transitions. [2021-08-25 20:17:58,521 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1241 transitions. Word has length 130 [2021-08-25 20:17:58,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:58,521 INFO L470 AbstractCegarLoop]: Abstraction has 843 states and 1241 transitions. [2021-08-25 20:17:58,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:58,521 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1241 transitions. [2021-08-25 20:17:58,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-08-25 20:17:58,524 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:58,524 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 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] [2021-08-25 20:17:58,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-25 20:17:58,524 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:58,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:58,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1537947938, now seen corresponding path program 1 times [2021-08-25 20:17:58,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:58,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227727480] [2021-08-25 20:17:58,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:58,525 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:58,585 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-08-25 20:17:58,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:58,586 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227727480] [2021-08-25 20:17:58,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227727480] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:58,586 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:58,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:17:58,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80361432] [2021-08-25 20:17:58,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:17:58,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:58,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:17:58,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:17:58,587 INFO L87 Difference]: Start difference. First operand 843 states and 1241 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:58,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:58,872 INFO L93 Difference]: Finished difference Result 1639 states and 2418 transitions. [2021-08-25 20:17:58,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:17:58,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2021-08-25 20:17:58,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:58,876 INFO L225 Difference]: With dead ends: 1639 [2021-08-25 20:17:58,876 INFO L226 Difference]: Without dead ends: 981 [2021-08-25 20:17:58,878 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:17:58,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2021-08-25 20:17:58,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 915. [2021-08-25 20:17:58,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 914 states have (on average 1.4890590809628008) internal successors, (1361), 914 states have internal predecessors, (1361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:58,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1361 transitions. [2021-08-25 20:17:58,898 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1361 transitions. Word has length 130 [2021-08-25 20:17:58,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:58,898 INFO L470 AbstractCegarLoop]: Abstraction has 915 states and 1361 transitions. [2021-08-25 20:17:58,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:58,899 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1361 transitions. [2021-08-25 20:17:58,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-08-25 20:17:58,901 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:58,901 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:17:58,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-25 20:17:58,901 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:58,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:58,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1834884522, now seen corresponding path program 1 times [2021-08-25 20:17:58,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:58,902 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169099821] [2021-08-25 20:17:58,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:58,902 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:58,961 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:17:58,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:58,961 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169099821] [2021-08-25 20:17:58,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169099821] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:58,962 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:58,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:17:58,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500948473] [2021-08-25 20:17:58,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:17:58,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:58,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:17:58,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:17:58,963 INFO L87 Difference]: Start difference. First operand 915 states and 1361 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:59,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:59,312 INFO L93 Difference]: Finished difference Result 1951 states and 2866 transitions. [2021-08-25 20:17:59,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:17:59,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2021-08-25 20:17:59,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:59,317 INFO L225 Difference]: With dead ends: 1951 [2021-08-25 20:17:59,318 INFO L226 Difference]: Without dead ends: 1046 [2021-08-25 20:17:59,319 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:17:59,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2021-08-25 20:17:59,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 915. [2021-08-25 20:17:59,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 914 states have (on average 1.4835886214442013) internal successors, (1356), 914 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1356 transitions. [2021-08-25 20:17:59,338 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1356 transitions. Word has length 131 [2021-08-25 20:17:59,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:59,339 INFO L470 AbstractCegarLoop]: Abstraction has 915 states and 1356 transitions. [2021-08-25 20:17:59,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:59,339 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1356 transitions. [2021-08-25 20:17:59,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-08-25 20:17:59,341 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:59,342 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:17:59,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-25 20:17:59,342 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:59,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:59,343 INFO L82 PathProgramCache]: Analyzing trace with hash 653511332, now seen corresponding path program 1 times [2021-08-25 20:17:59,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:59,343 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984344706] [2021-08-25 20:17:59,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:59,343 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:59,407 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:17:59,407 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:59,407 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984344706] [2021-08-25 20:17:59,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984344706] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:59,407 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:59,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:17:59,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431933889] [2021-08-25 20:17:59,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:17:59,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:59,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:17:59,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:17:59,409 INFO L87 Difference]: Start difference. First operand 915 states and 1356 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:59,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:17:59,718 INFO L93 Difference]: Finished difference Result 1951 states and 2856 transitions. [2021-08-25 20:17:59,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:17:59,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2021-08-25 20:17:59,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:17:59,722 INFO L225 Difference]: With dead ends: 1951 [2021-08-25 20:17:59,723 INFO L226 Difference]: Without dead ends: 1046 [2021-08-25 20:17:59,724 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:17:59,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2021-08-25 20:17:59,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 915. [2021-08-25 20:17:59,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 914 states have (on average 1.4781181619256019) internal successors, (1351), 914 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:59,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1351 transitions. [2021-08-25 20:17:59,743 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1351 transitions. Word has length 132 [2021-08-25 20:17:59,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:17:59,744 INFO L470 AbstractCegarLoop]: Abstraction has 915 states and 1351 transitions. [2021-08-25 20:17:59,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:17:59,744 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1351 transitions. [2021-08-25 20:17:59,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-08-25 20:17:59,746 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:17:59,747 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:17:59,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-25 20:17:59,747 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:17:59,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:17:59,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1844078565, now seen corresponding path program 1 times [2021-08-25 20:17:59,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:17:59,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176580237] [2021-08-25 20:17:59,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:17:59,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:17:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:17:59,805 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:17:59,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:17:59,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176580237] [2021-08-25 20:17:59,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176580237] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:17:59,806 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:17:59,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:17:59,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829674714] [2021-08-25 20:17:59,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:17:59,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:17:59,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:17:59,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:17:59,807 INFO L87 Difference]: Start difference. First operand 915 states and 1351 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:00,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:00,130 INFO L93 Difference]: Finished difference Result 1906 states and 2791 transitions. [2021-08-25 20:18:00,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:18:00,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2021-08-25 20:18:00,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:00,135 INFO L225 Difference]: With dead ends: 1906 [2021-08-25 20:18:00,135 INFO L226 Difference]: Without dead ends: 1001 [2021-08-25 20:18:00,138 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:18:00,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2021-08-25 20:18:00,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 915. [2021-08-25 20:18:00,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 914 states have (on average 1.4726477024070022) internal successors, (1346), 914 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:00,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1346 transitions. [2021-08-25 20:18:00,165 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1346 transitions. Word has length 133 [2021-08-25 20:18:00,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:00,165 INFO L470 AbstractCegarLoop]: Abstraction has 915 states and 1346 transitions. [2021-08-25 20:18:00,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:00,165 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1346 transitions. [2021-08-25 20:18:00,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-08-25 20:18:00,167 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:00,168 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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] [2021-08-25 20:18:00,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-25 20:18:00,168 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:00,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:00,168 INFO L82 PathProgramCache]: Analyzing trace with hash 487188268, now seen corresponding path program 1 times [2021-08-25 20:18:00,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:18:00,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447801250] [2021-08-25 20:18:00,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:00,169 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:18:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:00,228 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2021-08-25 20:18:00,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:18:00,229 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447801250] [2021-08-25 20:18:00,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447801250] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:00,229 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:00,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:18:00,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643131795] [2021-08-25 20:18:00,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:18:00,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:18:00,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:18:00,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:00,230 INFO L87 Difference]: Start difference. First operand 915 states and 1346 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:00,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:00,538 INFO L93 Difference]: Finished difference Result 2051 states and 3021 transitions. [2021-08-25 20:18:00,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:18:00,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2021-08-25 20:18:00,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:00,543 INFO L225 Difference]: With dead ends: 2051 [2021-08-25 20:18:00,543 INFO L226 Difference]: Without dead ends: 1146 [2021-08-25 20:18:00,544 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:18:00,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2021-08-25 20:18:00,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1025. [2021-08-25 20:18:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1024 states have (on average 1.5) internal successors, (1536), 1024 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:00,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1536 transitions. [2021-08-25 20:18:00,567 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1536 transitions. Word has length 133 [2021-08-25 20:18:00,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:00,567 INFO L470 AbstractCegarLoop]: Abstraction has 1025 states and 1536 transitions. [2021-08-25 20:18:00,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:00,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1536 transitions. [2021-08-25 20:18:00,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-08-25 20:18:00,570 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:00,571 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2021-08-25 20:18:00,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-25 20:18:00,571 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:00,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:00,571 INFO L82 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2021-08-25 20:18:00,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:18:00,572 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709499647] [2021-08-25 20:18:00,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:00,572 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:18:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:18:00,683 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 20:18:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:18:00,929 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-25 20:18:00,930 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 20:18:00,931 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:18:00,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-08-25 20:18:00,938 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:18:01,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:18:01 BoogieIcfgContainer [2021-08-25 20:18:01,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:18:01,062 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:18:01,062 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:18:01,062 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:18:01,062 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:17:45" (3/4) ... [2021-08-25 20:18:01,065 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-25 20:18:01,065 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:18:01,067 INFO L168 Benchmark]: Toolchain (without parser) took 17519.86 ms. Allocated memory was 54.5 MB in the beginning and 209.7 MB in the end (delta: 155.2 MB). Free memory was 31.6 MB in the beginning and 118.9 MB in the end (delta: -87.3 MB). Peak memory consumption was 67.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:18:01,067 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 54.5 MB. Free memory was 37.0 MB in the beginning and 36.9 MB in the end (delta: 43.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:18:01,067 INFO L168 Benchmark]: CACSL2BoogieTranslator took 566.10 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 31.3 MB in the beginning and 33.0 MB in the end (delta: -1.7 MB). Peak memory consumption was 9.9 MB. Max. memory is 16.1 GB. [2021-08-25 20:18:01,068 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.15 ms. Allocated memory is still 67.1 MB. Free memory was 32.8 MB in the beginning and 42.8 MB in the end (delta: -10.1 MB). Peak memory consumption was 8.7 MB. Max. memory is 16.1 GB. [2021-08-25 20:18:01,068 INFO L168 Benchmark]: Boogie Preprocessor took 107.97 ms. Allocated memory is still 67.1 MB. Free memory was 42.8 MB in the beginning and 36.5 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:18:01,068 INFO L168 Benchmark]: RCFGBuilder took 1172.47 ms. Allocated memory was 67.1 MB in the beginning and 81.8 MB in the end (delta: 14.7 MB). Free memory was 36.5 MB in the beginning and 36.6 MB in the end (delta: -124.9 kB). Peak memory consumption was 23.4 MB. Max. memory is 16.1 GB. [2021-08-25 20:18:01,069 INFO L168 Benchmark]: TraceAbstraction took 15573.40 ms. Allocated memory was 81.8 MB in the beginning and 209.7 MB in the end (delta: 127.9 MB). Free memory was 36.2 MB in the beginning and 118.9 MB in the end (delta: -82.7 MB). Peak memory consumption was 109.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:18:01,069 INFO L168 Benchmark]: Witness Printer took 3.38 ms. Allocated memory is still 209.7 MB. Free memory is still 118.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:18:01,073 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.18 ms. Allocated memory is still 54.5 MB. Free memory was 37.0 MB in the beginning and 36.9 MB in the end (delta: 43.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 566.10 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 31.3 MB in the beginning and 33.0 MB in the end (delta: -1.7 MB). Peak memory consumption was 9.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 87.15 ms. Allocated memory is still 67.1 MB. Free memory was 32.8 MB in the beginning and 42.8 MB in the end (delta: -10.1 MB). Peak memory consumption was 8.7 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 107.97 ms. Allocated memory is still 67.1 MB. Free memory was 42.8 MB in the beginning and 36.5 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1172.47 ms. Allocated memory was 67.1 MB in the beginning and 81.8 MB in the end (delta: 14.7 MB). Free memory was 36.5 MB in the beginning and 36.6 MB in the end (delta: -124.9 kB). Peak memory consumption was 23.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 15573.40 ms. Allocated memory was 81.8 MB in the beginning and 209.7 MB in the end (delta: 127.9 MB). Free memory was 36.2 MB in the beginning and 118.9 MB in the end (delta: -82.7 MB). Peak memory consumption was 109.5 MB. Max. memory is 16.1 GB. * Witness Printer took 3.38 ms. Allocated memory is still 209.7 MB. Free memory is still 118.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1646]: 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 1331. Possible FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={6:0}] [L1067] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 12292 [L1075] s->version = __VERIFIER_nondet_int() [L1082] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1083] unsigned long tmp ; [L1084] unsigned long l ; [L1085] long num1 ; [L1086] void (*cb)() ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 ; [L1094] int tmp___4 ; [L1095] int tmp___5 ; [L1096] int tmp___6 ; [L1097] int tmp___7 ; [L1098] int tmp___8 ; [L1099] long tmp___9 ; [L1101] int blastFlag ; [L1104] blastFlag = 0 [L1105] s->hit=__VERIFIER_nondet_int () [L1106] s->state = 12292 [L1107] tmp = __VERIFIER_nondet_int() [L1108] cb = (void (*)())((void *)0) [L1109] ret = -1 [L1110] skip = 0 [L1111] EXPR s->info_callback VAL [init=1, SSLv3_client_data={6:0}] [L1111] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1112] EXPR s->info_callback [L1112] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={6:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={6:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1134] COND TRUE s->state == 12292 [L1237] s->new_session = 1 [L1238] s->state = 4096 [L1239] EXPR s->ctx [L1239] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1239] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1244] s->server = 0 VAL [init=1, SSLv3_client_data={6:0}] [L1245] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={6:0}] [L1250] EXPR s->version VAL [init=1, SSLv3_client_data={6:0}] [L1250] COND FALSE !((s->version & 65280) != 768) [L1256] s->type = 4096 [L1257] EXPR s->init_buf VAL [init=1, SSLv3_client_data={6:0}] [L1257] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1269] tmp___4 = __VERIFIER_nondet_int() [L1270] COND FALSE !(! tmp___4) [L1276] tmp___5 = __VERIFIER_nondet_int() [L1277] COND FALSE !(! tmp___5) [L1283] s->state = 4368 [L1284] EXPR s->ctx [L1284] EXPR (s->ctx)->stats.sess_connect [L1284] (s->ctx)->stats.sess_connect += 1 [L1285] s->init_num = 0 VAL [init=1, SSLv3_client_data={6:0}] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={6:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={6:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={6:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1149] COND TRUE s->state == 4368 [L1289] s->shutdown = 0 [L1290] ret = __VERIFIER_nondet_int() [L1291] COND TRUE blastFlag == 0 [L1292] blastFlag = 1 VAL [init=1, SSLv3_client_data={6:0}] [L1296] COND FALSE !(ret <= 0) [L1301] s->state = 4384 [L1302] s->init_num = 0 [L1303] EXPR s->bbio [L1303] EXPR s->wbio VAL [init=1, SSLv3_client_data={6:0}] [L1303] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={6:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={6:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={6:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1155] COND TRUE s->state == 4384 [L1311] ret = __VERIFIER_nondet_int() [L1312] COND TRUE blastFlag == 1 [L1313] blastFlag = 2 VAL [init=1, SSLv3_client_data={6:0}] [L1317] COND FALSE !(ret <= 0) [L1322] s->hit VAL [init=1, SSLv3_client_data={6:0}] [L1322] COND FALSE !(s->hit) [L1325] s->state = 4400 VAL [init=1, SSLv3_client_data={6:0}] [L1327] s->init_num = 0 VAL [init=1, SSLv3_client_data={6:0}] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={6:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={6:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={6:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1161] COND TRUE s->state == 4400 [L1331] EXPR s->s3 [L1331] EXPR (s->s3)->tmp.new_cipher [L1331] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={6:0}] [L1331] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1334] ret = __VERIFIER_nondet_int() [L1335] COND TRUE blastFlag == 2 [L1336] blastFlag = 3 VAL [init=1, SSLv3_client_data={6:0}] [L1340] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={6:0}] [L1346] s->state = 4416 [L1347] s->init_num = 0 VAL [init=1, SSLv3_client_data={6:0}] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={6:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={6:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={6:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1167] COND TRUE s->state == 4416 [L1351] ret = __VERIFIER_nondet_int() [L1352] COND TRUE blastFlag == 3 [L1353] blastFlag = 4 VAL [init=1, SSLv3_client_data={6:0}] [L1357] COND FALSE !(ret <= 0) [L1362] s->state = 4432 [L1363] s->init_num = 0 [L1364] tmp___6 = __VERIFIER_nondet_int() [L1365] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={6:0}] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={6:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={6:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={6:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1173] COND TRUE s->state == 4432 [L1374] ret = __VERIFIER_nondet_int() [L1375] COND FALSE !(blastFlag == 5) VAL [init=1, SSLv3_client_data={6:0}] [L1380] COND FALSE !(ret <= 0) [L1385] s->state = 4448 [L1386] s->init_num = 0 VAL [init=1, SSLv3_client_data={6:0}] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={6:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={6:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={6:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1173] COND FALSE !(s->state == 4432) [L1176] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1176] COND FALSE !(s->state == 4433) [L1179] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1179] COND TRUE s->state == 4448 [L1390] ret = __VERIFIER_nondet_int() [L1391] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={6:0}] [L1646] reach_error() VAL [init=1, SSLv3_client_data={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15398.8ms, OverallIterations: 35, TraceHistogramMax: 7, EmptinessCheckTime: 85.3ms, AutomataDifference: 11466.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 13.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 7362 SDtfs, 2436 SDslu, 9320 SDs, 0 SdLazy, 5220 SolverSat, 199 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8754.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 68 SyntacticMatches, 21 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 455.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1025occurred in iteration=34, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 551.0ms AutomataMinimizationTime, 34 MinimizatonAttempts, 2600 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 178.1ms SsaConstructionTime, 826.5ms SatisfiabilityAnalysisTime, 1651.4ms InterpolantComputationTime, 3271 NumberOfCodeBlocks, 3271 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3100 ConstructedInterpolants, 0 QuantifiedInterpolants, 7355 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 3328/3328 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 [2021-08-25 20:18:01,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:18:02,947 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:18:02,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:18:02,983 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:18:02,983 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:18:02,985 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:18:02,986 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:18:02,988 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:18:02,989 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:18:02,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:18:02,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:18:02,992 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:18:02,992 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:18:02,993 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:18:02,994 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:18:02,995 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:18:02,996 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:18:02,997 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:18:02,999 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:18:03,000 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:18:03,002 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:18:03,003 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:18:03,004 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:18:03,004 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:18:03,007 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:18:03,007 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:18:03,008 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:18:03,008 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:18:03,009 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:18:03,010 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:18:03,010 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:18:03,011 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:18:03,011 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:18:03,012 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:18:03,013 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:18:03,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:18:03,014 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:18:03,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:18:03,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:18:03,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:18:03,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:18:03,017 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-08-25 20:18:03,037 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:18:03,037 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:18:03,038 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:18:03,038 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:18:03,039 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:18:03,039 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:18:03,039 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:18:03,040 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:18:03,040 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:18:03,040 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:18:03,040 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:18:03,041 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:18:03,041 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:18:03,041 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:18:03,041 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-25 20:18:03,042 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-25 20:18:03,042 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:18:03,042 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:18:03,042 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:18:03,042 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:18:03,043 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:18:03,043 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:18:03,043 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:18:03,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:18:03,044 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:18:03,044 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:18:03,044 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:18:03,044 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-25 20:18:03,045 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-25 20:18:03,045 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:18:03,045 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:18:03,045 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-25 20:18:03,046 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 782042467f0cb3a7476d3c48a134dfd084f9a32e [2021-08-25 20:18:03,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:18:03,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:18:03,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:18:03,371 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:18:03,372 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:18:03,373 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c [2021-08-25 20:18:03,441 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad1f949f0/585a462dd5d34079bf6aa290d709e3ab/FLAGdd84dbee8 [2021-08-25 20:18:04,001 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:18:04,002 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c [2021-08-25 20:18:04,016 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad1f949f0/585a462dd5d34079bf6aa290d709e3ab/FLAGdd84dbee8 [2021-08-25 20:18:04,451 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad1f949f0/585a462dd5d34079bf6aa290d709e3ab [2021-08-25 20:18:04,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:18:04,455 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:18:04,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:18:04,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:18:04,464 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:18:04,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:18:04" (1/1) ... [2021-08-25 20:18:04,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27fd3ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:04, skipping insertion in model container [2021-08-25 20:18:04,465 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:18:04" (1/1) ... [2021-08-25 20:18:04,471 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:18:04,530 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:18:04,878 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c[64476,64489] [2021-08-25 20:18:04,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:18:04,913 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:18:05,056 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.01.i.cil-2.c[64476,64489] [2021-08-25 20:18:05,059 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:18:05,083 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:18:05,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:05 WrapperNode [2021-08-25 20:18:05,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:18:05,084 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:18:05,090 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:18:05,090 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:18:05,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:05" (1/1) ... [2021-08-25 20:18:05,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:05" (1/1) ... [2021-08-25 20:18:05,178 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:18:05,182 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:18:05,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:18:05,183 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:18:05,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:05" (1/1) ... [2021-08-25 20:18:05,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:05" (1/1) ... [2021-08-25 20:18:05,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:05" (1/1) ... [2021-08-25 20:18:05,214 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:05" (1/1) ... [2021-08-25 20:18:05,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:05" (1/1) ... [2021-08-25 20:18:05,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:05" (1/1) ... [2021-08-25 20:18:05,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:05" (1/1) ... [2021-08-25 20:18:05,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:18:05,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:18:05,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:18:05,274 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:18:05,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:05" (1/1) ... [2021-08-25 20:18:05,284 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:18:05,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:18:05,306 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-25 20:18:05,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 20:18:05,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-25 20:18:05,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-25 20:18:05,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:18:05,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-25 20:18:05,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-25 20:18:05,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-25 20:18:05,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:18:05,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:18:05,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-25 20:18:05,561 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:18:07,611 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-08-25 20:18:07,612 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-08-25 20:18:07,618 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:18:07,618 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:18:07,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:18:07 BoogieIcfgContainer [2021-08-25 20:18:07,620 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:18:07,621 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:18:07,621 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:18:07,624 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:18:07,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:18:04" (1/3) ... [2021-08-25 20:18:07,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bebbc55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:18:07, skipping insertion in model container [2021-08-25 20:18:07,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:05" (2/3) ... [2021-08-25 20:18:07,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bebbc55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:18:07, skipping insertion in model container [2021-08-25 20:18:07,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:18:07" (3/3) ... [2021-08-25 20:18:07,627 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-2.c [2021-08-25 20:18:07,631 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:18:07,632 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:18:07,672 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:18:07,676 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 20:18:07,677 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:18:07,699 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:07,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-25 20:18:07,705 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:07,705 INFO L512 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] [2021-08-25 20:18:07,706 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:07,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:07,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2021-08-25 20:18:07,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:18:07,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1901982917] [2021-08-25 20:18:07,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:07,727 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:18:07,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:18:07,732 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:18:07,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-25 20:18:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:07,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:18:07,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:18:08,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:18:08,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:18:08,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:18:08,214 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:18:08,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1901982917] [2021-08-25 20:18:08,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1901982917] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:08,217 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:08,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 20:18:08,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187259226] [2021-08-25 20:18:08,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:18:08,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:18:08,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:18:08,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:08,246 INFO L87 Difference]: Start difference. First operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:08,364 INFO L93 Difference]: Finished difference Result 375 states and 626 transitions. [2021-08-25 20:18:08,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:18:08,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-08-25 20:18:08,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:08,376 INFO L225 Difference]: With dead ends: 375 [2021-08-25 20:18:08,376 INFO L226 Difference]: Without dead ends: 217 [2021-08-25 20:18:08,379 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:08,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-08-25 20:18:08,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2021-08-25 20:18:08,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.4814814814814814) internal successors, (320), 216 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 320 transitions. [2021-08-25 20:18:08,436 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 320 transitions. Word has length 24 [2021-08-25 20:18:08,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:08,436 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 320 transitions. [2021-08-25 20:18:08,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:08,437 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 320 transitions. [2021-08-25 20:18:08,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-08-25 20:18:08,439 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:08,439 INFO L512 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] [2021-08-25 20:18:08,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-08-25 20:18:08,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:18:08,652 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:08,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:08,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1495258694, now seen corresponding path program 1 times [2021-08-25 20:18:08,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:18:08,654 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539680385] [2021-08-25 20:18:08,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:08,654 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:18:08,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:18:08,655 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:18:08,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-25 20:18:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:08,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:18:08,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:18:09,033 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:18:09,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:18:09,207 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:18:09,207 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:18:09,208 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [539680385] [2021-08-25 20:18:09,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [539680385] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:09,208 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:09,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 20:18:09,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607215935] [2021-08-25 20:18:09,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:18:09,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:18:09,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:18:09,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:09,211 INFO L87 Difference]: Start difference. First operand 217 states and 320 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:10,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:10,088 INFO L93 Difference]: Finished difference Result 528 states and 787 transitions. [2021-08-25 20:18:10,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:18:10,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-08-25 20:18:10,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:10,092 INFO L225 Difference]: With dead ends: 528 [2021-08-25 20:18:10,092 INFO L226 Difference]: Without dead ends: 421 [2021-08-25 20:18:10,093 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:10,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2021-08-25 20:18:10,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2021-08-25 20:18:10,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.480952380952381) internal successors, (622), 420 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:10,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 622 transitions. [2021-08-25 20:18:10,131 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 622 transitions. Word has length 41 [2021-08-25 20:18:10,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:10,132 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 622 transitions. [2021-08-25 20:18:10,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:10,133 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 622 transitions. [2021-08-25 20:18:10,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-25 20:18:10,140 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:10,141 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2021-08-25 20:18:10,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-25 20:18:10,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:18:10,354 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:10,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:10,354 INFO L82 PathProgramCache]: Analyzing trace with hash 924360661, now seen corresponding path program 1 times [2021-08-25 20:18:10,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:18:10,355 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [911866444] [2021-08-25 20:18:10,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:10,356 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:18:10,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:18:10,357 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:18:10,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-25 20:18:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:10,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:18:10,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:18:10,844 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-25 20:18:10,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:18:11,140 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-08-25 20:18:11,141 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:18:11,141 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [911866444] [2021-08-25 20:18:11,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [911866444] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:11,142 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:11,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 20:18:11,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342786424] [2021-08-25 20:18:11,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:18:11,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:18:11,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:18:11,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:11,144 INFO L87 Difference]: Start difference. First operand 421 states and 622 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:11,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:11,702 INFO L93 Difference]: Finished difference Result 939 states and 1394 transitions. [2021-08-25 20:18:11,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:18:11,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-08-25 20:18:11,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:11,710 INFO L225 Difference]: With dead ends: 939 [2021-08-25 20:18:11,710 INFO L226 Difference]: Without dead ends: 628 [2021-08-25 20:18:11,715 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:11,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2021-08-25 20:18:11,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2021-08-25 20:18:11,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 627 states have (on average 1.4784688995215312) internal successors, (927), 627 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:11,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 927 transitions. [2021-08-25 20:18:11,755 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 927 transitions. Word has length 80 [2021-08-25 20:18:11,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:11,757 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 927 transitions. [2021-08-25 20:18:11,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:11,758 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 927 transitions. [2021-08-25 20:18:11,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-08-25 20:18:11,761 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:11,761 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2021-08-25 20:18:11,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-08-25 20:18:11,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:18:11,973 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:11,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:11,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1855651051, now seen corresponding path program 1 times [2021-08-25 20:18:11,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:18:11,974 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682352793] [2021-08-25 20:18:11,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:11,975 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:18:11,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:18:11,976 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:18:11,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-25 20:18:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:12,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:18:12,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:18:14,312 INFO L354 Elim1Store]: treesize reduction 182, result has 23.2 percent of original size [2021-08-25 20:18:14,313 INFO L388 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 3 case distinctions, treesize of input 44 treesize of output 64 [2021-08-25 20:18:14,406 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-08-25 20:18:14,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2021-08-25 20:18:14,445 INFO L388 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 19 treesize of output 7 [2021-08-25 20:18:14,719 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2021-08-25 20:18:14,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:18:15,077 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2021-08-25 20:18:15,078 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:18:15,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [682352793] [2021-08-25 20:18:15,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [682352793] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:15,080 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:15,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-25 20:18:15,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359577415] [2021-08-25 20:18:15,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:18:15,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:18:15,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:18:15,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:15,083 INFO L87 Difference]: Start difference. First operand 628 states and 927 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:16,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:16,511 INFO L93 Difference]: Finished difference Result 1253 states and 1848 transitions. [2021-08-25 20:18:16,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:18:16,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-08-25 20:18:16,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:16,517 INFO L225 Difference]: With dead ends: 1253 [2021-08-25 20:18:16,518 INFO L226 Difference]: Without dead ends: 632 [2021-08-25 20:18:16,519 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:18:16,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2021-08-25 20:18:16,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 631. [2021-08-25 20:18:16,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 630 states have (on average 1.4761904761904763) internal successors, (930), 630 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:16,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 930 transitions. [2021-08-25 20:18:16,540 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 930 transitions. Word has length 100 [2021-08-25 20:18:16,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:16,541 INFO L470 AbstractCegarLoop]: Abstraction has 631 states and 930 transitions. [2021-08-25 20:18:16,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:16,541 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 930 transitions. [2021-08-25 20:18:16,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-08-25 20:18:16,544 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:16,544 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 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] [2021-08-25 20:18:16,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-25 20:18:16,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:18:16,769 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:16,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:16,770 INFO L82 PathProgramCache]: Analyzing trace with hash 517833024, now seen corresponding path program 1 times [2021-08-25 20:18:16,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:18:16,771 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925329874] [2021-08-25 20:18:16,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:16,771 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:18:16,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:18:16,772 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:18:16,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-25 20:18:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:17,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:18:17,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:18:17,357 INFO L388 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-08-25 20:18:17,391 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:18:17,391 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-08-25 20:18:17,609 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-25 20:18:17,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2021-08-25 20:18:17,760 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-08-25 20:18:17,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:18:18,124 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-08-25 20:18:18,131 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:18:18,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925329874] [2021-08-25 20:18:18,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [925329874] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:18,133 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:18,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2021-08-25 20:18:18,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718115218] [2021-08-25 20:18:18,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-25 20:18:18,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:18:18,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-25 20:18:18,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:18:18,136 INFO L87 Difference]: Start difference. First operand 631 states and 930 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:25,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:25,005 INFO L93 Difference]: Finished difference Result 2267 states and 3362 transitions. [2021-08-25 20:18:25,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-25 20:18:25,007 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2021-08-25 20:18:25,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:25,016 INFO L225 Difference]: With dead ends: 2267 [2021-08-25 20:18:25,016 INFO L226 Difference]: Without dead ends: 1646 [2021-08-25 20:18:25,018 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 72.9ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-08-25 20:18:25,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2021-08-25 20:18:25,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 756. [2021-08-25 20:18:25,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 755 states have (on average 1.508609271523179) internal successors, (1139), 755 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:25,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1139 transitions. [2021-08-25 20:18:25,052 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1139 transitions. Word has length 115 [2021-08-25 20:18:25,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:25,052 INFO L470 AbstractCegarLoop]: Abstraction has 756 states and 1139 transitions. [2021-08-25 20:18:25,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:25,053 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1139 transitions. [2021-08-25 20:18:25,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-08-25 20:18:25,054 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:25,054 INFO L512 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 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] [2021-08-25 20:18:25,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-25 20:18:25,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:18:25,255 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:25,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:25,255 INFO L82 PathProgramCache]: Analyzing trace with hash -698320702, now seen corresponding path program 1 times [2021-08-25 20:18:25,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:18:25,256 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294870613] [2021-08-25 20:18:25,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:25,257 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:18:25,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:18:25,258 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:18:25,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-25 20:18:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:25,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:18:25,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:18:26,021 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:18:26,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-25 20:18:26,268 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-25 20:18:26,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2021-08-25 20:18:26,293 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:18:26,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:18:26,600 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:18:26,600 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:18:26,601 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1294870613] [2021-08-25 20:18:26,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1294870613] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:26,601 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:26,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2021-08-25 20:18:26,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450289933] [2021-08-25 20:18:26,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:18:26,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:18:26,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:18:26,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:18:26,603 INFO L87 Difference]: Start difference. First operand 756 states and 1139 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:30,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:30,810 INFO L93 Difference]: Finished difference Result 1760 states and 2637 transitions. [2021-08-25 20:18:30,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:18:30,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2021-08-25 20:18:30,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:30,818 INFO L225 Difference]: With dead ends: 1760 [2021-08-25 20:18:30,818 INFO L226 Difference]: Without dead ends: 1014 [2021-08-25 20:18:30,819 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.7ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:18:30,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2021-08-25 20:18:30,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 876. [2021-08-25 20:18:30,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 875 states have (on average 1.536) internal successors, (1344), 875 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:30,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1344 transitions. [2021-08-25 20:18:30,848 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1344 transitions. Word has length 115 [2021-08-25 20:18:30,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:30,848 INFO L470 AbstractCegarLoop]: Abstraction has 876 states and 1344 transitions. [2021-08-25 20:18:30,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:30,848 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1344 transitions. [2021-08-25 20:18:30,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-08-25 20:18:30,850 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:30,850 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:18:30,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-08-25 20:18:31,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:18:31,067 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:31,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:31,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1667253281, now seen corresponding path program 2 times [2021-08-25 20:18:31,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:18:31,069 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082480972] [2021-08-25 20:18:31,069 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-25 20:18:31,069 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:18:31,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:18:31,070 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:18:31,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-08-25 20:18:31,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-25 20:18:31,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-25 20:18:31,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:18:31,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:18:31,965 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:18:31,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-25 20:18:32,079 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-25 20:18:32,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2021-08-25 20:18:32,176 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:18:32,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:18:32,512 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:18:32,513 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:18:32,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082480972] [2021-08-25 20:18:32,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082480972] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:32,513 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:32,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:18:32,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726778921] [2021-08-25 20:18:32,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:18:32,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:18:32,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:18:32,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:18:32,515 INFO L87 Difference]: Start difference. First operand 876 states and 1344 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:35,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:35,069 INFO L93 Difference]: Finished difference Result 2396 states and 3610 transitions. [2021-08-25 20:18:35,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:18:35,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2021-08-25 20:18:35,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:35,077 INFO L225 Difference]: With dead ends: 2396 [2021-08-25 20:18:35,077 INFO L226 Difference]: Without dead ends: 1530 [2021-08-25 20:18:35,079 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 55.2ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:18:35,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2021-08-25 20:18:35,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 931. [2021-08-25 20:18:35,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 930 states have (on average 1.5193548387096774) internal successors, (1413), 930 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:35,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1413 transitions. [2021-08-25 20:18:35,111 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1413 transitions. Word has length 130 [2021-08-25 20:18:35,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:35,112 INFO L470 AbstractCegarLoop]: Abstraction has 931 states and 1413 transitions. [2021-08-25 20:18:35,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:35,112 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1413 transitions. [2021-08-25 20:18:35,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-08-25 20:18:35,114 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:35,114 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:18:35,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-08-25 20:18:35,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:18:35,334 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:35,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:35,334 INFO L82 PathProgramCache]: Analyzing trace with hash 919227327, now seen corresponding path program 1 times [2021-08-25 20:18:35,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:18:35,335 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746530244] [2021-08-25 20:18:35,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:35,335 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:18:35,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:18:35,336 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:18:35,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-08-25 20:18:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:35,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:18:35,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:18:36,224 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:18:36,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-25 20:18:36,330 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-25 20:18:36,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2021-08-25 20:18:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:18:36,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:18:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:18:36,743 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:18:36,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746530244] [2021-08-25 20:18:36,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1746530244] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:36,743 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:36,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:18:36,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174047676] [2021-08-25 20:18:36,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:18:36,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:18:36,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:18:36,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:18:36,745 INFO L87 Difference]: Start difference. First operand 931 states and 1413 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:41,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:41,422 INFO L93 Difference]: Finished difference Result 2452 states and 3664 transitions. [2021-08-25 20:18:41,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:18:41,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2021-08-25 20:18:41,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:41,430 INFO L225 Difference]: With dead ends: 2452 [2021-08-25 20:18:41,430 INFO L226 Difference]: Without dead ends: 1531 [2021-08-25 20:18:41,432 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 46.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:18:41,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2021-08-25 20:18:41,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 936. [2021-08-25 20:18:41,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 935 states have (on average 1.504812834224599) internal successors, (1407), 935 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:41,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1407 transitions. [2021-08-25 20:18:41,463 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1407 transitions. Word has length 130 [2021-08-25 20:18:41,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:41,464 INFO L470 AbstractCegarLoop]: Abstraction has 936 states and 1407 transitions. [2021-08-25 20:18:41,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:41,464 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1407 transitions. [2021-08-25 20:18:41,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-08-25 20:18:41,466 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:41,466 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 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] [2021-08-25 20:18:41,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-08-25 20:18:41,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:18:41,682 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:41,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:41,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1537947938, now seen corresponding path program 1 times [2021-08-25 20:18:41,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:18:41,683 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902423787] [2021-08-25 20:18:41,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:41,683 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:18:41,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:18:41,684 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:18:41,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-08-25 20:18:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:42,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:18:42,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:18:42,617 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:18:42,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-25 20:18:42,755 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-25 20:18:42,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2021-08-25 20:18:42,823 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:18:42,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:18:43,156 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:18:43,156 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:18:43,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902423787] [2021-08-25 20:18:43,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902423787] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:43,157 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:43,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:18:43,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233454259] [2021-08-25 20:18:43,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:18:43,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:18:43,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:18:43,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:18:43,158 INFO L87 Difference]: Start difference. First operand 936 states and 1407 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:48,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:48,291 INFO L93 Difference]: Finished difference Result 2419 states and 3597 transitions. [2021-08-25 20:18:48,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:18:48,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2021-08-25 20:18:48,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:48,298 INFO L225 Difference]: With dead ends: 2419 [2021-08-25 20:18:48,298 INFO L226 Difference]: Without dead ends: 1651 [2021-08-25 20:18:48,299 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 60.1ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:18:48,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2021-08-25 20:18:48,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1052. [2021-08-25 20:18:48,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.5042816365366318) internal successors, (1581), 1051 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:48,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1581 transitions. [2021-08-25 20:18:48,334 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1581 transitions. Word has length 130 [2021-08-25 20:18:48,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:48,334 INFO L470 AbstractCegarLoop]: Abstraction has 1052 states and 1581 transitions. [2021-08-25 20:18:48,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:48,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1581 transitions. [2021-08-25 20:18:48,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-08-25 20:18:48,337 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:48,337 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:18:48,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-08-25 20:18:48,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:18:48,553 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:48,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:48,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1834884522, now seen corresponding path program 1 times [2021-08-25 20:18:48,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:18:48,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [620853066] [2021-08-25 20:18:48,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:48,554 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:18:48,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:18:48,555 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:18:48,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-08-25 20:18:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:49,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:18:49,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:18:49,527 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:18:49,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-25 20:18:49,612 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-25 20:18:49,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2021-08-25 20:18:49,686 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:18:49,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:18:49,973 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:18:49,974 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:18:49,974 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [620853066] [2021-08-25 20:18:49,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [620853066] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:49,974 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:49,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:18:49,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790625210] [2021-08-25 20:18:49,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:18:49,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:18:49,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:18:49,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:18:49,976 INFO L87 Difference]: Start difference. First operand 1052 states and 1581 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:53,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:53,433 INFO L93 Difference]: Finished difference Result 2669 states and 3950 transitions. [2021-08-25 20:18:53,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:18:53,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2021-08-25 20:18:53,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:53,449 INFO L225 Difference]: With dead ends: 2669 [2021-08-25 20:18:53,449 INFO L226 Difference]: Without dead ends: 1627 [2021-08-25 20:18:53,450 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 50.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:18:53,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2021-08-25 20:18:53,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1052. [2021-08-25 20:18:53,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.483349191246432) internal successors, (1559), 1051 states have internal predecessors, (1559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:53,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1559 transitions. [2021-08-25 20:18:53,485 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1559 transitions. Word has length 131 [2021-08-25 20:18:53,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:53,485 INFO L470 AbstractCegarLoop]: Abstraction has 1052 states and 1559 transitions. [2021-08-25 20:18:53,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:53,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1559 transitions. [2021-08-25 20:18:53,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-08-25 20:18:53,488 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:53,488 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:18:53,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-08-25 20:18:53,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:18:53,703 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:53,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:53,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1695627015, now seen corresponding path program 1 times [2021-08-25 20:18:53,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:18:53,704 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [923103084] [2021-08-25 20:18:53,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:53,705 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:18:53,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:18:53,706 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:18:53,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-08-25 20:18:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:54,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:18:54,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:18:54,792 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:18:54,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-25 20:18:54,934 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-25 20:18:54,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2021-08-25 20:18:55,001 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:18:55,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:18:55,290 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:18:55,290 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:18:55,290 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [923103084] [2021-08-25 20:18:55,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [923103084] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:55,290 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:55,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:18:55,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453339411] [2021-08-25 20:18:55,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:18:55,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:18:55,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:18:55,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:18:55,292 INFO L87 Difference]: Start difference. First operand 1052 states and 1559 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:19:00,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:00,939 INFO L93 Difference]: Finished difference Result 2484 states and 3649 transitions. [2021-08-25 20:19:00,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:19:00,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2021-08-25 20:19:00,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:00,945 INFO L225 Difference]: With dead ends: 2484 [2021-08-25 20:19:00,945 INFO L226 Difference]: Without dead ends: 1620 [2021-08-25 20:19:00,946 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 48.2ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:19:00,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2021-08-25 20:19:00,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1063. [2021-08-25 20:19:00,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 1062 states have (on average 1.4736346516007532) internal successors, (1565), 1062 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:19:00,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1565 transitions. [2021-08-25 20:19:00,984 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1565 transitions. Word has length 131 [2021-08-25 20:19:00,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:00,984 INFO L470 AbstractCegarLoop]: Abstraction has 1063 states and 1565 transitions. [2021-08-25 20:19:00,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:19:00,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1565 transitions. [2021-08-25 20:19:00,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-08-25 20:19:00,986 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:00,987 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:19:01,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-08-25 20:19:01,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:19:01,204 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:01,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:01,205 INFO L82 PathProgramCache]: Analyzing trace with hash 653511332, now seen corresponding path program 1 times [2021-08-25 20:19:01,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:19:01,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [757967475] [2021-08-25 20:19:01,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:01,206 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:19:01,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:19:01,207 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:19:01,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-08-25 20:19:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:02,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:19:02,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:19:02,449 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:19:02,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-25 20:19:02,542 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-25 20:19:02,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2021-08-25 20:19:02,617 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:19:02,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:19:02,908 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:19:02,909 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:19:02,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [757967475] [2021-08-25 20:19:02,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [757967475] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:02,909 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:02,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:19:02,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951700587] [2021-08-25 20:19:02,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:19:02,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:19:02,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:19:02,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:19:02,910 INFO L87 Difference]: Start difference. First operand 1063 states and 1565 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:19:06,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:06,286 INFO L93 Difference]: Finished difference Result 2672 states and 3892 transitions. [2021-08-25 20:19:06,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:19:06,288 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2021-08-25 20:19:06,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:06,293 INFO L225 Difference]: With dead ends: 2672 [2021-08-25 20:19:06,293 INFO L226 Difference]: Without dead ends: 1619 [2021-08-25 20:19:06,298 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 47.4ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:19:06,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2021-08-25 20:19:06,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1063. [2021-08-25 20:19:06,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 1062 states have (on average 1.4529190207156308) internal successors, (1543), 1062 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:19:06,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1543 transitions. [2021-08-25 20:19:06,343 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1543 transitions. Word has length 132 [2021-08-25 20:19:06,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:06,344 INFO L470 AbstractCegarLoop]: Abstraction has 1063 states and 1543 transitions. [2021-08-25 20:19:06,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:19:06,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1543 transitions. [2021-08-25 20:19:06,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-08-25 20:19:06,346 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:06,347 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:19:06,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-08-25 20:19:06,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:19:06,564 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:06,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:06,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1844078565, now seen corresponding path program 1 times [2021-08-25 20:19:06,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:19:06,565 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [363409565] [2021-08-25 20:19:06,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:06,565 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:19:06,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:19:06,567 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:19:06,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-08-25 20:19:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:07,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:19:07,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:19:07,839 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:19:07,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-25 20:19:07,953 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-25 20:19:07,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2021-08-25 20:19:08,033 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:19:08,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:19:08,342 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:19:08,342 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:19:08,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [363409565] [2021-08-25 20:19:08,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [363409565] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:08,342 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:08,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:19:08,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675350957] [2021-08-25 20:19:08,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:19:08,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:19:08,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:19:08,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:19:08,345 INFO L87 Difference]: Start difference. First operand 1063 states and 1543 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:19:12,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:12,761 INFO L93 Difference]: Finished difference Result 2627 states and 3793 transitions. [2021-08-25 20:19:12,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:19:12,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2021-08-25 20:19:12,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:12,768 INFO L225 Difference]: With dead ends: 2627 [2021-08-25 20:19:12,769 INFO L226 Difference]: Without dead ends: 1574 [2021-08-25 20:19:12,770 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 55.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:19:12,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2021-08-25 20:19:12,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1063. [2021-08-25 20:19:12,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 1062 states have (on average 1.4322033898305084) internal successors, (1521), 1062 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:19:12,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1521 transitions. [2021-08-25 20:19:12,808 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1521 transitions. Word has length 133 [2021-08-25 20:19:12,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:12,808 INFO L470 AbstractCegarLoop]: Abstraction has 1063 states and 1521 transitions. [2021-08-25 20:19:12,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:19:12,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1521 transitions. [2021-08-25 20:19:12,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-08-25 20:19:12,811 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:12,811 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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] [2021-08-25 20:19:12,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-08-25 20:19:13,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:19:13,025 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:13,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:13,025 INFO L82 PathProgramCache]: Analyzing trace with hash -197856968, now seen corresponding path program 1 times [2021-08-25 20:19:13,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:19:13,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840231988] [2021-08-25 20:19:13,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:13,026 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:19:13,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:19:13,027 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:19:13,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-08-25 20:19:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:14,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:19:14,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:19:14,342 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:19:14,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-25 20:19:14,505 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-25 20:19:14,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2021-08-25 20:19:14,579 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:19:14,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:19:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:19:14,871 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:19:14,871 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840231988] [2021-08-25 20:19:14,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840231988] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:14,871 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:14,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:19:14,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419668907] [2021-08-25 20:19:14,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:19:14,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:19:14,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:19:14,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:19:14,872 INFO L87 Difference]: Start difference. First operand 1063 states and 1521 transitions. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:19:18,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:18,689 INFO L93 Difference]: Finished difference Result 2727 states and 3884 transitions. [2021-08-25 20:19:18,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:19:18,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2021-08-25 20:19:18,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:18,694 INFO L225 Difference]: With dead ends: 2727 [2021-08-25 20:19:18,694 INFO L226 Difference]: Without dead ends: 1674 [2021-08-25 20:19:18,695 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 46.0ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:19:18,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2021-08-25 20:19:18,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 1158. [2021-08-25 20:19:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1157 states have (on average 1.4131374243733794) internal successors, (1635), 1157 states have internal predecessors, (1635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:19:18,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1635 transitions. [2021-08-25 20:19:18,731 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1635 transitions. Word has length 133 [2021-08-25 20:19:18,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:18,732 INFO L470 AbstractCegarLoop]: Abstraction has 1158 states and 1635 transitions. [2021-08-25 20:19:18,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:19:18,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1635 transitions. [2021-08-25 20:19:18,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-08-25 20:19:18,734 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:18,734 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:19:18,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-08-25 20:19:18,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:19:18,952 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:18,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:18,953 INFO L82 PathProgramCache]: Analyzing trace with hash 584684213, now seen corresponding path program 1 times [2021-08-25 20:19:18,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:19:18,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1639426427] [2021-08-25 20:19:18,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:18,954 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:19:18,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:19:18,955 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:19:18,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-08-25 20:19:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:20,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:19:20,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:19:20,343 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:19:20,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-25 20:19:20,502 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-25 20:19:20,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2021-08-25 20:19:20,563 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:19:20,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:19:20,858 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:19:20,858 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:19:20,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1639426427] [2021-08-25 20:19:20,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1639426427] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:20,858 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:20,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:19:20,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343827838] [2021-08-25 20:19:20,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:19:20,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:19:20,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:19:20,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:19:20,860 INFO L87 Difference]: Start difference. First operand 1158 states and 1635 transitions. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:19:25,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:25,140 INFO L93 Difference]: Finished difference Result 2781 states and 3928 transitions. [2021-08-25 20:19:25,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:19:25,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2021-08-25 20:19:25,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:25,145 INFO L225 Difference]: With dead ends: 2781 [2021-08-25 20:19:25,145 INFO L226 Difference]: Without dead ends: 1633 [2021-08-25 20:19:25,146 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 54.4ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:19:25,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2021-08-25 20:19:25,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1174. [2021-08-25 20:19:25,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 1173 states have (on average 1.411764705882353) internal successors, (1656), 1173 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:19:25,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1656 transitions. [2021-08-25 20:19:25,186 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1656 transitions. Word has length 134 [2021-08-25 20:19:25,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:25,187 INFO L470 AbstractCegarLoop]: Abstraction has 1174 states and 1656 transitions. [2021-08-25 20:19:25,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:19:25,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1656 transitions. [2021-08-25 20:19:25,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-08-25 20:19:25,191 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:25,191 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 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] [2021-08-25 20:19:25,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-08-25 20:19:25,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:19:25,407 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:25,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:25,408 INFO L82 PathProgramCache]: Analyzing trace with hash 2002780513, now seen corresponding path program 1 times [2021-08-25 20:19:25,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:19:25,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031819354] [2021-08-25 20:19:25,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:25,409 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:19:25,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:19:25,409 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:19:25,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-08-25 20:19:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:26,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-25 20:19:26,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:19:26,848 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:19:26,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-08-25 20:19:26,973 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-25 20:19:26,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 10 [2021-08-25 20:19:27,038 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:19:27,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:19:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-25 20:19:27,326 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:19:27,326 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031819354] [2021-08-25 20:19:27,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031819354] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:27,326 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:27,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-25 20:19:27,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943490190] [2021-08-25 20:19:27,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-25 20:19:27,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:19:27,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-25 20:19:27,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-25 20:19:27,328 INFO L87 Difference]: Start difference. First operand 1174 states and 1656 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:19:30,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:30,008 INFO L93 Difference]: Finished difference Result 2775 states and 3909 transitions. [2021-08-25 20:19:30,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-25 20:19:30,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2021-08-25 20:19:30,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:30,012 INFO L225 Difference]: With dead ends: 2775 [2021-08-25 20:19:30,013 INFO L226 Difference]: Without dead ends: 1611 [2021-08-25 20:19:30,013 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 44.9ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-25 20:19:30,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2021-08-25 20:19:30,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1174. [2021-08-25 20:19:30,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 1173 states have (on average 1.3981244671781756) internal successors, (1640), 1173 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:19:30,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1640 transitions. [2021-08-25 20:19:30,050 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1640 transitions. Word has length 134 [2021-08-25 20:19:30,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:30,050 INFO L470 AbstractCegarLoop]: Abstraction has 1174 states and 1640 transitions. [2021-08-25 20:19:30,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:19:30,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1640 transitions. [2021-08-25 20:19:30,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-08-25 20:19:30,054 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:30,054 INFO L512 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2021-08-25 20:19:30,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-08-25 20:19:30,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:19:30,269 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:30,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:30,269 INFO L82 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2021-08-25 20:19:30,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:19:30,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223519036] [2021-08-25 20:19:30,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:30,270 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:19:30,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:19:30,271 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:19:30,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-08-25 20:19:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:19:31,800 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 20:19:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:19:32,471 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-08-25 20:19:32,471 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 20:19:32,472 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:19:32,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-08-25 20:19:32,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:19:32,679 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:19:32,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:19:32 BoogieIcfgContainer [2021-08-25 20:19:32,790 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:19:32,791 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:19:32,791 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:19:32,791 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:19:32,791 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:18:07" (3/4) ... [2021-08-25 20:19:32,794 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-25 20:19:32,904 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 20:19:32,904 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:19:32,905 INFO L168 Benchmark]: Toolchain (without parser) took 88449.83 ms. Allocated memory was 54.5 MB in the beginning and 232.8 MB in the end (delta: 178.3 MB). Free memory was 29.9 MB in the beginning and 91.5 MB in the end (delta: -61.6 MB). Peak memory consumption was 114.7 MB. Max. memory is 16.1 GB. [2021-08-25 20:19:32,905 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 54.5 MB. Free memory was 37.3 MB in the beginning and 37.2 MB in the end (delta: 36.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:19:32,909 INFO L168 Benchmark]: CACSL2BoogieTranslator took 623.38 ms. Allocated memory was 54.5 MB in the beginning and 69.2 MB in the end (delta: 14.7 MB). Free memory was 29.6 MB in the beginning and 47.2 MB in the end (delta: -17.5 MB). Peak memory consumption was 12.8 MB. Max. memory is 16.1 GB. [2021-08-25 20:19:32,909 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.44 ms. Allocated memory is still 69.2 MB. Free memory was 47.2 MB in the beginning and 42.8 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:19:32,909 INFO L168 Benchmark]: Boogie Preprocessor took 90.85 ms. Allocated memory is still 69.2 MB. Free memory was 42.8 MB in the beginning and 36.2 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:19:32,910 INFO L168 Benchmark]: RCFGBuilder took 2346.30 ms. Allocated memory was 69.2 MB in the beginning and 90.2 MB in the end (delta: 21.0 MB). Free memory was 36.2 MB in the beginning and 41.9 MB in the end (delta: -5.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 16.1 GB. [2021-08-25 20:19:32,910 INFO L168 Benchmark]: TraceAbstraction took 85168.72 ms. Allocated memory was 90.2 MB in the beginning and 232.8 MB in the end (delta: 142.6 MB). Free memory was 41.3 MB in the beginning and 106.2 MB in the end (delta: -64.9 MB). Peak memory consumption was 76.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:19:32,910 INFO L168 Benchmark]: Witness Printer took 113.49 ms. Allocated memory is still 232.8 MB. Free memory was 106.2 MB in the beginning and 91.5 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-08-25 20:19:32,913 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.21 ms. Allocated memory is still 54.5 MB. Free memory was 37.3 MB in the beginning and 37.2 MB in the end (delta: 36.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 623.38 ms. Allocated memory was 54.5 MB in the beginning and 69.2 MB in the end (delta: 14.7 MB). Free memory was 29.6 MB in the beginning and 47.2 MB in the end (delta: -17.5 MB). Peak memory consumption was 12.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 97.44 ms. Allocated memory is still 69.2 MB. Free memory was 47.2 MB in the beginning and 42.8 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 90.85 ms. Allocated memory is still 69.2 MB. Free memory was 42.8 MB in the beginning and 36.2 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2346.30 ms. Allocated memory was 69.2 MB in the beginning and 90.2 MB in the end (delta: 21.0 MB). Free memory was 36.2 MB in the beginning and 41.9 MB in the end (delta: -5.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 85168.72 ms. Allocated memory was 90.2 MB in the beginning and 232.8 MB in the end (delta: 142.6 MB). Free memory was 41.3 MB in the beginning and 106.2 MB in the end (delta: -64.9 MB). Peak memory consumption was 76.1 MB. Max. memory is 16.1 GB. * Witness Printer took 113.49 ms. Allocated memory is still 232.8 MB. Free memory was 106.2 MB in the beginning and 91.5 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1646]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1067] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 12292 [L1075] s->version = __VERIFIER_nondet_int() [L1082] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1083] unsigned long tmp ; [L1084] unsigned long l ; [L1085] long num1 ; [L1086] void (*cb)() ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 ; [L1094] int tmp___4 ; [L1095] int tmp___5 ; [L1096] int tmp___6 ; [L1097] int tmp___7 ; [L1098] int tmp___8 ; [L1099] long tmp___9 ; [L1101] int blastFlag ; [L1104] blastFlag = 0 [L1105] s->hit=__VERIFIER_nondet_int () [L1106] s->state = 12292 [L1107] tmp = __VERIFIER_nondet_int() [L1108] cb = (void (*)())((void *)0) [L1109] ret = -1 [L1110] skip = 0 [L1111] EXPR s->info_callback VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1111] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1112] EXPR s->info_callback [L1112] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1134] COND TRUE s->state == 12292 [L1237] s->new_session = 1 [L1238] s->state = 4096 [L1239] EXPR s->ctx [L1239] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1239] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1244] s->server = 0 VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1245] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1250] EXPR s->version VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1250] COND FALSE !((s->version & 65280) != 768) [L1256] s->type = 4096 [L1257] EXPR s->init_buf VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1257] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1269] tmp___4 = __VERIFIER_nondet_int() [L1270] COND FALSE !(! tmp___4) [L1276] tmp___5 = __VERIFIER_nondet_int() [L1277] COND FALSE !(! tmp___5) [L1283] s->state = 4368 [L1284] EXPR s->ctx [L1284] EXPR (s->ctx)->stats.sess_connect [L1284] (s->ctx)->stats.sess_connect += 1 [L1285] s->init_num = 0 VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1149] COND TRUE s->state == 4368 [L1289] s->shutdown = 0 [L1290] ret = __VERIFIER_nondet_int() [L1291] COND TRUE blastFlag == 0 [L1292] blastFlag = 1 VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1296] COND FALSE !(ret <= 0) [L1301] s->state = 4384 [L1302] s->init_num = 0 [L1303] EXPR s->bbio [L1303] EXPR s->wbio VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1303] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1155] COND TRUE s->state == 4384 [L1311] ret = __VERIFIER_nondet_int() [L1312] COND TRUE blastFlag == 1 [L1313] blastFlag = 2 VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1317] COND FALSE !(ret <= 0) [L1322] s->hit VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1322] COND FALSE !(s->hit) [L1325] s->state = 4400 VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1327] s->init_num = 0 VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1161] COND TRUE s->state == 4400 [L1331] EXPR s->s3 [L1331] EXPR (s->s3)->tmp.new_cipher [L1331] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1331] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1334] ret = __VERIFIER_nondet_int() [L1335] COND TRUE blastFlag == 2 [L1336] blastFlag = 3 VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1340] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1346] s->state = 4416 [L1347] s->init_num = 0 VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1167] COND TRUE s->state == 4416 [L1351] ret = __VERIFIER_nondet_int() [L1352] COND TRUE blastFlag == 3 [L1353] blastFlag = 4 VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1357] COND FALSE !(ret <= 0) [L1362] s->state = 4432 [L1363] s->init_num = 0 [L1364] tmp___6 = __VERIFIER_nondet_int() [L1365] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1173] COND TRUE s->state == 4432 [L1374] ret = __VERIFIER_nondet_int() [L1375] COND FALSE !(blastFlag == 5) VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1380] COND FALSE !(ret <= 0) [L1385] s->state = 4448 [L1386] s->init_num = 0 VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1605] EXPR s->s3 [L1605] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1605] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1634] skip = 0 VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1131] COND TRUE 1 VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1133] EXPR s->state [L1133] state = s->state [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1134] COND FALSE !(s->state == 12292) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1137] COND FALSE !(s->state == 16384) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1140] COND FALSE !(s->state == 4096) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1143] COND FALSE !(s->state == 20480) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1146] COND FALSE !(s->state == 4099) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1149] COND FALSE !(s->state == 4368) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1152] COND FALSE !(s->state == 4369) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1155] COND FALSE !(s->state == 4384) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1158] COND FALSE !(s->state == 4385) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1161] COND FALSE !(s->state == 4400) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1164] COND FALSE !(s->state == 4401) [L1167] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1167] COND FALSE !(s->state == 4416) [L1170] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1170] COND FALSE !(s->state == 4417) [L1173] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1173] COND FALSE !(s->state == 4432) [L1176] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1176] COND FALSE !(s->state == 4433) [L1179] EXPR s->state VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1179] COND TRUE s->state == 4448 [L1390] ret = __VERIFIER_nondet_int() [L1391] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={-2147483569:0}] [L1646] reach_error() VAL [init=1, SSLv3_client_data={-2147483569:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 85006.5ms, OverallIterations: 17, TraceHistogramMax: 7, EmptinessCheckTime: 51.9ms, AutomataDifference: 54278.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 17.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2847 SDtfs, 2729 SDslu, 6017 SDs, 0 SdLazy, 5274 SolverSat, 594 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 49143.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3578 GetRequests, 3496 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 673.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1174occurred in iteration=15, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 569.8ms AutomataMinimizationTime, 16 MinimizatonAttempts, 6433 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 692.2ms SsaConstructionTime, 3206.1ms SatisfiabilityAnalysisTime, 13133.4ms InterpolantComputationTime, 1930 NumberOfCodeBlocks, 1930 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 3554 ConstructedInterpolants, 0 QuantifiedInterpolants, 7788 SizeOfPredicates, 74 NumberOfNonLiveVariables, 4790 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 PerfectInterpolantSequences, 5078/5078 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 proved your program to be incorrect! [2021-08-25 20:19:32,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...