./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt --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 3d679f9e9f2b660e8a3bb8065738c0f2482e8d5a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt --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 3d679f9e9f2b660e8a3bb8065738c0f2482e8d5a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-4e77c04 [2021-10-13 01:11:44,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 01:11:44,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 01:11:44,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 01:11:44,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 01:11:44,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 01:11:44,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 01:11:44,586 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 01:11:44,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 01:11:44,590 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 01:11:44,591 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 01:11:44,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 01:11:44,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 01:11:44,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 01:11:44,597 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 01:11:44,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 01:11:44,601 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 01:11:44,608 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 01:11:44,616 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 01:11:44,621 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 01:11:44,623 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 01:11:44,630 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 01:11:44,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 01:11:44,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 01:11:44,637 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 01:11:44,638 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 01:11:44,638 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 01:11:44,639 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 01:11:44,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 01:11:44,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 01:11:44,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 01:11:44,653 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 01:11:44,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 01:11:44,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 01:11:44,659 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 01:11:44,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 01:11:44,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 01:11:44,660 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 01:11:44,660 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 01:11:44,661 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 01:11:44,662 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 01:11:44,663 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-13 01:11:44,719 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 01:11:44,719 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 01:11:44,720 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 01:11:44,720 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 01:11:44,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 01:11:44,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 01:11:44,722 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 01:11:44,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 01:11:44,722 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 01:11:44,722 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 01:11:44,723 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 01:11:44,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 01:11:44,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 01:11:44,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 01:11:44,723 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 01:11:44,724 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 01:11:44,724 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 01:11:44,724 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 01:11:44,724 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 01:11:44,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 01:11:44,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 01:11:44,725 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 01:11:44,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 01:11:44,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 01:11:44,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 01:11:44,726 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 01:11:44,726 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 01:11:44,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 01:11:44,726 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 01:11:44,727 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 01:11:44,727 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt 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 -> 3d679f9e9f2b660e8a3bb8065738c0f2482e8d5a [2021-10-13 01:11:45,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 01:11:45,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 01:11:45,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 01:11:45,052 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 01:11:45,053 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 01:11:45,054 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c [2021-10-13 01:11:45,136 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/data/bbf854082/c2fc3f0e519b4835aa449ed7728ad839/FLAG49deb0930 [2021-10-13 01:11:45,867 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 01:11:45,868 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c [2021-10-13 01:11:45,891 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/data/bbf854082/c2fc3f0e519b4835aa449ed7728ad839/FLAG49deb0930 [2021-10-13 01:11:46,029 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/data/bbf854082/c2fc3f0e519b4835aa449ed7728ad839 [2021-10-13 01:11:46,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 01:11:46,035 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 01:11:46,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 01:11:46,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 01:11:46,058 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 01:11:46,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:11:46" (1/1) ... [2021-10-13 01:11:46,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4df83a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:11:46, skipping insertion in model container [2021-10-13 01:11:46,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:11:46" (1/1) ... [2021-10-13 01:11:46,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 01:11:46,156 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 01:11:46,620 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c[72015,72028] [2021-10-13 01:11:46,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 01:11:46,644 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 01:11:46,817 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c[72015,72028] [2021-10-13 01:11:46,820 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 01:11:46,842 INFO L208 MainTranslator]: Completed translation [2021-10-13 01:11:46,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:11:46 WrapperNode [2021-10-13 01:11:46,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 01:11:46,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 01:11:46,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 01:11:46,844 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 01:11:46,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:11:46" (1/1) ... [2021-10-13 01:11:46,897 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:11:46" (1/1) ... [2021-10-13 01:11:46,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 01:11:46,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 01:11:46,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 01:11:46,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 01:11:46,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:11:46" (1/1) ... [2021-10-13 01:11:46,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:11:46" (1/1) ... [2021-10-13 01:11:46,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:11:46" (1/1) ... [2021-10-13 01:11:46,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:11:46" (1/1) ... [2021-10-13 01:11:47,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:11:46" (1/1) ... [2021-10-13 01:11:47,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:11:46" (1/1) ... [2021-10-13 01:11:47,051 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:11:46" (1/1) ... [2021-10-13 01:11:47,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 01:11:47,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 01:11:47,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 01:11:47,067 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 01:11:47,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:11:46" (1/1) ... [2021-10-13 01:11:47,079 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 01:11:47,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:11:47,114 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 01:11:47,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 01:11:47,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-13 01:11:47,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 01:11:47,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-13 01:11:47,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-13 01:11:47,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-13 01:11:47,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 01:11:47,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-13 01:11:47,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 01:11:47,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 01:11:47,472 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 01:11:50,547 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-10-13 01:11:50,548 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-10-13 01:11:50,557 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 01:11:50,557 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-13 01:11:50,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:11:50 BoogieIcfgContainer [2021-10-13 01:11:50,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 01:11:50,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 01:11:50,562 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 01:11:50,566 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 01:11:50,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:11:46" (1/3) ... [2021-10-13 01:11:50,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84fdfba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:11:50, skipping insertion in model container [2021-10-13 01:11:50,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:11:46" (2/3) ... [2021-10-13 01:11:50,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84fdfba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:11:50, skipping insertion in model container [2021-10-13 01:11:50,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:11:50" (3/3) ... [2021-10-13 01:11:50,570 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.03.i.cil.c [2021-10-13 01:11:50,576 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 01:11:50,576 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-13 01:11:50,630 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 01:11:50,636 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-10-13 01:11:50,637 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-13 01:11:50,669 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 143 states have (on average 1.7062937062937062) internal successors, (244), 144 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:11:50,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-13 01:11:50,700 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:11:50,701 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:11:50,702 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:11:50,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:11:50,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1430119920, now seen corresponding path program 1 times [2021-10-13 01:11:50,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:11:50,740 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723650961] [2021-10-13 01:11:50,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:11:50,741 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:11:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:11:51,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:11:51,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:11:51,326 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723650961] [2021-10-13 01:11:51,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723650961] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:11:51,327 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:11:51,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:11:51,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392955699] [2021-10-13 01:11:51,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:11:51,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:11:51,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:11:51,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:11:51,370 INFO L87 Difference]: Start difference. First operand has 145 states, 143 states have (on average 1.7062937062937062) internal successors, (244), 144 states have internal predecessors, (244), 0 states have call successors, (0), 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.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:11:53,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:11:53,978 INFO L93 Difference]: Finished difference Result 315 states and 530 transitions. [2021-10-13 01:11:53,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:11:53,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2021-10-13 01:11:53,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:11:53,994 INFO L225 Difference]: With dead ends: 315 [2021-10-13 01:11:53,994 INFO L226 Difference]: Without dead ends: 160 [2021-10-13 01:11:53,998 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:11:54,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-10-13 01:11:54,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2021-10-13 01:11:54,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.5422535211267605) internal successors, (219), 142 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:11:54,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 219 transitions. [2021-10-13 01:11:54,049 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 219 transitions. Word has length 47 [2021-10-13 01:11:54,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:11:54,050 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 219 transitions. [2021-10-13 01:11:54,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:11:54,051 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 219 transitions. [2021-10-13 01:11:54,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-13 01:11:54,054 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:11:54,055 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:11:54,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 01:11:54,055 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:11:54,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:11:54,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1036819743, now seen corresponding path program 1 times [2021-10-13 01:11:54,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:11:54,057 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391903399] [2021-10-13 01:11:54,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:11:54,058 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:11:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:11:54,239 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:11:54,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:11:54,240 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391903399] [2021-10-13 01:11:54,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391903399] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:11:54,240 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:11:54,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:11:54,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230277948] [2021-10-13 01:11:54,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:11:54,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:11:54,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:11:54,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:11:54,247 INFO L87 Difference]: Start difference. First operand 143 states and 219 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-10-13 01:11:56,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:11:56,748 INFO L93 Difference]: Finished difference Result 282 states and 426 transitions. [2021-10-13 01:11:56,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:11:56,750 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 60 [2021-10-13 01:11:56,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:11:56,752 INFO L225 Difference]: With dead ends: 282 [2021-10-13 01:11:56,752 INFO L226 Difference]: Without dead ends: 160 [2021-10-13 01:11:56,754 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:11:56,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-10-13 01:11:56,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2021-10-13 01:11:56,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.5352112676056338) internal successors, (218), 142 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:11:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 218 transitions. [2021-10-13 01:11:56,773 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 218 transitions. Word has length 60 [2021-10-13 01:11:56,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:11:56,774 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 218 transitions. [2021-10-13 01:11:56,774 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-10-13 01:11:56,775 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 218 transitions. [2021-10-13 01:11:56,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-10-13 01:11:56,785 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:11:56,785 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:11:56,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 01:11:56,786 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:11:56,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:11:56,787 INFO L82 PathProgramCache]: Analyzing trace with hash 622344944, now seen corresponding path program 1 times [2021-10-13 01:11:56,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:11:56,790 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101198561] [2021-10-13 01:11:56,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:11:56,791 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:11:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:11:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:11:56,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:11:56,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101198561] [2021-10-13 01:11:56,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101198561] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:11:56,953 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:11:56,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:11:56,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585324407] [2021-10-13 01:11:56,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:11:56,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:11:56,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:11:56,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:11:56,961 INFO L87 Difference]: Start difference. First operand 143 states and 218 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:11:59,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:11:59,389 INFO L93 Difference]: Finished difference Result 281 states and 424 transitions. [2021-10-13 01:11:59,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:11:59,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-10-13 01:11:59,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:11:59,393 INFO L225 Difference]: With dead ends: 281 [2021-10-13 01:11:59,393 INFO L226 Difference]: Without dead ends: 159 [2021-10-13 01:11:59,394 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:11:59,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-10-13 01:11:59,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 143. [2021-10-13 01:11:59,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.528169014084507) internal successors, (217), 142 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-10-13 01:11:59,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 217 transitions. [2021-10-13 01:11:59,407 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 217 transitions. Word has length 61 [2021-10-13 01:11:59,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:11:59,407 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 217 transitions. [2021-10-13 01:11:59,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:11:59,408 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 217 transitions. [2021-10-13 01:11:59,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-10-13 01:11:59,409 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:11:59,409 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:11:59,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 01:11:59,410 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:11:59,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:11:59,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1460355716, now seen corresponding path program 1 times [2021-10-13 01:11:59,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:11:59,411 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491099255] [2021-10-13 01:11:59,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:11:59,411 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:11:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:11:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:11:59,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:11:59,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491099255] [2021-10-13 01:11:59,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491099255] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:11:59,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:11:59,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:11:59,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745485611] [2021-10-13 01:11:59,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:11:59,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:11:59,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:11:59,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:11:59,514 INFO L87 Difference]: Start difference. First operand 143 states and 217 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:01,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:12:01,987 INFO L93 Difference]: Finished difference Result 281 states and 423 transitions. [2021-10-13 01:12:01,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:12:01,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-10-13 01:12:01,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:12:01,990 INFO L225 Difference]: With dead ends: 281 [2021-10-13 01:12:01,990 INFO L226 Difference]: Without dead ends: 159 [2021-10-13 01:12:01,990 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:12:01,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-10-13 01:12:02,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 143. [2021-10-13 01:12:02,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.5211267605633803) internal successors, (216), 142 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:02,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 216 transitions. [2021-10-13 01:12:02,003 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 216 transitions. Word has length 61 [2021-10-13 01:12:02,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:12:02,003 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 216 transitions. [2021-10-13 01:12:02,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:02,004 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 216 transitions. [2021-10-13 01:12:02,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-10-13 01:12:02,005 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:12:02,005 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:12:02,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 01:12:02,005 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:12:02,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:12:02,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1380080741, now seen corresponding path program 1 times [2021-10-13 01:12:02,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:12:02,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509550456] [2021-10-13 01:12:02,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:12:02,007 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:12:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:12:02,093 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:12:02,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:12:02,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509550456] [2021-10-13 01:12:02,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509550456] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:12:02,093 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:12:02,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:12:02,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925397638] [2021-10-13 01:12:02,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:12:02,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:12:02,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:12:02,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:12:02,096 INFO L87 Difference]: Start difference. First operand 143 states and 216 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:04,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:12:04,530 INFO L93 Difference]: Finished difference Result 280 states and 421 transitions. [2021-10-13 01:12:04,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:12:04,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-10-13 01:12:04,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:12:04,533 INFO L225 Difference]: With dead ends: 280 [2021-10-13 01:12:04,533 INFO L226 Difference]: Without dead ends: 158 [2021-10-13 01:12:04,534 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:12:04,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-10-13 01:12:04,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 143. [2021-10-13 01:12:04,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.5140845070422535) internal successors, (215), 142 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:04,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 215 transitions. [2021-10-13 01:12:04,543 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 215 transitions. Word has length 61 [2021-10-13 01:12:04,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:12:04,543 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 215 transitions. [2021-10-13 01:12:04,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:04,544 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 215 transitions. [2021-10-13 01:12:04,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-10-13 01:12:04,545 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:12:04,545 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:12:04,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 01:12:04,545 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:12:04,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:12:04,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1965538395, now seen corresponding path program 1 times [2021-10-13 01:12:04,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:12:04,547 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759829394] [2021-10-13 01:12:04,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:12:04,547 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:12:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:12:04,633 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:12:04,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:12:04,634 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759829394] [2021-10-13 01:12:04,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759829394] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:12:04,634 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:12:04,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:12:04,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528530785] [2021-10-13 01:12:04,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:12:04,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:12:04,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:12:04,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:12:04,637 INFO L87 Difference]: Start difference. First operand 143 states and 215 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:07,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:12:07,004 INFO L93 Difference]: Finished difference Result 278 states and 418 transitions. [2021-10-13 01:12:07,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:12:07,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-10-13 01:12:07,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:12:07,006 INFO L225 Difference]: With dead ends: 278 [2021-10-13 01:12:07,006 INFO L226 Difference]: Without dead ends: 156 [2021-10-13 01:12:07,007 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:12:07,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-10-13 01:12:07,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2021-10-13 01:12:07,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.5070422535211268) internal successors, (214), 142 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:07,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 214 transitions. [2021-10-13 01:12:07,016 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 214 transitions. Word has length 61 [2021-10-13 01:12:07,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:12:07,016 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 214 transitions. [2021-10-13 01:12:07,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:07,017 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 214 transitions. [2021-10-13 01:12:07,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-10-13 01:12:07,018 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:12:07,018 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:12:07,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 01:12:07,019 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:12:07,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:12:07,020 INFO L82 PathProgramCache]: Analyzing trace with hash -96300664, now seen corresponding path program 1 times [2021-10-13 01:12:07,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:12:07,020 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793120197] [2021-10-13 01:12:07,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:12:07,021 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:12:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:12:07,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:12:07,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:12:07,115 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793120197] [2021-10-13 01:12:07,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793120197] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:12:07,116 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:12:07,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:12:07,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695055029] [2021-10-13 01:12:07,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:12:07,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:12:07,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:12:07,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:12:07,119 INFO L87 Difference]: Start difference. First operand 143 states and 214 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:09,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:12:09,464 INFO L93 Difference]: Finished difference Result 278 states and 417 transitions. [2021-10-13 01:12:09,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:12:09,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-10-13 01:12:09,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:12:09,466 INFO L225 Difference]: With dead ends: 278 [2021-10-13 01:12:09,466 INFO L226 Difference]: Without dead ends: 156 [2021-10-13 01:12:09,466 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:12:09,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-10-13 01:12:09,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2021-10-13 01:12:09,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.5) internal successors, (213), 142 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:09,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 213 transitions. [2021-10-13 01:12:09,472 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 213 transitions. Word has length 62 [2021-10-13 01:12:09,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:12:09,472 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 213 transitions. [2021-10-13 01:12:09,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:09,472 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 213 transitions. [2021-10-13 01:12:09,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-13 01:12:09,473 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:12:09,473 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:12:09,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 01:12:09,474 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:12:09,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:12:09,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1146804983, now seen corresponding path program 1 times [2021-10-13 01:12:09,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:12:09,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293525154] [2021-10-13 01:12:09,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:12:09,475 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:12:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:12:09,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:12:09,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:12:09,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293525154] [2021-10-13 01:12:09,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293525154] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:12:09,544 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:12:09,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:12:09,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052267433] [2021-10-13 01:12:09,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:12:09,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:12:09,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:12:09,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:12:09,545 INFO L87 Difference]: Start difference. First operand 143 states and 213 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:11,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:12:11,903 INFO L93 Difference]: Finished difference Result 278 states and 416 transitions. [2021-10-13 01:12:11,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:12:11,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-10-13 01:12:11,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:12:11,905 INFO L225 Difference]: With dead ends: 278 [2021-10-13 01:12:11,905 INFO L226 Difference]: Without dead ends: 156 [2021-10-13 01:12:11,906 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:12:11,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-10-13 01:12:11,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2021-10-13 01:12:11,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.4929577464788732) internal successors, (212), 142 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:11,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 212 transitions. [2021-10-13 01:12:11,913 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 212 transitions. Word has length 63 [2021-10-13 01:12:11,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:12:11,914 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 212 transitions. [2021-10-13 01:12:11,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:11,914 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 212 transitions. [2021-10-13 01:12:11,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-13 01:12:11,917 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:12:11,918 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:12:11,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 01:12:11,918 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:12:11,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:12:11,919 INFO L82 PathProgramCache]: Analyzing trace with hash 608502701, now seen corresponding path program 1 times [2021-10-13 01:12:11,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:12:11,919 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826002937] [2021-10-13 01:12:11,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:12:11,920 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:12:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:12:12,090 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:12:12,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:12:12,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826002937] [2021-10-13 01:12:12,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826002937] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:12:12,091 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:12:12,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:12:12,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788455021] [2021-10-13 01:12:12,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:12:12,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:12:12,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:12:12,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:12:12,095 INFO L87 Difference]: Start difference. First operand 143 states and 212 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:14,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:12:14,404 INFO L93 Difference]: Finished difference Result 268 states and 402 transitions. [2021-10-13 01:12:14,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:12:14,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-10-13 01:12:14,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:12:14,406 INFO L225 Difference]: With dead ends: 268 [2021-10-13 01:12:14,406 INFO L226 Difference]: Without dead ends: 146 [2021-10-13 01:12:14,407 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:12:14,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-10-13 01:12:14,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2021-10-13 01:12:14,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.4859154929577465) internal successors, (211), 142 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:14,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 211 transitions. [2021-10-13 01:12:14,412 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 211 transitions. Word has length 64 [2021-10-13 01:12:14,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:12:14,412 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 211 transitions. [2021-10-13 01:12:14,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:14,412 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 211 transitions. [2021-10-13 01:12:14,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-13 01:12:14,413 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:12:14,413 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:12:14,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 01:12:14,413 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:12:14,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:12:14,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1008654101, now seen corresponding path program 1 times [2021-10-13 01:12:14,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:12:14,414 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391267189] [2021-10-13 01:12:14,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:12:14,415 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:12:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:12:14,477 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:12:14,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:12:14,478 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391267189] [2021-10-13 01:12:14,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391267189] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:12:14,478 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:12:14,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:12:14,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649765932] [2021-10-13 01:12:14,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:12:14,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:12:14,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:12:14,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:12:14,480 INFO L87 Difference]: Start difference. First operand 143 states and 211 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:16,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:12:16,810 INFO L93 Difference]: Finished difference Result 308 states and 463 transitions. [2021-10-13 01:12:16,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:12:16,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-10-13 01:12:16,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:12:16,813 INFO L225 Difference]: With dead ends: 308 [2021-10-13 01:12:16,813 INFO L226 Difference]: Without dead ends: 186 [2021-10-13 01:12:16,813 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:12:16,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-10-13 01:12:16,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2021-10-13 01:12:16,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.5182926829268293) internal successors, (249), 164 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:16,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 249 transitions. [2021-10-13 01:12:16,818 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 249 transitions. Word has length 64 [2021-10-13 01:12:16,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:12:16,818 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 249 transitions. [2021-10-13 01:12:16,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:16,819 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 249 transitions. [2021-10-13 01:12:16,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-10-13 01:12:16,819 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:12:16,820 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:12:16,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 01:12:16,820 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:12:16,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:12:16,820 INFO L82 PathProgramCache]: Analyzing trace with hash -221679590, now seen corresponding path program 1 times [2021-10-13 01:12:16,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:12:16,821 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773851553] [2021-10-13 01:12:16,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:12:16,821 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:12:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:12:16,886 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:12:16,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:12:16,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773851553] [2021-10-13 01:12:16,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773851553] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:12:16,887 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:12:16,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:12:16,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637250022] [2021-10-13 01:12:16,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:12:16,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:12:16,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:12:16,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:12:16,888 INFO L87 Difference]: Start difference. First operand 165 states and 249 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-10-13 01:12:19,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:12:19,187 INFO L93 Difference]: Finished difference Result 330 states and 500 transitions. [2021-10-13 01:12:19,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:12:19,187 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 77 [2021-10-13 01:12:19,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:12:19,189 INFO L225 Difference]: With dead ends: 330 [2021-10-13 01:12:19,189 INFO L226 Difference]: Without dead ends: 186 [2021-10-13 01:12:19,189 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:12:19,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-10-13 01:12:19,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2021-10-13 01:12:19,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.5121951219512195) internal successors, (248), 164 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:19,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 248 transitions. [2021-10-13 01:12:19,195 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 248 transitions. Word has length 77 [2021-10-13 01:12:19,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:12:19,196 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 248 transitions. [2021-10-13 01:12:19,196 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-10-13 01:12:19,196 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 248 transitions. [2021-10-13 01:12:19,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-10-13 01:12:19,197 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:12:19,197 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:12:19,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 01:12:19,198 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:12:19,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:12:19,198 INFO L82 PathProgramCache]: Analyzing trace with hash 263571285, now seen corresponding path program 1 times [2021-10-13 01:12:19,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:12:19,198 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778120634] [2021-10-13 01:12:19,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:12:19,199 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:12:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:12:19,279 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:12:19,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:12:19,280 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778120634] [2021-10-13 01:12:19,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778120634] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:12:19,280 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:12:19,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:12:19,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322274670] [2021-10-13 01:12:19,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:12:19,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:12:19,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:12:19,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:12:19,282 INFO L87 Difference]: Start difference. First operand 165 states and 248 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:21,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:12:21,601 INFO L93 Difference]: Finished difference Result 329 states and 497 transitions. [2021-10-13 01:12:21,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:12:21,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-10-13 01:12:21,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:12:21,603 INFO L225 Difference]: With dead ends: 329 [2021-10-13 01:12:21,603 INFO L226 Difference]: Without dead ends: 185 [2021-10-13 01:12:21,604 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:12:21,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-10-13 01:12:21,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 165. [2021-10-13 01:12:21,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.5060975609756098) internal successors, (247), 164 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:21,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 247 transitions. [2021-10-13 01:12:21,610 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 247 transitions. Word has length 78 [2021-10-13 01:12:21,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:12:21,610 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 247 transitions. [2021-10-13 01:12:21,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:21,611 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 247 transitions. [2021-10-13 01:12:21,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-10-13 01:12:21,612 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:12:21,612 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:12:21,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 01:12:21,613 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:12:21,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:12:21,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1101582057, now seen corresponding path program 1 times [2021-10-13 01:12:21,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:12:21,613 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387128473] [2021-10-13 01:12:21,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:12:21,614 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:12:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:12:21,668 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:12:21,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:12:21,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387128473] [2021-10-13 01:12:21,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387128473] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:12:21,669 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:12:21,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:12:21,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948506256] [2021-10-13 01:12:21,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:12:21,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:12:21,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:12:21,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:12:21,671 INFO L87 Difference]: Start difference. First operand 165 states and 247 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:23,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:12:23,995 INFO L93 Difference]: Finished difference Result 329 states and 495 transitions. [2021-10-13 01:12:23,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:12:23,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-10-13 01:12:23,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:12:23,997 INFO L225 Difference]: With dead ends: 329 [2021-10-13 01:12:23,997 INFO L226 Difference]: Without dead ends: 185 [2021-10-13 01:12:23,998 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:12:23,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-10-13 01:12:24,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 165. [2021-10-13 01:12:24,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.5) internal successors, (246), 164 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:24,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 246 transitions. [2021-10-13 01:12:24,004 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 246 transitions. Word has length 78 [2021-10-13 01:12:24,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:12:24,005 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 246 transitions. [2021-10-13 01:12:24,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:24,005 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 246 transitions. [2021-10-13 01:12:24,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-10-13 01:12:24,006 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:12:24,006 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:12:24,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 01:12:24,007 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:12:24,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:12:24,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1738854400, now seen corresponding path program 1 times [2021-10-13 01:12:24,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:12:24,008 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266651204] [2021-10-13 01:12:24,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:12:24,008 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:12:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:12:24,075 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:12:24,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:12:24,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266651204] [2021-10-13 01:12:24,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266651204] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:12:24,076 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:12:24,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:12:24,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195065485] [2021-10-13 01:12:24,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:12:24,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:12:24,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:12:24,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:12:24,078 INFO L87 Difference]: Start difference. First operand 165 states and 246 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:26,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:12:26,370 INFO L93 Difference]: Finished difference Result 328 states and 492 transitions. [2021-10-13 01:12:26,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:12:26,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-10-13 01:12:26,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:12:26,372 INFO L225 Difference]: With dead ends: 328 [2021-10-13 01:12:26,372 INFO L226 Difference]: Without dead ends: 184 [2021-10-13 01:12:26,373 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:12:26,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-10-13 01:12:26,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 165. [2021-10-13 01:12:26,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.4939024390243902) internal successors, (245), 164 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:26,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 245 transitions. [2021-10-13 01:12:26,379 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 245 transitions. Word has length 78 [2021-10-13 01:12:26,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:12:26,379 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 245 transitions. [2021-10-13 01:12:26,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:26,379 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2021-10-13 01:12:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-10-13 01:12:26,380 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:12:26,380 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:12:26,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 01:12:26,381 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:12:26,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:12:26,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1606764736, now seen corresponding path program 1 times [2021-10-13 01:12:26,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:12:26,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770572022] [2021-10-13 01:12:26,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:12:26,382 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:12:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:12:26,470 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:12:26,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:12:26,471 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770572022] [2021-10-13 01:12:26,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770572022] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:12:26,471 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:12:26,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:12:26,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742733463] [2021-10-13 01:12:26,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:12:26,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:12:26,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:12:26,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:12:26,473 INFO L87 Difference]: Start difference. First operand 165 states and 245 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:28,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:12:28,773 INFO L93 Difference]: Finished difference Result 326 states and 488 transitions. [2021-10-13 01:12:28,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:12:28,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-10-13 01:12:28,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:12:28,775 INFO L225 Difference]: With dead ends: 326 [2021-10-13 01:12:28,775 INFO L226 Difference]: Without dead ends: 182 [2021-10-13 01:12:28,776 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:12:28,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-10-13 01:12:28,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2021-10-13 01:12:28,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.4878048780487805) internal successors, (244), 164 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:28,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2021-10-13 01:12:28,782 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 78 [2021-10-13 01:12:28,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:12:28,782 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2021-10-13 01:12:28,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:28,782 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2021-10-13 01:12:28,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-10-13 01:12:28,783 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:12:28,784 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:12:28,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 01:12:28,784 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:12:28,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:12:28,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1666617795, now seen corresponding path program 1 times [2021-10-13 01:12:28,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:12:28,785 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000562774] [2021-10-13 01:12:28,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:12:28,786 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:12:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:12:28,843 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:12:28,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:12:28,844 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000562774] [2021-10-13 01:12:28,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000562774] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:12:28,844 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:12:28,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:12:28,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743208855] [2021-10-13 01:12:28,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:12:28,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:12:28,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:12:28,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:12:28,846 INFO L87 Difference]: Start difference. First operand 165 states and 244 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:31,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:12:31,107 INFO L93 Difference]: Finished difference Result 326 states and 486 transitions. [2021-10-13 01:12:31,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:12:31,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-10-13 01:12:31,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:12:31,109 INFO L225 Difference]: With dead ends: 326 [2021-10-13 01:12:31,109 INFO L226 Difference]: Without dead ends: 182 [2021-10-13 01:12:31,110 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:12:31,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-10-13 01:12:31,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2021-10-13 01:12:31,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.4817073170731707) internal successors, (243), 164 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:31,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 243 transitions. [2021-10-13 01:12:31,116 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 243 transitions. Word has length 79 [2021-10-13 01:12:31,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:12:31,116 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 243 transitions. [2021-10-13 01:12:31,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:31,117 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 243 transitions. [2021-10-13 01:12:31,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-10-13 01:12:31,118 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:12:31,118 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:12:31,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 01:12:31,118 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:12:31,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:12:31,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1964059694, now seen corresponding path program 1 times [2021-10-13 01:12:31,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:12:31,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183953395] [2021-10-13 01:12:31,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:12:31,120 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:12:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:12:31,180 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:12:31,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:12:31,181 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183953395] [2021-10-13 01:12:31,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183953395] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:12:31,181 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:12:31,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:12:31,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129505092] [2021-10-13 01:12:31,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:12:31,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:12:31,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:12:31,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:12:31,183 INFO L87 Difference]: Start difference. First operand 165 states and 243 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:33,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:12:33,453 INFO L93 Difference]: Finished difference Result 326 states and 484 transitions. [2021-10-13 01:12:33,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:12:33,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-10-13 01:12:33,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:12:33,455 INFO L225 Difference]: With dead ends: 326 [2021-10-13 01:12:33,455 INFO L226 Difference]: Without dead ends: 182 [2021-10-13 01:12:33,455 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:12:33,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-10-13 01:12:33,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2021-10-13 01:12:33,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.475609756097561) internal successors, (242), 164 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:33,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 242 transitions. [2021-10-13 01:12:33,475 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 242 transitions. Word has length 80 [2021-10-13 01:12:33,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:12:33,475 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 242 transitions. [2021-10-13 01:12:33,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:33,476 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 242 transitions. [2021-10-13 01:12:33,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-10-13 01:12:33,477 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:12:33,477 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:12:33,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 01:12:33,477 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:12:33,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:12:33,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1738940120, now seen corresponding path program 1 times [2021-10-13 01:12:33,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:12:33,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742818466] [2021-10-13 01:12:33,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:12:33,479 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:12:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:12:33,536 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:12:33,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:12:33,537 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742818466] [2021-10-13 01:12:33,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742818466] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:12:33,537 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:12:33,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:12:33,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29467130] [2021-10-13 01:12:33,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:12:33,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:12:33,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:12:33,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:12:33,539 INFO L87 Difference]: Start difference. First operand 165 states and 242 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:35,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:12:35,780 INFO L93 Difference]: Finished difference Result 316 states and 469 transitions. [2021-10-13 01:12:35,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:12:35,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2021-10-13 01:12:35,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:12:35,781 INFO L225 Difference]: With dead ends: 316 [2021-10-13 01:12:35,782 INFO L226 Difference]: Without dead ends: 172 [2021-10-13 01:12:35,782 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:12:35,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-10-13 01:12:35,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 165. [2021-10-13 01:12:35,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.4695121951219512) internal successors, (241), 164 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:35,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 241 transitions. [2021-10-13 01:12:35,788 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 241 transitions. Word has length 81 [2021-10-13 01:12:35,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:12:35,788 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 241 transitions. [2021-10-13 01:12:35,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 241 transitions. [2021-10-13 01:12:35,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-10-13 01:12:35,790 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:12:35,790 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:12:35,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 01:12:35,790 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:12:35,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:12:35,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1548644719, now seen corresponding path program 1 times [2021-10-13 01:12:35,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:12:35,791 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236778635] [2021-10-13 01:12:35,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:12:35,792 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:12:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:12:35,863 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 01:12:35,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:12:35,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236778635] [2021-10-13 01:12:35,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236778635] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:12:35,864 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:12:35,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:12:35,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004778973] [2021-10-13 01:12:35,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:12:35,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:12:35,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:12:35,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:12:35,866 INFO L87 Difference]: Start difference. First operand 165 states and 241 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-10-13 01:12:38,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:12:38,241 INFO L93 Difference]: Finished difference Result 405 states and 606 transitions. [2021-10-13 01:12:38,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:12:38,242 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 86 [2021-10-13 01:12:38,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:12:38,244 INFO L225 Difference]: With dead ends: 405 [2021-10-13 01:12:38,244 INFO L226 Difference]: Without dead ends: 261 [2021-10-13 01:12:38,244 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:12:38,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-10-13 01:12:38,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 208. [2021-10-13 01:12:38,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.541062801932367) internal successors, (319), 207 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-10-13 01:12:38,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 319 transitions. [2021-10-13 01:12:38,252 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 319 transitions. Word has length 86 [2021-10-13 01:12:38,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:12:38,253 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 319 transitions. [2021-10-13 01:12:38,253 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-10-13 01:12:38,253 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 319 transitions. [2021-10-13 01:12:38,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-10-13 01:12:38,254 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:12:38,254 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:12:38,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 01:12:38,255 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:12:38,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:12:38,255 INFO L82 PathProgramCache]: Analyzing trace with hash 651251441, now seen corresponding path program 1 times [2021-10-13 01:12:38,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:12:38,256 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758508832] [2021-10-13 01:12:38,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:12:38,256 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:12:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:12:38,327 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 01:12:38,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:12:38,328 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758508832] [2021-10-13 01:12:38,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758508832] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:12:38,328 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:12:38,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:12:38,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302397422] [2021-10-13 01:12:38,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:12:38,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:12:38,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:12:38,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:12:38,330 INFO L87 Difference]: Start difference. First operand 208 states and 319 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-10-13 01:12:40,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:12:40,674 INFO L93 Difference]: Finished difference Result 444 states and 688 transitions. [2021-10-13 01:12:40,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:12:40,674 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 86 [2021-10-13 01:12:40,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:12:40,676 INFO L225 Difference]: With dead ends: 444 [2021-10-13 01:12:40,677 INFO L226 Difference]: Without dead ends: 257 [2021-10-13 01:12:40,677 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:12:40,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-10-13 01:12:40,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2021-10-13 01:12:40,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.5627705627705628) internal successors, (361), 231 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:40,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 361 transitions. [2021-10-13 01:12:40,685 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 361 transitions. Word has length 86 [2021-10-13 01:12:40,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:12:40,685 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 361 transitions. [2021-10-13 01:12:40,686 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-10-13 01:12:40,686 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 361 transitions. [2021-10-13 01:12:40,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-13 01:12:40,687 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:12:40,687 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:12:40,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-13 01:12:40,688 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:12:40,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:12:40,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1438844928, now seen corresponding path program 1 times [2021-10-13 01:12:40,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:12:40,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777084170] [2021-10-13 01:12:40,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:12:40,689 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:12:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:12:40,755 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 01:12:40,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:12:40,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777084170] [2021-10-13 01:12:40,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777084170] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:12:40,755 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:12:40,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:12:40,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220529322] [2021-10-13 01:12:40,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:12:40,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:12:40,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:12:40,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:12:40,757 INFO L87 Difference]: Start difference. First operand 232 states and 361 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:43,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:12:43,211 INFO L93 Difference]: Finished difference Result 496 states and 767 transitions. [2021-10-13 01:12:43,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:12:43,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 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 99 [2021-10-13 01:12:43,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:12:43,214 INFO L225 Difference]: With dead ends: 496 [2021-10-13 01:12:43,214 INFO L226 Difference]: Without dead ends: 285 [2021-10-13 01:12:43,215 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:12:43,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-10-13 01:12:43,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 232. [2021-10-13 01:12:43,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.5584415584415585) internal successors, (360), 231 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:43,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 360 transitions. [2021-10-13 01:12:43,222 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 360 transitions. Word has length 99 [2021-10-13 01:12:43,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:12:43,223 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 360 transitions. [2021-10-13 01:12:43,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:43,223 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 360 transitions. [2021-10-13 01:12:43,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-13 01:12:43,225 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:12:43,225 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:12:43,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-13 01:12:43,225 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:12:43,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:12:43,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1398170178, now seen corresponding path program 1 times [2021-10-13 01:12:43,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:12:43,226 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266052477] [2021-10-13 01:12:43,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:12:43,227 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:12:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:12:43,291 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 01:12:43,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:12:43,292 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266052477] [2021-10-13 01:12:43,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266052477] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:12:43,292 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:12:43,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:12:43,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475871757] [2021-10-13 01:12:43,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:12:43,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:12:43,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:12:43,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:12:43,294 INFO L87 Difference]: Start difference. First operand 232 states and 360 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:45,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:12:45,624 INFO L93 Difference]: Finished difference Result 468 states and 727 transitions. [2021-10-13 01:12:45,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:12:45,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 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 99 [2021-10-13 01:12:45,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:12:45,627 INFO L225 Difference]: With dead ends: 468 [2021-10-13 01:12:45,627 INFO L226 Difference]: Without dead ends: 257 [2021-10-13 01:12:45,652 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:12:45,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-10-13 01:12:45,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2021-10-13 01:12:45,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.5541125541125542) internal successors, (359), 231 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:45,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 359 transitions. [2021-10-13 01:12:45,660 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 359 transitions. Word has length 99 [2021-10-13 01:12:45,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:12:45,661 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 359 transitions. [2021-10-13 01:12:45,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:45,661 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2021-10-13 01:12:45,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-13 01:12:45,662 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:12:45,663 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:12:45,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-13 01:12:45,663 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:12:45,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:12:45,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1186151471, now seen corresponding path program 1 times [2021-10-13 01:12:45,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:12:45,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979315675] [2021-10-13 01:12:45,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:12:45,664 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:12:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:12:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 01:12:45,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:12:45,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979315675] [2021-10-13 01:12:45,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979315675] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:12:45,742 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:12:45,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:12:45,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241064274] [2021-10-13 01:12:45,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:12:45,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:12:45,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:12:45,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:12:45,744 INFO L87 Difference]: Start difference. First operand 232 states and 359 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:48,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:12:48,155 INFO L93 Difference]: Finished difference Result 495 states and 762 transitions. [2021-10-13 01:12:48,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:12:48,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-10-13 01:12:48,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:12:48,157 INFO L225 Difference]: With dead ends: 495 [2021-10-13 01:12:48,157 INFO L226 Difference]: Without dead ends: 284 [2021-10-13 01:12:48,158 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:12:48,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-10-13 01:12:48,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 232. [2021-10-13 01:12:48,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.5497835497835497) internal successors, (358), 231 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:48,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 358 transitions. [2021-10-13 01:12:48,165 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 358 transitions. Word has length 100 [2021-10-13 01:12:48,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:12:48,166 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 358 transitions. [2021-10-13 01:12:48,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:48,166 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 358 transitions. [2021-10-13 01:12:48,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-13 01:12:48,167 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:12:48,167 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:12:48,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-13 01:12:48,168 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:12:48,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:12:48,168 INFO L82 PathProgramCache]: Analyzing trace with hash 2024162243, now seen corresponding path program 1 times [2021-10-13 01:12:48,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:12:48,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872633894] [2021-10-13 01:12:48,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:12:48,169 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:12:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:12:48,254 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-10-13 01:12:48,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:12:48,254 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872633894] [2021-10-13 01:12:48,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872633894] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:12:48,255 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:12:48,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 01:12:48,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488636542] [2021-10-13 01:12:48,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 01:12:48,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:12:48,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 01:12:48,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:12:48,256 INFO L87 Difference]: Start difference. First operand 232 states and 358 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:52,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:12:52,676 INFO L93 Difference]: Finished difference Result 464 states and 721 transitions. [2021-10-13 01:12:52,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 01:12:52,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-10-13 01:12:52,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:12:52,678 INFO L225 Difference]: With dead ends: 464 [2021-10-13 01:12:52,678 INFO L226 Difference]: Without dead ends: 253 [2021-10-13 01:12:52,679 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 31.8ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-13 01:12:52,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-10-13 01:12:52,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2021-10-13 01:12:52,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.5298804780876494) internal successors, (384), 251 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:52,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 384 transitions. [2021-10-13 01:12:52,687 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 384 transitions. Word has length 100 [2021-10-13 01:12:52,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:12:52,687 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 384 transitions. [2021-10-13 01:12:52,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:52,688 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 384 transitions. [2021-10-13 01:12:52,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-13 01:12:52,689 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:12:52,689 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:12:52,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-13 01:12:52,690 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:12:52,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:12:52,690 INFO L82 PathProgramCache]: Analyzing trace with hash -816274214, now seen corresponding path program 1 times [2021-10-13 01:12:52,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:12:52,691 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13816436] [2021-10-13 01:12:52,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:12:52,691 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:12:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:12:52,764 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 01:12:52,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:12:52,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13816436] [2021-10-13 01:12:52,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13816436] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:12:52,765 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:12:52,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:12:52,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563158192] [2021-10-13 01:12:52,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:12:52,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:12:52,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:12:52,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:12:52,767 INFO L87 Difference]: Start difference. First operand 252 states and 384 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:55,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:12:55,134 INFO L93 Difference]: Finished difference Result 534 states and 810 transitions. [2021-10-13 01:12:55,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:12:55,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-10-13 01:12:55,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:12:55,137 INFO L225 Difference]: With dead ends: 534 [2021-10-13 01:12:55,137 INFO L226 Difference]: Without dead ends: 303 [2021-10-13 01:12:55,138 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:12:55,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-10-13 01:12:55,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 252. [2021-10-13 01:12:55,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.5258964143426295) internal successors, (383), 251 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:55,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 383 transitions. [2021-10-13 01:12:55,147 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 383 transitions. Word has length 100 [2021-10-13 01:12:55,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:12:55,147 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 383 transitions. [2021-10-13 01:12:55,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 383 transitions. [2021-10-13 01:12:55,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-13 01:12:55,149 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:12:55,149 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:12:55,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-13 01:12:55,150 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:12:55,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:12:55,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1765622374, now seen corresponding path program 1 times [2021-10-13 01:12:55,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:12:55,151 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822380943] [2021-10-13 01:12:55,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:12:55,151 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:12:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:12:55,216 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 01:12:55,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:12:55,216 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822380943] [2021-10-13 01:12:55,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822380943] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:12:55,217 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:12:55,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:12:55,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060441953] [2021-10-13 01:12:55,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:12:55,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:12:55,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:12:55,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:12:55,219 INFO L87 Difference]: Start difference. First operand 252 states and 383 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:57,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:12:57,615 INFO L93 Difference]: Finished difference Result 532 states and 806 transitions. [2021-10-13 01:12:57,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:12:57,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-10-13 01:12:57,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:12:57,617 INFO L225 Difference]: With dead ends: 532 [2021-10-13 01:12:57,617 INFO L226 Difference]: Without dead ends: 301 [2021-10-13 01:12:57,618 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:12:57,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-10-13 01:12:57,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 252. [2021-10-13 01:12:57,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.5219123505976095) internal successors, (382), 251 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:57,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 382 transitions. [2021-10-13 01:12:57,627 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 382 transitions. Word has length 100 [2021-10-13 01:12:57,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:12:57,627 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 382 transitions. [2021-10-13 01:12:57,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:12:57,628 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 382 transitions. [2021-10-13 01:12:57,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-13 01:12:57,629 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:12:57,629 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:12:57,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-13 01:12:57,630 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:12:57,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:12:57,630 INFO L82 PathProgramCache]: Analyzing trace with hash 444643036, now seen corresponding path program 1 times [2021-10-13 01:12:57,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:12:57,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163322754] [2021-10-13 01:12:57,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:12:57,631 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:12:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:12:57,705 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 01:12:57,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:12:57,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163322754] [2021-10-13 01:12:57,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163322754] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:12:57,705 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:12:57,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:12:57,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138001887] [2021-10-13 01:12:57,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:12:57,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:12:57,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:12:57,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:12:57,708 INFO L87 Difference]: Start difference. First operand 252 states and 382 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:00,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:13:00,020 INFO L93 Difference]: Finished difference Result 506 states and 768 transitions. [2021-10-13 01:13:00,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:13:00,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-10-13 01:13:00,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:13:00,022 INFO L225 Difference]: With dead ends: 506 [2021-10-13 01:13:00,022 INFO L226 Difference]: Without dead ends: 275 [2021-10-13 01:13:00,023 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:13:00,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-10-13 01:13:00,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 252. [2021-10-13 01:13:00,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.5179282868525896) internal successors, (381), 251 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:00,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 381 transitions. [2021-10-13 01:13:00,031 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 381 transitions. Word has length 100 [2021-10-13 01:13:00,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:13:00,031 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 381 transitions. [2021-10-13 01:13:00,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:00,032 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 381 transitions. [2021-10-13 01:13:00,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-13 01:13:00,033 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:13:00,033 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:13:00,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-13 01:13:00,034 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:13:00,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:13:00,034 INFO L82 PathProgramCache]: Analyzing trace with hash -504705124, now seen corresponding path program 1 times [2021-10-13 01:13:00,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:13:00,035 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570310532] [2021-10-13 01:13:00,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:13:00,035 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:13:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:13:00,099 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 01:13:00,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:13:00,099 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570310532] [2021-10-13 01:13:00,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570310532] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:13:00,100 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:13:00,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:13:00,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202965581] [2021-10-13 01:13:00,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:13:00,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:13:00,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:13:00,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:13:00,102 INFO L87 Difference]: Start difference. First operand 252 states and 381 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:02,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:13:02,378 INFO L93 Difference]: Finished difference Result 504 states and 764 transitions. [2021-10-13 01:13:02,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:13:02,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-10-13 01:13:02,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:13:02,380 INFO L225 Difference]: With dead ends: 504 [2021-10-13 01:13:02,380 INFO L226 Difference]: Without dead ends: 273 [2021-10-13 01:13:02,381 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:13:02,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-10-13 01:13:02,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2021-10-13 01:13:02,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.5139442231075697) internal successors, (380), 251 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:02,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 380 transitions. [2021-10-13 01:13:02,390 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 380 transitions. Word has length 100 [2021-10-13 01:13:02,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:13:02,390 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 380 transitions. [2021-10-13 01:13:02,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:02,390 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 380 transitions. [2021-10-13 01:13:02,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-10-13 01:13:02,392 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:13:02,392 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:13:02,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-13 01:13:02,392 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:13:02,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:13:02,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1074128156, now seen corresponding path program 1 times [2021-10-13 01:13:02,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:13:02,393 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600299059] [2021-10-13 01:13:02,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:13:02,394 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:13:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:13:02,457 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 01:13:02,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:13:02,458 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600299059] [2021-10-13 01:13:02,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600299059] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:13:02,458 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:13:02,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:13:02,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310757614] [2021-10-13 01:13:02,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:13:02,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:13:02,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:13:02,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:13:02,460 INFO L87 Difference]: Start difference. First operand 252 states and 380 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:04,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:13:04,923 INFO L93 Difference]: Finished difference Result 532 states and 800 transitions. [2021-10-13 01:13:04,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:13:04,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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 101 [2021-10-13 01:13:04,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:13:04,926 INFO L225 Difference]: With dead ends: 532 [2021-10-13 01:13:04,926 INFO L226 Difference]: Without dead ends: 301 [2021-10-13 01:13:04,926 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:13:04,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-10-13 01:13:04,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 252. [2021-10-13 01:13:04,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.5099601593625498) internal successors, (379), 251 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:04,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 379 transitions. [2021-10-13 01:13:04,961 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 379 transitions. Word has length 101 [2021-10-13 01:13:04,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:13:04,962 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 379 transitions. [2021-10-13 01:13:04,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:04,962 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 379 transitions. [2021-10-13 01:13:04,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-10-13 01:13:04,963 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:13:04,963 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:13:04,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-13 01:13:04,964 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:13:04,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:13:04,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1507857242, now seen corresponding path program 1 times [2021-10-13 01:13:04,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:13:04,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929987451] [2021-10-13 01:13:04,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:13:04,965 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:13:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:13:05,028 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 01:13:05,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:13:05,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929987451] [2021-10-13 01:13:05,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929987451] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:13:05,029 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:13:05,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:13:05,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452970123] [2021-10-13 01:13:05,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:13:05,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:13:05,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:13:05,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:13:05,031 INFO L87 Difference]: Start difference. First operand 252 states and 379 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:07,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:13:07,309 INFO L93 Difference]: Finished difference Result 504 states and 760 transitions. [2021-10-13 01:13:07,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:13:07,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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 101 [2021-10-13 01:13:07,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:13:07,311 INFO L225 Difference]: With dead ends: 504 [2021-10-13 01:13:07,312 INFO L226 Difference]: Without dead ends: 273 [2021-10-13 01:13:07,312 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:13:07,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-10-13 01:13:07,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2021-10-13 01:13:07,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.5059760956175299) internal successors, (378), 251 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:07,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 378 transitions. [2021-10-13 01:13:07,321 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 378 transitions. Word has length 101 [2021-10-13 01:13:07,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:13:07,321 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 378 transitions. [2021-10-13 01:13:07,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:07,321 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 378 transitions. [2021-10-13 01:13:07,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-10-13 01:13:07,322 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:13:07,323 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:13:07,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-13 01:13:07,323 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:13:07,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:13:07,324 INFO L82 PathProgramCache]: Analyzing trace with hash 416480630, now seen corresponding path program 1 times [2021-10-13 01:13:07,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:13:07,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539487085] [2021-10-13 01:13:07,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:13:07,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:13:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:13:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 01:13:07,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:13:07,388 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539487085] [2021-10-13 01:13:07,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539487085] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:13:07,388 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:13:07,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:13:07,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56424262] [2021-10-13 01:13:07,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:13:07,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:13:07,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:13:07,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:13:07,390 INFO L87 Difference]: Start difference. First operand 252 states and 378 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:09,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:13:09,880 INFO L93 Difference]: Finished difference Result 532 states and 796 transitions. [2021-10-13 01:13:09,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:13:09,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2021-10-13 01:13:09,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:13:09,883 INFO L225 Difference]: With dead ends: 532 [2021-10-13 01:13:09,883 INFO L226 Difference]: Without dead ends: 301 [2021-10-13 01:13:09,884 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:13:09,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-10-13 01:13:09,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 252. [2021-10-13 01:13:09,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.50199203187251) internal successors, (377), 251 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:09,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 377 transitions. [2021-10-13 01:13:09,893 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 377 transitions. Word has length 102 [2021-10-13 01:13:09,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:13:09,893 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 377 transitions. [2021-10-13 01:13:09,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:09,893 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 377 transitions. [2021-10-13 01:13:09,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-10-13 01:13:09,894 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:13:09,895 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:13:09,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-13 01:13:09,895 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:13:09,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:13:09,896 INFO L82 PathProgramCache]: Analyzing trace with hash 977180408, now seen corresponding path program 1 times [2021-10-13 01:13:09,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:13:09,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523319237] [2021-10-13 01:13:09,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:13:09,896 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:13:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:13:09,977 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 01:13:09,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:13:09,978 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523319237] [2021-10-13 01:13:09,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523319237] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:13:09,979 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:13:09,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:13:09,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776460086] [2021-10-13 01:13:09,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:13:09,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:13:09,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:13:09,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:13:09,982 INFO L87 Difference]: Start difference. First operand 252 states and 377 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:12,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:13:12,266 INFO L93 Difference]: Finished difference Result 504 states and 756 transitions. [2021-10-13 01:13:12,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:13:12,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2021-10-13 01:13:12,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:13:12,268 INFO L225 Difference]: With dead ends: 504 [2021-10-13 01:13:12,268 INFO L226 Difference]: Without dead ends: 273 [2021-10-13 01:13:12,269 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:13:12,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-10-13 01:13:12,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2021-10-13 01:13:12,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.49800796812749) internal successors, (376), 251 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:12,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 376 transitions. [2021-10-13 01:13:12,278 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 376 transitions. Word has length 102 [2021-10-13 01:13:12,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:13:12,279 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 376 transitions. [2021-10-13 01:13:12,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:12,279 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 376 transitions. [2021-10-13 01:13:12,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-10-13 01:13:12,280 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:13:12,280 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:13:12,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-13 01:13:12,281 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:13:12,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:13:12,281 INFO L82 PathProgramCache]: Analyzing trace with hash 301543159, now seen corresponding path program 1 times [2021-10-13 01:13:12,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:13:12,282 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407536929] [2021-10-13 01:13:12,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:13:12,282 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:13:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:13:12,347 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 01:13:12,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:13:12,348 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407536929] [2021-10-13 01:13:12,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407536929] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:13:12,348 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:13:12,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:13:12,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619317525] [2021-10-13 01:13:12,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:13:12,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:13:12,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:13:12,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:13:12,350 INFO L87 Difference]: Start difference. First operand 252 states and 376 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:14,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:13:14,205 INFO L93 Difference]: Finished difference Result 532 states and 792 transitions. [2021-10-13 01:13:14,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:13:14,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-10-13 01:13:14,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:13:14,207 INFO L225 Difference]: With dead ends: 532 [2021-10-13 01:13:14,207 INFO L226 Difference]: Without dead ends: 301 [2021-10-13 01:13:14,207 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:13:14,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-10-13 01:13:14,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 252. [2021-10-13 01:13:14,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.4940239043824701) internal successors, (375), 251 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:14,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 375 transitions. [2021-10-13 01:13:14,216 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 375 transitions. Word has length 103 [2021-10-13 01:13:14,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:13:14,217 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 375 transitions. [2021-10-13 01:13:14,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:14,217 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 375 transitions. [2021-10-13 01:13:14,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-10-13 01:13:14,218 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:13:14,218 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:13:14,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-13 01:13:14,219 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:13:14,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:13:14,219 INFO L82 PathProgramCache]: Analyzing trace with hash 503367093, now seen corresponding path program 1 times [2021-10-13 01:13:14,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:13:14,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581739735] [2021-10-13 01:13:14,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:13:14,220 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:13:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:13:14,285 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 01:13:14,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:13:14,285 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581739735] [2021-10-13 01:13:14,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581739735] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:13:14,286 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:13:14,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:13:14,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133732421] [2021-10-13 01:13:14,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:13:14,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:13:14,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:13:14,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:13:14,287 INFO L87 Difference]: Start difference. First operand 252 states and 375 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:16,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:13:16,634 INFO L93 Difference]: Finished difference Result 504 states and 752 transitions. [2021-10-13 01:13:16,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:13:16,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-10-13 01:13:16,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:13:16,635 INFO L225 Difference]: With dead ends: 504 [2021-10-13 01:13:16,635 INFO L226 Difference]: Without dead ends: 273 [2021-10-13 01:13:16,636 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:13:16,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-10-13 01:13:16,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2021-10-13 01:13:16,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.4900398406374502) internal successors, (374), 251 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:16,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 374 transitions. [2021-10-13 01:13:16,642 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 374 transitions. Word has length 103 [2021-10-13 01:13:16,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:13:16,643 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 374 transitions. [2021-10-13 01:13:16,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:16,643 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 374 transitions. [2021-10-13 01:13:16,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-10-13 01:13:16,644 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:13:16,645 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:13:16,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-13 01:13:16,645 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:13:16,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:13:16,646 INFO L82 PathProgramCache]: Analyzing trace with hash -169251791, now seen corresponding path program 1 times [2021-10-13 01:13:16,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:13:16,646 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730521858] [2021-10-13 01:13:16,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:13:16,646 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:13:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:13:16,710 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 01:13:16,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:13:16,710 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730521858] [2021-10-13 01:13:16,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730521858] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:13:16,710 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:13:16,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:13:16,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717313274] [2021-10-13 01:13:16,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:13:16,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:13:16,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:13:16,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:13:16,712 INFO L87 Difference]: Start difference. First operand 252 states and 374 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:19,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:13:19,139 INFO L93 Difference]: Finished difference Result 522 states and 776 transitions. [2021-10-13 01:13:19,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:13:19,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-10-13 01:13:19,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:13:19,142 INFO L225 Difference]: With dead ends: 522 [2021-10-13 01:13:19,143 INFO L226 Difference]: Without dead ends: 291 [2021-10-13 01:13:19,143 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:13:19,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-10-13 01:13:19,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 252. [2021-10-13 01:13:19,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.4860557768924303) internal successors, (373), 251 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:19,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 373 transitions. [2021-10-13 01:13:19,155 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 373 transitions. Word has length 104 [2021-10-13 01:13:19,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:13:19,155 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 373 transitions. [2021-10-13 01:13:19,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:19,156 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 373 transitions. [2021-10-13 01:13:19,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-10-13 01:13:19,157 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:13:19,157 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:13:19,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-13 01:13:19,158 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:13:19,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:13:19,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1792322867, now seen corresponding path program 1 times [2021-10-13 01:13:19,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:13:19,159 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030212931] [2021-10-13 01:13:19,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:13:19,159 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:13:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:13:19,281 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 01:13:19,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:13:19,282 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030212931] [2021-10-13 01:13:19,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030212931] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:13:19,282 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:13:19,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:13:19,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738056370] [2021-10-13 01:13:19,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:13:19,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:13:19,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:13:19,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:13:19,284 INFO L87 Difference]: Start difference. First operand 252 states and 373 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:21,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:13:21,573 INFO L93 Difference]: Finished difference Result 494 states and 736 transitions. [2021-10-13 01:13:21,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:13:21,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-10-13 01:13:21,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:13:21,575 INFO L225 Difference]: With dead ends: 494 [2021-10-13 01:13:21,575 INFO L226 Difference]: Without dead ends: 263 [2021-10-13 01:13:21,576 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:13:21,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-10-13 01:13:21,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 252. [2021-10-13 01:13:21,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.4820717131474104) internal successors, (372), 251 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 372 transitions. [2021-10-13 01:13:21,582 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 372 transitions. Word has length 104 [2021-10-13 01:13:21,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:13:21,582 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 372 transitions. [2021-10-13 01:13:21,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:21,583 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 372 transitions. [2021-10-13 01:13:21,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-10-13 01:13:21,583 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:13:21,583 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:13:21,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-13 01:13:21,584 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:13:21,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:13:21,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1449725251, now seen corresponding path program 1 times [2021-10-13 01:13:21,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:13:21,584 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491225605] [2021-10-13 01:13:21,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:13:21,584 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:13:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:13:21,677 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-13 01:13:21,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:13:21,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491225605] [2021-10-13 01:13:21,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491225605] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:13:21,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:13:21,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:13:21,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332145580] [2021-10-13 01:13:21,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:13:21,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:13:21,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:13:21,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:13:21,681 INFO L87 Difference]: Start difference. First operand 252 states and 372 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:24,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:13:24,056 INFO L93 Difference]: Finished difference Result 522 states and 772 transitions. [2021-10-13 01:13:24,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:13:24,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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 108 [2021-10-13 01:13:24,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:13:24,059 INFO L225 Difference]: With dead ends: 522 [2021-10-13 01:13:24,059 INFO L226 Difference]: Without dead ends: 291 [2021-10-13 01:13:24,060 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:13:24,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-10-13 01:13:24,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 252. [2021-10-13 01:13:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.4780876494023905) internal successors, (371), 251 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:24,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 371 transitions. [2021-10-13 01:13:24,069 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 371 transitions. Word has length 108 [2021-10-13 01:13:24,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:13:24,069 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 371 transitions. [2021-10-13 01:13:24,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:24,070 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 371 transitions. [2021-10-13 01:13:24,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-10-13 01:13:24,071 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:13:24,071 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:13:24,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-13 01:13:24,072 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:13:24,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:13:24,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1159062207, now seen corresponding path program 1 times [2021-10-13 01:13:24,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:13:24,073 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134171357] [2021-10-13 01:13:24,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:13:24,073 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:13:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:13:24,139 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-10-13 01:13:24,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:13:24,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134171357] [2021-10-13 01:13:24,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134171357] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:13:24,140 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:13:24,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:13:24,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320289532] [2021-10-13 01:13:24,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:13:24,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:13:24,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:13:24,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:13:24,142 INFO L87 Difference]: Start difference. First operand 252 states and 371 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:24,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:13:24,176 INFO L93 Difference]: Finished difference Result 710 states and 1060 transitions. [2021-10-13 01:13:24,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:13:24,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2021-10-13 01:13:24,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:13:24,180 INFO L225 Difference]: With dead ends: 710 [2021-10-13 01:13:24,181 INFO L226 Difference]: Without dead ends: 479 [2021-10-13 01:13:24,181 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:13:24,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2021-10-13 01:13:24,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2021-10-13 01:13:24,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 478 states have (on average 1.4832635983263598) internal successors, (709), 478 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:24,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 709 transitions. [2021-10-13 01:13:24,199 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 709 transitions. Word has length 108 [2021-10-13 01:13:24,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:13:24,200 INFO L470 AbstractCegarLoop]: Abstraction has 479 states and 709 transitions. [2021-10-13 01:13:24,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:24,201 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 709 transitions. [2021-10-13 01:13:24,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-10-13 01:13:24,202 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:13:24,203 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:13:24,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-13 01:13:24,203 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:13:24,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:13:24,204 INFO L82 PathProgramCache]: Analyzing trace with hash -57091519, now seen corresponding path program 1 times [2021-10-13 01:13:24,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:13:24,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063639889] [2021-10-13 01:13:24,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:13:24,205 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:13:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:13:24,257 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-10-13 01:13:24,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:13:24,257 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063639889] [2021-10-13 01:13:24,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063639889] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:13:24,258 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:13:24,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:13:24,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565377378] [2021-10-13 01:13:24,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:13:24,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:13:24,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:13:24,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:13:24,260 INFO L87 Difference]: Start difference. First operand 479 states and 709 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:24,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:13:24,288 INFO L93 Difference]: Finished difference Result 964 states and 1430 transitions. [2021-10-13 01:13:24,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:13:24,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 108 [2021-10-13 01:13:24,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:13:24,292 INFO L225 Difference]: With dead ends: 964 [2021-10-13 01:13:24,292 INFO L226 Difference]: Without dead ends: 506 [2021-10-13 01:13:24,294 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:13:24,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2021-10-13 01:13:24,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2021-10-13 01:13:24,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 505 states have (on average 1.4732673267326732) internal successors, (744), 505 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:24,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 744 transitions. [2021-10-13 01:13:24,336 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 744 transitions. Word has length 108 [2021-10-13 01:13:24,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:13:24,336 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 744 transitions. [2021-10-13 01:13:24,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:24,337 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 744 transitions. [2021-10-13 01:13:24,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-10-13 01:13:24,338 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:13:24,339 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:13:24,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-13 01:13:24,340 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:13:24,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:13:24,340 INFO L82 PathProgramCache]: Analyzing trace with hash -643367741, now seen corresponding path program 1 times [2021-10-13 01:13:24,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:13:24,341 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824821076] [2021-10-13 01:13:24,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:13:24,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:13:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:13:24,384 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-10-13 01:13:24,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:13:24,385 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824821076] [2021-10-13 01:13:24,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824821076] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:13:24,385 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:13:24,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:13:24,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313877025] [2021-10-13 01:13:24,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:13:24,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:13:24,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:13:24,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:13:24,389 INFO L87 Difference]: Start difference. First operand 506 states and 744 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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-10-13 01:13:24,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:13:24,412 INFO L93 Difference]: Finished difference Result 993 states and 1466 transitions. [2021-10-13 01:13:24,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:13:24,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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 108 [2021-10-13 01:13:24,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:13:24,416 INFO L225 Difference]: With dead ends: 993 [2021-10-13 01:13:24,416 INFO L226 Difference]: Without dead ends: 508 [2021-10-13 01:13:24,417 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:13:24,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-10-13 01:13:24,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2021-10-13 01:13:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 1.4714003944773175) internal successors, (746), 507 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:24,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 746 transitions. [2021-10-13 01:13:24,435 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 746 transitions. Word has length 108 [2021-10-13 01:13:24,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:13:24,435 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 746 transitions. [2021-10-13 01:13:24,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 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-10-13 01:13:24,436 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 746 transitions. [2021-10-13 01:13:24,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-10-13 01:13:24,438 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:13:24,438 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-10-13 01:13:24,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-13 01:13:24,438 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:13:24,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:13:24,439 INFO L82 PathProgramCache]: Analyzing trace with hash 42738551, now seen corresponding path program 1 times [2021-10-13 01:13:24,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:13:24,439 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860642575] [2021-10-13 01:13:24,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:13:24,440 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:13:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:13:24,805 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2021-10-13 01:13:24,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:13:24,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860642575] [2021-10-13 01:13:24,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860642575] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:13:24,806 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:13:24,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 01:13:24,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901565634] [2021-10-13 01:13:24,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 01:13:24,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:13:24,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 01:13:24,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:13:24,809 INFO L87 Difference]: Start difference. First operand 508 states and 746 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:29,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:13:29,213 INFO L93 Difference]: Finished difference Result 1013 states and 1488 transitions. [2021-10-13 01:13:29,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 01:13:29,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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 127 [2021-10-13 01:13:29,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:13:29,216 INFO L225 Difference]: With dead ends: 1013 [2021-10-13 01:13:29,216 INFO L226 Difference]: Without dead ends: 508 [2021-10-13 01:13:29,217 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 47.6ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-13 01:13:29,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-10-13 01:13:29,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2021-10-13 01:13:29,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 1.4694280078895463) internal successors, (745), 507 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:29,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 745 transitions. [2021-10-13 01:13:29,235 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 745 transitions. Word has length 127 [2021-10-13 01:13:29,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:13:29,235 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 745 transitions. [2021-10-13 01:13:29,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:29,236 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 745 transitions. [2021-10-13 01:13:29,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-10-13 01:13:29,238 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:13:29,238 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-10-13 01:13:29,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-13 01:13:29,239 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:13:29,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:13:29,239 INFO L82 PathProgramCache]: Analyzing trace with hash -663858055, now seen corresponding path program 1 times [2021-10-13 01:13:29,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:13:29,240 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838896850] [2021-10-13 01:13:29,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:13:29,240 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:13:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:13:29,545 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 01:13:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:13:29,973 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 01:13:29,974 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 01:13:29,975 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:13:29,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-13 01:13:29,984 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 01:13:30,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:13:30 BoogieIcfgContainer [2021-10-13 01:13:30,193 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 01:13:30,194 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 01:13:30,194 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 01:13:30,194 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 01:13:30,195 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:11:50" (3/4) ... [2021-10-13 01:13:30,199 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-10-13 01:13:30,199 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 01:13:30,201 INFO L168 Benchmark]: Toolchain (without parser) took 104164.67 ms. Allocated memory was 119.5 MB in the beginning and 155.2 MB in the end (delta: 35.7 MB). Free memory was 92.4 MB in the beginning and 109.3 MB in the end (delta: -16.9 MB). Peak memory consumption was 18.5 MB. Max. memory is 16.1 GB. [2021-10-13 01:13:30,201 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 119.5 MB. Free memory is still 79.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 01:13:30,202 INFO L168 Benchmark]: CACSL2BoogieTranslator took 806.33 ms. Allocated memory is still 119.5 MB. Free memory was 92.4 MB in the beginning and 73.5 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-13 01:13:30,202 INFO L168 Benchmark]: Boogie Procedure Inliner took 122.08 ms. Allocated memory is still 119.5 MB. Free memory was 73.5 MB in the beginning and 68.6 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 01:13:30,203 INFO L168 Benchmark]: Boogie Preprocessor took 98.78 ms. Allocated memory is still 119.5 MB. Free memory was 68.6 MB in the beginning and 61.5 MB in the end (delta: 7.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 01:13:30,204 INFO L168 Benchmark]: RCFGBuilder took 3493.76 ms. Allocated memory was 119.5 MB in the beginning and 155.2 MB in the end (delta: 35.7 MB). Free memory was 61.5 MB in the beginning and 117.3 MB in the end (delta: -55.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 16.1 GB. [2021-10-13 01:13:30,204 INFO L168 Benchmark]: TraceAbstraction took 99631.28 ms. Allocated memory is still 155.2 MB. Free memory was 116.4 MB in the beginning and 109.3 MB in the end (delta: 7.1 MB). Peak memory consumption was 84.5 MB. Max. memory is 16.1 GB. [2021-10-13 01:13:30,204 INFO L168 Benchmark]: Witness Printer took 5.53 ms. Allocated memory is still 155.2 MB. Free memory is still 109.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 01:13:30,207 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 119.5 MB. Free memory is still 79.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 806.33 ms. Allocated memory is still 119.5 MB. Free memory was 92.4 MB in the beginning and 73.5 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 122.08 ms. Allocated memory is still 119.5 MB. Free memory was 73.5 MB in the beginning and 68.6 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 98.78 ms. Allocated memory is still 119.5 MB. Free memory was 68.6 MB in the beginning and 61.5 MB in the end (delta: 7.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3493.76 ms. Allocated memory was 119.5 MB in the beginning and 155.2 MB in the end (delta: 35.7 MB). Free memory was 61.5 MB in the beginning and 117.3 MB in the end (delta: -55.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 99631.28 ms. Allocated memory is still 155.2 MB. Free memory was 116.4 MB in the beginning and 109.3 MB in the end (delta: 7.1 MB). Peak memory consumption was 84.5 MB. Max. memory is 16.1 GB. * Witness Printer took 5.53 ms. Allocated memory is still 155.2 MB. Free memory is still 109.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1724]: 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 1142. Possible FailurePath: [L1044] static int init = 1; [L1045] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={21:0}] [L1067] SSL *s ; [L1068] int tmp ; [L1072] s = malloc(sizeof(SSL)) [L1073] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1074] s->ctx = malloc(sizeof(SSL_CTX)) [L1075] s->session = malloc(sizeof(SSL_SESSION)) [L1076] s->state = 8464 [L1078] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1079] s->options = __VERIFIER_nondet_ulong() [L1080] s->verify_mode = __VERIFIER_nondet_int() [L1081] EXPR s->session [L1081] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1082] EXPR s->s3 [L1082] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1083] EXPR s->s3 [L1083] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1084] EXPR s->s3 [L1084] EXPR (s->s3)->tmp.new_cipher [L1084] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1085] EXPR s->s3 [L1085] EXPR (s->s3)->tmp.new_cipher [L1085] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1086] COND FALSE !(__VERIFIER_nondet_int()) [L1092] s->cert = malloc(sizeof(struct cert_st)) [L1093] EXPR s->cert [L1093] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1102] BUF_MEM *buf ; [L1103] unsigned long l ; [L1104] unsigned long Time ; [L1105] unsigned long tmp ; [L1106] void (*cb)() ; [L1107] long num1 ; [L1108] int ret ; [L1109] int new_state ; [L1110] int state ; [L1111] int skip ; [L1112] int got_new_session ; [L1113] int tmp___1 = __VERIFIER_nondet_int() ; [L1114] int tmp___2 = __VERIFIER_nondet_int() ; [L1115] int tmp___3 = __VERIFIER_nondet_int() ; [L1116] int tmp___4 = __VERIFIER_nondet_int() ; [L1117] int tmp___5 = __VERIFIER_nondet_int() ; [L1118] int tmp___6 = __VERIFIER_nondet_int() ; [L1119] int tmp___7 ; [L1120] long tmp___8 = __VERIFIER_nondet_long() ; [L1121] int tmp___9 = __VERIFIER_nondet_int() ; [L1122] int tmp___10 = __VERIFIER_nondet_int() ; [L1123] int blastFlag ; [L1127] blastFlag = 0 [L1128] s->hit=__VERIFIER_nondet_int () [L1129] s->state = 8464 [L1130] tmp = __VERIFIER_nondet_int() [L1131] Time = tmp [L1132] cb = (void (*)())((void *)0) [L1133] ret = -1 [L1134] skip = 0 [L1135] got_new_session = 0 [L1136] EXPR s->info_callback VAL [init=1, SSLv3_server_data={21:0}] [L1136] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1137] EXPR s->info_callback [L1137] cb = s->info_callback [L1141] EXPR s->in_handshake [L1141] s->in_handshake += 1 [L1142] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={21:0}] [L1151] EXPR s->cert VAL [init=1, SSLv3_server_data={21:0}] [L1151] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1157] COND TRUE 1 VAL [init=1, SSLv3_server_data={21:0}] [L1159] EXPR s->state [L1159] state = s->state [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1160] COND FALSE !(s->state == 12292) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1163] COND FALSE !(s->state == 16384) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1166] COND FALSE !(s->state == 8192) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1169] COND FALSE !(s->state == 24576) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1172] COND FALSE !(s->state == 8195) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1175] COND FALSE !(s->state == 8480) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1178] COND FALSE !(s->state == 8481) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1181] COND FALSE !(s->state == 8482) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1184] COND TRUE s->state == 8464 [L1344] s->shutdown = 0 [L1345] ret = __VERIFIER_nondet_int() [L1346] COND TRUE blastFlag == 0 [L1347] blastFlag = 1 VAL [init=1, SSLv3_server_data={21:0}] [L1351] COND FALSE !(ret <= 0) [L1356] got_new_session = 1 [L1357] s->state = 8496 [L1358] s->init_num = 0 VAL [init=1, SSLv3_server_data={21:0}] [L1683] EXPR s->s3 [L1683] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={21:0}] [L1683] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1712] skip = 0 VAL [init=1, SSLv3_server_data={21:0}] [L1157] COND TRUE 1 VAL [init=1, SSLv3_server_data={21:0}] [L1159] EXPR s->state [L1159] state = s->state [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1160] COND FALSE !(s->state == 12292) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1163] COND FALSE !(s->state == 16384) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1166] COND FALSE !(s->state == 8192) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1169] COND FALSE !(s->state == 24576) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1172] COND FALSE !(s->state == 8195) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1175] COND FALSE !(s->state == 8480) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1178] COND FALSE !(s->state == 8481) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1181] COND FALSE !(s->state == 8482) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1184] COND FALSE !(s->state == 8464) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1187] COND FALSE !(s->state == 8465) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1190] COND FALSE !(s->state == 8466) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1193] COND TRUE s->state == 8496 [L1362] ret = __VERIFIER_nondet_int() [L1363] COND TRUE blastFlag == 1 [L1364] blastFlag = 2 VAL [init=1, SSLv3_server_data={21:0}] [L1368] COND FALSE !(ret <= 0) [L1373] s->hit VAL [init=1, SSLv3_server_data={21:0}] [L1373] COND TRUE s->hit [L1374] s->state = 8656 VAL [init=1, SSLv3_server_data={21:0}] [L1378] s->init_num = 0 VAL [init=1, SSLv3_server_data={21:0}] [L1683] EXPR s->s3 [L1683] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={21:0}] [L1683] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1712] skip = 0 VAL [init=1, SSLv3_server_data={21:0}] [L1157] COND TRUE 1 VAL [init=1, SSLv3_server_data={21:0}] [L1159] EXPR s->state [L1159] state = s->state [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1160] COND FALSE !(s->state == 12292) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1163] COND FALSE !(s->state == 16384) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1166] COND FALSE !(s->state == 8192) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1169] COND FALSE !(s->state == 24576) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1172] COND FALSE !(s->state == 8195) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1175] COND FALSE !(s->state == 8480) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1178] COND FALSE !(s->state == 8481) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1181] COND FALSE !(s->state == 8482) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1184] COND FALSE !(s->state == 8464) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1187] COND FALSE !(s->state == 8465) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1190] COND FALSE !(s->state == 8466) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1193] COND FALSE !(s->state == 8496) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1196] COND FALSE !(s->state == 8497) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1199] COND FALSE !(s->state == 8512) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1202] COND FALSE !(s->state == 8513) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1205] COND FALSE !(s->state == 8528) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1208] COND FALSE !(s->state == 8529) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1211] COND FALSE !(s->state == 8544) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1214] COND FALSE !(s->state == 8545) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1217] COND FALSE !(s->state == 8560) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1220] COND FALSE !(s->state == 8561) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1223] COND FALSE !(s->state == 8448) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1226] COND FALSE !(s->state == 8576) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1229] COND FALSE !(s->state == 8577) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1232] COND FALSE !(s->state == 8592) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1235] COND FALSE !(s->state == 8593) [L1238] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1238] COND FALSE !(s->state == 8608) [L1241] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1241] COND FALSE !(s->state == 8609) [L1244] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1244] COND FALSE !(s->state == 8640) [L1247] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1247] COND FALSE !(s->state == 8641) [L1250] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1250] COND TRUE s->state == 8656 [L1576] EXPR s->session [L1576] EXPR s->s3 [L1576] EXPR (s->s3)->tmp.new_cipher [L1576] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1577] COND FALSE !(! tmp___9) [L1583] ret = __VERIFIER_nondet_int() [L1584] COND TRUE blastFlag == 2 [L1585] blastFlag = 3 VAL [init=1, SSLv3_server_data={21:0}] [L1589] COND FALSE !(ret <= 0) [L1594] s->state = 8672 [L1595] s->init_num = 0 VAL [init=1, SSLv3_server_data={21:0}] [L1596] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={21:0}] [L1683] EXPR s->s3 [L1683] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={21:0}] [L1683] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1712] skip = 0 VAL [init=1, SSLv3_server_data={21:0}] [L1157] COND TRUE 1 VAL [init=1, SSLv3_server_data={21:0}] [L1159] EXPR s->state [L1159] state = s->state [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1160] COND FALSE !(s->state == 12292) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1163] COND FALSE !(s->state == 16384) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1166] COND FALSE !(s->state == 8192) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1169] COND FALSE !(s->state == 24576) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1172] COND FALSE !(s->state == 8195) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1175] COND FALSE !(s->state == 8480) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1178] COND FALSE !(s->state == 8481) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1181] COND FALSE !(s->state == 8482) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1184] COND FALSE !(s->state == 8464) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1187] COND FALSE !(s->state == 8465) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1190] COND FALSE !(s->state == 8466) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1193] COND FALSE !(s->state == 8496) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1196] COND FALSE !(s->state == 8497) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1199] COND FALSE !(s->state == 8512) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1202] COND FALSE !(s->state == 8513) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1205] COND FALSE !(s->state == 8528) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1208] COND FALSE !(s->state == 8529) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1211] COND FALSE !(s->state == 8544) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1214] COND FALSE !(s->state == 8545) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1217] COND FALSE !(s->state == 8560) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1220] COND FALSE !(s->state == 8561) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1223] COND FALSE !(s->state == 8448) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1226] COND FALSE !(s->state == 8576) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1229] COND FALSE !(s->state == 8577) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1232] COND FALSE !(s->state == 8592) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1235] COND FALSE !(s->state == 8593) [L1238] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1238] COND FALSE !(s->state == 8608) [L1241] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1241] COND FALSE !(s->state == 8609) [L1244] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1244] COND FALSE !(s->state == 8640) [L1247] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1247] COND FALSE !(s->state == 8641) [L1250] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1250] COND FALSE !(s->state == 8656) [L1253] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1253] COND FALSE !(s->state == 8657) [L1256] EXPR s->state VAL [init=1, SSLv3_server_data={21:0}] [L1256] COND TRUE s->state == 8672 [L1605] ret = __VERIFIER_nondet_int() [L1606] COND TRUE blastFlag == 3 VAL [init=1, SSLv3_server_data={21:0}] [L1724] reach_error() VAL [init=1, SSLv3_server_data={21:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 99354.1ms, OverallIterations: 42, TraceHistogramMax: 4, EmptinessCheckTime: 99.9ms, AutomataDifference: 93691.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 22.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 7823 SDtfs, 2119 SDslu, 11520 SDs, 0 SdLazy, 7144 SolverSat, 347 SolverUnsat, 39 SolverUnknown, 0 SolverNotchecked, 89595.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 233 GetRequests, 83 SyntacticMatches, 29 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 666.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=508occurred in iteration=40, InterpolantAutomatonStates: 165, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 454.7ms AutomataMinimizationTime, 41 MinimizatonAttempts, 934 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 303.3ms SsaConstructionTime, 1585.1ms SatisfiabilityAnalysisTime, 2215.6ms InterpolantComputationTime, 3709 NumberOfCodeBlocks, 3709 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 3541 ConstructedInterpolants, 0 QuantifiedInterpolants, 9600 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 41 PerfectInterpolantSequences, 1839/1839 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-10-13 01:13:30,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/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-4e77c04 [2021-10-13 01:13:32,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 01:13:32,896 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 01:13:32,942 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 01:13:32,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 01:13:32,948 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 01:13:32,950 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 01:13:32,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 01:13:32,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 01:13:32,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 01:13:32,971 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 01:13:32,973 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 01:13:32,974 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 01:13:32,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 01:13:32,981 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 01:13:32,986 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 01:13:32,988 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 01:13:32,990 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 01:13:32,998 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 01:13:33,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 01:13:33,009 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 01:13:33,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 01:13:33,015 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 01:13:33,017 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 01:13:33,024 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 01:13:33,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 01:13:33,025 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 01:13:33,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 01:13:33,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 01:13:33,030 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 01:13:33,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 01:13:33,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 01:13:33,034 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 01:13:33,035 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 01:13:33,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 01:13:33,038 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 01:13:33,039 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 01:13:33,039 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 01:13:33,040 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 01:13:33,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 01:13:33,043 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 01:13:33,044 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-10-13 01:13:33,101 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 01:13:33,101 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 01:13:33,102 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 01:13:33,102 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 01:13:33,103 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 01:13:33,104 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 01:13:33,104 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 01:13:33,104 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 01:13:33,104 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 01:13:33,105 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 01:13:33,105 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 01:13:33,105 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 01:13:33,105 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 01:13:33,106 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 01:13:33,106 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-13 01:13:33,106 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-13 01:13:33,106 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 01:13:33,107 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 01:13:33,107 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 01:13:33,107 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 01:13:33,108 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 01:13:33,108 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 01:13:33,108 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 01:13:33,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 01:13:33,109 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 01:13:33,109 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 01:13:33,109 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 01:13:33,109 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-10-13 01:13:33,110 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-13 01:13:33,110 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 01:13:33,110 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 01:13:33,110 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 01:13:33,111 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt 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 -> 3d679f9e9f2b660e8a3bb8065738c0f2482e8d5a [2021-10-13 01:13:33,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 01:13:33,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 01:13:33,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 01:13:33,519 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 01:13:33,520 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 01:13:33,523 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c [2021-10-13 01:13:33,603 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/data/b7761cee9/7447b4fca4ac43bd985d494cf733603d/FLAGa089666a8 [2021-10-13 01:13:34,390 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 01:13:34,392 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c [2021-10-13 01:13:34,436 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/data/b7761cee9/7447b4fca4ac43bd985d494cf733603d/FLAGa089666a8 [2021-10-13 01:13:34,534 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/data/b7761cee9/7447b4fca4ac43bd985d494cf733603d [2021-10-13 01:13:34,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 01:13:34,547 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 01:13:34,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 01:13:34,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 01:13:34,558 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 01:13:34,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:13:34" (1/1) ... [2021-10-13 01:13:34,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b11c7a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:13:34, skipping insertion in model container [2021-10-13 01:13:34,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:13:34" (1/1) ... [2021-10-13 01:13:34,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 01:13:34,673 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 01:13:35,221 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c[72015,72028] [2021-10-13 01:13:35,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 01:13:35,254 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 01:13:35,388 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/sv-benchmarks/c/openssl/s3_srvr.blast.03.i.cil.c[72015,72028] [2021-10-13 01:13:35,391 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 01:13:35,414 INFO L208 MainTranslator]: Completed translation [2021-10-13 01:13:35,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:13:35 WrapperNode [2021-10-13 01:13:35,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 01:13:35,418 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 01:13:35,418 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 01:13:35,418 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 01:13:35,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:13:35" (1/1) ... [2021-10-13 01:13:35,492 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:13:35" (1/1) ... [2021-10-13 01:13:35,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 01:13:35,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 01:13:35,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 01:13:35,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 01:13:35,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:13:35" (1/1) ... [2021-10-13 01:13:35,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:13:35" (1/1) ... [2021-10-13 01:13:35,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:13:35" (1/1) ... [2021-10-13 01:13:35,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:13:35" (1/1) ... [2021-10-13 01:13:35,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:13:35" (1/1) ... [2021-10-13 01:13:35,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:13:35" (1/1) ... [2021-10-13 01:13:35,704 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:13:35" (1/1) ... [2021-10-13 01:13:35,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 01:13:35,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 01:13:35,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 01:13:35,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 01:13:35,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:13:35" (1/1) ... [2021-10-13 01:13:35,723 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 01:13:35,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:13:35,752 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 01:13:35,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 01:13:35,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-13 01:13:35,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-13 01:13:35,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 01:13:35,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-10-13 01:13:35,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-13 01:13:35,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-13 01:13:35,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 01:13:35,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 01:13:35,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-10-13 01:13:36,125 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 01:13:40,952 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-10-13 01:13:40,952 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-10-13 01:13:40,974 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 01:13:40,974 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-13 01:13:40,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:13:40 BoogieIcfgContainer [2021-10-13 01:13:40,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 01:13:40,980 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 01:13:40,980 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 01:13:40,984 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 01:13:40,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:13:34" (1/3) ... [2021-10-13 01:13:40,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c524397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:13:40, skipping insertion in model container [2021-10-13 01:13:40,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:13:35" (2/3) ... [2021-10-13 01:13:40,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c524397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:13:40, skipping insertion in model container [2021-10-13 01:13:40,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:13:40" (3/3) ... [2021-10-13 01:13:40,990 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.03.i.cil.c [2021-10-13 01:13:40,998 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 01:13:40,998 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-13 01:13:41,075 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 01:13:41,086 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-10-13 01:13:41,086 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-13 01:13:41,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 143 states have (on average 1.7062937062937062) internal successors, (244), 144 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:41,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-13 01:13:41,140 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:13:41,141 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:13:41,142 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:13:41,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:13:41,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1430119920, now seen corresponding path program 1 times [2021-10-13 01:13:41,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 01:13:41,168 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861699848] [2021-10-13 01:13:41,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:13:41,169 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 01:13:41,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/mathsat [2021-10-13 01:13:41,176 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 01:13:41,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-13 01:13:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:13:41,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 01:13:41,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:13:41,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:13:41,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 01:13:42,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:13:42,371 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 01:13:42,371 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861699848] [2021-10-13 01:13:42,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1861699848] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 01:13:42,372 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:13:42,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 01:13:42,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393952429] [2021-10-13 01:13:42,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:13:42,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 01:13:42,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:13:42,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:13:42,400 INFO L87 Difference]: Start difference. First operand has 145 states, 143 states have (on average 1.7062937062937062) internal successors, (244), 144 states have internal predecessors, (244), 0 states have call successors, (0), 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 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:42,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:13:42,609 INFO L93 Difference]: Finished difference Result 539 states and 915 transitions. [2021-10-13 01:13:42,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:13:42,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 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 47 [2021-10-13 01:13:42,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:13:42,635 INFO L225 Difference]: With dead ends: 539 [2021-10-13 01:13:42,640 INFO L226 Difference]: Without dead ends: 365 [2021-10-13 01:13:42,646 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:13:42,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-10-13 01:13:42,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2021-10-13 01:13:42,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.521978021978022) internal successors, (554), 364 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:42,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 554 transitions. [2021-10-13 01:13:42,729 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 554 transitions. Word has length 47 [2021-10-13 01:13:42,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:13:42,730 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 554 transitions. [2021-10-13 01:13:42,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:42,731 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 554 transitions. [2021-10-13 01:13:42,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-10-13 01:13:42,743 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:13:42,744 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:13:42,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-10-13 01:13:42,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 [2021-10-13 01:13:42,957 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:13:42,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:13:42,958 INFO L82 PathProgramCache]: Analyzing trace with hash -430845807, now seen corresponding path program 1 times [2021-10-13 01:13:42,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 01:13:42,960 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345664782] [2021-10-13 01:13:42,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:13:42,961 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 01:13:42,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/mathsat [2021-10-13 01:13:42,967 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 01:13:42,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-13 01:13:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:13:43,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 01:13:43,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:13:43,837 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:13:43,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 01:13:44,433 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:13:44,434 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 01:13:44,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [345664782] [2021-10-13 01:13:44,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [345664782] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 01:13:44,434 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:13:44,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 01:13:44,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789891286] [2021-10-13 01:13:44,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:13:44,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 01:13:44,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:13:44,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:13:44,442 INFO L87 Difference]: Start difference. First operand 365 states and 554 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:44,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:13:44,586 INFO L93 Difference]: Finished difference Result 836 states and 1275 transitions. [2021-10-13 01:13:44,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:13:44,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 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 105 [2021-10-13 01:13:44,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:13:44,592 INFO L225 Difference]: With dead ends: 836 [2021-10-13 01:13:44,593 INFO L226 Difference]: Without dead ends: 600 [2021-10-13 01:13:44,595 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:13:44,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2021-10-13 01:13:44,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2021-10-13 01:13:44,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.5175292153589315) internal successors, (909), 599 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:44,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 909 transitions. [2021-10-13 01:13:44,655 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 909 transitions. Word has length 105 [2021-10-13 01:13:44,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:13:44,658 INFO L470 AbstractCegarLoop]: Abstraction has 600 states and 909 transitions. [2021-10-13 01:13:44,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:44,659 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 909 transitions. [2021-10-13 01:13:44,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-10-13 01:13:44,670 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:13:44,671 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-10-13 01:13:44,686 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-13 01:13:44,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 [2021-10-13 01:13:44,872 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:13:44,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:13:44,872 INFO L82 PathProgramCache]: Analyzing trace with hash 42738551, now seen corresponding path program 1 times [2021-10-13 01:13:44,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 01:13:44,874 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966859265] [2021-10-13 01:13:44,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:13:44,875 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 01:13:44,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/mathsat [2021-10-13 01:13:44,881 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 01:13:44,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-13 01:13:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:13:45,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 15 conjunts are in the unsatisfiable core [2021-10-13 01:13:45,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:13:45,461 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-10-13 01:13:45,476 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-10-13 01:13:45,636 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-10-13 01:13:45,636 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 2 case distinctions, treesize of input 34 treesize of output 22 [2021-10-13 01:13:45,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 01:13:45,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 01:13:45,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 01:13:45,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2021-10-13 01:13:45,782 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-10-13 01:13:45,783 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 29 treesize of output 13 [2021-10-13 01:13:45,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 01:13:45,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-10-13 01:13:45,850 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 37 treesize of output 25 [2021-10-13 01:13:45,857 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 22 treesize of output 10 [2021-10-13 01:13:46,337 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2021-10-13 01:13:46,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 01:13:47,086 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2021-10-13 01:13:47,086 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-13 01:13:47,087 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966859265] [2021-10-13 01:13:47,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1966859265] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 01:13:47,087 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:13:47,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-10-13 01:13:47,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438716710] [2021-10-13 01:13:47,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 01:13:47,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-13 01:13:47,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 01:13:47,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-13 01:13:47,090 INFO L87 Difference]: Start difference. First operand 600 states and 909 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 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-10-13 01:13:59,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:13:59,095 INFO L93 Difference]: Finished difference Result 1197 states and 1814 transitions. [2021-10-13 01:13:59,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 01:13:59,097 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 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 127 [2021-10-13 01:13:59,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:13:59,101 INFO L225 Difference]: With dead ends: 1197 [2021-10-13 01:13:59,101 INFO L226 Difference]: Without dead ends: 600 [2021-10-13 01:13:59,102 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 287.9ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-10-13 01:13:59,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2021-10-13 01:13:59,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2021-10-13 01:13:59,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.5158597662771285) internal successors, (908), 599 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:13:59,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 908 transitions. [2021-10-13 01:13:59,128 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 908 transitions. Word has length 127 [2021-10-13 01:13:59,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:13:59,129 INFO L470 AbstractCegarLoop]: Abstraction has 600 states and 908 transitions. [2021-10-13 01:13:59,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 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-10-13 01:13:59,129 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 908 transitions. [2021-10-13 01:13:59,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-10-13 01:13:59,132 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:13:59,132 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-10-13 01:13:59,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-10-13 01:13:59,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 [2021-10-13 01:13:59,350 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:13:59,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:13:59,351 INFO L82 PathProgramCache]: Analyzing trace with hash -663858055, now seen corresponding path program 1 times [2021-10-13 01:13:59,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-13 01:13:59,352 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246307250] [2021-10-13 01:13:59,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:13:59,352 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 01:13:59,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/mathsat [2021-10-13 01:13:59,353 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 01:13:59,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-10-13 01:14:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:14:00,569 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 01:14:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:14:01,507 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-10-13 01:14:01,508 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 01:14:01,509 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:14:01,533 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-10-13 01:14:01,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/mathsat -unsat_core_generation=3 [2021-10-13 01:14:01,732 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 01:14:01,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:14:01 BoogieIcfgContainer [2021-10-13 01:14:01,873 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 01:14:01,874 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 01:14:01,874 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 01:14:01,874 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 01:14:01,880 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:13:40" (3/4) ... [2021-10-13 01:14:01,882 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 01:14:02,054 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 01:14:02,054 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 01:14:02,055 INFO L168 Benchmark]: Toolchain (without parser) took 27508.23 ms. Allocated memory was 48.2 MB in the beginning and 104.9 MB in the end (delta: 56.6 MB). Free memory was 29.1 MB in the beginning and 59.6 MB in the end (delta: -30.4 MB). Peak memory consumption was 56.2 MB. Max. memory is 16.1 GB. [2021-10-13 01:14:02,056 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 48.2 MB. Free memory was 28.2 MB in the beginning and 28.2 MB in the end (delta: 31.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 01:14:02,056 INFO L168 Benchmark]: CACSL2BoogieTranslator took 868.00 ms. Allocated memory was 48.2 MB in the beginning and 62.9 MB in the end (delta: 14.7 MB). Free memory was 28.9 MB in the beginning and 31.1 MB in the end (delta: -2.2 MB). Peak memory consumption was 16.3 MB. Max. memory is 16.1 GB. [2021-10-13 01:14:02,057 INFO L168 Benchmark]: Boogie Procedure Inliner took 189.82 ms. Allocated memory is still 62.9 MB. Free memory was 30.9 MB in the beginning and 37.9 MB in the end (delta: -7.1 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.1 GB. [2021-10-13 01:14:02,057 INFO L168 Benchmark]: Boogie Preprocessor took 102.97 ms. Allocated memory is still 62.9 MB. Free memory was 37.9 MB in the beginning and 30.6 MB in the end (delta: 7.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-13 01:14:02,058 INFO L168 Benchmark]: RCFGBuilder took 5265.77 ms. Allocated memory was 62.9 MB in the beginning and 86.0 MB in the end (delta: 23.1 MB). Free memory was 30.6 MB in the beginning and 47.5 MB in the end (delta: -16.9 MB). Peak memory consumption was 19.2 MB. Max. memory is 16.1 GB. [2021-10-13 01:14:02,058 INFO L168 Benchmark]: TraceAbstraction took 20893.68 ms. Allocated memory was 86.0 MB in the beginning and 104.9 MB in the end (delta: 18.9 MB). Free memory was 47.0 MB in the beginning and 36.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 30.3 MB. Max. memory is 16.1 GB. [2021-10-13 01:14:02,058 INFO L168 Benchmark]: Witness Printer took 180.66 ms. Allocated memory is still 104.9 MB. Free memory was 36.3 MB in the beginning and 59.6 MB in the end (delta: -23.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-13 01:14:02,063 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.35 ms. Allocated memory is still 48.2 MB. Free memory was 28.2 MB in the beginning and 28.2 MB in the end (delta: 31.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 868.00 ms. Allocated memory was 48.2 MB in the beginning and 62.9 MB in the end (delta: 14.7 MB). Free memory was 28.9 MB in the beginning and 31.1 MB in the end (delta: -2.2 MB). Peak memory consumption was 16.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 189.82 ms. Allocated memory is still 62.9 MB. Free memory was 30.9 MB in the beginning and 37.9 MB in the end (delta: -7.1 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 102.97 ms. Allocated memory is still 62.9 MB. Free memory was 37.9 MB in the beginning and 30.6 MB in the end (delta: 7.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 5265.77 ms. Allocated memory was 62.9 MB in the beginning and 86.0 MB in the end (delta: 23.1 MB). Free memory was 30.6 MB in the beginning and 47.5 MB in the end (delta: -16.9 MB). Peak memory consumption was 19.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 20893.68 ms. Allocated memory was 86.0 MB in the beginning and 104.9 MB in the end (delta: 18.9 MB). Free memory was 47.0 MB in the beginning and 36.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 30.3 MB. Max. memory is 16.1 GB. * Witness Printer took 180.66 ms. Allocated memory is still 104.9 MB. Free memory was 36.3 MB in the beginning and 59.6 MB in the end (delta: -23.2 MB). Peak memory consumption was 6.3 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: 1724]: 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_server_data ; VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1067] SSL *s ; [L1068] int tmp ; [L1072] s = malloc(sizeof(SSL)) [L1073] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1074] s->ctx = malloc(sizeof(SSL_CTX)) [L1075] s->session = malloc(sizeof(SSL_SESSION)) [L1076] s->state = 8464 [L1078] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1079] s->options = __VERIFIER_nondet_ulong() [L1080] s->verify_mode = __VERIFIER_nondet_int() [L1081] EXPR s->session [L1081] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1082] EXPR s->s3 [L1082] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1083] EXPR s->s3 [L1083] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1084] EXPR s->s3 [L1084] EXPR (s->s3)->tmp.new_cipher [L1084] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1085] EXPR s->s3 [L1085] EXPR (s->s3)->tmp.new_cipher [L1085] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1086] COND FALSE !(__VERIFIER_nondet_int()) [L1092] s->cert = malloc(sizeof(struct cert_st)) [L1093] EXPR s->cert [L1093] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1102] BUF_MEM *buf ; [L1103] unsigned long l ; [L1104] unsigned long Time ; [L1105] unsigned long tmp ; [L1106] void (*cb)() ; [L1107] long num1 ; [L1108] int ret ; [L1109] int new_state ; [L1110] int state ; [L1111] int skip ; [L1112] int got_new_session ; [L1113] int tmp___1 = __VERIFIER_nondet_int() ; [L1114] int tmp___2 = __VERIFIER_nondet_int() ; [L1115] int tmp___3 = __VERIFIER_nondet_int() ; [L1116] int tmp___4 = __VERIFIER_nondet_int() ; [L1117] int tmp___5 = __VERIFIER_nondet_int() ; [L1118] int tmp___6 = __VERIFIER_nondet_int() ; [L1119] int tmp___7 ; [L1120] long tmp___8 = __VERIFIER_nondet_long() ; [L1121] int tmp___9 = __VERIFIER_nondet_int() ; [L1122] int tmp___10 = __VERIFIER_nondet_int() ; [L1123] int blastFlag ; [L1127] blastFlag = 0 [L1128] s->hit=__VERIFIER_nondet_int () [L1129] s->state = 8464 [L1130] tmp = __VERIFIER_nondet_int() [L1131] Time = tmp [L1132] cb = (void (*)())((void *)0) [L1133] ret = -1 [L1134] skip = 0 [L1135] got_new_session = 0 [L1136] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1136] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1137] EXPR s->info_callback [L1137] cb = s->info_callback [L1141] EXPR s->in_handshake [L1141] s->in_handshake += 1 [L1142] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1151] EXPR s->cert VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1151] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1157] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1159] EXPR s->state [L1159] state = s->state [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1160] COND FALSE !(s->state == 12292) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1163] COND FALSE !(s->state == 16384) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1166] COND FALSE !(s->state == 8192) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1169] COND FALSE !(s->state == 24576) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1172] COND FALSE !(s->state == 8195) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1175] COND FALSE !(s->state == 8480) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1178] COND FALSE !(s->state == 8481) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1181] COND FALSE !(s->state == 8482) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1184] COND TRUE s->state == 8464 [L1344] s->shutdown = 0 [L1345] ret = __VERIFIER_nondet_int() [L1346] COND TRUE blastFlag == 0 [L1347] blastFlag = 1 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1351] COND FALSE !(ret <= 0) [L1356] got_new_session = 1 [L1357] s->state = 8496 [L1358] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1683] EXPR s->s3 [L1683] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1683] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1712] skip = 0 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1157] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1159] EXPR s->state [L1159] state = s->state [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1160] COND FALSE !(s->state == 12292) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1163] COND FALSE !(s->state == 16384) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1166] COND FALSE !(s->state == 8192) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1169] COND FALSE !(s->state == 24576) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1172] COND FALSE !(s->state == 8195) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1175] COND FALSE !(s->state == 8480) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1178] COND FALSE !(s->state == 8481) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1181] COND FALSE !(s->state == 8482) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1184] COND FALSE !(s->state == 8464) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1187] COND FALSE !(s->state == 8465) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1190] COND FALSE !(s->state == 8466) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1193] COND TRUE s->state == 8496 [L1362] ret = __VERIFIER_nondet_int() [L1363] COND TRUE blastFlag == 1 [L1364] blastFlag = 2 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1368] COND FALSE !(ret <= 0) [L1373] s->hit VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1373] COND TRUE s->hit [L1374] s->state = 8656 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1378] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1683] EXPR s->s3 [L1683] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1683] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1712] skip = 0 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1157] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1159] EXPR s->state [L1159] state = s->state [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1160] COND FALSE !(s->state == 12292) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1163] COND FALSE !(s->state == 16384) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1166] COND FALSE !(s->state == 8192) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1169] COND FALSE !(s->state == 24576) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1172] COND FALSE !(s->state == 8195) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1175] COND FALSE !(s->state == 8480) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1178] COND FALSE !(s->state == 8481) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1181] COND FALSE !(s->state == 8482) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1184] COND FALSE !(s->state == 8464) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1187] COND FALSE !(s->state == 8465) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1190] COND FALSE !(s->state == 8466) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1193] COND FALSE !(s->state == 8496) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1196] COND FALSE !(s->state == 8497) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1199] COND FALSE !(s->state == 8512) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1202] COND FALSE !(s->state == 8513) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1205] COND FALSE !(s->state == 8528) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1208] COND FALSE !(s->state == 8529) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1211] COND FALSE !(s->state == 8544) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1214] COND FALSE !(s->state == 8545) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1217] COND FALSE !(s->state == 8560) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1220] COND FALSE !(s->state == 8561) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1223] COND FALSE !(s->state == 8448) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1226] COND FALSE !(s->state == 8576) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1229] COND FALSE !(s->state == 8577) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1232] COND FALSE !(s->state == 8592) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1235] COND FALSE !(s->state == 8593) [L1238] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1238] COND FALSE !(s->state == 8608) [L1241] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1241] COND FALSE !(s->state == 8609) [L1244] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1244] COND FALSE !(s->state == 8640) [L1247] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1247] COND FALSE !(s->state == 8641) [L1250] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1250] COND TRUE s->state == 8656 [L1576] EXPR s->session [L1576] EXPR s->s3 [L1576] EXPR (s->s3)->tmp.new_cipher [L1576] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1577] COND FALSE !(! tmp___9) [L1583] ret = __VERIFIER_nondet_int() [L1584] COND TRUE blastFlag == 2 [L1585] blastFlag = 3 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1589] COND FALSE !(ret <= 0) [L1594] s->state = 8672 [L1595] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1596] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1683] EXPR s->s3 [L1683] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1683] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1712] skip = 0 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1157] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1159] EXPR s->state [L1159] state = s->state [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1160] COND FALSE !(s->state == 12292) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1163] COND FALSE !(s->state == 16384) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1166] COND FALSE !(s->state == 8192) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1169] COND FALSE !(s->state == 24576) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1172] COND FALSE !(s->state == 8195) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1175] COND FALSE !(s->state == 8480) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1178] COND FALSE !(s->state == 8481) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1181] COND FALSE !(s->state == 8482) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1184] COND FALSE !(s->state == 8464) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1187] COND FALSE !(s->state == 8465) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1190] COND FALSE !(s->state == 8466) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1193] COND FALSE !(s->state == 8496) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1196] COND FALSE !(s->state == 8497) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1199] COND FALSE !(s->state == 8512) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1202] COND FALSE !(s->state == 8513) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1205] COND FALSE !(s->state == 8528) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1208] COND FALSE !(s->state == 8529) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1211] COND FALSE !(s->state == 8544) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1214] COND FALSE !(s->state == 8545) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1217] COND FALSE !(s->state == 8560) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1220] COND FALSE !(s->state == 8561) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1223] COND FALSE !(s->state == 8448) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1226] COND FALSE !(s->state == 8576) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1229] COND FALSE !(s->state == 8577) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1232] COND FALSE !(s->state == 8592) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1235] COND FALSE !(s->state == 8593) [L1238] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1238] COND FALSE !(s->state == 8608) [L1241] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1241] COND FALSE !(s->state == 8609) [L1244] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1244] COND FALSE !(s->state == 8640) [L1247] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1247] COND FALSE !(s->state == 8641) [L1250] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1250] COND FALSE !(s->state == 8656) [L1253] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1253] COND FALSE !(s->state == 8657) [L1256] EXPR s->state VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1256] COND TRUE s->state == 8672 [L1605] ret = __VERIFIER_nondet_int() [L1606] COND TRUE blastFlag == 3 VAL [init=1, SSLv3_server_data={-1073741793:0}] [L1724] reach_error() VAL [init=1, SSLv3_server_data={-1073741793:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20658.4ms, OverallIterations: 4, TraceHistogramMax: 4, EmptinessCheckTime: 57.8ms, AutomataDifference: 12435.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 21.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 790 SDtfs, 665 SDslu, 1476 SDs, 0 SdLazy, 374 SolverSat, 20 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 11634.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 554 GetRequests, 541 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 337.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=600occurred in iteration=2, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 154.3ms AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 218.2ms SsaConstructionTime, 1465.9ms SatisfiabilityAnalysisTime, 3853.2ms InterpolantComputationTime, 406 NumberOfCodeBlocks, 406 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 552 ConstructedInterpolants, 1 QuantifiedInterpolants, 1163 SizeOfPredicates, 12 NumberOfNonLiveVariables, 792 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 322/322 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-10-13 01:14:02,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_72ea87e2-812a-43b2-bba6-d202f83dd233/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...