./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix057_tso.oepc.i --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_d64235fd-4b22-48e6-a8b4-47ea3cdb5b07/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64235fd-4b22-48e6-a8b4-47ea3cdb5b07/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_d64235fd-4b22-48e6-a8b4-47ea3cdb5b07/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64235fd-4b22-48e6-a8b4-47ea3cdb5b07/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix057_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64235fd-4b22-48e6-a8b4-47ea3cdb5b07/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_d64235fd-4b22-48e6-a8b4-47ea3cdb5b07/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 6df937937075082959735d2992fd1cc04193c7fa ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 00:46:27,656 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 00:46:27,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 00:46:27,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 00:46:27,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 00:46:27,718 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 00:46:27,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 00:46:27,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 00:46:27,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 00:46:27,732 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 00:46:27,733 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 00:46:27,735 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 00:46:27,736 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 00:46:27,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 00:46:27,740 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 00:46:27,745 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 00:46:27,746 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 00:46:27,747 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 00:46:27,750 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 00:46:27,757 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 00:46:27,759 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 00:46:27,761 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 00:46:27,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 00:46:27,765 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 00:46:27,771 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 00:46:27,771 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 00:46:27,772 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 00:46:27,773 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 00:46:27,773 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 00:46:27,774 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 00:46:27,775 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 00:46:27,776 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 00:46:27,777 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 00:46:27,778 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 00:46:27,779 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 00:46:27,779 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 00:46:27,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 00:46:27,780 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 00:46:27,780 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 00:46:27,781 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 00:46:27,782 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 00:46:27,783 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64235fd-4b22-48e6-a8b4-47ea3cdb5b07/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-13 00:46:27,806 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 00:46:27,806 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 00:46:27,806 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 00:46:27,807 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 00:46:27,808 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 00:46:27,808 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 00:46:27,808 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 00:46:27,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 00:46:27,809 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 00:46:27,809 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 00:46:27,809 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 00:46:27,809 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 00:46:27,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 00:46:27,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 00:46:27,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 00:46:27,810 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 00:46:27,810 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 00:46:27,811 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 00:46:27,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 00:46:27,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 00:46:27,811 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 00:46:27,812 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 00:46:27,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:46:27,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 00:46:27,815 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 00:46:27,815 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 00:46:27,815 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 00:46:27,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 00:46:27,816 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 00:46:27,816 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 00:46:27,818 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_d64235fd-4b22-48e6-a8b4-47ea3cdb5b07/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_d64235fd-4b22-48e6-a8b4-47ea3cdb5b07/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 -> 6df937937075082959735d2992fd1cc04193c7fa [2021-10-13 00:46:28,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 00:46:28,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 00:46:28,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 00:46:28,155 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 00:46:28,155 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 00:46:28,156 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64235fd-4b22-48e6-a8b4-47ea3cdb5b07/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/pthread-wmm/mix057_tso.oepc.i [2021-10-13 00:46:28,238 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64235fd-4b22-48e6-a8b4-47ea3cdb5b07/bin/uautomizer-WNIpwEf4Nt/data/ba37bcff9/21d588d2c5e04fafa13f82745f6d5dc0/FLAGd9ad3bfb6 [2021-10-13 00:46:28,830 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 00:46:28,830 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64235fd-4b22-48e6-a8b4-47ea3cdb5b07/sv-benchmarks/c/pthread-wmm/mix057_tso.oepc.i [2021-10-13 00:46:28,863 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64235fd-4b22-48e6-a8b4-47ea3cdb5b07/bin/uautomizer-WNIpwEf4Nt/data/ba37bcff9/21d588d2c5e04fafa13f82745f6d5dc0/FLAGd9ad3bfb6 [2021-10-13 00:46:29,077 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64235fd-4b22-48e6-a8b4-47ea3cdb5b07/bin/uautomizer-WNIpwEf4Nt/data/ba37bcff9/21d588d2c5e04fafa13f82745f6d5dc0 [2021-10-13 00:46:29,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 00:46:29,083 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 00:46:29,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 00:46:29,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 00:46:29,091 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 00:46:29,091 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:46:29" (1/1) ... [2021-10-13 00:46:29,093 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cfff425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:29, skipping insertion in model container [2021-10-13 00:46:29,093 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:46:29" (1/1) ... [2021-10-13 00:46:29,100 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 00:46:29,167 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 00:46:29,418 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_d64235fd-4b22-48e6-a8b4-47ea3cdb5b07/sv-benchmarks/c/pthread-wmm/mix057_tso.oepc.i[949,962] [2021-10-13 00:46:29,711 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:46:29,728 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 00:46:29,747 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_d64235fd-4b22-48e6-a8b4-47ea3cdb5b07/sv-benchmarks/c/pthread-wmm/mix057_tso.oepc.i[949,962] [2021-10-13 00:46:29,848 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:46:29,909 INFO L208 MainTranslator]: Completed translation [2021-10-13 00:46:29,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:29 WrapperNode [2021-10-13 00:46:29,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 00:46:29,913 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 00:46:29,913 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 00:46:29,914 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 00:46:29,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:29" (1/1) ... [2021-10-13 00:46:29,967 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:29" (1/1) ... [2021-10-13 00:46:30,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 00:46:30,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 00:46:30,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 00:46:30,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 00:46:30,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:29" (1/1) ... [2021-10-13 00:46:30,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:29" (1/1) ... [2021-10-13 00:46:30,042 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:29" (1/1) ... [2021-10-13 00:46:30,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:29" (1/1) ... [2021-10-13 00:46:30,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:29" (1/1) ... [2021-10-13 00:46:30,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:29" (1/1) ... [2021-10-13 00:46:30,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:29" (1/1) ... [2021-10-13 00:46:30,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 00:46:30,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 00:46:30,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 00:46:30,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 00:46:30,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:29" (1/1) ... [2021-10-13 00:46:30,094 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:46:30,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64235fd-4b22-48e6-a8b4-47ea3cdb5b07/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:46:30,119 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64235fd-4b22-48e6-a8b4-47ea3cdb5b07/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 00:46:30,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64235fd-4b22-48e6-a8b4-47ea3cdb5b07/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 00:46:30,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-13 00:46:30,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-13 00:46:30,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 00:46:30,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 00:46:30,168 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-13 00:46:30,169 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-13 00:46:30,169 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-13 00:46:30,169 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-13 00:46:30,169 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-10-13 00:46:30,169 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-10-13 00:46:30,170 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-10-13 00:46:30,170 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-10-13 00:46:30,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 00:46:30,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-13 00:46:30,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 00:46:30,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 00:46:30,172 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-13 00:46:32,279 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 00:46:32,280 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-13 00:46:32,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:46:32 BoogieIcfgContainer [2021-10-13 00:46:32,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 00:46:32,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 00:46:32,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 00:46:32,291 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 00:46:32,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:46:29" (1/3) ... [2021-10-13 00:46:32,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c309c4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:46:32, skipping insertion in model container [2021-10-13 00:46:32,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:46:29" (2/3) ... [2021-10-13 00:46:32,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c309c4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:46:32, skipping insertion in model container [2021-10-13 00:46:32,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:46:32" (3/3) ... [2021-10-13 00:46:32,300 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_tso.oepc.i [2021-10-13 00:46:32,306 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-13 00:46:32,306 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 00:46:32,306 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-13 00:46:32,306 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-13 00:46:32,358 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,359 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,359 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,359 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,360 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,362 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,362 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,362 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,362 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,362 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,364 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,364 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,367 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,368 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,369 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,369 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,374 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,375 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,375 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,376 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,376 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,376 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,376 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,376 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,377 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,377 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,377 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,377 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,378 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,378 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,378 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,379 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,379 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,379 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,380 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,380 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,380 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,380 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,381 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,381 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,381 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,381 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,382 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,382 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,383 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,383 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,383 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,383 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,390 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,391 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,392 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,395 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,395 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,397 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,398 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,398 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,399 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,399 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,408 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,409 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,412 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,412 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,415 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,416 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,416 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:46:32,417 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-13 00:46:32,477 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 00:46:32,487 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 00:46:32,487 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-10-13 00:46:32,515 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-13 00:46:32,527 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 124 transitions, 268 flow [2021-10-13 00:46:32,530 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 124 transitions, 268 flow [2021-10-13 00:46:32,532 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 135 places, 124 transitions, 268 flow [2021-10-13 00:46:32,622 INFO L129 PetriNetUnfolder]: 2/120 cut-off events. [2021-10-13 00:46:32,622 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-13 00:46:32,627 INFO L84 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 120 events. 2/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2021-10-13 00:46:32,634 INFO L116 LiptonReduction]: Number of co-enabled transitions 2682 [2021-10-13 00:46:50,459 INFO L131 LiptonReduction]: Checked pairs total: 6268 [2021-10-13 00:46:50,459 INFO L133 LiptonReduction]: Total number of compositions: 101 [2021-10-13 00:46:50,470 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 31 transitions, 82 flow [2021-10-13 00:46:50,643 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2282 states, 2279 states have (on average 3.8121983326020183) internal successors, (8688), 2281 states have internal predecessors, (8688), 0 states have call successors, (0), 0 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 00:46:50,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 2282 states, 2279 states have (on average 3.8121983326020183) internal successors, (8688), 2281 states have internal predecessors, (8688), 0 states have call successors, (0), 0 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 00:46:50,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 00:46:50,667 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:50,668 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:46:50,669 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 00:46:50,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:50,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1638475840, now seen corresponding path program 1 times [2021-10-13 00:46:50,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:50,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088214040] [2021-10-13 00:46:50,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:50,692 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:51,164 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 00:46:51,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:51,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088214040] [2021-10-13 00:46:51,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088214040] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:51,167 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:51,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-13 00:46:51,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46612376] [2021-10-13 00:46:51,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:46:51,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:51,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:46:51,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:51,201 INFO L87 Difference]: Start difference. First operand has 2282 states, 2279 states have (on average 3.8121983326020183) internal successors, (8688), 2281 states have internal predecessors, (8688), 0 states have call successors, (0), 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 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 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 00:46:51,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:51,313 INFO L93 Difference]: Finished difference Result 1882 states and 7048 transitions. [2021-10-13 00:46:51,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:46:51,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2021-10-13 00:46:51,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:51,364 INFO L225 Difference]: With dead ends: 1882 [2021-10-13 00:46:51,364 INFO L226 Difference]: Without dead ends: 1802 [2021-10-13 00:46:51,365 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:51,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2021-10-13 00:46:51,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2021-10-13 00:46:51,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1801 states have (on average 3.7667962243198225) internal successors, (6784), 1801 states have internal predecessors, (6784), 0 states have call successors, (0), 0 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 00:46:51,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6784 transitions. [2021-10-13 00:46:51,528 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6784 transitions. Word has length 9 [2021-10-13 00:46:51,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:51,529 INFO L470 AbstractCegarLoop]: Abstraction has 1802 states and 6784 transitions. [2021-10-13 00:46:51,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 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 00:46:51,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6784 transitions. [2021-10-13 00:46:51,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-13 00:46:51,533 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:51,533 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:46:51,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 00:46:51,534 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 00:46:51,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:51,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1677622827, now seen corresponding path program 1 times [2021-10-13 00:46:51,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:51,535 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003279539] [2021-10-13 00:46:51,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:51,535 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:51,661 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 00:46:51,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:51,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003279539] [2021-10-13 00:46:51,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003279539] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:51,662 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:51,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-13 00:46:51,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964170424] [2021-10-13 00:46:51,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:46:51,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:51,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:46:51,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:51,665 INFO L87 Difference]: Start difference. First operand 1802 states and 6784 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 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 00:46:51,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:51,693 INFO L93 Difference]: Finished difference Result 1752 states and 6554 transitions. [2021-10-13 00:46:51,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:46:51,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-10-13 00:46:51,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:51,715 INFO L225 Difference]: With dead ends: 1752 [2021-10-13 00:46:51,715 INFO L226 Difference]: Without dead ends: 1752 [2021-10-13 00:46:51,716 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:51,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2021-10-13 00:46:51,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. [2021-10-13 00:46:51,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1752 states, 1751 states have (on average 3.743003997715591) internal successors, (6554), 1751 states have internal predecessors, (6554), 0 states have call successors, (0), 0 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 00:46:51,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 6554 transitions. [2021-10-13 00:46:51,852 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 6554 transitions. Word has length 11 [2021-10-13 00:46:51,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:51,852 INFO L470 AbstractCegarLoop]: Abstraction has 1752 states and 6554 transitions. [2021-10-13 00:46:51,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 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 00:46:51,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 6554 transitions. [2021-10-13 00:46:51,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-13 00:46:51,856 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:51,856 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:46:51,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 00:46:51,857 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 00:46:51,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:51,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1241052862, now seen corresponding path program 1 times [2021-10-13 00:46:51,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:51,858 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841030048] [2021-10-13 00:46:51,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:51,858 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:52,063 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 00:46:52,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:52,064 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841030048] [2021-10-13 00:46:52,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841030048] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:52,064 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:52,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-13 00:46:52,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217946364] [2021-10-13 00:46:52,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:46:52,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:52,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:46:52,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:52,067 INFO L87 Difference]: Start difference. First operand 1752 states and 6554 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 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 00:46:52,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:52,109 INFO L93 Difference]: Finished difference Result 1722 states and 6420 transitions. [2021-10-13 00:46:52,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:46:52,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-10-13 00:46:52,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:52,130 INFO L225 Difference]: With dead ends: 1722 [2021-10-13 00:46:52,131 INFO L226 Difference]: Without dead ends: 1722 [2021-10-13 00:46:52,131 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:52,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2021-10-13 00:46:52,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1722. [2021-10-13 00:46:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1722 states, 1721 states have (on average 3.730389308541546) internal successors, (6420), 1721 states have internal predecessors, (6420), 0 states have call successors, (0), 0 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 00:46:52,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 6420 transitions. [2021-10-13 00:46:52,234 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 6420 transitions. Word has length 12 [2021-10-13 00:46:52,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:52,235 INFO L470 AbstractCegarLoop]: Abstraction has 1722 states and 6420 transitions. [2021-10-13 00:46:52,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 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 00:46:52,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 6420 transitions. [2021-10-13 00:46:52,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-13 00:46:52,240 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:52,240 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:46:52,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 00:46:52,241 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 00:46:52,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:52,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1771173454, now seen corresponding path program 1 times [2021-10-13 00:46:52,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:52,241 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116103775] [2021-10-13 00:46:52,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:52,242 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:52,382 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 00:46:52,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:52,383 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116103775] [2021-10-13 00:46:52,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116103775] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:52,384 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:52,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 00:46:52,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010799051] [2021-10-13 00:46:52,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:46:52,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:52,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:46:52,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:52,386 INFO L87 Difference]: Start difference. First operand 1722 states and 6420 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 00:46:52,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:52,431 INFO L93 Difference]: Finished difference Result 2386 states and 8562 transitions. [2021-10-13 00:46:52,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:46:52,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-10-13 00:46:52,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:52,451 INFO L225 Difference]: With dead ends: 2386 [2021-10-13 00:46:52,451 INFO L226 Difference]: Without dead ends: 1842 [2021-10-13 00:46:52,452 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:52,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2021-10-13 00:46:52,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1682. [2021-10-13 00:46:52,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1681 states have (on average 3.5609756097560976) internal successors, (5986), 1681 states have internal predecessors, (5986), 0 states have call successors, (0), 0 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 00:46:52,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 5986 transitions. [2021-10-13 00:46:52,546 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 5986 transitions. Word has length 13 [2021-10-13 00:46:52,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:52,547 INFO L470 AbstractCegarLoop]: Abstraction has 1682 states and 5986 transitions. [2021-10-13 00:46:52,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 00:46:52,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 5986 transitions. [2021-10-13 00:46:52,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-13 00:46:52,550 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:52,550 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:46:52,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 00:46:52,550 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 00:46:52,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:52,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1081592393, now seen corresponding path program 1 times [2021-10-13 00:46:52,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:52,553 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74466285] [2021-10-13 00:46:52,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:52,553 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:52,811 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 00:46:52,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:52,812 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74466285] [2021-10-13 00:46:52,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74466285] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:52,812 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:52,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 00:46:52,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906369858] [2021-10-13 00:46:52,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:46:52,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:52,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:46:52,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:46:52,815 INFO L87 Difference]: Start difference. First operand 1682 states and 5986 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 00:46:52,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:52,880 INFO L93 Difference]: Finished difference Result 1640 states and 5800 transitions. [2021-10-13 00:46:52,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:46:52,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-10-13 00:46:52,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:52,898 INFO L225 Difference]: With dead ends: 1640 [2021-10-13 00:46:52,899 INFO L226 Difference]: Without dead ends: 1640 [2021-10-13 00:46:52,899 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:46:52,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2021-10-13 00:46:52,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1640. [2021-10-13 00:46:52,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1639 states have (on average 3.538743136058572) internal successors, (5800), 1639 states have internal predecessors, (5800), 0 states have call successors, (0), 0 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 00:46:52,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 5800 transitions. [2021-10-13 00:46:52,968 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 5800 transitions. Word has length 13 [2021-10-13 00:46:52,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:52,969 INFO L470 AbstractCegarLoop]: Abstraction has 1640 states and 5800 transitions. [2021-10-13 00:46:52,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 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 00:46:52,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 5800 transitions. [2021-10-13 00:46:52,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-13 00:46:52,972 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:52,972 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:46:52,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 00:46:52,972 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 00:46:52,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:52,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1872787779, now seen corresponding path program 1 times [2021-10-13 00:46:52,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:52,973 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301334337] [2021-10-13 00:46:52,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:52,973 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:53,142 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 00:46:53,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:53,142 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301334337] [2021-10-13 00:46:53,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301334337] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:53,143 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:53,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:46:53,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430691655] [2021-10-13 00:46:53,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:46:53,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:53,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:46:53,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:46:53,144 INFO L87 Difference]: Start difference. First operand 1640 states and 5800 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 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 00:46:53,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:53,240 INFO L93 Difference]: Finished difference Result 1886 states and 6660 transitions. [2021-10-13 00:46:53,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 00:46:53,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-10-13 00:46:53,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:53,263 INFO L225 Difference]: With dead ends: 1886 [2021-10-13 00:46:53,263 INFO L226 Difference]: Without dead ends: 1886 [2021-10-13 00:46:53,264 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 32.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:46:53,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2021-10-13 00:46:53,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1886. [2021-10-13 00:46:53,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1885 states have (on average 3.53315649867374) internal successors, (6660), 1885 states have internal predecessors, (6660), 0 states have call successors, (0), 0 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 00:46:53,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 6660 transitions. [2021-10-13 00:46:53,394 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 6660 transitions. Word has length 14 [2021-10-13 00:46:53,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:53,395 INFO L470 AbstractCegarLoop]: Abstraction has 1886 states and 6660 transitions. [2021-10-13 00:46:53,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 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 00:46:53,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 6660 transitions. [2021-10-13 00:46:53,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-13 00:46:53,399 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:53,399 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:46:53,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 00:46:53,400 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 00:46:53,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:53,401 INFO L82 PathProgramCache]: Analyzing trace with hash -29626043, now seen corresponding path program 1 times [2021-10-13 00:46:53,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:53,401 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713487728] [2021-10-13 00:46:53,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:53,401 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:53,520 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 00:46:53,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:53,521 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713487728] [2021-10-13 00:46:53,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713487728] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:53,521 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:53,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:46:53,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248078050] [2021-10-13 00:46:53,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:46:53,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:53,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:46:53,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:46:53,523 INFO L87 Difference]: Start difference. First operand 1886 states and 6660 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 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 00:46:53,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:53,626 INFO L93 Difference]: Finished difference Result 1982 states and 6946 transitions. [2021-10-13 00:46:53,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 00:46:53,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-10-13 00:46:53,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:53,650 INFO L225 Difference]: With dead ends: 1982 [2021-10-13 00:46:53,650 INFO L226 Difference]: Without dead ends: 1982 [2021-10-13 00:46:53,651 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.1ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:46:53,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2021-10-13 00:46:53,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1858. [2021-10-13 00:46:53,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1857 states have (on average 3.493807215939688) internal successors, (6488), 1857 states have internal predecessors, (6488), 0 states have call successors, (0), 0 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 00:46:53,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 6488 transitions. [2021-10-13 00:46:53,741 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 6488 transitions. Word has length 15 [2021-10-13 00:46:53,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:53,742 INFO L470 AbstractCegarLoop]: Abstraction has 1858 states and 6488 transitions. [2021-10-13 00:46:53,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 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 00:46:53,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 6488 transitions. [2021-10-13 00:46:53,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-13 00:46:53,747 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:53,747 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:46:53,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 00:46:53,748 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 00:46:53,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:53,748 INFO L82 PathProgramCache]: Analyzing trace with hash -159180566, now seen corresponding path program 1 times [2021-10-13 00:46:53,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:53,749 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949292018] [2021-10-13 00:46:53,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:53,749 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:53,949 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 00:46:53,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:53,950 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949292018] [2021-10-13 00:46:53,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949292018] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:53,950 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:53,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:46:53,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081038952] [2021-10-13 00:46:53,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:46:53,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:53,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:46:53,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:46:53,952 INFO L87 Difference]: Start difference. First operand 1858 states and 6488 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 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 00:46:54,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:54,165 INFO L93 Difference]: Finished difference Result 2090 states and 7300 transitions. [2021-10-13 00:46:54,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 00:46:54,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-10-13 00:46:54,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:54,198 INFO L225 Difference]: With dead ends: 2090 [2021-10-13 00:46:54,207 INFO L226 Difference]: Without dead ends: 2090 [2021-10-13 00:46:54,207 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 95.0ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:46:54,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2021-10-13 00:46:54,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 1610. [2021-10-13 00:46:54,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1609 states have (on average 3.487880671224363) internal successors, (5612), 1609 states have internal predecessors, (5612), 0 states have call successors, (0), 0 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 00:46:54,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 5612 transitions. [2021-10-13 00:46:54,288 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 5612 transitions. Word has length 16 [2021-10-13 00:46:54,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:54,289 INFO L470 AbstractCegarLoop]: Abstraction has 1610 states and 5612 transitions. [2021-10-13 00:46:54,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 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 00:46:54,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 5612 transitions. [2021-10-13 00:46:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-13 00:46:54,294 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:54,294 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:46:54,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 00:46:54,295 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 00:46:54,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:54,295 INFO L82 PathProgramCache]: Analyzing trace with hash -920960370, now seen corresponding path program 1 times [2021-10-13 00:46:54,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:54,296 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781302486] [2021-10-13 00:46:54,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:54,296 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:54,415 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 00:46:54,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:54,416 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781302486] [2021-10-13 00:46:54,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781302486] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:54,416 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:54,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:46:54,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883094852] [2021-10-13 00:46:54,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:46:54,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:54,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:46:54,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:46:54,418 INFO L87 Difference]: Start difference. First operand 1610 states and 5612 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 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 00:46:54,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:54,467 INFO L93 Difference]: Finished difference Result 1715 states and 5456 transitions. [2021-10-13 00:46:54,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 00:46:54,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-10-13 00:46:54,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:54,475 INFO L225 Difference]: With dead ends: 1715 [2021-10-13 00:46:54,475 INFO L226 Difference]: Without dead ends: 1283 [2021-10-13 00:46:54,476 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:46:54,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2021-10-13 00:46:54,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2021-10-13 00:46:54,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1282 states have (on average 3.1630265210608424) internal successors, (4055), 1282 states have internal predecessors, (4055), 0 states have call successors, (0), 0 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 00:46:54,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 4055 transitions. [2021-10-13 00:46:54,530 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 4055 transitions. Word has length 16 [2021-10-13 00:46:54,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:54,530 INFO L470 AbstractCegarLoop]: Abstraction has 1283 states and 4055 transitions. [2021-10-13 00:46:54,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 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 00:46:54,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 4055 transitions. [2021-10-13 00:46:54,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 00:46:54,535 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:54,535 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:46:54,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 00:46:54,536 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 00:46:54,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:54,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1239163265, now seen corresponding path program 1 times [2021-10-13 00:46:54,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:54,537 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634155037] [2021-10-13 00:46:54,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:54,537 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:54,711 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 00:46:54,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:54,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634155037] [2021-10-13 00:46:54,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634155037] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:54,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:54,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:46:54,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902742835] [2021-10-13 00:46:54,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:46:54,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:54,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:46:54,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:46:54,715 INFO L87 Difference]: Start difference. First operand 1283 states and 4055 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 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 00:46:54,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:54,794 INFO L93 Difference]: Finished difference Result 1150 states and 3339 transitions. [2021-10-13 00:46:54,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 00:46:54,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-10-13 00:46:54,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:54,800 INFO L225 Difference]: With dead ends: 1150 [2021-10-13 00:46:54,800 INFO L226 Difference]: Without dead ends: 871 [2021-10-13 00:46:54,801 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 15.5ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:46:54,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2021-10-13 00:46:54,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 871. [2021-10-13 00:46:54,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 870 states have (on average 2.8517241379310345) internal successors, (2481), 870 states have internal predecessors, (2481), 0 states have call successors, (0), 0 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 00:46:54,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 2481 transitions. [2021-10-13 00:46:54,848 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 2481 transitions. Word has length 17 [2021-10-13 00:46:54,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:54,850 INFO L470 AbstractCegarLoop]: Abstraction has 871 states and 2481 transitions. [2021-10-13 00:46:54,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 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 00:46:54,851 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 2481 transitions. [2021-10-13 00:46:54,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 00:46:54,855 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:54,855 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:46:54,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 00:46:54,856 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 00:46:54,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:54,856 INFO L82 PathProgramCache]: Analyzing trace with hash 634628423, now seen corresponding path program 1 times [2021-10-13 00:46:54,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:54,857 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314369694] [2021-10-13 00:46:54,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:54,858 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:54,977 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 00:46:54,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:54,978 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314369694] [2021-10-13 00:46:54,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314369694] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:54,978 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:54,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:46:54,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890986267] [2021-10-13 00:46:54,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:46:54,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:54,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:46:54,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:46:54,983 INFO L87 Difference]: Start difference. First operand 871 states and 2481 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 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 00:46:55,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:55,018 INFO L93 Difference]: Finished difference Result 1201 states and 3360 transitions. [2021-10-13 00:46:55,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:46:55,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2021-10-13 00:46:55,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:55,023 INFO L225 Difference]: With dead ends: 1201 [2021-10-13 00:46:55,023 INFO L226 Difference]: Without dead ends: 561 [2021-10-13 00:46:55,023 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:46:55,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2021-10-13 00:46:55,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2021-10-13 00:46:55,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 560 states have (on average 2.648214285714286) internal successors, (1483), 560 states have internal predecessors, (1483), 0 states have call successors, (0), 0 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 00:46:55,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 1483 transitions. [2021-10-13 00:46:55,055 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 1483 transitions. Word has length 19 [2021-10-13 00:46:55,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:55,057 INFO L470 AbstractCegarLoop]: Abstraction has 561 states and 1483 transitions. [2021-10-13 00:46:55,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 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 00:46:55,058 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 1483 transitions. [2021-10-13 00:46:55,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 00:46:55,062 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:55,062 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:46:55,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 00:46:55,063 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 00:46:55,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:55,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1720530527, now seen corresponding path program 1 times [2021-10-13 00:46:55,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:55,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600242571] [2021-10-13 00:46:55,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:55,065 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:55,225 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 00:46:55,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:55,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600242571] [2021-10-13 00:46:55,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600242571] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:55,226 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:55,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:46:55,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219435619] [2021-10-13 00:46:55,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:46:55,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:55,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:46:55,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:46:55,228 INFO L87 Difference]: Start difference. First operand 561 states and 1483 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 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 00:46:55,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:55,326 INFO L93 Difference]: Finished difference Result 479 states and 1218 transitions. [2021-10-13 00:46:55,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:46:55,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2021-10-13 00:46:55,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:55,329 INFO L225 Difference]: With dead ends: 479 [2021-10-13 00:46:55,329 INFO L226 Difference]: Without dead ends: 403 [2021-10-13 00:46:55,330 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 39.9ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:46:55,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2021-10-13 00:46:55,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 387. [2021-10-13 00:46:55,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 386 states have (on average 2.55699481865285) internal successors, (987), 386 states have internal predecessors, (987), 0 states have call successors, (0), 0 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 00:46:55,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 987 transitions. [2021-10-13 00:46:55,362 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 987 transitions. Word has length 19 [2021-10-13 00:46:55,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:55,362 INFO L470 AbstractCegarLoop]: Abstraction has 387 states and 987 transitions. [2021-10-13 00:46:55,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 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 00:46:55,363 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 987 transitions. [2021-10-13 00:46:55,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 00:46:55,365 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:55,365 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] [2021-10-13 00:46:55,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 00:46:55,365 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 00:46:55,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:55,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1510881533, now seen corresponding path program 1 times [2021-10-13 00:46:55,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:55,366 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710335301] [2021-10-13 00:46:55,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:55,367 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:55,550 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 00:46:55,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:55,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710335301] [2021-10-13 00:46:55,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710335301] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:55,551 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:55,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:46:55,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954237982] [2021-10-13 00:46:55,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:46:55,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:55,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:46:55,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:46:55,554 INFO L87 Difference]: Start difference. First operand 387 states and 987 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 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 00:46:55,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:55,628 INFO L93 Difference]: Finished difference Result 365 states and 942 transitions. [2021-10-13 00:46:55,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 00:46:55,629 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-10-13 00:46:55,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:55,630 INFO L225 Difference]: With dead ends: 365 [2021-10-13 00:46:55,630 INFO L226 Difference]: Without dead ends: 223 [2021-10-13 00:46:55,631 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 27.3ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:46:55,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-10-13 00:46:55,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 207. [2021-10-13 00:46:55,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 2.4902912621359223) internal successors, (513), 206 states have internal predecessors, (513), 0 states have call successors, (0), 0 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 00:46:55,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 513 transitions. [2021-10-13 00:46:55,640 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 513 transitions. Word has length 22 [2021-10-13 00:46:55,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:55,641 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 513 transitions. [2021-10-13 00:46:55,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 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 00:46:55,641 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 513 transitions. [2021-10-13 00:46:55,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 00:46:55,643 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:55,643 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] [2021-10-13 00:46:55,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 00:46:55,643 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 00:46:55,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:55,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1718323758, now seen corresponding path program 1 times [2021-10-13 00:46:55,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:55,647 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756753937] [2021-10-13 00:46:55,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:55,647 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:55,768 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 00:46:55,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:55,771 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756753937] [2021-10-13 00:46:55,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756753937] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:55,772 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:55,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 00:46:55,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417247298] [2021-10-13 00:46:55,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:46:55,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:55,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:46:55,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:55,774 INFO L87 Difference]: Start difference. First operand 207 states and 513 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 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 00:46:55,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:55,788 INFO L93 Difference]: Finished difference Result 275 states and 676 transitions. [2021-10-13 00:46:55,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:46:55,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2021-10-13 00:46:55,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:55,792 INFO L225 Difference]: With dead ends: 275 [2021-10-13 00:46:55,792 INFO L226 Difference]: Without dead ends: 91 [2021-10-13 00:46:55,793 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:46:55,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-10-13 00:46:55,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-10-13 00:46:55,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 2.188888888888889) internal successors, (197), 90 states have internal predecessors, (197), 0 states have call successors, (0), 0 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 00:46:55,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 197 transitions. [2021-10-13 00:46:55,798 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 197 transitions. Word has length 25 [2021-10-13 00:46:55,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:55,798 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 197 transitions. [2021-10-13 00:46:55,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 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 00:46:55,799 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 197 transitions. [2021-10-13 00:46:55,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 00:46:55,802 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:55,802 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] [2021-10-13 00:46:55,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 00:46:55,803 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 00:46:55,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:55,804 INFO L82 PathProgramCache]: Analyzing trace with hash 583869732, now seen corresponding path program 2 times [2021-10-13 00:46:55,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:55,804 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127012527] [2021-10-13 00:46:55,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:55,805 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:46:56,071 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 00:46:56,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:46:56,071 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127012527] [2021-10-13 00:46:56,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127012527] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:46:56,072 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:46:56,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:46:56,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277742041] [2021-10-13 00:46:56,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:46:56,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:46:56,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:46:56,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:46:56,077 INFO L87 Difference]: Start difference. First operand 91 states and 197 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 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 00:46:56,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:46:56,177 INFO L93 Difference]: Finished difference Result 117 states and 251 transitions. [2021-10-13 00:46:56,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 00:46:56,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2021-10-13 00:46:56,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:46:56,178 INFO L225 Difference]: With dead ends: 117 [2021-10-13 00:46:56,178 INFO L226 Difference]: Without dead ends: 63 [2021-10-13 00:46:56,179 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 76.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:46:56,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-10-13 00:46:56,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-10-13 00:46:56,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.9516129032258065) internal successors, (121), 62 states have internal predecessors, (121), 0 states have call successors, (0), 0 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 00:46:56,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 121 transitions. [2021-10-13 00:46:56,182 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 121 transitions. Word has length 25 [2021-10-13 00:46:56,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:46:56,182 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 121 transitions. [2021-10-13 00:46:56,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 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 00:46:56,182 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 121 transitions. [2021-10-13 00:46:56,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 00:46:56,183 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:46:56,183 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] [2021-10-13 00:46:56,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 00:46:56,184 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-10-13 00:46:56,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:46:56,184 INFO L82 PathProgramCache]: Analyzing trace with hash -995369118, now seen corresponding path program 3 times [2021-10-13 00:46:56,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:46:56,186 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238854581] [2021-10-13 00:46:56,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:46:56,187 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:46:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:46:56,271 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:46:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:46:56,445 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:46:56,448 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 00:46:56,450 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:46:56,452 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:46:56,452 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-13 00:46:56,453 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-13 00:46:56,453 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-13 00:46:56,453 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION [2021-10-13 00:46:56,453 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:46:56,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 00:46:56,461 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-13 00:46:56,462 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 00:46:56,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:46:56 BasicIcfg [2021-10-13 00:46:56,634 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 00:46:56,635 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 00:46:56,635 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 00:46:56,635 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 00:46:56,636 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:46:32" (3/4) ... [2021-10-13 00:46:56,638 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 00:46:56,791 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64235fd-4b22-48e6-a8b4-47ea3cdb5b07/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 00:46:56,791 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 00:46:56,793 INFO L168 Benchmark]: Toolchain (without parser) took 27708.17 ms. Allocated memory was 123.7 MB in the beginning and 281.0 MB in the end (delta: 157.3 MB). Free memory was 86.5 MB in the beginning and 119.1 MB in the end (delta: -32.6 MB). Peak memory consumption was 124.0 MB. Max. memory is 16.1 GB. [2021-10-13 00:46:56,793 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 123.7 MB. Free memory was 94.6 MB in the beginning and 94.6 MB in the end (delta: 21.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:46:56,794 INFO L168 Benchmark]: CACSL2BoogieTranslator took 824.73 ms. Allocated memory is still 123.7 MB. Free memory was 86.1 MB in the beginning and 85.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 00:46:56,795 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.12 ms. Allocated memory is still 123.7 MB. Free memory was 85.0 MB in the beginning and 82.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 00:46:56,798 INFO L168 Benchmark]: Boogie Preprocessor took 48.68 ms. Allocated memory is still 123.7 MB. Free memory was 82.2 MB in the beginning and 80.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:46:56,798 INFO L168 Benchmark]: RCFGBuilder took 2215.60 ms. Allocated memory was 123.7 MB in the beginning and 159.4 MB in the end (delta: 35.7 MB). Free memory was 80.1 MB in the beginning and 122.4 MB in the end (delta: -42.2 MB). Peak memory consumption was 51.7 MB. Max. memory is 16.1 GB. [2021-10-13 00:46:56,799 INFO L168 Benchmark]: TraceAbstraction took 24346.89 ms. Allocated memory was 159.4 MB in the beginning and 281.0 MB in the end (delta: 121.6 MB). Free memory was 121.4 MB in the beginning and 135.8 MB in the end (delta: -14.4 MB). Peak memory consumption was 108.3 MB. Max. memory is 16.1 GB. [2021-10-13 00:46:56,799 INFO L168 Benchmark]: Witness Printer took 156.12 ms. Allocated memory is still 281.0 MB. Free memory was 135.8 MB in the beginning and 119.1 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-10-13 00:46:56,802 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 123.7 MB. Free memory was 94.6 MB in the beginning and 94.6 MB in the end (delta: 21.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 824.73 ms. Allocated memory is still 123.7 MB. Free memory was 86.1 MB in the beginning and 85.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 105.12 ms. Allocated memory is still 123.7 MB. Free memory was 85.0 MB in the beginning and 82.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 48.68 ms. Allocated memory is still 123.7 MB. Free memory was 82.2 MB in the beginning and 80.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2215.60 ms. Allocated memory was 123.7 MB in the beginning and 159.4 MB in the end (delta: 35.7 MB). Free memory was 80.1 MB in the beginning and 122.4 MB in the end (delta: -42.2 MB). Peak memory consumption was 51.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 24346.89 ms. Allocated memory was 159.4 MB in the beginning and 281.0 MB in the end (delta: 121.6 MB). Free memory was 121.4 MB in the beginning and 135.8 MB in the end (delta: -14.4 MB). Peak memory consumption was 108.3 MB. Max. memory is 16.1 GB. * Witness Printer took 156.12 ms. Allocated memory is still 281.0 MB. Free memory was 135.8 MB in the beginning and 119.1 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17929.2ms, 135 PlacesBefore, 44 PlacesAfterwards, 124 TransitionsBefore, 31 TransitionsAfterwards, 2682 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 101 TotalNumberOfCompositions, 6268 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3416, positive: 3248, positive conditional: 0, positive unconditional: 3248, negative: 168, negative conditional: 0, negative unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1859, positive: 1798, positive conditional: 0, positive unconditional: 1798, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1859, positive: 1778, positive conditional: 0, positive unconditional: 1778, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 81, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 874, positive: 188, positive conditional: 0, positive unconditional: 188, negative: 686, negative conditional: 0, negative unconditional: 686, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3416, positive: 1450, positive conditional: 0, positive unconditional: 1450, negative: 107, negative conditional: 0, negative unconditional: 107, unknown: 1859, unknown conditional: 0, unknown unconditional: 1859] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 176, Positive conditional cache size: 0, Positive unconditional cache size: 176, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1537; [L835] FCALL, FORK 0 pthread_create(&t1537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1538; [L837] FCALL, FORK 0 pthread_create(&t1538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1539; [L839] FCALL, FORK 0 pthread_create(&t1539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1540; [L841] FCALL, FORK 0 pthread_create(&t1540, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L776] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 4 return 0; [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 837]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 835]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 158 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 23982.5ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 71.8ms, AutomataDifference: 1458.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 18156.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 461 SDtfs, 511 SDslu, 660 SDs, 0 SdLazy, 294 SolverSat, 98 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 507.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 364.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2282occurred in iteration=0, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1032.2ms AutomataMinimizationTime, 15 MinimizatonAttempts, 796 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 110.1ms SsaConstructionTime, 1028.7ms SatisfiabilityAnalysisTime, 1559.4ms InterpolantComputationTime, 271 NumberOfCodeBlocks, 271 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 1498 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 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 00:46:56,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d64235fd-4b22-48e6-a8b4-47ea3cdb5b07/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...