./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_clnt.blast.03.i.cil-1.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.03.i.cil-1.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 8334dcb0cdaf6693a0e55f9663f2e64fc956eb05 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.03.i.cil-1.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 8334dcb0cdaf6693a0e55f9663f2e64fc956eb05 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:19:07,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:19:07,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:19:07,426 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:19:07,426 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:19:07,430 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:19:07,431 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:19:07,436 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:19:07,439 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:19:07,443 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:19:07,445 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:19:07,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:19:07,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:19:07,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:19:07,459 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:19:07,462 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:19:07,464 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:19:07,464 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:19:07,467 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:19:07,473 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:19:07,475 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:19:07,476 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:19:07,477 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:19:07,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:19:07,486 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:19:07,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:19:07,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:19:07,488 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:19:07,489 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:19:07,490 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:19:07,490 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:19:07,491 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:19:07,492 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:19:07,493 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:19:07,494 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:19:07,494 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:19:07,495 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:19:07,495 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:19:07,495 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:19:07,497 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:19:07,498 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:19:07,499 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:19:07,539 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:19:07,540 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:19:07,541 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:19:07,541 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:19:07,543 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:19:07,543 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:19:07,543 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:19:07,544 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:19:07,544 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:19:07,544 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 20:19:07,545 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:19:07,545 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:19:07,545 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:19:07,546 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:19:07,546 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:19:07,546 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:19:07,546 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:19:07,546 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:19:07,547 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:19:07,547 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:19:07,547 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:19:07,547 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:19:07,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:19:07,548 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:19:07,548 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:19:07,548 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:19:07,548 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 20:19:07,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 20:19:07,549 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:19:07,549 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:19:07,549 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 -> 8334dcb0cdaf6693a0e55f9663f2e64fc956eb05 [2021-08-25 20:19:08,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:19:08,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:19:08,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:19:08,166 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:19:08,173 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:19:08,174 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_clnt.blast.03.i.cil-1.c [2021-08-25 20:19:08,272 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f04356ac/bcad5be6af0b40fdb3ed9b771340a2d6/FLAG73da433f1 [2021-08-25 20:19:09,039 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:19:09,040 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.03.i.cil-1.c [2021-08-25 20:19:09,064 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f04356ac/bcad5be6af0b40fdb3ed9b771340a2d6/FLAG73da433f1 [2021-08-25 20:19:09,238 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f04356ac/bcad5be6af0b40fdb3ed9b771340a2d6 [2021-08-25 20:19:09,241 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:19:09,242 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:19:09,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:19:09,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:19:09,259 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:19:09,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:19:09" (1/1) ... [2021-08-25 20:19:09,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f275976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:19:09, skipping insertion in model container [2021-08-25 20:19:09,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:19:09" (1/1) ... [2021-08-25 20:19:09,267 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:19:09,405 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:19:09,880 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.03.i.cil-1.c[64353,64366] [2021-08-25 20:19:09,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:19:09,912 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:19:10,014 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.03.i.cil-1.c[64353,64366] [2021-08-25 20:19:10,026 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:19:10,041 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:19:10,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:19:10 WrapperNode [2021-08-25 20:19:10,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:19:10,046 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:19:10,046 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:19:10,047 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:19:10,053 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:19:10" (1/1) ... [2021-08-25 20:19:10,084 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:19:10" (1/1) ... [2021-08-25 20:19:10,125 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:19:10,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:19:10,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:19:10,127 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:19:10,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:19:10" (1/1) ... [2021-08-25 20:19:10,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:19:10" (1/1) ... [2021-08-25 20:19:10,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:19:10" (1/1) ... [2021-08-25 20:19:10,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:19:10" (1/1) ... [2021-08-25 20:19:10,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:19:10" (1/1) ... [2021-08-25 20:19:10,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:19:10" (1/1) ... [2021-08-25 20:19:10,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:19:10" (1/1) ... [2021-08-25 20:19:10,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:19:10,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:19:10,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:19:10,190 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:19:10,191 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:19:10" (1/1) ... [2021-08-25 20:19:10,197 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:19:10,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:19:10,215 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:19:10,255 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:19:10,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-25 20:19:10,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:19:10,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-25 20:19:10,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-25 20:19:10,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-25 20:19:10,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 20:19:10,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-25 20:19:10,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:19:10,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:19:10,553 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:19:11,722 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-08-25 20:19:11,722 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-08-25 20:19:11,729 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:19:11,729 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:19:11,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:19:11 BoogieIcfgContainer [2021-08-25 20:19:11,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:19:11,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:19:11,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:19:11,736 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:19:11,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:19:09" (1/3) ... [2021-08-25 20:19:11,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700c7a50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:19:11, skipping insertion in model container [2021-08-25 20:19:11,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:19:10" (2/3) ... [2021-08-25 20:19:11,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700c7a50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:19:11, skipping insertion in model container [2021-08-25 20:19:11,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:19:11" (3/3) ... [2021-08-25 20:19:11,739 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03.i.cil-1.c [2021-08-25 20:19:11,744 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:19:11,745 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:19:11,786 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:19:11,791 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:19:11,791 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:19:11,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 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:11,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-25 20:19:11,813 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:11,814 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:19:11,814 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:11,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:11,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2021-08-25 20:19:11,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:19:11,828 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896379698] [2021-08-25 20:19:11,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:11,829 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:19:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:12,150 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:19:12,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:19:12,151 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896379698] [2021-08-25 20:19:12,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896379698] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:12,152 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:12,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:19:12,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611569355] [2021-08-25 20:19:12,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:19:12,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:19:12,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:19:12,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:19:12,180 INFO L87 Difference]: Start difference. First operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 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:19:12,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:12,636 INFO L93 Difference]: Finished difference Result 255 states and 430 transitions. [2021-08-25 20:19:12,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:19:12,638 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:19:12,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:12,649 INFO L225 Difference]: With dead ends: 255 [2021-08-25 20:19:12,649 INFO L226 Difference]: Without dead ends: 116 [2021-08-25 20:19:12,652 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:19:12,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-08-25 20:19:12,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2021-08-25 20:19:12,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.5087719298245614) internal successors, (172), 114 states have internal predecessors, (172), 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,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2021-08-25 20:19:12,689 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2021-08-25 20:19:12,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:12,690 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2021-08-25 20:19:12,690 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:19:12,690 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2021-08-25 20:19:12,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-25 20:19:12,692 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:12,692 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] [2021-08-25 20:19:12,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 20:19:12,692 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:12,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:12,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1001988123, now seen corresponding path program 1 times [2021-08-25 20:19:12,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:19:12,694 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901576320] [2021-08-25 20:19:12,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:12,694 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:19:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:12,843 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:19:12,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:19:12,843 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901576320] [2021-08-25 20:19:12,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901576320] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:12,845 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:12,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:19:12,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30544457] [2021-08-25 20:19:12,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:19:12,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:19:12,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:19:12,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:19:12,849 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:12,924 INFO L93 Difference]: Finished difference Result 321 states and 484 transitions. [2021-08-25 20:19:12,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:19:12,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 38 [2021-08-25 20:19:12,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:12,931 INFO L225 Difference]: With dead ends: 321 [2021-08-25 20:19:12,931 INFO L226 Difference]: Without dead ends: 216 [2021-08-25 20:19:12,933 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:19:12,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-08-25 20:19:12,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2021-08-25 20:19:12,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.4883720930232558) internal successors, (320), 215 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:19:12,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 320 transitions. [2021-08-25 20:19:12,969 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 320 transitions. Word has length 38 [2021-08-25 20:19:12,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:12,970 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 320 transitions. [2021-08-25 20:19:12,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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,971 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 320 transitions. [2021-08-25 20:19:12,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-08-25 20:19:12,975 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:12,976 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] [2021-08-25 20:19:12,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 20:19:12,978 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:12,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:12,980 INFO L82 PathProgramCache]: Analyzing trace with hash -596933037, now seen corresponding path program 1 times [2021-08-25 20:19:12,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:19:12,981 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812665745] [2021-08-25 20:19:12,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:12,983 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:19:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:13,118 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:19:13,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:19:13,119 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812665745] [2021-08-25 20:19:13,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812665745] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:13,119 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:13,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:19:13,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67146527] [2021-08-25 20:19:13,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:19:13,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:19:13,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:19:13,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:19:13,121 INFO L87 Difference]: Start difference. First operand 216 states and 320 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:13,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:13,205 INFO L93 Difference]: Finished difference Result 420 states and 629 transitions. [2021-08-25 20:19:13,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:19:13,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 53 [2021-08-25 20:19:13,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:13,208 INFO L225 Difference]: With dead ends: 420 [2021-08-25 20:19:13,208 INFO L226 Difference]: Without dead ends: 315 [2021-08-25 20:19:13,209 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:19:13,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-08-25 20:19:13,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2021-08-25 20:19:13,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 1.484076433121019) internal successors, (466), 314 states have internal predecessors, (466), 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:13,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 466 transitions. [2021-08-25 20:19:13,220 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 466 transitions. Word has length 53 [2021-08-25 20:19:13,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:13,220 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 466 transitions. [2021-08-25 20:19:13,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:13,221 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 466 transitions. [2021-08-25 20:19:13,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-25 20:19:13,223 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:13,223 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] [2021-08-25 20:19:13,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 20:19:13,223 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:13,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:13,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1173568974, now seen corresponding path program 1 times [2021-08-25 20:19:13,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:19:13,224 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328531383] [2021-08-25 20:19:13,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:13,225 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:19:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:13,331 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:19:13,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:19:13,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328531383] [2021-08-25 20:19:13,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328531383] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:13,332 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:13,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:19:13,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312651809] [2021-08-25 20:19:13,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:19:13,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:19:13,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:19:13,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:19:13,335 INFO L87 Difference]: Start difference. First operand 315 states and 466 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:13,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:13,969 INFO L93 Difference]: Finished difference Result 806 states and 1197 transitions. [2021-08-25 20:19:13,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:19:13,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 71 [2021-08-25 20:19:13,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:13,972 INFO L225 Difference]: With dead ends: 806 [2021-08-25 20:19:13,973 INFO L226 Difference]: Without dead ends: 501 [2021-08-25 20:19:13,974 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:19:13,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2021-08-25 20:19:13,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 365. [2021-08-25 20:19:13,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.5164835164835164) internal successors, (552), 364 states have internal predecessors, (552), 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:13,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 552 transitions. [2021-08-25 20:19:13,985 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 552 transitions. Word has length 71 [2021-08-25 20:19:13,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:13,985 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 552 transitions. [2021-08-25 20:19:13,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:13,986 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 552 transitions. [2021-08-25 20:19:13,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-25 20:19:13,988 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:13,988 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] [2021-08-25 20:19:13,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 20:19:13,988 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:13,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:13,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1307582480, now seen corresponding path program 1 times [2021-08-25 20:19:13,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:19:13,989 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252577420] [2021-08-25 20:19:13,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:13,990 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:19:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:14,090 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:19:14,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:19:14,091 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252577420] [2021-08-25 20:19:14,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252577420] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:14,092 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:14,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:19:14,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16143621] [2021-08-25 20:19:14,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:19:14,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:19:14,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:19:14,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:19:14,098 INFO L87 Difference]: Start difference. First operand 365 states and 552 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:14,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:14,525 INFO L93 Difference]: Finished difference Result 806 states and 1218 transitions. [2021-08-25 20:19:14,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:19:14,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 71 [2021-08-25 20:19:14,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:14,528 INFO L225 Difference]: With dead ends: 806 [2021-08-25 20:19:14,528 INFO L226 Difference]: Without dead ends: 451 [2021-08-25 20:19:14,529 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 51.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:19:14,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2021-08-25 20:19:14,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 405. [2021-08-25 20:19:14,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 1.5346534653465347) internal successors, (620), 404 states have internal predecessors, (620), 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:14,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 620 transitions. [2021-08-25 20:19:14,543 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 620 transitions. Word has length 71 [2021-08-25 20:19:14,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:14,543 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 620 transitions. [2021-08-25 20:19:14,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:14,544 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 620 transitions. [2021-08-25 20:19:14,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-25 20:19:14,545 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:14,545 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:19:14,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 20:19:14,545 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:14,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:14,546 INFO L82 PathProgramCache]: Analyzing trace with hash -2025585655, now seen corresponding path program 1 times [2021-08-25 20:19:14,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:19:14,546 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617500901] [2021-08-25 20:19:14,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:14,547 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:19:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:14,628 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:19:14,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:19:14,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617500901] [2021-08-25 20:19:14,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617500901] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:14,629 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:14,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:19:14,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198151787] [2021-08-25 20:19:14,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:19:14,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:19:14,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:19:14,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:19:14,631 INFO L87 Difference]: Start difference. First operand 405 states and 620 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:19:15,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:15,141 INFO L93 Difference]: Finished difference Result 928 states and 1409 transitions. [2021-08-25 20:19:15,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:19:15,142 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:19:15,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:15,144 INFO L225 Difference]: With dead ends: 928 [2021-08-25 20:19:15,144 INFO L226 Difference]: Without dead ends: 533 [2021-08-25 20:19:15,145 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:19:15,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2021-08-25 20:19:15,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 407. [2021-08-25 20:19:15,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.5320197044334976) internal successors, (622), 406 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:19:15,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 622 transitions. [2021-08-25 20:19:15,156 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 622 transitions. Word has length 72 [2021-08-25 20:19:15,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:15,157 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 622 transitions. [2021-08-25 20:19:15,157 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:19:15,157 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 622 transitions. [2021-08-25 20:19:15,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-25 20:19:15,158 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:15,158 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, 1, 1, 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:15,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-25 20:19:15,159 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:15,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:15,159 INFO L82 PathProgramCache]: Analyzing trace with hash 703880522, now seen corresponding path program 2 times [2021-08-25 20:19:15,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:19:15,160 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764242661] [2021-08-25 20:19:15,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:15,160 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:19:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:15,243 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-25 20:19:15,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:19:15,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764242661] [2021-08-25 20:19:15,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764242661] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:15,244 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:15,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:19:15,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094125347] [2021-08-25 20:19:15,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:19:15,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:19:15,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:19:15,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:19:15,245 INFO L87 Difference]: Start difference. First operand 407 states and 622 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:15,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:15,704 INFO L93 Difference]: Finished difference Result 928 states and 1407 transitions. [2021-08-25 20:19:15,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:19:15,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 85 [2021-08-25 20:19:15,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:15,707 INFO L225 Difference]: With dead ends: 928 [2021-08-25 20:19:15,708 INFO L226 Difference]: Without dead ends: 531 [2021-08-25 20:19:15,708 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:19:15,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2021-08-25 20:19:15,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2021-08-25 20:19:15,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.5270935960591132) internal successors, (620), 406 states have internal predecessors, (620), 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:15,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 620 transitions. [2021-08-25 20:19:15,724 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 620 transitions. Word has length 85 [2021-08-25 20:19:15,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:15,725 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 620 transitions. [2021-08-25 20:19:15,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:15,725 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 620 transitions. [2021-08-25 20:19:15,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-25 20:19:15,726 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:15,726 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:19:15,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-25 20:19:15,727 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:15,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:15,727 INFO L82 PathProgramCache]: Analyzing trace with hash -405099924, now seen corresponding path program 1 times [2021-08-25 20:19:15,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:19:15,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261952339] [2021-08-25 20:19:15,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:15,728 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:19:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-25 20:19:15,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:19:15,787 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261952339] [2021-08-25 20:19:15,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261952339] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:15,787 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:15,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:19:15,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587984963] [2021-08-25 20:19:15,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:19:15,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:19:15,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:19:15,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:19:15,789 INFO L87 Difference]: Start difference. First operand 407 states and 620 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:16,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:16,232 INFO L93 Difference]: Finished difference Result 928 states and 1403 transitions. [2021-08-25 20:19:16,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:19:16,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 85 [2021-08-25 20:19:16,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:16,235 INFO L225 Difference]: With dead ends: 928 [2021-08-25 20:19:16,235 INFO L226 Difference]: Without dead ends: 531 [2021-08-25 20:19:16,236 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:19:16,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2021-08-25 20:19:16,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2021-08-25 20:19:16,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.522167487684729) internal successors, (618), 406 states have internal predecessors, (618), 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:16,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 618 transitions. [2021-08-25 20:19:16,247 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 618 transitions. Word has length 85 [2021-08-25 20:19:16,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:16,248 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 618 transitions. [2021-08-25 20:19:16,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:16,248 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 618 transitions. [2021-08-25 20:19:16,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-25 20:19:16,249 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:16,249 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, 1, 1, 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:16,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 20:19:16,250 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:16,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:16,250 INFO L82 PathProgramCache]: Analyzing trace with hash -325478776, now seen corresponding path program 2 times [2021-08-25 20:19:16,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:19:16,251 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314748031] [2021-08-25 20:19:16,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:16,251 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:19:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:16,308 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-25 20:19:16,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:19:16,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314748031] [2021-08-25 20:19:16,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314748031] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:16,309 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:16,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:19:16,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111101312] [2021-08-25 20:19:16,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:19:16,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:19:16,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:19:16,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:19:16,311 INFO L87 Difference]: Start difference. First operand 407 states and 618 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:16,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:16,633 INFO L93 Difference]: Finished difference Result 848 states and 1278 transitions. [2021-08-25 20:19:16,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:19:16,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 85 [2021-08-25 20:19:16,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:16,636 INFO L225 Difference]: With dead ends: 848 [2021-08-25 20:19:16,639 INFO L226 Difference]: Without dead ends: 451 [2021-08-25 20:19:16,640 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:19:16,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2021-08-25 20:19:16,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2021-08-25 20:19:16,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.5172413793103448) internal successors, (616), 406 states have internal predecessors, (616), 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:16,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 616 transitions. [2021-08-25 20:19:16,651 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 616 transitions. Word has length 85 [2021-08-25 20:19:16,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:16,662 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 616 transitions. [2021-08-25 20:19:16,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:16,664 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 616 transitions. [2021-08-25 20:19:16,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-25 20:19:16,665 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:16,666 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:19:16,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 20:19:16,666 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:16,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:16,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1434459222, now seen corresponding path program 1 times [2021-08-25 20:19:16,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:19:16,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951688142] [2021-08-25 20:19:16,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:16,670 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:19:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-25 20:19:16,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:19:16,737 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951688142] [2021-08-25 20:19:16,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951688142] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:16,737 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:16,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:19:16,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010070881] [2021-08-25 20:19:16,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:19:16,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:19:16,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:19:16,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:19:16,740 INFO L87 Difference]: Start difference. First operand 407 states and 616 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:17,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:17,067 INFO L93 Difference]: Finished difference Result 848 states and 1274 transitions. [2021-08-25 20:19:17,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:19:17,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 85 [2021-08-25 20:19:17,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:17,070 INFO L225 Difference]: With dead ends: 848 [2021-08-25 20:19:17,070 INFO L226 Difference]: Without dead ends: 451 [2021-08-25 20:19:17,071 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:19:17,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2021-08-25 20:19:17,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2021-08-25 20:19:17,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.5123152709359606) internal successors, (614), 406 states have internal predecessors, (614), 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:17,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 614 transitions. [2021-08-25 20:19:17,080 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 614 transitions. Word has length 85 [2021-08-25 20:19:17,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:17,081 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 614 transitions. [2021-08-25 20:19:17,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:17,081 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 614 transitions. [2021-08-25 20:19:17,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-25 20:19:17,082 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:17,082 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:19:17,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 20:19:17,083 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:17,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:17,083 INFO L82 PathProgramCache]: Analyzing trace with hash 381197251, now seen corresponding path program 1 times [2021-08-25 20:19:17,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:19:17,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28308417] [2021-08-25 20:19:17,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:17,084 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:19:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:17,143 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-25 20:19:17,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:19:17,144 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28308417] [2021-08-25 20:19:17,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28308417] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:17,144 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:17,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:19:17,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398624391] [2021-08-25 20:19:17,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:19:17,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:19:17,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:19:17,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:19:17,146 INFO L87 Difference]: Start difference. First operand 407 states and 614 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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:17,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:17,614 INFO L93 Difference]: Finished difference Result 928 states and 1391 transitions. [2021-08-25 20:19:17,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:19:17,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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 86 [2021-08-25 20:19:17,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:17,618 INFO L225 Difference]: With dead ends: 928 [2021-08-25 20:19:17,618 INFO L226 Difference]: Without dead ends: 531 [2021-08-25 20:19:17,618 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:19:17,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2021-08-25 20:19:17,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2021-08-25 20:19:17,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.5073891625615763) internal successors, (612), 406 states have internal predecessors, (612), 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:17,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 612 transitions. [2021-08-25 20:19:17,629 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 612 transitions. Word has length 86 [2021-08-25 20:19:17,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:17,630 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 612 transitions. [2021-08-25 20:19:17,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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:17,630 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 612 transitions. [2021-08-25 20:19:17,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-25 20:19:17,631 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:17,631 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] [2021-08-25 20:19:17,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 20:19:17,632 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:17,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:17,632 INFO L82 PathProgramCache]: Analyzing trace with hash 681258334, now seen corresponding path program 1 times [2021-08-25 20:19:17,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:19:17,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442411286] [2021-08-25 20:19:17,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:17,633 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:19:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:17,691 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:19:17,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:19:17,692 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442411286] [2021-08-25 20:19:17,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442411286] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:17,692 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:17,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:19:17,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332754198] [2021-08-25 20:19:17,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:19:17,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:19:17,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:19:17,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:19:17,694 INFO L87 Difference]: Start difference. First operand 407 states and 612 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:18,151 INFO L93 Difference]: Finished difference Result 783 states and 1168 transitions. [2021-08-25 20:19:18,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:19:18,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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 86 [2021-08-25 20:19:18,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:18,154 INFO L225 Difference]: With dead ends: 783 [2021-08-25 20:19:18,154 INFO L226 Difference]: Without dead ends: 531 [2021-08-25 20:19:18,155 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:19:18,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2021-08-25 20:19:18,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2021-08-25 20:19:18,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.5024630541871922) internal successors, (610), 406 states have internal predecessors, (610), 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,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 610 transitions. [2021-08-25 20:19:18,167 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 610 transitions. Word has length 86 [2021-08-25 20:19:18,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:18,167 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 610 transitions. [2021-08-25 20:19:18,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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,167 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 610 transitions. [2021-08-25 20:19:18,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-25 20:19:18,171 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:18,171 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:19:18,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 20:19:18,172 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:18,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:18,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1464169915, now seen corresponding path program 1 times [2021-08-25 20:19:18,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:19:18,173 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725424730] [2021-08-25 20:19:18,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:18,173 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:19:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:18,240 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-25 20:19:18,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:19:18,241 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725424730] [2021-08-25 20:19:18,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725424730] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:18,241 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:18,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:19:18,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583541186] [2021-08-25 20:19:18,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:19:18,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:19:18,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:19:18,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:19:18,243 INFO L87 Difference]: Start difference. First operand 407 states and 610 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:18,627 INFO L93 Difference]: Finished difference Result 848 states and 1262 transitions. [2021-08-25 20:19:18,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:19:18,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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 86 [2021-08-25 20:19:18,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:18,630 INFO L225 Difference]: With dead ends: 848 [2021-08-25 20:19:18,630 INFO L226 Difference]: Without dead ends: 451 [2021-08-25 20:19:18,630 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:19:18,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2021-08-25 20:19:18,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2021-08-25 20:19:18,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.4975369458128078) internal successors, (608), 406 states have internal predecessors, (608), 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,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 608 transitions. [2021-08-25 20:19:18,641 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 608 transitions. Word has length 86 [2021-08-25 20:19:18,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:18,641 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 608 transitions. [2021-08-25 20:19:18,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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,641 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 608 transitions. [2021-08-25 20:19:18,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-25 20:19:18,642 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:18,643 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] [2021-08-25 20:19:18,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-25 20:19:18,643 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:18,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:18,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1164108832, now seen corresponding path program 1 times [2021-08-25 20:19:18,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:19:18,644 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796649131] [2021-08-25 20:19:18,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:18,644 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:19:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:18,697 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:19:18,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:19:18,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796649131] [2021-08-25 20:19:18,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796649131] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:18,698 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:18,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:19:18,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855814374] [2021-08-25 20:19:18,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:19:18,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:19:18,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:19:18,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:19:18,700 INFO L87 Difference]: Start difference. First operand 407 states and 608 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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:19,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:19,021 INFO L93 Difference]: Finished difference Result 703 states and 1041 transitions. [2021-08-25 20:19:19,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:19:19,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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 86 [2021-08-25 20:19:19,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:19,024 INFO L225 Difference]: With dead ends: 703 [2021-08-25 20:19:19,025 INFO L226 Difference]: Without dead ends: 451 [2021-08-25 20:19:19,025 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:19:19,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2021-08-25 20:19:19,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2021-08-25 20:19:19,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.4926108374384237) internal successors, (606), 406 states have internal predecessors, (606), 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:19,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 606 transitions. [2021-08-25 20:19:19,035 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 606 transitions. Word has length 86 [2021-08-25 20:19:19,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:19,035 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 606 transitions. [2021-08-25 20:19:19,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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:19,035 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 606 transitions. [2021-08-25 20:19:19,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-08-25 20:19:19,037 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:19,037 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:19:19,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-25 20:19:19,037 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:19,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:19,038 INFO L82 PathProgramCache]: Analyzing trace with hash -956813465, now seen corresponding path program 1 times [2021-08-25 20:19:19,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:19:19,038 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298982482] [2021-08-25 20:19:19,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:19,038 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:19:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:19,091 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-25 20:19:19,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:19:19,091 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298982482] [2021-08-25 20:19:19,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298982482] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:19,091 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:19,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:19:19,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521865842] [2021-08-25 20:19:19,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:19:19,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:19:19,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:19:19,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:19:19,093 INFO L87 Difference]: Start difference. First operand 407 states and 606 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:19:19,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:19,549 INFO L93 Difference]: Finished difference Result 928 states and 1375 transitions. [2021-08-25 20:19:19,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:19:19,550 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:19:19,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:19,552 INFO L225 Difference]: With dead ends: 928 [2021-08-25 20:19:19,552 INFO L226 Difference]: Without dead ends: 531 [2021-08-25 20:19:19,553 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:19:19,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2021-08-25 20:19:19,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2021-08-25 20:19:19,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.4876847290640394) internal successors, (604), 406 states have internal predecessors, (604), 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:19,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 604 transitions. [2021-08-25 20:19:19,563 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 604 transitions. Word has length 87 [2021-08-25 20:19:19,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:19,564 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 604 transitions. [2021-08-25 20:19:19,564 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:19:19,564 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 604 transitions. [2021-08-25 20:19:19,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-08-25 20:19:19,565 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:19,565 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] [2021-08-25 20:19:19,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-25 20:19:19,566 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:19,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:19,566 INFO L82 PathProgramCache]: Analyzing trace with hash 2048176167, now seen corresponding path program 1 times [2021-08-25 20:19:19,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:19:19,567 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868989515] [2021-08-25 20:19:19,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:19,567 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:19:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:19,629 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:19:19,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:19:19,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868989515] [2021-08-25 20:19:19,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868989515] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:19,631 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:19,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:19:19,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290806531] [2021-08-25 20:19:19,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:19:19,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:19:19,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:19:19,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:19:19,633 INFO L87 Difference]: Start difference. First operand 407 states and 604 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:19:20,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:20,055 INFO L93 Difference]: Finished difference Result 777 states and 1149 transitions. [2021-08-25 20:19:20,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:19:20,056 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:19:20,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:20,058 INFO L225 Difference]: With dead ends: 777 [2021-08-25 20:19:20,058 INFO L226 Difference]: Without dead ends: 525 [2021-08-25 20:19:20,059 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:19:20,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2021-08-25 20:19:20,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 407. [2021-08-25 20:19:20,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.4827586206896552) internal successors, (602), 406 states have internal predecessors, (602), 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:20,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 602 transitions. [2021-08-25 20:19:20,070 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 602 transitions. Word has length 87 [2021-08-25 20:19:20,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:20,070 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 602 transitions. [2021-08-25 20:19:20,070 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:19:20,071 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 602 transitions. [2021-08-25 20:19:20,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-08-25 20:19:20,072 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:20,072 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:19:20,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-25 20:19:20,073 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:20,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:20,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1966346533, now seen corresponding path program 1 times [2021-08-25 20:19:20,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:19:20,073 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351236885] [2021-08-25 20:19:20,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:20,074 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:19:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:20,130 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-08-25 20:19:20,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:19:20,131 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351236885] [2021-08-25 20:19:20,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351236885] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:20,131 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:20,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:19:20,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272926638] [2021-08-25 20:19:20,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:19:20,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:19:20,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:19:20,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:19:20,134 INFO L87 Difference]: Start difference. First operand 407 states and 602 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:19:20,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:20,467 INFO L93 Difference]: Finished difference Result 848 states and 1246 transitions. [2021-08-25 20:19:20,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:19:20,468 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:19:20,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:20,470 INFO L225 Difference]: With dead ends: 848 [2021-08-25 20:19:20,470 INFO L226 Difference]: Without dead ends: 451 [2021-08-25 20:19:20,470 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:19:20,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2021-08-25 20:19:20,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2021-08-25 20:19:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.477832512315271) internal successors, (600), 406 states have internal predecessors, (600), 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:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 600 transitions. [2021-08-25 20:19:20,480 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 600 transitions. Word has length 87 [2021-08-25 20:19:20,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:20,480 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 600 transitions. [2021-08-25 20:19:20,480 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:19:20,481 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 600 transitions. [2021-08-25 20:19:20,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-08-25 20:19:20,482 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:20,482 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] [2021-08-25 20:19:20,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-25 20:19:20,483 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:20,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:20,483 INFO L82 PathProgramCache]: Analyzing trace with hash 676368869, now seen corresponding path program 1 times [2021-08-25 20:19:20,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:19:20,484 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372203171] [2021-08-25 20:19:20,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:20,484 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:19:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:20,551 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:19:20,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:19:20,552 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372203171] [2021-08-25 20:19:20,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372203171] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:20,552 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:20,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:19:20,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369096245] [2021-08-25 20:19:20,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:19:20,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:19:20,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:19:20,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:19:20,555 INFO L87 Difference]: Start difference. First operand 407 states and 600 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:19:20,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:20,871 INFO L93 Difference]: Finished difference Result 697 states and 1022 transitions. [2021-08-25 20:19:20,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:19:20,873 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:19:20,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:20,875 INFO L225 Difference]: With dead ends: 697 [2021-08-25 20:19:20,875 INFO L226 Difference]: Without dead ends: 445 [2021-08-25 20:19:20,876 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:19:20,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-08-25 20:19:20,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 407. [2021-08-25 20:19:20,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.4729064039408868) internal successors, (598), 406 states have internal predecessors, (598), 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:20,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 598 transitions. [2021-08-25 20:19:20,885 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 598 transitions. Word has length 87 [2021-08-25 20:19:20,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:20,885 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 598 transitions. [2021-08-25 20:19:20,885 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:19:20,885 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 598 transitions. [2021-08-25 20:19:20,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-25 20:19:20,887 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:20,887 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:19:20,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-25 20:19:20,887 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:20,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:20,888 INFO L82 PathProgramCache]: Analyzing trace with hash 571107934, now seen corresponding path program 1 times [2021-08-25 20:19:20,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:19:20,888 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143114242] [2021-08-25 20:19:20,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:20,889 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:19:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:20,942 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:19:20,943 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:19:20,943 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143114242] [2021-08-25 20:19:20,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143114242] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:20,943 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:20,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:19:20,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502096464] [2021-08-25 20:19:20,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:19:20,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:19:20,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:19:20,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:19:20,946 INFO L87 Difference]: Start difference. First operand 407 states and 598 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:19:21,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:21,403 INFO L93 Difference]: Finished difference Result 904 states and 1330 transitions. [2021-08-25 20:19:21,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:19:21,404 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:19:21,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:21,406 INFO L225 Difference]: With dead ends: 904 [2021-08-25 20:19:21,406 INFO L226 Difference]: Without dead ends: 507 [2021-08-25 20:19:21,407 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:19:21,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2021-08-25 20:19:21,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 407. [2021-08-25 20:19:21,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.4679802955665024) internal successors, (596), 406 states have internal predecessors, (596), 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:21,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 596 transitions. [2021-08-25 20:19:21,417 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 596 transitions. Word has length 88 [2021-08-25 20:19:21,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:21,417 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 596 transitions. [2021-08-25 20:19:21,418 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:19:21,418 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 596 transitions. [2021-08-25 20:19:21,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-25 20:19:21,419 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:21,419 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:19:21,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-25 20:19:21,420 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:21,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:21,421 INFO L82 PathProgramCache]: Analyzing trace with hash 994754656, now seen corresponding path program 1 times [2021-08-25 20:19:21,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:19:21,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69496606] [2021-08-25 20:19:21,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:21,421 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:19:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:21,483 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:19:21,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:19:21,483 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69496606] [2021-08-25 20:19:21,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69496606] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:21,484 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:21,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:19:21,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685095010] [2021-08-25 20:19:21,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:19:21,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:19:21,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:19:21,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:19:21,486 INFO L87 Difference]: Start difference. First operand 407 states and 596 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:19:21,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:21,797 INFO L93 Difference]: Finished difference Result 824 states and 1205 transitions. [2021-08-25 20:19:21,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:19:21,798 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:19:21,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:21,800 INFO L225 Difference]: With dead ends: 824 [2021-08-25 20:19:21,800 INFO L226 Difference]: Without dead ends: 427 [2021-08-25 20:19:21,801 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:19:21,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-08-25 20:19:21,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 407. [2021-08-25 20:19:21,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.4630541871921183) internal successors, (594), 406 states have internal predecessors, (594), 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:21,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 594 transitions. [2021-08-25 20:19:21,811 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 594 transitions. Word has length 88 [2021-08-25 20:19:21,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:21,812 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 594 transitions. [2021-08-25 20:19:21,812 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:19:21,812 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 594 transitions. [2021-08-25 20:19:21,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-25 20:19:21,813 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:21,813 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] [2021-08-25 20:19:21,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-25 20:19:21,814 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:21,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:21,815 INFO L82 PathProgramCache]: Analyzing trace with hash -433365501, now seen corresponding path program 1 times [2021-08-25 20:19:21,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:19:21,815 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734985659] [2021-08-25 20:19:21,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:21,815 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:19:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:21,873 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:19:21,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:19:21,873 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734985659] [2021-08-25 20:19:21,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734985659] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:21,874 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:21,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:19:21,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859718124] [2021-08-25 20:19:21,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:19:21,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:19:21,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:19:21,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:19:21,877 INFO L87 Difference]: Start difference. First operand 407 states and 594 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:19:22,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:22,317 INFO L93 Difference]: Finished difference Result 904 states and 1322 transitions. [2021-08-25 20:19:22,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:19:22,318 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:19:22,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:22,320 INFO L225 Difference]: With dead ends: 904 [2021-08-25 20:19:22,321 INFO L226 Difference]: Without dead ends: 507 [2021-08-25 20:19:22,321 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:19:22,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2021-08-25 20:19:22,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 407. [2021-08-25 20:19:22,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.458128078817734) internal successors, (592), 406 states have internal predecessors, (592), 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:22,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 592 transitions. [2021-08-25 20:19:22,334 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 592 transitions. Word has length 89 [2021-08-25 20:19:22,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:22,335 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 592 transitions. [2021-08-25 20:19:22,335 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:19:22,335 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 592 transitions. [2021-08-25 20:19:22,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-25 20:19:22,336 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:22,336 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] [2021-08-25 20:19:22,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-25 20:19:22,337 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:22,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:22,337 INFO L82 PathProgramCache]: Analyzing trace with hash -185219007, now seen corresponding path program 1 times [2021-08-25 20:19:22,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:19:22,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684873541] [2021-08-25 20:19:22,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:22,339 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:19:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:22,390 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:19:22,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:19:22,390 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684873541] [2021-08-25 20:19:22,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684873541] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:22,391 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:22,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:19:22,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514639264] [2021-08-25 20:19:22,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:19:22,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:19:22,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:19:22,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:19:22,392 INFO L87 Difference]: Start difference. First operand 407 states and 592 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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:19:22,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:22,458 INFO L93 Difference]: Finished difference Result 805 states and 1178 transitions. [2021-08-25 20:19:22,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:19:22,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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 89 [2021-08-25 20:19:22,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:22,461 INFO L225 Difference]: With dead ends: 805 [2021-08-25 20:19:22,461 INFO L226 Difference]: Without dead ends: 555 [2021-08-25 20:19:22,462 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:19:22,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-08-25 20:19:22,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2021-08-25 20:19:22,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 554 states have (on average 1.4530685920577617) internal successors, (805), 554 states have internal predecessors, (805), 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:22,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 805 transitions. [2021-08-25 20:19:22,481 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 805 transitions. Word has length 89 [2021-08-25 20:19:22,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:22,482 INFO L470 AbstractCegarLoop]: Abstraction has 555 states and 805 transitions. [2021-08-25 20:19:22,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 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:19:22,482 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 805 transitions. [2021-08-25 20:19:22,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-08-25 20:19:22,483 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:22,484 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] [2021-08-25 20:19:22,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-25 20:19:22,484 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:22,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:22,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1027809079, now seen corresponding path program 1 times [2021-08-25 20:19:22,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:19:22,485 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736890737] [2021-08-25 20:19:22,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:22,485 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:19:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:22,543 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:19:22,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:19:22,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736890737] [2021-08-25 20:19:22,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736890737] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:22,544 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:22,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:19:22,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772066376] [2021-08-25 20:19:22,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:19:22,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:19:22,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:19:22,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:19:22,547 INFO L87 Difference]: Start difference. First operand 555 states and 805 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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:19:22,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:22,583 INFO L93 Difference]: Finished difference Result 1102 states and 1605 transitions. [2021-08-25 20:19:22,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:19:22,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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 91 [2021-08-25 20:19:22,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:22,587 INFO L225 Difference]: With dead ends: 1102 [2021-08-25 20:19:22,587 INFO L226 Difference]: Without dead ends: 704 [2021-08-25 20:19:22,588 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:19:22,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2021-08-25 20:19:22,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2021-08-25 20:19:22,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 703 states have (on average 1.4551920341394025) internal successors, (1023), 703 states have internal predecessors, (1023), 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:22,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1023 transitions. [2021-08-25 20:19:22,604 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1023 transitions. Word has length 91 [2021-08-25 20:19:22,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:22,604 INFO L470 AbstractCegarLoop]: Abstraction has 704 states and 1023 transitions. [2021-08-25 20:19:22,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 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:19:22,605 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1023 transitions. [2021-08-25 20:19:22,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-08-25 20:19:22,606 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:22,606 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] [2021-08-25 20:19:22,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-25 20:19:22,607 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:22,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:22,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1254631592, now seen corresponding path program 1 times [2021-08-25 20:19:22,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:19:22,608 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912230366] [2021-08-25 20:19:22,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:22,608 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:19:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:19:22,818 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 20:19:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:19:23,048 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-25 20:19:23,048 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 20:19:23,049 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:19:23,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-25 20:19:23,056 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:19:23,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:19:23 BoogieIcfgContainer [2021-08-25 20:19:23,173 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:19:23,174 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:19:23,174 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:19:23,174 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:19:23,175 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:19:11" (3/4) ... [2021-08-25 20:19:23,178 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-25 20:19:23,178 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:19:23,180 INFO L168 Benchmark]: Toolchain (without parser) took 13936.96 ms. Allocated memory was 58.7 MB in the beginning and 195.0 MB in the end (delta: 136.3 MB). Free memory was 43.1 MB in the beginning and 66.3 MB in the end (delta: -23.2 MB). Peak memory consumption was 111.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:19:23,180 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 48.2 MB. Free memory was 30.8 MB in the beginning and 30.8 MB in the end (delta: 31.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:19:23,180 INFO L168 Benchmark]: CACSL2BoogieTranslator took 800.17 ms. Allocated memory is still 58.7 MB. Free memory was 42.8 MB in the beginning and 35.1 MB in the end (delta: 7.7 MB). Peak memory consumption was 19.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:19:23,181 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.27 ms. Allocated memory is still 58.7 MB. Free memory was 35.1 MB in the beginning and 30.8 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:19:23,181 INFO L168 Benchmark]: Boogie Preprocessor took 63.19 ms. Allocated memory is still 58.7 MB. Free memory was 30.8 MB in the beginning and 24.4 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:19:23,181 INFO L168 Benchmark]: RCFGBuilder took 1541.53 ms. Allocated memory was 58.7 MB in the beginning and 75.5 MB in the end (delta: 16.8 MB). Free memory was 24.2 MB in the beginning and 39.9 MB in the end (delta: -15.7 MB). Peak memory consumption was 13.9 MB. Max. memory is 16.1 GB. [2021-08-25 20:19:23,182 INFO L168 Benchmark]: TraceAbstraction took 11440.43 ms. Allocated memory was 75.5 MB in the beginning and 195.0 MB in the end (delta: 119.5 MB). Free memory was 39.5 MB in the beginning and 67.4 MB in the end (delta: -27.9 MB). Peak memory consumption was 92.6 MB. Max. memory is 16.1 GB. [2021-08-25 20:19:23,182 INFO L168 Benchmark]: Witness Printer took 4.39 ms. Allocated memory is still 195.0 MB. Free memory is still 66.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:19:23,183 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.29 ms. Allocated memory is still 48.2 MB. Free memory was 30.8 MB in the beginning and 30.8 MB in the end (delta: 31.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 800.17 ms. Allocated memory is still 58.7 MB. Free memory was 42.8 MB in the beginning and 35.1 MB in the end (delta: 7.7 MB). Peak memory consumption was 19.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 79.27 ms. Allocated memory is still 58.7 MB. Free memory was 35.1 MB in the beginning and 30.8 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 63.19 ms. Allocated memory is still 58.7 MB. Free memory was 30.8 MB in the beginning and 24.4 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1541.53 ms. Allocated memory was 58.7 MB in the beginning and 75.5 MB in the end (delta: 16.8 MB). Free memory was 24.2 MB in the beginning and 39.9 MB in the end (delta: -15.7 MB). Peak memory consumption was 13.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 11440.43 ms. Allocated memory was 75.5 MB in the beginning and 195.0 MB in the end (delta: 119.5 MB). Free memory was 39.5 MB in the beginning and 67.4 MB in the end (delta: -27.9 MB). Peak memory consumption was 92.6 MB. Max. memory is 16.1 GB. * Witness Printer took 4.39 ms. Allocated memory is still 195.0 MB. Free memory is still 66.3 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: 1643]: 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 1338. 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 ; [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 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 = __VERIFIER_nondet_int() ; [L1098] int tmp___8 = __VERIFIER_nondet_int() ; [L1099] long tmp___9 = __VERIFIER_nondet_long() ; [L1100] int blastFlag ; [L1103] blastFlag = 0 [L1104] s->hit=__VERIFIER_nondet_int () [L1105] s->state = 12292 [L1106] tmp = __VERIFIER_nondet_int() [L1107] cb = (void (*)())((void *)0) [L1108] ret = -1 [L1109] skip = 0 [L1110] EXPR s->info_callback VAL [init=1, SSLv3_client_data={6:0}] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR s->info_callback [L1111] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={6:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={6:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1133] COND TRUE s->state == 12292 [L1236] s->new_session = 1 [L1237] s->state = 4096 [L1238] EXPR s->ctx [L1238] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1238] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1243] s->server = 0 VAL [init=1, SSLv3_client_data={6:0}] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={6:0}] [L1249] EXPR s->version VAL [init=1, SSLv3_client_data={6:0}] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] s->type = 4096 [L1256] EXPR s->init_buf VAL [init=1, SSLv3_client_data={6:0}] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1274] COND FALSE !(! tmp___4) VAL [init=1, SSLv3_client_data={6:0}] [L1280] COND FALSE !(! tmp___5) [L1286] s->state = 4368 [L1287] EXPR s->ctx [L1287] EXPR (s->ctx)->stats.sess_connect [L1287] (s->ctx)->stats.sess_connect += 1 [L1288] s->init_num = 0 VAL [init=1, SSLv3_client_data={6:0}] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={6:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={6:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={6:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1148] COND TRUE s->state == 4368 [L1292] s->shutdown = 0 [L1293] ret = __VERIFIER_nondet_int() [L1294] COND TRUE blastFlag == 0 [L1295] blastFlag = 1 VAL [init=1, SSLv3_client_data={6:0}] [L1299] COND FALSE !(ret <= 0) [L1304] s->state = 4384 [L1305] s->init_num = 0 [L1306] EXPR s->bbio [L1306] EXPR s->wbio VAL [init=1, SSLv3_client_data={6:0}] [L1306] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={6:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={6:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={6:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1154] COND TRUE s->state == 4384 [L1314] ret = __VERIFIER_nondet_int() [L1315] COND TRUE blastFlag == 1 [L1316] blastFlag = 2 VAL [init=1, SSLv3_client_data={6:0}] [L1324] COND FALSE !(ret <= 0) [L1329] s->hit VAL [init=1, SSLv3_client_data={6:0}] [L1329] COND FALSE !(s->hit) [L1332] s->state = 4400 VAL [init=1, SSLv3_client_data={6:0}] [L1334] s->init_num = 0 VAL [init=1, SSLv3_client_data={6:0}] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={6:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={6:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={6:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1160] COND TRUE s->state == 4400 [L1338] EXPR s->s3 [L1338] EXPR (s->s3)->tmp.new_cipher [L1338] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={6:0}] [L1338] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 2 [L1343] blastFlag = 3 VAL [init=1, SSLv3_client_data={6:0}] [L1347] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={6:0}] [L1353] s->state = 4416 [L1354] s->init_num = 0 VAL [init=1, SSLv3_client_data={6:0}] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={6:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={6:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={6:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1166] COND TRUE s->state == 4416 [L1358] ret = __VERIFIER_nondet_int() [L1359] COND TRUE blastFlag == 3 [L1360] blastFlag = 4 VAL [init=1, SSLv3_client_data={6:0}] [L1364] COND FALSE !(ret <= 0) [L1369] s->state = 4432 [L1370] s->init_num = 0 VAL [init=1, SSLv3_client_data={6:0}] [L1371] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={6:0}] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={6:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={6:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={6:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [init=1, SSLv3_client_data={6:0}] [L1172] COND TRUE s->state == 4432 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={6:0}] [L1643] reach_error() VAL [init=1, SSLv3_client_data={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11271.0ms, OverallIterations: 24, TraceHistogramMax: 6, EmptinessCheckTime: 43.5ms, AutomataDifference: 8357.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 11.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 5055 SDtfs, 1779 SDslu, 6314 SDs, 0 SdLazy, 3604 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6293.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 46 SyntacticMatches, 19 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 364.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=704occurred in iteration=23, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 302.1ms AutomataMinimizationTime, 23 MinimizatonAttempts, 1525 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 130.7ms SsaConstructionTime, 676.2ms SatisfiabilityAnalysisTime, 1186.7ms InterpolantComputationTime, 1918 NumberOfCodeBlocks, 1918 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1783 ConstructedInterpolants, 0 QuantifiedInterpolants, 4707 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 1532/1532 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:19:23,225 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:19:25,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:19:25,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:19:25,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:19:25,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:19:25,158 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:19:25,159 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:19:25,161 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:19:25,162 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:19:25,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:19:25,164 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:19:25,165 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:19:25,166 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:19:25,166 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:19:25,168 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:19:25,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:19:25,169 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:19:25,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:19:25,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:19:25,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:19:25,174 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:19:25,175 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:19:25,176 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:19:25,177 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:19:25,179 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:19:25,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:19:25,180 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:19:25,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:19:25,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:19:25,182 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:19:25,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:19:25,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:19:25,184 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:19:25,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:19:25,185 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:19:25,185 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:19:25,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:19:25,186 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:19:25,187 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:19:25,188 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:19:25,188 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:19:25,189 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:19:25,210 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:19:25,216 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:19:25,217 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:19:25,218 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:19:25,219 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:19:25,219 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:19:25,220 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:19:25,220 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:19:25,220 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:19:25,220 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:19:25,221 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:19:25,221 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:19:25,221 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:19:25,222 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:19:25,222 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-25 20:19:25,222 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-25 20:19:25,222 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:19:25,222 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:19:25,222 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:19:25,223 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:19:25,233 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:19:25,233 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:19:25,233 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:19:25,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:19:25,234 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:19:25,234 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:19:25,234 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:19:25,234 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-25 20:19:25,234 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-25 20:19:25,234 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:19:25,235 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:19:25,235 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-25 20:19:25,235 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 -> 8334dcb0cdaf6693a0e55f9663f2e64fc956eb05 [2021-08-25 20:19:25,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:19:25,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:19:25,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:19:25,615 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:19:25,616 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:19:25,618 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_clnt.blast.03.i.cil-1.c [2021-08-25 20:19:25,697 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6582abbad/d7b2516001174cd69e9dd4eae3b6d585/FLAG6866ca9d0 [2021-08-25 20:19:26,317 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:19:26,320 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.03.i.cil-1.c [2021-08-25 20:19:26,335 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6582abbad/d7b2516001174cd69e9dd4eae3b6d585/FLAG6866ca9d0 [2021-08-25 20:19:26,700 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6582abbad/d7b2516001174cd69e9dd4eae3b6d585 [2021-08-25 20:19:26,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:19:26,704 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:19:26,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:19:26,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:19:26,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:19:26,710 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:19:26" (1/1) ... [2021-08-25 20:19:26,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75992ad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:19:26, skipping insertion in model container [2021-08-25 20:19:26,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:19:26" (1/1) ... [2021-08-25 20:19:26,717 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:19:26,762 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:19:27,155 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.03.i.cil-1.c[64353,64366] [2021-08-25 20:19:27,169 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:19:27,189 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:19:27,276 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.03.i.cil-1.c[64353,64366] [2021-08-25 20:19:27,279 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:19:27,294 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:19:27,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:19:27 WrapperNode [2021-08-25 20:19:27,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:19:27,296 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:19:27,296 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:19:27,296 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:19:27,309 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:19:27" (1/1) ... [2021-08-25 20:19:27,340 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:19:27" (1/1) ... [2021-08-25 20:19:27,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:19:27,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:19:27,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:19:27,401 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:19:27,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:19:27" (1/1) ... [2021-08-25 20:19:27,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:19:27" (1/1) ... [2021-08-25 20:19:27,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:19:27" (1/1) ... [2021-08-25 20:19:27,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:19:27" (1/1) ... [2021-08-25 20:19:27,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:19:27" (1/1) ... [2021-08-25 20:19:27,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:19:27" (1/1) ... [2021-08-25 20:19:27,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:19:27" (1/1) ... [2021-08-25 20:19:27,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:19:27,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:19:27,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:19:27,517 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:19:27,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:19:27" (1/1) ... [2021-08-25 20:19:27,524 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:19:27,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:19:27,546 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:19:27,568 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:19:27,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-25 20:19:27,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-25 20:19:27,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:19:27,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-25 20:19:27,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-25 20:19:27,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-25 20:19:27,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:19:27,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:19:27,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-25 20:19:27,935 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:19:31,219 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-08-25 20:19:31,220 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-08-25 20:19:31,227 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:19:31,227 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:19:31,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:19:31 BoogieIcfgContainer [2021-08-25 20:19:31,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:19:31,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:19:31,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:19:31,233 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:19:31,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:19:26" (1/3) ... [2021-08-25 20:19:31,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3392d49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:19:31, skipping insertion in model container [2021-08-25 20:19:31,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:19:27" (2/3) ... [2021-08-25 20:19:31,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3392d49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:19:31, skipping insertion in model container [2021-08-25 20:19:31,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:19:31" (3/3) ... [2021-08-25 20:19:31,236 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03.i.cil-1.c [2021-08-25 20:19:31,241 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:19:31,241 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:19:31,285 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:19:31,292 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:19:31,292 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:19:31,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 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:31,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-25 20:19:31,339 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:31,340 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:19:31,340 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:31,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:31,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2021-08-25 20:19:31,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:19:31,355 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180743260] [2021-08-25 20:19:31,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:31,355 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:19:31,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:19:31,357 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:19:31,360 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:19:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:31,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:19:31,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:19:31,744 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:19:31,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:19:31,917 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:19:31,918 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:19:31,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180743260] [2021-08-25 20:19:31,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1180743260] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:31,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:31,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 20:19:31,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907773003] [2021-08-25 20:19:31,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:19:31,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:19:31,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:19:31,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:19:31,938 INFO L87 Difference]: Start difference. First operand has 129 states, 127 states have (on average 1.7086614173228347) internal successors, (217), 128 states have internal predecessors, (217), 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:19:32,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:32,083 INFO L93 Difference]: Finished difference Result 485 states and 820 transitions. [2021-08-25 20:19:32,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:19:32,085 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:19:32,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:32,102 INFO L225 Difference]: With dead ends: 485 [2021-08-25 20:19:32,102 INFO L226 Difference]: Without dead ends: 312 [2021-08-25 20:19:32,106 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:19:32,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-08-25 20:19:32,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2021-08-25 20:19:32,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 1.5016077170418007) internal successors, (467), 311 states have internal predecessors, (467), 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:32,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 467 transitions. [2021-08-25 20:19:32,179 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 467 transitions. Word has length 24 [2021-08-25 20:19:32,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:32,179 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 467 transitions. [2021-08-25 20:19:32,179 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:19:32,180 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 467 transitions. [2021-08-25 20:19:32,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-25 20:19:32,182 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:32,182 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:19:32,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-08-25 20:19:32,392 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:19:32,392 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:32,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:32,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1854239308, now seen corresponding path program 1 times [2021-08-25 20:19:32,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:19:32,394 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516357270] [2021-08-25 20:19:32,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:32,394 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:19:32,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:19:32,397 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:19:32,398 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:19:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:32,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:19:32,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:19:32,857 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:19:32,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:19:33,107 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:19:33,108 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:19:33,108 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1516357270] [2021-08-25 20:19:33,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1516357270] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:33,109 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:33,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 20:19:33,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110519266] [2021-08-25 20:19:33,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:19:33,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:19:33,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:19:33,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:19:33,113 INFO L87 Difference]: Start difference. First operand 312 states and 467 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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:34,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:34,130 INFO L93 Difference]: Finished difference Result 716 states and 1078 transitions. [2021-08-25 20:19:34,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:19:34,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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 60 [2021-08-25 20:19:34,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:34,133 INFO L225 Difference]: With dead ends: 716 [2021-08-25 20:19:34,134 INFO L226 Difference]: Without dead ends: 512 [2021-08-25 20:19:34,138 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:19:34,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2021-08-25 20:19:34,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2021-08-25 20:19:34,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 511 states have (on average 1.4951076320939334) internal successors, (764), 511 states have internal predecessors, (764), 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:34,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 764 transitions. [2021-08-25 20:19:34,168 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 764 transitions. Word has length 60 [2021-08-25 20:19:34,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:34,169 INFO L470 AbstractCegarLoop]: Abstraction has 512 states and 764 transitions. [2021-08-25 20:19:34,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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:34,169 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 764 transitions. [2021-08-25 20:19:34,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:19:34,173 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:34,174 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] [2021-08-25 20:19:34,187 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:19:34,384 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:19:34,385 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:34,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:34,385 INFO L82 PathProgramCache]: Analyzing trace with hash 922615118, now seen corresponding path program 1 times [2021-08-25 20:19:34,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:19:34,386 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [545320794] [2021-08-25 20:19:34,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:34,387 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:19:34,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:19:34,389 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:19:34,390 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:19:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:34,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:19:34,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:19:36,473 INFO L354 Elim1Store]: treesize reduction 182, result has 23.2 percent of original size [2021-08-25 20:19:36,474 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:19:36,582 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-08-25 20:19:36,583 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:19:36,616 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:19:36,940 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:19:36,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:19:37,335 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:19:37,335 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:19:37,336 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [545320794] [2021-08-25 20:19:37,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [545320794] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:37,337 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:37,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-25 20:19:37,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644153948] [2021-08-25 20:19:37,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:19:37,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:19:37,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:19:37,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:19:37,342 INFO L87 Difference]: Start difference. First operand 512 states and 764 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 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:19:38,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:38,951 INFO L93 Difference]: Finished difference Result 1021 states and 1522 transitions. [2021-08-25 20:19:38,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:19:38,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 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 98 [2021-08-25 20:19:38,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:38,958 INFO L225 Difference]: With dead ends: 1021 [2021-08-25 20:19:38,958 INFO L226 Difference]: Without dead ends: 516 [2021-08-25 20:19:38,959 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:19:38,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2021-08-25 20:19:38,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 515. [2021-08-25 20:19:38,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 514 states have (on average 1.4922178988326849) internal successors, (767), 514 states have internal predecessors, (767), 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:38,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 767 transitions. [2021-08-25 20:19:38,972 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 767 transitions. Word has length 98 [2021-08-25 20:19:38,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:38,973 INFO L470 AbstractCegarLoop]: Abstraction has 515 states and 767 transitions. [2021-08-25 20:19:38,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 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:19:38,973 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 767 transitions. [2021-08-25 20:19:38,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-08-25 20:19:38,976 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:38,976 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] [2021-08-25 20:19:38,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-25 20:19:39,180 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:19:39,181 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:39,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:39,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1354155866, now seen corresponding path program 1 times [2021-08-25 20:19:39,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:19:39,182 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939991512] [2021-08-25 20:19:39,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:39,183 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:19:39,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:19:39,196 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:19:39,199 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:19:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:19:39,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:19:39,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:19:39,762 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:19:39,801 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:19:39,802 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:19:40,041 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-25 20:19:40,041 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:40,210 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:19:40,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:19:40,644 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:19:40,644 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:19:40,644 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939991512] [2021-08-25 20:19:40,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939991512] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:19:40,645 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:19:40,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2021-08-25 20:19:40,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085440824] [2021-08-25 20:19:40,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-25 20:19:40,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:19:40,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-25 20:19:40,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:19:40,647 INFO L87 Difference]: Start difference. First operand 515 states and 767 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 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:19:48,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:19:48,114 INFO L93 Difference]: Finished difference Result 1748 states and 2616 transitions. [2021-08-25 20:19:48,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-25 20:19:48,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 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 112 [2021-08-25 20:19:48,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:19:48,123 INFO L225 Difference]: With dead ends: 1748 [2021-08-25 20:19:48,123 INFO L226 Difference]: Without dead ends: 1243 [2021-08-25 20:19:48,125 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 216 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 88.1ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-08-25 20:19:48,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2021-08-25 20:19:48,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 618. [2021-08-25 20:19:48,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 617 states have (on average 1.5235008103727714) internal successors, (940), 617 states have internal predecessors, (940), 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:48,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 940 transitions. [2021-08-25 20:19:48,150 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 940 transitions. Word has length 112 [2021-08-25 20:19:48,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:19:48,150 INFO L470 AbstractCegarLoop]: Abstraction has 618 states and 940 transitions. [2021-08-25 20:19:48,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 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:19:48,151 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 940 transitions. [2021-08-25 20:19:48,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-08-25 20:19:48,153 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:19:48,153 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] [2021-08-25 20:19:48,177 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:19:48,367 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:19:48,367 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:19:48,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:19:48,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1254631592, now seen corresponding path program 1 times [2021-08-25 20:19:48,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:19:48,369 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28008946] [2021-08-25 20:19:48,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:19:48,377 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:19:48,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:19:48,378 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:19:48,390 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:19:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:19:48,976 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 20:19:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:19:49,576 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-08-25 20:19:49,576 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 20:19:49,577 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:19:49,599 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:19:49,796 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:19:49,802 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:19:49,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:19:49 BoogieIcfgContainer [2021-08-25 20:19:49,940 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:19:49,941 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:19:49,941 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:19:49,941 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:19:49,941 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:19:31" (3/4) ... [2021-08-25 20:19:49,943 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-25 20:19:50,043 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 20:19:50,044 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:19:50,044 INFO L168 Benchmark]: Toolchain (without parser) took 23340.06 ms. Allocated memory was 65.0 MB in the beginning and 96.5 MB in the end (delta: 31.5 MB). Free memory was 43.0 MB in the beginning and 34.1 MB in the end (delta: 8.9 MB). Peak memory consumption was 39.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:19:50,045 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 65.0 MB. Free memory is still 46.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:19:50,045 INFO L168 Benchmark]: CACSL2BoogieTranslator took 589.60 ms. Allocated memory is still 65.0 MB. Free memory was 42.8 MB in the beginning and 30.5 MB in the end (delta: 12.3 MB). Peak memory consumption was 14.6 MB. Max. memory is 16.1 GB. [2021-08-25 20:19:50,046 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.43 ms. Allocated memory was 65.0 MB in the beginning and 79.7 MB in the end (delta: 14.7 MB). Free memory was 30.4 MB in the beginning and 56.7 MB in the end (delta: -26.3 MB). Peak memory consumption was 5.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:19:50,046 INFO L168 Benchmark]: Boogie Preprocessor took 113.72 ms. Allocated memory is still 79.7 MB. Free memory was 56.7 MB in the beginning and 50.0 MB in the end (delta: 6.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-08-25 20:19:50,046 INFO L168 Benchmark]: RCFGBuilder took 3713.98 ms. Allocated memory is still 79.7 MB. Free memory was 50.0 MB in the beginning and 34.5 MB in the end (delta: 15.5 MB). Peak memory consumption was 21.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:19:50,047 INFO L168 Benchmark]: TraceAbstraction took 18709.78 ms. Allocated memory was 79.7 MB in the beginning and 96.5 MB in the end (delta: 16.8 MB). Free memory was 34.0 MB in the beginning and 46.8 MB in the end (delta: -12.7 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. [2021-08-25 20:19:50,047 INFO L168 Benchmark]: Witness Printer took 102.85 ms. Allocated memory is still 96.5 MB. Free memory was 46.8 MB in the beginning and 34.1 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-25 20:19:50,049 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.26 ms. Allocated memory is still 65.0 MB. Free memory is still 46.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 589.60 ms. Allocated memory is still 65.0 MB. Free memory was 42.8 MB in the beginning and 30.5 MB in the end (delta: 12.3 MB). Peak memory consumption was 14.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 104.43 ms. Allocated memory was 65.0 MB in the beginning and 79.7 MB in the end (delta: 14.7 MB). Free memory was 30.4 MB in the beginning and 56.7 MB in the end (delta: -26.3 MB). Peak memory consumption was 5.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 113.72 ms. Allocated memory is still 79.7 MB. Free memory was 56.7 MB in the beginning and 50.0 MB in the end (delta: 6.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3713.98 ms. Allocated memory is still 79.7 MB. Free memory was 50.0 MB in the beginning and 34.5 MB in the end (delta: 15.5 MB). Peak memory consumption was 21.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 18709.78 ms. Allocated memory was 79.7 MB in the beginning and 96.5 MB in the end (delta: 16.8 MB). Free memory was 34.0 MB in the beginning and 46.8 MB in the end (delta: -12.7 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. * Witness Printer took 102.85 ms. Allocated memory is still 96.5 MB. Free memory was 46.8 MB in the beginning and 34.1 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 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: 1643]: 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={79: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 ; [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 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 = __VERIFIER_nondet_int() ; [L1098] int tmp___8 = __VERIFIER_nondet_int() ; [L1099] long tmp___9 = __VERIFIER_nondet_long() ; [L1100] int blastFlag ; [L1103] blastFlag = 0 [L1104] s->hit=__VERIFIER_nondet_int () [L1105] s->state = 12292 [L1106] tmp = __VERIFIER_nondet_int() [L1107] cb = (void (*)())((void *)0) [L1108] ret = -1 [L1109] skip = 0 [L1110] EXPR s->info_callback VAL [init=1, SSLv3_client_data={79:0}] [L1110] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1111] EXPR s->info_callback [L1111] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={79:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={79:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1133] COND TRUE s->state == 12292 [L1236] s->new_session = 1 [L1237] s->state = 4096 [L1238] EXPR s->ctx [L1238] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1238] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1243] s->server = 0 VAL [init=1, SSLv3_client_data={79:0}] [L1244] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={79:0}] [L1249] EXPR s->version VAL [init=1, SSLv3_client_data={79:0}] [L1249] COND FALSE !((s->version & 65280) != 768) [L1255] s->type = 4096 [L1256] EXPR s->init_buf VAL [init=1, SSLv3_client_data={79:0}] [L1256] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1274] COND FALSE !(! tmp___4) VAL [init=1, SSLv3_client_data={79:0}] [L1280] COND FALSE !(! tmp___5) [L1286] s->state = 4368 [L1287] EXPR s->ctx [L1287] EXPR (s->ctx)->stats.sess_connect [L1287] (s->ctx)->stats.sess_connect += 1 [L1288] s->init_num = 0 VAL [init=1, SSLv3_client_data={79:0}] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={79:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={79:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={79:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1148] COND TRUE s->state == 4368 [L1292] s->shutdown = 0 [L1293] ret = __VERIFIER_nondet_int() [L1294] COND TRUE blastFlag == 0 [L1295] blastFlag = 1 VAL [init=1, SSLv3_client_data={79:0}] [L1299] COND FALSE !(ret <= 0) [L1304] s->state = 4384 [L1305] s->init_num = 0 [L1306] EXPR s->bbio [L1306] EXPR s->wbio VAL [init=1, SSLv3_client_data={79:0}] [L1306] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={79:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={79:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={79:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1154] COND TRUE s->state == 4384 [L1314] ret = __VERIFIER_nondet_int() [L1315] COND TRUE blastFlag == 1 [L1316] blastFlag = 2 VAL [init=1, SSLv3_client_data={79:0}] [L1324] COND FALSE !(ret <= 0) [L1329] s->hit VAL [init=1, SSLv3_client_data={79:0}] [L1329] COND FALSE !(s->hit) [L1332] s->state = 4400 VAL [init=1, SSLv3_client_data={79:0}] [L1334] s->init_num = 0 VAL [init=1, SSLv3_client_data={79:0}] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={79:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={79:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={79:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1160] COND TRUE s->state == 4400 [L1338] EXPR s->s3 [L1338] EXPR (s->s3)->tmp.new_cipher [L1338] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={79:0}] [L1338] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 2 [L1343] blastFlag = 3 VAL [init=1, SSLv3_client_data={79:0}] [L1347] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={79:0}] [L1353] s->state = 4416 [L1354] s->init_num = 0 VAL [init=1, SSLv3_client_data={79:0}] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={79:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={79:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={79:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1166] COND TRUE s->state == 4416 [L1358] ret = __VERIFIER_nondet_int() [L1359] COND TRUE blastFlag == 3 [L1360] blastFlag = 4 VAL [init=1, SSLv3_client_data={79:0}] [L1364] COND FALSE !(ret <= 0) [L1369] s->state = 4432 [L1370] s->init_num = 0 VAL [init=1, SSLv3_client_data={79:0}] [L1371] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={79:0}] [L1602] EXPR s->s3 [L1602] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={79:0}] [L1602] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1631] skip = 0 VAL [init=1, SSLv3_client_data={79:0}] [L1130] COND TRUE 1 VAL [init=1, SSLv3_client_data={79:0}] [L1132] EXPR s->state [L1132] state = s->state [L1133] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1133] COND FALSE !(s->state == 12292) [L1136] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1136] COND FALSE !(s->state == 16384) [L1139] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1139] COND FALSE !(s->state == 4096) [L1142] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1142] COND FALSE !(s->state == 20480) [L1145] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1145] COND FALSE !(s->state == 4099) [L1148] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1148] COND FALSE !(s->state == 4368) [L1151] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1151] COND FALSE !(s->state == 4369) [L1154] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1154] COND FALSE !(s->state == 4384) [L1157] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1157] COND FALSE !(s->state == 4385) [L1160] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1160] COND FALSE !(s->state == 4400) [L1163] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1163] COND FALSE !(s->state == 4401) [L1166] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1166] COND FALSE !(s->state == 4416) [L1169] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1169] COND FALSE !(s->state == 4417) [L1172] EXPR s->state VAL [init=1, SSLv3_client_data={79:0}] [L1172] COND TRUE s->state == 4432 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={79:0}] [L1643] reach_error() VAL [init=1, SSLv3_client_data={79:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18521.3ms, OverallIterations: 5, TraceHistogramMax: 6, EmptinessCheckTime: 43.3ms, AutomataDifference: 10305.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 14.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 823 SDtfs, 956 SDslu, 1400 SDs, 0 SdLazy, 746 SolverSat, 92 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9261.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 583 GetRequests, 567 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 155.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=618occurred in iteration=4, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 129.9ms AutomataMinimizationTime, 4 MinimizatonAttempts, 626 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 220.0ms SsaConstructionTime, 770.7ms SatisfiabilityAnalysisTime, 4590.8ms InterpolantComputationTime, 406 NumberOfCodeBlocks, 406 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 580 ConstructedInterpolants, 0 QuantifiedInterpolants, 1274 SizeOfPredicates, 8 NumberOfNonLiveVariables, 850 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 592/592 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:50,103 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...