./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_clnt.blast.02.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.02.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 bbd47246d88fcb39767f657e10b2743b89754c4e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.02.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 bbd47246d88fcb39767f657e10b2743b89754c4e ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:18:00,140 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:18:00,142 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:18:00,173 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:18:00,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:18:00,177 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:18:00,178 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:18:00,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:18:00,186 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:18:00,193 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:18:00,194 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:18:00,194 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:18:00,195 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:18:00,195 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:18:00,196 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:18:00,196 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:18:00,197 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:18:00,197 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:18:00,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:18:00,199 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:18:00,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:18:00,201 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:18:00,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:18:00,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:18:00,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:18:00,204 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:18:00,204 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:18:00,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:18:00,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:18:00,205 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:18:00,205 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:18:00,206 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:18:00,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:18:00,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:18:00,207 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:18:00,208 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:18:00,208 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:18:00,208 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:18:00,208 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:18:00,209 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:18:00,209 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:18:00,210 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:18:00,228 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:18:00,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:18:00,228 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:18:00,228 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:18:00,229 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:18:00,229 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:18:00,229 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:18:00,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:18:00,230 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:18:00,230 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 20:18:00,230 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:18:00,230 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:18:00,230 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:18:00,230 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:18:00,230 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:18:00,231 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:18:00,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:18:00,231 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:18:00,231 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:18:00,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:18:00,231 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:18:00,231 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:18:00,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:18:00,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:18:00,238 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:18:00,238 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:18:00,239 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 20:18:00,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 20:18:00,239 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:18:00,239 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:18:00,239 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 -> bbd47246d88fcb39767f657e10b2743b89754c4e [2021-08-25 20:18:00,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:18:00,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:18:00,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:18:00,517 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:18:00,517 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:18:00,518 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_clnt.blast.02.i.cil-1.c [2021-08-25 20:18:00,572 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4809ce330/c001690bee2c4f35bba90adcd7b40d8e/FLAGf667f1ef6 [2021-08-25 20:18:00,996 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:18:01,001 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.02.i.cil-1.c [2021-08-25 20:18:01,023 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4809ce330/c001690bee2c4f35bba90adcd7b40d8e/FLAGf667f1ef6 [2021-08-25 20:18:01,347 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4809ce330/c001690bee2c4f35bba90adcd7b40d8e [2021-08-25 20:18:01,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:18:01,350 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:18:01,351 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:18:01,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:18:01,354 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:18:01,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:18:01" (1/1) ... [2021-08-25 20:18:01,356 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a7bdd19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:01, skipping insertion in model container [2021-08-25 20:18:01,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:18:01" (1/1) ... [2021-08-25 20:18:01,361 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:18:01,411 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:18:01,683 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.02.i.cil-1.c[64353,64366] [2021-08-25 20:18:01,689 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:18:01,697 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:18:01,753 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.02.i.cil-1.c[64353,64366] [2021-08-25 20:18:01,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:18:01,772 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:18:01,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:01 WrapperNode [2021-08-25 20:18:01,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:18:01,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:18:01,773 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:18:01,773 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:18:01,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:01" (1/1) ... [2021-08-25 20:18:01,791 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:01" (1/1) ... [2021-08-25 20:18:01,814 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:18:01,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:18:01,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:18:01,815 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:18:01,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:01" (1/1) ... [2021-08-25 20:18:01,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:01" (1/1) ... [2021-08-25 20:18:01,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:01" (1/1) ... [2021-08-25 20:18:01,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:01" (1/1) ... [2021-08-25 20:18:01,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:01" (1/1) ... [2021-08-25 20:18:01,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:01" (1/1) ... [2021-08-25 20:18:01,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:01" (1/1) ... [2021-08-25 20:18:01,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:18:01,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:18:01,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:18:01,858 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:18:01,858 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:01" (1/1) ... [2021-08-25 20:18:01,863 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:18:01,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:18:01,887 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-25 20:18:01,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 20:18:01,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-25 20:18:01,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:18:01,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-25 20:18:01,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-25 20:18:01,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-25 20:18:01,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 20:18:01,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-25 20:18:01,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:18:01,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:18:02,137 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:18:02,637 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-08-25 20:18:02,638 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-08-25 20:18:02,642 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:18:02,642 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:18:02,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:18:02 BoogieIcfgContainer [2021-08-25 20:18:02,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:18:02,645 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:18:02,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:18:02,647 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:18:02,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:18:01" (1/3) ... [2021-08-25 20:18:02,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5981f1f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:18:02, skipping insertion in model container [2021-08-25 20:18:02,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:01" (2/3) ... [2021-08-25 20:18:02,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5981f1f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:18:02, skipping insertion in model container [2021-08-25 20:18:02,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:18:02" (3/3) ... [2021-08-25 20:18:02,651 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02.i.cil-1.c [2021-08-25 20:18:02,655 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:18:02,655 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:18:02,688 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:18:02,692 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 20:18:02,692 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:18:02,706 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:18:02,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-25 20:18:02,716 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:02,716 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:18:02,717 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:02,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:02,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2021-08-25 20:18:02,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:18:02,727 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493939171] [2021-08-25 20:18:02,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:02,728 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:18:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:02,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:18:02,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:18:02,968 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493939171] [2021-08-25 20:18:02,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493939171] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:02,968 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:02,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:18:02,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44448582] [2021-08-25 20:18:02,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:18:02,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:18:02,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:18:02,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:02,985 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:18:03,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:03,296 INFO L93 Difference]: Finished difference Result 255 states and 430 transitions. [2021-08-25 20:18:03,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:18:03,297 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:18:03,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:03,305 INFO L225 Difference]: With dead ends: 255 [2021-08-25 20:18:03,306 INFO L226 Difference]: Without dead ends: 116 [2021-08-25 20:18:03,308 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:18:03,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-08-25 20:18:03,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2021-08-25 20:18:03,332 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:18:03,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2021-08-25 20:18:03,333 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2021-08-25 20:18:03,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:03,333 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2021-08-25 20:18:03,334 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:18:03,334 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2021-08-25 20:18:03,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-25 20:18:03,334 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:03,335 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:18:03,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 20:18:03,335 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:03,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:03,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1001988123, now seen corresponding path program 1 times [2021-08-25 20:18:03,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:18:03,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302091133] [2021-08-25 20:18:03,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:03,336 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:18:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:03,429 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:18:03,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:18:03,429 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302091133] [2021-08-25 20:18:03,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302091133] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:03,430 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:03,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:18:03,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506051091] [2021-08-25 20:18:03,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:18:03,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:18:03,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:18:03,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:18:03,434 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:18:03,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:03,468 INFO L93 Difference]: Finished difference Result 320 states and 482 transitions. [2021-08-25 20:18:03,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:18:03,468 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:18:03,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:03,470 INFO L225 Difference]: With dead ends: 320 [2021-08-25 20:18:03,470 INFO L226 Difference]: Without dead ends: 215 [2021-08-25 20:18:03,471 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:18:03,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-08-25 20:18:03,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2021-08-25 20:18:03,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.4906542056074767) internal successors, (319), 214 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:03,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 319 transitions. [2021-08-25 20:18:03,481 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 319 transitions. Word has length 38 [2021-08-25 20:18:03,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:03,481 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 319 transitions. [2021-08-25 20:18:03,482 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:18:03,482 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 319 transitions. [2021-08-25 20:18:03,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-08-25 20:18:03,483 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:03,483 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:18:03,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 20:18:03,483 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:03,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:03,484 INFO L82 PathProgramCache]: Analyzing trace with hash 996888307, now seen corresponding path program 1 times [2021-08-25 20:18:03,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:18:03,484 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751641932] [2021-08-25 20:18:03,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:03,484 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:18:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:03,571 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:18:03,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:18:03,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751641932] [2021-08-25 20:18:03,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751641932] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:03,572 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:03,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:18:03,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418520020] [2021-08-25 20:18:03,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:18:03,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:18:03,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:18:03,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:18:03,573 INFO L87 Difference]: Start difference. First operand 215 states and 319 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:18:03,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:03,704 INFO L93 Difference]: Finished difference Result 420 states and 630 transitions. [2021-08-25 20:18:03,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:18:03,705 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:18:03,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:03,706 INFO L225 Difference]: With dead ends: 420 [2021-08-25 20:18:03,706 INFO L226 Difference]: Without dead ends: 315 [2021-08-25 20:18:03,707 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:18:03,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-08-25 20:18:03,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2021-08-25 20:18:03,724 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:18:03,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 466 transitions. [2021-08-25 20:18:03,725 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 466 transitions. Word has length 53 [2021-08-25 20:18:03,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:03,725 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 466 transitions. [2021-08-25 20:18:03,725 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:18:03,725 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 466 transitions. [2021-08-25 20:18:03,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-25 20:18:03,727 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:03,727 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:18:03,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 20:18:03,728 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:03,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:03,728 INFO L82 PathProgramCache]: Analyzing trace with hash -973367758, now seen corresponding path program 1 times [2021-08-25 20:18:03,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:18:03,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991248475] [2021-08-25 20:18:03,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:03,729 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:18:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:03,854 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:18:03,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:18:03,854 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991248475] [2021-08-25 20:18:03,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991248475] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:03,854 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:03,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:18:03,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753244926] [2021-08-25 20:18:03,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:18:03,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:18:03,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:18:03,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:03,855 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:18:04,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:04,331 INFO L93 Difference]: Finished difference Result 805 states and 1196 transitions. [2021-08-25 20:18:04,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:18:04,332 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:18:04,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:04,335 INFO L225 Difference]: With dead ends: 805 [2021-08-25 20:18:04,335 INFO L226 Difference]: Without dead ends: 500 [2021-08-25 20:18:04,336 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:18:04,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2021-08-25 20:18:04,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 365. [2021-08-25 20:18:04,371 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:18:04,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 552 transitions. [2021-08-25 20:18:04,372 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 552 transitions. Word has length 71 [2021-08-25 20:18:04,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:04,372 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 552 transitions. [2021-08-25 20:18:04,372 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:18:04,372 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 552 transitions. [2021-08-25 20:18:04,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-25 20:18:04,374 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:04,374 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:18:04,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 20:18:04,375 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:04,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:04,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1107381264, now seen corresponding path program 1 times [2021-08-25 20:18:04,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:18:04,375 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300035606] [2021-08-25 20:18:04,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:04,380 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:18:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:04,486 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:18:04,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:18:04,486 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300035606] [2021-08-25 20:18:04,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300035606] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:04,487 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:04,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:18:04,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498823511] [2021-08-25 20:18:04,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:18:04,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:18:04,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:18:04,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:04,488 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:18:04,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:04,762 INFO L93 Difference]: Finished difference Result 805 states and 1217 transitions. [2021-08-25 20:18:04,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:18:04,763 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:18:04,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:04,765 INFO L225 Difference]: With dead ends: 805 [2021-08-25 20:18:04,765 INFO L226 Difference]: Without dead ends: 450 [2021-08-25 20:18:04,766 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:18:04,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-08-25 20:18:04,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 405. [2021-08-25 20:18:04,784 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:18:04,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 620 transitions. [2021-08-25 20:18:04,785 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 620 transitions. Word has length 71 [2021-08-25 20:18:04,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:04,786 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 620 transitions. [2021-08-25 20:18:04,786 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:18:04,786 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 620 transitions. [2021-08-25 20:18:04,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-25 20:18:04,787 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:04,788 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:18:04,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 20:18:04,788 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:04,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:04,788 INFO L82 PathProgramCache]: Analyzing trace with hash -114315255, now seen corresponding path program 1 times [2021-08-25 20:18:04,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:18:04,788 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923927191] [2021-08-25 20:18:04,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:04,789 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:18:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:04,889 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:18:04,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:18:04,896 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923927191] [2021-08-25 20:18:04,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923927191] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:04,897 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:04,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:18:04,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086002714] [2021-08-25 20:18:04,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:18:04,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:18:04,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:18:04,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:04,902 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:18:05,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:05,271 INFO L93 Difference]: Finished difference Result 927 states and 1408 transitions. [2021-08-25 20:18:05,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:18:05,272 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:18:05,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:05,274 INFO L225 Difference]: With dead ends: 927 [2021-08-25 20:18:05,274 INFO L226 Difference]: Without dead ends: 532 [2021-08-25 20:18:05,274 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:18:05,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-08-25 20:18:05,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 407. [2021-08-25 20:18:05,282 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:18:05,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 622 transitions. [2021-08-25 20:18:05,283 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 622 transitions. Word has length 72 [2021-08-25 20:18:05,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:05,284 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 622 transitions. [2021-08-25 20:18:05,284 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:18:05,284 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 622 transitions. [2021-08-25 20:18:05,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-25 20:18:05,285 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:05,286 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:18:05,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-25 20:18:05,286 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:05,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:05,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1902129482, now seen corresponding path program 2 times [2021-08-25 20:18:05,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:18:05,287 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700076653] [2021-08-25 20:18:05,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:05,287 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:18:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:05,353 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:18:05,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:18:05,353 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700076653] [2021-08-25 20:18:05,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700076653] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:05,353 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:05,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:18:05,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897327051] [2021-08-25 20:18:05,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:18:05,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:18:05,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:18:05,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:05,354 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:18:05,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:05,729 INFO L93 Difference]: Finished difference Result 927 states and 1406 transitions. [2021-08-25 20:18:05,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:18:05,730 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:18:05,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:05,731 INFO L225 Difference]: With dead ends: 927 [2021-08-25 20:18:05,731 INFO L226 Difference]: Without dead ends: 530 [2021-08-25 20:18:05,732 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:18:05,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-08-25 20:18:05,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2021-08-25 20:18:05,739 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:18:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 620 transitions. [2021-08-25 20:18:05,739 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 620 transitions. Word has length 85 [2021-08-25 20:18:05,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:05,740 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 620 transitions. [2021-08-25 20:18:05,740 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:18:05,740 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 620 transitions. [2021-08-25 20:18:05,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-25 20:18:05,741 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:05,741 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:18:05,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-25 20:18:05,741 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:05,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:05,741 INFO L82 PathProgramCache]: Analyzing trace with hash 793149036, now seen corresponding path program 1 times [2021-08-25 20:18:05,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:18:05,742 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041120440] [2021-08-25 20:18:05,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:05,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:18:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:05,802 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:18:05,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:18:05,806 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041120440] [2021-08-25 20:18:05,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041120440] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:05,806 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:05,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:18:05,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001497327] [2021-08-25 20:18:05,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:18:05,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:18:05,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:18:05,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:05,808 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:18:06,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:06,158 INFO L93 Difference]: Finished difference Result 927 states and 1402 transitions. [2021-08-25 20:18:06,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:18:06,158 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:18:06,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:06,160 INFO L225 Difference]: With dead ends: 927 [2021-08-25 20:18:06,160 INFO L226 Difference]: Without dead ends: 530 [2021-08-25 20:18:06,161 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:18:06,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-08-25 20:18:06,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2021-08-25 20:18:06,169 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:18:06,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 618 transitions. [2021-08-25 20:18:06,170 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 618 transitions. Word has length 85 [2021-08-25 20:18:06,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:06,172 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 618 transitions. [2021-08-25 20:18:06,172 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:18:06,172 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 618 transitions. [2021-08-25 20:18:06,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-25 20:18:06,173 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:06,173 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:18:06,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 20:18:06,173 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:06,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:06,174 INFO L82 PathProgramCache]: Analyzing trace with hash 872770184, now seen corresponding path program 2 times [2021-08-25 20:18:06,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:18:06,174 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174941972] [2021-08-25 20:18:06,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:06,174 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:18:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:06,251 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:18:06,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:18:06,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174941972] [2021-08-25 20:18:06,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174941972] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:06,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:06,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:18:06,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573189722] [2021-08-25 20:18:06,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:18:06,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:18:06,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:18:06,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:06,253 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:18:06,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:06,547 INFO L93 Difference]: Finished difference Result 847 states and 1277 transitions. [2021-08-25 20:18:06,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:18:06,548 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:18:06,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:06,549 INFO L225 Difference]: With dead ends: 847 [2021-08-25 20:18:06,549 INFO L226 Difference]: Without dead ends: 450 [2021-08-25 20:18:06,550 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:18:06,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-08-25 20:18:06,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2021-08-25 20:18:06,556 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:18:06,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 616 transitions. [2021-08-25 20:18:06,557 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 616 transitions. Word has length 85 [2021-08-25 20:18:06,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:06,557 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 616 transitions. [2021-08-25 20:18:06,557 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:18:06,557 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 616 transitions. [2021-08-25 20:18:06,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-25 20:18:06,558 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:06,558 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:18:06,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 20:18:06,559 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:06,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:06,559 INFO L82 PathProgramCache]: Analyzing trace with hash -236210262, now seen corresponding path program 1 times [2021-08-25 20:18:06,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:18:06,559 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603741964] [2021-08-25 20:18:06,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:06,559 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:18:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:06,602 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:18:06,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:18:06,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603741964] [2021-08-25 20:18:06,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603741964] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:06,602 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:06,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:18:06,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223897023] [2021-08-25 20:18:06,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:18:06,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:18:06,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:18:06,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:06,603 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:18:06,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:06,873 INFO L93 Difference]: Finished difference Result 847 states and 1273 transitions. [2021-08-25 20:18:06,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:18:06,874 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:18:06,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:06,875 INFO L225 Difference]: With dead ends: 847 [2021-08-25 20:18:06,875 INFO L226 Difference]: Without dead ends: 450 [2021-08-25 20:18:06,876 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:18:06,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-08-25 20:18:06,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2021-08-25 20:18:06,888 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:18:06,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 614 transitions. [2021-08-25 20:18:06,889 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 614 transitions. Word has length 85 [2021-08-25 20:18:06,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:06,889 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 614 transitions. [2021-08-25 20:18:06,889 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:18:06,889 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 614 transitions. [2021-08-25 20:18:06,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-25 20:18:06,890 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:06,890 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:18:06,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 20:18:06,891 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:06,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:06,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1127790653, now seen corresponding path program 1 times [2021-08-25 20:18:06,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:18:06,891 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972189476] [2021-08-25 20:18:06,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:06,891 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:18:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:06,937 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:18:06,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:18:06,937 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972189476] [2021-08-25 20:18:06,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972189476] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:06,938 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:06,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:18:06,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409532895] [2021-08-25 20:18:06,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:18:06,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:18:06,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:18:06,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:06,939 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:18:07,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:07,278 INFO L93 Difference]: Finished difference Result 927 states and 1390 transitions. [2021-08-25 20:18:07,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:18:07,279 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:18:07,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:07,281 INFO L225 Difference]: With dead ends: 927 [2021-08-25 20:18:07,281 INFO L226 Difference]: Without dead ends: 530 [2021-08-25 20:18:07,282 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:18:07,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-08-25 20:18:07,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2021-08-25 20:18:07,288 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:18:07,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 612 transitions. [2021-08-25 20:18:07,289 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 612 transitions. Word has length 86 [2021-08-25 20:18:07,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:07,289 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 612 transitions. [2021-08-25 20:18:07,289 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:18:07,289 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 612 transitions. [2021-08-25 20:18:07,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-08-25 20:18:07,290 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:07,290 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:18:07,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 20:18:07,290 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:07,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:07,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1321809477, now seen corresponding path program 1 times [2021-08-25 20:18:07,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:18:07,291 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329631696] [2021-08-25 20:18:07,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:07,291 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:18:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:07,342 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:18:07,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:18:07,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329631696] [2021-08-25 20:18:07,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329631696] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:07,342 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:07,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:18:07,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38781073] [2021-08-25 20:18:07,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:18:07,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:18:07,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:18:07,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:07,343 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:18:07,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:07,608 INFO L93 Difference]: Finished difference Result 847 states and 1265 transitions. [2021-08-25 20:18:07,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:18:07,609 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:18:07,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:07,610 INFO L225 Difference]: With dead ends: 847 [2021-08-25 20:18:07,610 INFO L226 Difference]: Without dead ends: 450 [2021-08-25 20:18:07,611 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:18:07,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-08-25 20:18:07,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2021-08-25 20:18:07,617 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:18:07,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 610 transitions. [2021-08-25 20:18:07,618 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 610 transitions. Word has length 86 [2021-08-25 20:18:07,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:07,618 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 610 transitions. [2021-08-25 20:18:07,618 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:18:07,618 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 610 transitions. [2021-08-25 20:18:07,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-08-25 20:18:07,619 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:07,619 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:18:07,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 20:18:07,619 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:07,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:07,620 INFO L82 PathProgramCache]: Analyzing trace with hash -490798233, now seen corresponding path program 1 times [2021-08-25 20:18:07,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:18:07,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262341756] [2021-08-25 20:18:07,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:07,620 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:18:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:07,661 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:18:07,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:18:07,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262341756] [2021-08-25 20:18:07,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262341756] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:07,662 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:07,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:18:07,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304769006] [2021-08-25 20:18:07,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:18:07,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:18:07,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:18:07,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:07,663 INFO L87 Difference]: Start difference. First operand 407 states and 610 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:18:08,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:08,001 INFO L93 Difference]: Finished difference Result 927 states and 1382 transitions. [2021-08-25 20:18:08,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:18:08,001 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:18:08,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:08,003 INFO L225 Difference]: With dead ends: 927 [2021-08-25 20:18:08,003 INFO L226 Difference]: Without dead ends: 530 [2021-08-25 20:18:08,003 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:18:08,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-08-25 20:18:08,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2021-08-25 20:18:08,010 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:18:08,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 608 transitions. [2021-08-25 20:18:08,011 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 608 transitions. Word has length 87 [2021-08-25 20:18:08,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:08,011 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 608 transitions. [2021-08-25 20:18:08,011 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:18:08,011 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 608 transitions. [2021-08-25 20:18:08,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-08-25 20:18:08,012 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:08,012 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:18:08,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-25 20:18:08,012 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:08,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:08,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1383461914, now seen corresponding path program 1 times [2021-08-25 20:18:08,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:18:08,012 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80970122] [2021-08-25 20:18:08,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:08,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:18:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:08,057 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:18:08,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:18:08,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80970122] [2021-08-25 20:18:08,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80970122] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:08,058 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:08,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:18:08,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030338140] [2021-08-25 20:18:08,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:18:08,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:18:08,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:18:08,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:08,059 INFO L87 Difference]: Start difference. First operand 407 states and 608 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:18:08,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:08,425 INFO L93 Difference]: Finished difference Result 783 states and 1162 transitions. [2021-08-25 20:18:08,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:18:08,427 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:18:08,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:08,429 INFO L225 Difference]: With dead ends: 783 [2021-08-25 20:18:08,429 INFO L226 Difference]: Without dead ends: 530 [2021-08-25 20:18:08,429 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:18:08,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-08-25 20:18:08,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2021-08-25 20:18:08,436 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:18:08,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 606 transitions. [2021-08-25 20:18:08,437 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 606 transitions. Word has length 87 [2021-08-25 20:18:08,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:08,437 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 606 transitions. [2021-08-25 20:18:08,437 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:18:08,437 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 606 transitions. [2021-08-25 20:18:08,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-08-25 20:18:08,438 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:08,438 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:18:08,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-25 20:18:08,439 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:08,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:08,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1862605531, now seen corresponding path program 1 times [2021-08-25 20:18:08,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:18:08,439 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221947218] [2021-08-25 20:18:08,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:08,439 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:18:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:08,479 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:18:08,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:18:08,479 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221947218] [2021-08-25 20:18:08,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221947218] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:08,480 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:08,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:18:08,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307133629] [2021-08-25 20:18:08,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:18:08,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:18:08,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:18:08,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:08,481 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:18:08,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:08,713 INFO L93 Difference]: Finished difference Result 847 states and 1253 transitions. [2021-08-25 20:18:08,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:18:08,713 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:18:08,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:08,714 INFO L225 Difference]: With dead ends: 847 [2021-08-25 20:18:08,714 INFO L226 Difference]: Without dead ends: 450 [2021-08-25 20:18:08,715 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:18:08,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-08-25 20:18:08,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2021-08-25 20:18:08,721 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:18:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 604 transitions. [2021-08-25 20:18:08,722 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 604 transitions. Word has length 87 [2021-08-25 20:18:08,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:08,722 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 604 transitions. [2021-08-25 20:18:08,722 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:18:08,722 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 604 transitions. [2021-08-25 20:18:08,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-08-25 20:18:08,723 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:08,723 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:18:08,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-25 20:18:08,723 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:08,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:08,724 INFO L82 PathProgramCache]: Analyzing trace with hash 11654616, now seen corresponding path program 1 times [2021-08-25 20:18:08,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:18:08,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215203555] [2021-08-25 20:18:08,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:08,724 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:18:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:08,764 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:18:08,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:18:08,764 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215203555] [2021-08-25 20:18:08,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215203555] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:08,764 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:08,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:18:08,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881393916] [2021-08-25 20:18:08,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:18:08,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:18:08,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:18:08,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:08,765 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:18:08,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:08,990 INFO L93 Difference]: Finished difference Result 703 states and 1035 transitions. [2021-08-25 20:18:08,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:18:08,991 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:18:08,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:08,992 INFO L225 Difference]: With dead ends: 703 [2021-08-25 20:18:08,992 INFO L226 Difference]: Without dead ends: 450 [2021-08-25 20:18:08,992 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:18:08,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-08-25 20:18:08,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 407. [2021-08-25 20:18:08,999 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:18:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 602 transitions. [2021-08-25 20:18:09,000 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 602 transitions. Word has length 87 [2021-08-25 20:18:09,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:09,000 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 602 transitions. [2021-08-25 20:18:09,000 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:18:09,000 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 602 transitions. [2021-08-25 20:18:09,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-25 20:18:09,001 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:09,001 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:18:09,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-25 20:18:09,001 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:09,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:09,001 INFO L82 PathProgramCache]: Analyzing trace with hash 2132678238, now seen corresponding path program 1 times [2021-08-25 20:18:09,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:18:09,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892925611] [2021-08-25 20:18:09,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:09,002 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:18:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:09,045 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:18:09,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:18:09,045 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892925611] [2021-08-25 20:18:09,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892925611] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:09,046 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:09,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:18:09,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518257986] [2021-08-25 20:18:09,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:18:09,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:18:09,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:18:09,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:09,047 INFO L87 Difference]: Start difference. First operand 407 states and 602 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:18:09,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:09,350 INFO L93 Difference]: Finished difference Result 909 states and 1344 transitions. [2021-08-25 20:18:09,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:18:09,350 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:18:09,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:09,352 INFO L225 Difference]: With dead ends: 909 [2021-08-25 20:18:09,352 INFO L226 Difference]: Without dead ends: 512 [2021-08-25 20:18:09,353 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:18:09,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2021-08-25 20:18:09,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 407. [2021-08-25 20:18:09,359 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:18:09,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 600 transitions. [2021-08-25 20:18:09,376 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 600 transitions. Word has length 88 [2021-08-25 20:18:09,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:09,376 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 600 transitions. [2021-08-25 20:18:09,377 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:18:09,377 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 600 transitions. [2021-08-25 20:18:09,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-25 20:18:09,377 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:09,377 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:18:09,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-25 20:18:09,378 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:09,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:09,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1903796849, now seen corresponding path program 1 times [2021-08-25 20:18:09,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:18:09,378 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321459875] [2021-08-25 20:18:09,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:09,378 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:18:09,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:09,422 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:18:09,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:18:09,422 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321459875] [2021-08-25 20:18:09,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321459875] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:09,422 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:09,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:18:09,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493063876] [2021-08-25 20:18:09,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:18:09,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:18:09,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:18:09,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:09,424 INFO L87 Difference]: Start difference. First operand 407 states and 600 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:18:09,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:09,743 INFO L93 Difference]: Finished difference Result 758 states and 1119 transitions. [2021-08-25 20:18:09,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:18:09,744 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:18:09,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:09,746 INFO L225 Difference]: With dead ends: 758 [2021-08-25 20:18:09,746 INFO L226 Difference]: Without dead ends: 505 [2021-08-25 20:18:09,746 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:18:09,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-08-25 20:18:09,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 407. [2021-08-25 20:18:09,753 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:18:09,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 598 transitions. [2021-08-25 20:18:09,754 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 598 transitions. Word has length 88 [2021-08-25 20:18:09,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:09,754 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 598 transitions. [2021-08-25 20:18:09,754 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:18:09,754 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 598 transitions. [2021-08-25 20:18:09,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-25 20:18:09,755 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:09,755 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:18:09,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-25 20:18:09,756 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:09,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:09,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1738642336, now seen corresponding path program 1 times [2021-08-25 20:18:09,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:18:09,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826144433] [2021-08-25 20:18:09,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:09,757 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:18:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:09,818 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:18:09,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:18:09,819 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826144433] [2021-08-25 20:18:09,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826144433] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:09,819 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:09,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:18:09,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316101630] [2021-08-25 20:18:09,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:18:09,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:18:09,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:18:09,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:09,821 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:18:10,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:10,074 INFO L93 Difference]: Finished difference Result 829 states and 1215 transitions. [2021-08-25 20:18:10,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:18:10,075 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:18:10,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:10,076 INFO L225 Difference]: With dead ends: 829 [2021-08-25 20:18:10,076 INFO L226 Difference]: Without dead ends: 432 [2021-08-25 20:18:10,077 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:18:10,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2021-08-25 20:18:10,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 407. [2021-08-25 20:18:10,083 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:18:10,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 596 transitions. [2021-08-25 20:18:10,084 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 596 transitions. Word has length 88 [2021-08-25 20:18:10,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:10,084 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 596 transitions. [2021-08-25 20:18:10,085 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:18:10,085 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 596 transitions. [2021-08-25 20:18:10,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-25 20:18:10,085 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:10,085 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:18:10,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-25 20:18:10,086 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:10,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:10,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1967523725, now seen corresponding path program 1 times [2021-08-25 20:18:10,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:18:10,087 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564074926] [2021-08-25 20:18:10,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:10,087 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:18:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:10,137 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:18:10,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:18:10,137 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564074926] [2021-08-25 20:18:10,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564074926] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:10,137 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:10,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:18:10,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384110669] [2021-08-25 20:18:10,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:18:10,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:18:10,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:18:10,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:10,138 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:18:10,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:10,358 INFO L93 Difference]: Finished difference Result 678 states and 992 transitions. [2021-08-25 20:18:10,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:18:10,359 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:18:10,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:10,360 INFO L225 Difference]: With dead ends: 678 [2021-08-25 20:18:10,360 INFO L226 Difference]: Without dead ends: 425 [2021-08-25 20:18:10,361 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:18:10,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2021-08-25 20:18:10,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 407. [2021-08-25 20:18:10,367 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:18:10,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 594 transitions. [2021-08-25 20:18:10,368 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 594 transitions. Word has length 88 [2021-08-25 20:18:10,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:10,368 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 594 transitions. [2021-08-25 20:18:10,368 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:18:10,368 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 594 transitions. [2021-08-25 20:18:10,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-25 20:18:10,369 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:10,369 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:18:10,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-25 20:18:10,370 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:10,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:10,370 INFO L82 PathProgramCache]: Analyzing trace with hash 730673667, now seen corresponding path program 1 times [2021-08-25 20:18:10,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:18:10,370 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923767020] [2021-08-25 20:18:10,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:10,370 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:18:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:10,427 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:18:10,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:18:10,427 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923767020] [2021-08-25 20:18:10,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923767020] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:10,427 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:10,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:18:10,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401530237] [2021-08-25 20:18:10,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:18:10,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:18:10,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:18:10,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:10,429 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:18:10,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:10,744 INFO L93 Difference]: Finished difference Result 902 states and 1319 transitions. [2021-08-25 20:18:10,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:18:10,745 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:18:10,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:10,746 INFO L225 Difference]: With dead ends: 902 [2021-08-25 20:18:10,747 INFO L226 Difference]: Without dead ends: 505 [2021-08-25 20:18:10,747 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:18:10,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-08-25 20:18:10,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 407. [2021-08-25 20:18:10,755 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:18:10,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 592 transitions. [2021-08-25 20:18:10,756 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 592 transitions. Word has length 89 [2021-08-25 20:18:10,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:10,756 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 592 transitions. [2021-08-25 20:18:10,757 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:18:10,757 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 592 transitions. [2021-08-25 20:18:10,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-25 20:18:10,757 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:10,758 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:18:10,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-25 20:18:10,758 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:10,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:10,758 INFO L82 PathProgramCache]: Analyzing trace with hash 978820161, now seen corresponding path program 1 times [2021-08-25 20:18:10,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:18:10,759 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854853507] [2021-08-25 20:18:10,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:10,759 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:18:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:10,794 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-08-25 20:18:10,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:18:10,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854853507] [2021-08-25 20:18:10,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854853507] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:10,795 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:10,795 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:18:10,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167132627] [2021-08-25 20:18:10,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:18:10,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:18:10,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:18:10,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:18:10,796 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:18:10,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:10,871 INFO L93 Difference]: Finished difference Result 806 states and 1179 transitions. [2021-08-25 20:18:10,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:18:10,873 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:18:10,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:10,874 INFO L225 Difference]: With dead ends: 806 [2021-08-25 20:18:10,874 INFO L226 Difference]: Without dead ends: 555 [2021-08-25 20:18:10,875 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:18:10,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-08-25 20:18:10,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2021-08-25 20:18:10,883 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:18:10,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 805 transitions. [2021-08-25 20:18:10,884 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 805 transitions. Word has length 89 [2021-08-25 20:18:10,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:10,884 INFO L470 AbstractCegarLoop]: Abstraction has 555 states and 805 transitions. [2021-08-25 20:18:10,884 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:18:10,884 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 805 transitions. [2021-08-25 20:18:10,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-08-25 20:18:10,885 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:10,885 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:18:10,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-25 20:18:10,885 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:10,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:10,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1317014729, now seen corresponding path program 1 times [2021-08-25 20:18:10,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:18:10,886 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790085638] [2021-08-25 20:18:10,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:10,886 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:18:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:10,939 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:18:10,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:18:10,940 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790085638] [2021-08-25 20:18:10,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790085638] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:10,940 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:10,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:18:10,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791632353] [2021-08-25 20:18:10,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:18:10,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:18:10,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:18:10,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:18:10,942 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:18:10,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:10,976 INFO L93 Difference]: Finished difference Result 1103 states and 1606 transitions. [2021-08-25 20:18:10,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:18:10,976 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:18:10,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:10,978 INFO L225 Difference]: With dead ends: 1103 [2021-08-25 20:18:10,978 INFO L226 Difference]: Without dead ends: 704 [2021-08-25 20:18:10,979 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:18:10,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2021-08-25 20:18:10,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2021-08-25 20:18:10,991 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:18:10,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1023 transitions. [2021-08-25 20:18:10,992 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1023 transitions. Word has length 91 [2021-08-25 20:18:10,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:10,993 INFO L470 AbstractCegarLoop]: Abstraction has 704 states and 1023 transitions. [2021-08-25 20:18:10,993 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:18:10,993 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1023 transitions. [2021-08-25 20:18:10,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-08-25 20:18:10,994 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:10,994 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:18:10,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-25 20:18:10,994 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:10,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:10,995 INFO L82 PathProgramCache]: Analyzing trace with hash -761801560, now seen corresponding path program 1 times [2021-08-25 20:18:10,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:18:10,995 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762816301] [2021-08-25 20:18:10,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:10,995 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:18:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:18:11,143 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 20:18:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:18:11,322 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-25 20:18:11,322 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 20:18:11,323 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:18:11,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-25 20:18:11,328 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:18:11,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:18:11 BoogieIcfgContainer [2021-08-25 20:18:11,413 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:18:11,413 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:18:11,414 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:18:11,414 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:18:11,414 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:18:02" (3/4) ... [2021-08-25 20:18:11,417 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-25 20:18:11,417 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:18:11,418 INFO L168 Benchmark]: Toolchain (without parser) took 10067.24 ms. Allocated memory was 56.6 MB in the beginning and 192.9 MB in the end (delta: 136.3 MB). Free memory was 33.5 MB in the beginning and 131.8 MB in the end (delta: -98.4 MB). Peak memory consumption was 36.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:18:11,419 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 56.6 MB. Free memory was 38.7 MB in the beginning and 38.7 MB in the end (delta: 44.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:18:11,419 INFO L168 Benchmark]: CACSL2BoogieTranslator took 421.13 ms. Allocated memory was 56.6 MB in the beginning and 71.3 MB in the end (delta: 14.7 MB). Free memory was 33.2 MB in the beginning and 50.3 MB in the end (delta: -17.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-08-25 20:18:11,420 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.52 ms. Allocated memory is still 71.3 MB. Free memory was 50.3 MB in the beginning and 45.9 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:18:11,420 INFO L168 Benchmark]: Boogie Preprocessor took 42.29 ms. Allocated memory is still 71.3 MB. Free memory was 45.9 MB in the beginning and 39.6 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:18:11,420 INFO L168 Benchmark]: RCFGBuilder took 786.36 ms. Allocated memory was 71.3 MB in the beginning and 90.2 MB in the end (delta: 18.9 MB). Free memory was 39.6 MB in the beginning and 41.6 MB in the end (delta: -2.0 MB). Peak memory consumption was 19.7 MB. Max. memory is 16.1 GB. [2021-08-25 20:18:11,420 INFO L168 Benchmark]: TraceAbstraction took 8768.24 ms. Allocated memory was 90.2 MB in the beginning and 192.9 MB in the end (delta: 102.8 MB). Free memory was 40.9 MB in the beginning and 131.8 MB in the end (delta: -90.9 MB). Peak memory consumption was 97.0 MB. Max. memory is 16.1 GB. [2021-08-25 20:18:11,420 INFO L168 Benchmark]: Witness Printer took 3.28 ms. Allocated memory is still 192.9 MB. Free memory is still 131.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:18:11,422 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.15 ms. Allocated memory is still 56.6 MB. Free memory was 38.7 MB in the beginning and 38.7 MB in the end (delta: 44.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 421.13 ms. Allocated memory was 56.6 MB in the beginning and 71.3 MB in the end (delta: 14.7 MB). Free memory was 33.2 MB in the beginning and 50.3 MB in the end (delta: -17.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 41.52 ms. Allocated memory is still 71.3 MB. Free memory was 50.3 MB in the beginning and 45.9 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 42.29 ms. Allocated memory is still 71.3 MB. Free memory was 45.9 MB in the beginning and 39.6 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 786.36 ms. Allocated memory was 71.3 MB in the beginning and 90.2 MB in the end (delta: 18.9 MB). Free memory was 39.6 MB in the beginning and 41.6 MB in the end (delta: -2.0 MB). Peak memory consumption was 19.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 8768.24 ms. Allocated memory was 90.2 MB in the beginning and 192.9 MB in the end (delta: 102.8 MB). Free memory was 40.9 MB in the beginning and 131.8 MB in the end (delta: -90.9 MB). Peak memory consumption was 97.0 MB. Max. memory is 16.1 GB. * Witness Printer took 3.28 ms. Allocated memory is still 192.9 MB. Free memory is still 131.8 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}] [L1303] COND FALSE !(ret <= 0) [L1308] s->state = 4384 [L1309] s->init_num = 0 [L1310] EXPR s->bbio [L1310] EXPR s->wbio VAL [init=1, SSLv3_client_data={6:0}] [L1310] 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 [L1318] ret = __VERIFIER_nondet_int() [L1319] COND TRUE blastFlag == 1 [L1320] 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: 8639.9ms, OverallIterations: 24, TraceHistogramMax: 6, EmptinessCheckTime: 38.5ms, AutomataDifference: 6276.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 5042 SDtfs, 1763 SDslu, 6301 SDs, 0 SdLazy, 3592 SolverSat, 131 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4784.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 46 SyntacticMatches, 19 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 230.4ms 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: 263.9ms AutomataMinimizationTime, 23 MinimizatonAttempts, 1480 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 110.0ms SsaConstructionTime, 559.8ms SatisfiabilityAnalysisTime, 966.6ms InterpolantComputationTime, 1922 NumberOfCodeBlocks, 1922 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1787 ConstructedInterpolants, 0 QuantifiedInterpolants, 4711 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:18:11,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:18:13,005 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:18:13,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:18:13,044 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:18:13,044 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:18:13,047 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:18:13,048 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:18:13,052 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:18:13,054 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:18:13,059 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:18:13,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:18:13,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:18:13,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:18:13,065 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:18:13,066 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:18:13,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:18:13,069 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:18:13,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:18:13,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:18:13,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:18:13,072 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:18:13,074 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:18:13,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:18:13,076 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:18:13,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:18:13,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:18:13,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:18:13,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:18:13,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:18:13,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:18:13,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:18:13,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:18:13,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:18:13,086 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:18:13,087 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:18:13,087 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:18:13,088 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:18:13,088 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:18:13,088 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:18:13,089 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:18:13,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:18:13,093 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-08-25 20:18:13,123 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:18:13,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:18:13,124 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:18:13,124 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:18:13,125 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:18:13,126 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:18:13,126 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:18:13,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:18:13,126 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:18:13,126 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:18:13,127 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:18:13,127 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:18:13,127 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:18:13,127 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:18:13,127 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-25 20:18:13,127 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-25 20:18:13,127 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:18:13,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:18:13,127 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:18:13,127 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:18:13,127 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:18:13,127 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:18:13,128 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:18:13,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:18:13,128 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:18:13,136 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:18:13,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:18:13,137 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-25 20:18:13,137 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-25 20:18:13,137 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:18:13,137 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:18:13,137 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-25 20:18:13,137 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 -> bbd47246d88fcb39767f657e10b2743b89754c4e [2021-08-25 20:18:13,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:18:13,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:18:13,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:18:13,431 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:18:13,432 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:18:13,433 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_clnt.blast.02.i.cil-1.c [2021-08-25 20:18:13,480 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb383a531/5b7d34ea1139442199758a8bb26b7a24/FLAGb7d5a72c5 [2021-08-25 20:18:13,977 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:18:13,978 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_clnt.blast.02.i.cil-1.c [2021-08-25 20:18:14,003 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb383a531/5b7d34ea1139442199758a8bb26b7a24/FLAGb7d5a72c5 [2021-08-25 20:18:14,509 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb383a531/5b7d34ea1139442199758a8bb26b7a24 [2021-08-25 20:18:14,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:18:14,511 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:18:14,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:18:14,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:18:14,520 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:18:14,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:18:14" (1/1) ... [2021-08-25 20:18:14,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b9bed2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:14, skipping insertion in model container [2021-08-25 20:18:14,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:18:14" (1/1) ... [2021-08-25 20:18:14,526 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:18:14,585 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:18:14,863 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.02.i.cil-1.c[64353,64366] [2021-08-25 20:18:14,878 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:18:14,898 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:18:15,004 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.02.i.cil-1.c[64353,64366] [2021-08-25 20:18:15,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:18:15,023 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:18:15,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:15 WrapperNode [2021-08-25 20:18:15,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:18:15,025 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:18:15,025 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:18:15,025 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:18:15,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:15" (1/1) ... [2021-08-25 20:18:15,057 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:15" (1/1) ... [2021-08-25 20:18:15,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:18:15,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:18:15,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:18:15,092 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:18:15,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:15" (1/1) ... [2021-08-25 20:18:15,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:15" (1/1) ... [2021-08-25 20:18:15,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:15" (1/1) ... [2021-08-25 20:18:15,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:15" (1/1) ... [2021-08-25 20:18:15,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:15" (1/1) ... [2021-08-25 20:18:15,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:15" (1/1) ... [2021-08-25 20:18:15,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:15" (1/1) ... [2021-08-25 20:18:15,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:18:15,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:18:15,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:18:15,144 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:18:15,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:15" (1/1) ... [2021-08-25 20:18:15,149 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:18:15,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:18:15,185 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-25 20:18:15,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 20:18:15,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-25 20:18:15,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-25 20:18:15,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:18:15,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-25 20:18:15,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-25 20:18:15,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-25 20:18:15,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:18:15,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:18:15,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-25 20:18:15,472 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:18:18,466 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-08-25 20:18:18,466 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-08-25 20:18:18,471 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:18:18,472 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-08-25 20:18:18,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:18:18 BoogieIcfgContainer [2021-08-25 20:18:18,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:18:18,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:18:18,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:18:18,477 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:18:18,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:18:14" (1/3) ... [2021-08-25 20:18:18,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e76d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:18:18, skipping insertion in model container [2021-08-25 20:18:18,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:18:15" (2/3) ... [2021-08-25 20:18:18,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e76d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:18:18, skipping insertion in model container [2021-08-25 20:18:18,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:18:18" (3/3) ... [2021-08-25 20:18:18,479 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02.i.cil-1.c [2021-08-25 20:18:18,483 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:18:18,483 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-25 20:18:18,516 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:18:18,520 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 20:18:18,520 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-25 20:18:18,538 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:18:18,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-25 20:18:18,545 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:18,546 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:18:18,546 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:18,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:18,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2021-08-25 20:18:18,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:18:18,568 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [412859283] [2021-08-25 20:18:18,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:18,569 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:18:18,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:18:18,571 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:18:18,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-25 20:18:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:18,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:18:18,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:18:18,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:18:18,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:18:18,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:18:18,966 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:18:18,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [412859283] [2021-08-25 20:18:18,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [412859283] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:18,968 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:18,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 20:18:18,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273397322] [2021-08-25 20:18:18,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:18:18,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:18:18,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:18:18,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:18,983 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:18:19,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:19,091 INFO L93 Difference]: Finished difference Result 485 states and 819 transitions. [2021-08-25 20:18:19,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:18:19,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-08-25 20:18:19,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:19,106 INFO L225 Difference]: With dead ends: 485 [2021-08-25 20:18:19,106 INFO L226 Difference]: Without dead ends: 312 [2021-08-25 20:18:19,111 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:19,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-08-25 20:18:19,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2021-08-25 20:18:19,168 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:18:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 467 transitions. [2021-08-25 20:18:19,173 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 467 transitions. Word has length 24 [2021-08-25 20:18:19,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:19,173 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 467 transitions. [2021-08-25 20:18:19,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:19,174 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 467 transitions. [2021-08-25 20:18:19,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-25 20:18:19,179 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:19,179 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:18:19,190 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:18:19,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:18:19,385 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:19,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:19,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1698457876, now seen corresponding path program 1 times [2021-08-25 20:18:19,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:18:19,386 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [100322127] [2021-08-25 20:18:19,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:19,387 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:18:19,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:18:19,390 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:18:19,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-25 20:18:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:19,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-25 20:18:19,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:18:19,753 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:18:19,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:18:19,933 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:18:19,933 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:18:19,933 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [100322127] [2021-08-25 20:18:19,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [100322127] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:19,934 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:19,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-08-25 20:18:19,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415603236] [2021-08-25 20:18:19,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:18:19,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:18:19,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:18:19,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:19,940 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:18:20,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:20,674 INFO L93 Difference]: Finished difference Result 718 states and 1080 transitions. [2021-08-25 20:18:20,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:18:20,674 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:18:20,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:20,677 INFO L225 Difference]: With dead ends: 718 [2021-08-25 20:18:20,677 INFO L226 Difference]: Without dead ends: 513 [2021-08-25 20:18:20,680 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:20,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2021-08-25 20:18:20,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2021-08-25 20:18:20,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 512 states have (on average 1.494140625) internal successors, (765), 512 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:20,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 765 transitions. [2021-08-25 20:18:20,701 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 765 transitions. Word has length 60 [2021-08-25 20:18:20,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:20,702 INFO L470 AbstractCegarLoop]: Abstraction has 513 states and 765 transitions. [2021-08-25 20:18:20,702 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:18:20,702 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 765 transitions. [2021-08-25 20:18:20,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-08-25 20:18:20,710 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:20,711 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:18:20,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-25 20:18:20,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:18:20,919 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:20,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:20,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1093818034, now seen corresponding path program 1 times [2021-08-25 20:18:20,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:18:20,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112712859] [2021-08-25 20:18:20,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:20,920 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:18:20,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:18:20,925 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:18:20,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-25 20:18:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:21,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:18:21,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:18:22,709 INFO L354 Elim1Store]: treesize reduction 182, result has 23.2 percent of original size [2021-08-25 20:18:22,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 64 [2021-08-25 20:18:22,786 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-08-25 20:18:22,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2021-08-25 20:18:22,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-08-25 20:18:23,039 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2021-08-25 20:18:23,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:18:23,343 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2021-08-25 20:18:23,344 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:18:23,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2112712859] [2021-08-25 20:18:23,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2112712859] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:23,344 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:23,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-25 20:18:23,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224477250] [2021-08-25 20:18:23,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:18:23,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:18:23,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:18:23,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:18:23,346 INFO L87 Difference]: Start difference. First operand 513 states and 765 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:18:24,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:24,940 INFO L93 Difference]: Finished difference Result 1023 states and 1524 transitions. [2021-08-25 20:18:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:18:24,942 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:18:24,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:24,945 INFO L225 Difference]: With dead ends: 1023 [2021-08-25 20:18:24,946 INFO L226 Difference]: Without dead ends: 517 [2021-08-25 20:18:24,947 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:18:24,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2021-08-25 20:18:24,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 516. [2021-08-25 20:18:24,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 515 states have (on average 1.4912621359223301) internal successors, (768), 515 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:24,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 768 transitions. [2021-08-25 20:18:24,958 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 768 transitions. Word has length 98 [2021-08-25 20:18:24,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:24,959 INFO L470 AbstractCegarLoop]: Abstraction has 516 states and 768 transitions. [2021-08-25 20:18:24,959 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:18:24,959 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 768 transitions. [2021-08-25 20:18:24,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-08-25 20:18:24,960 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:24,960 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:18:24,974 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:18:25,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:18:25,173 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:25,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:25,174 INFO L82 PathProgramCache]: Analyzing trace with hash 924378278, now seen corresponding path program 1 times [2021-08-25 20:18:25,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:18:25,174 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721240468] [2021-08-25 20:18:25,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:25,175 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:18:25,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:18:25,180 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:18:25,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-25 20:18:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:18:25,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-25 20:18:25,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-25 20:18:25,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-08-25 20:18:25,689 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-08-25 20:18:25,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-08-25 20:18:25,844 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-08-25 20:18:25,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2021-08-25 20:18:25,970 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-08-25 20:18:25,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-25 20:18:26,283 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-08-25 20:18:26,283 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-25 20:18:26,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721240468] [2021-08-25 20:18:26,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [721240468] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-25 20:18:26,283 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:18:26,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2021-08-25 20:18:26,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773755018] [2021-08-25 20:18:26,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-25 20:18:26,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-25 20:18:26,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-25 20:18:26,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:18:26,284 INFO L87 Difference]: Start difference. First operand 516 states and 768 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:18:31,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:18:31,823 INFO L93 Difference]: Finished difference Result 1842 states and 2759 transitions. [2021-08-25 20:18:31,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-25 20:18:31,827 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:18:31,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:18:31,831 INFO L225 Difference]: With dead ends: 1842 [2021-08-25 20:18:31,831 INFO L226 Difference]: Without dead ends: 1336 [2021-08-25 20:18:31,832 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 216 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 61.6ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-08-25 20:18:31,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2021-08-25 20:18:31,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 620. [2021-08-25 20:18:31,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 1.5218093699515347) internal successors, (942), 619 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:18:31,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 942 transitions. [2021-08-25 20:18:31,849 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 942 transitions. Word has length 112 [2021-08-25 20:18:31,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:18:31,850 INFO L470 AbstractCegarLoop]: Abstraction has 620 states and 942 transitions. [2021-08-25 20:18:31,850 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:18:31,850 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 942 transitions. [2021-08-25 20:18:31,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-08-25 20:18:31,851 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:18:31,851 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:18:31,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-25 20:18:32,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:18:32,061 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-25 20:18:32,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:18:32,061 INFO L82 PathProgramCache]: Analyzing trace with hash -761801560, now seen corresponding path program 1 times [2021-08-25 20:18:32,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-25 20:18:32,062 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255104379] [2021-08-25 20:18:32,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:18:32,062 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-25 20:18:32,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-25 20:18:32,063 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-25 20:18:32,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-25 20:18:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:18:32,562 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-25 20:18:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-25 20:18:33,064 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-08-25 20:18:33,064 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-25 20:18:33,065 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:18:33,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-25 20:18:33,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-25 20:18:33,273 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:18:33,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:18:33 BoogieIcfgContainer [2021-08-25 20:18:33,359 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:18:33,359 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:18:33,359 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:18:33,360 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:18:33,360 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:18:18" (3/4) ... [2021-08-25 20:18:33,361 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-25 20:18:33,442 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 20:18:33,442 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:18:33,443 INFO L168 Benchmark]: Toolchain (without parser) took 18931.12 ms. Allocated memory was 54.5 MB in the beginning and 100.7 MB in the end (delta: 46.1 MB). Free memory was 29.4 MB in the beginning and 49.3 MB in the end (delta: -19.9 MB). Peak memory consumption was 25.0 MB. Max. memory is 16.1 GB. [2021-08-25 20:18:33,443 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 54.5 MB. Free memory was 36.5 MB in the beginning and 36.5 MB in the end (delta: 33.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:18:33,443 INFO L168 Benchmark]: CACSL2BoogieTranslator took 511.77 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 29.2 MB in the beginning and 44.6 MB in the end (delta: -15.4 MB). Peak memory consumption was 14.9 MB. Max. memory is 16.1 GB. [2021-08-25 20:18:33,444 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.80 ms. Allocated memory is still 67.1 MB. Free memory was 44.6 MB in the beginning and 40.3 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:18:33,444 INFO L168 Benchmark]: Boogie Preprocessor took 50.87 ms. Allocated memory is still 67.1 MB. Free memory was 40.3 MB in the beginning and 33.8 MB in the end (delta: 6.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-08-25 20:18:33,444 INFO L168 Benchmark]: RCFGBuilder took 3330.41 ms. Allocated memory was 67.1 MB in the beginning and 83.9 MB in the end (delta: 16.8 MB). Free memory was 33.5 MB in the beginning and 36.6 MB in the end (delta: -3.1 MB). Peak memory consumption was 19.9 MB. Max. memory is 16.1 GB. [2021-08-25 20:18:33,444 INFO L168 Benchmark]: TraceAbstraction took 14884.21 ms. Allocated memory was 83.9 MB in the beginning and 100.7 MB in the end (delta: 16.8 MB). Free memory was 36.1 MB in the beginning and 61.9 MB in the end (delta: -25.8 MB). Peak memory consumption was 34.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:18:33,445 INFO L168 Benchmark]: Witness Printer took 82.65 ms. Allocated memory is still 100.7 MB. Free memory was 61.9 MB in the beginning and 49.3 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:18:33,447 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.10 ms. Allocated memory is still 54.5 MB. Free memory was 36.5 MB in the beginning and 36.5 MB in the end (delta: 33.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 511.77 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 29.2 MB in the beginning and 44.6 MB in the end (delta: -15.4 MB). Peak memory consumption was 14.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 66.80 ms. Allocated memory is still 67.1 MB. Free memory was 44.6 MB in the beginning and 40.3 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 50.87 ms. Allocated memory is still 67.1 MB. Free memory was 40.3 MB in the beginning and 33.8 MB in the end (delta: 6.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3330.41 ms. Allocated memory was 67.1 MB in the beginning and 83.9 MB in the end (delta: 16.8 MB). Free memory was 33.5 MB in the beginning and 36.6 MB in the end (delta: -3.1 MB). Peak memory consumption was 19.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14884.21 ms. Allocated memory was 83.9 MB in the beginning and 100.7 MB in the end (delta: 16.8 MB). Free memory was 36.1 MB in the beginning and 61.9 MB in the end (delta: -25.8 MB). Peak memory consumption was 34.2 MB. Max. memory is 16.1 GB. * Witness Printer took 82.65 ms. Allocated memory is still 100.7 MB. Free memory was 61.9 MB in the beginning and 49.3 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}] [L1303] COND FALSE !(ret <= 0) [L1308] s->state = 4384 [L1309] s->init_num = 0 [L1310] EXPR s->bbio [L1310] EXPR s->wbio VAL [init=1, SSLv3_client_data={79:0}] [L1310] 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 [L1318] ret = __VERIFIER_nondet_int() [L1319] COND TRUE blastFlag == 1 [L1320] 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: 14756.7ms, OverallIterations: 5, TraceHistogramMax: 6, EmptinessCheckTime: 28.0ms, AutomataDifference: 8030.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 12.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 826 SDtfs, 961 SDslu, 1411 SDs, 0 SdLazy, 756 SolverSat, 91 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7245.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 583 GetRequests, 567 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 95.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=620occurred 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: 101.9ms AutomataMinimizationTime, 4 MinimizatonAttempts, 717 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 194.6ms SsaConstructionTime, 668.1ms SatisfiabilityAnalysisTime, 3557.1ms 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:18:33,492 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...