./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix056_tso.opt.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_b33fa023-5571-4e7b-8c0a-118e7525d233/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b33fa023-5571-4e7b-8c0a-118e7525d233/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_b33fa023-5571-4e7b-8c0a-118e7525d233/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b33fa023-5571-4e7b-8c0a-118e7525d233/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix056_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b33fa023-5571-4e7b-8c0a-118e7525d233/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_b33fa023-5571-4e7b-8c0a-118e7525d233/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 bcce1dac8925a948651d75a3c8e6bec9473b96df ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-12 23:59:24,924 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-12 23:59:24,929 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-12 23:59:24,997 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-12 23:59:24,999 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-12 23:59:25,005 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-12 23:59:25,008 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-12 23:59:25,011 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-12 23:59:25,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-12 23:59:25,015 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-12 23:59:25,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-12 23:59:25,018 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-12 23:59:25,019 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-12 23:59:25,020 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-12 23:59:25,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-12 23:59:25,024 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-12 23:59:25,025 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-12 23:59:25,026 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-12 23:59:25,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-12 23:59:25,032 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-12 23:59:25,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-12 23:59:25,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-12 23:59:25,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-12 23:59:25,040 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-12 23:59:25,044 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-12 23:59:25,045 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-12 23:59:25,046 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-12 23:59:25,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-12 23:59:25,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-12 23:59:25,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-12 23:59:25,050 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-12 23:59:25,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-12 23:59:25,052 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-12 23:59:25,053 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-12 23:59:25,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-12 23:59:25,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-12 23:59:25,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-12 23:59:25,057 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-12 23:59:25,057 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-12 23:59:25,059 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-12 23:59:25,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-12 23:59:25,061 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b33fa023-5571-4e7b-8c0a-118e7525d233/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-12 23:59:25,093 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-12 23:59:25,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-12 23:59:25,094 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-12 23:59:25,094 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-12 23:59:25,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-12 23:59:25,096 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-12 23:59:25,096 INFO L138 SettingsManager]: * Use SBE=true [2021-10-12 23:59:25,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-12 23:59:25,097 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-12 23:59:25,097 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-12 23:59:25,098 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-12 23:59:25,098 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-12 23:59:25,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-12 23:59:25,099 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-12 23:59:25,099 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-12 23:59:25,099 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-12 23:59:25,100 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-12 23:59:25,100 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-12 23:59:25,100 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-12 23:59:25,101 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-12 23:59:25,101 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-12 23:59:25,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-12 23:59:25,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-12 23:59:25,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-12 23:59:25,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-12 23:59:25,103 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-12 23:59:25,103 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-12 23:59:25,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-12 23:59:25,104 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-12 23:59:25,104 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-12 23:59:25,104 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_b33fa023-5571-4e7b-8c0a-118e7525d233/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_b33fa023-5571-4e7b-8c0a-118e7525d233/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 -> bcce1dac8925a948651d75a3c8e6bec9473b96df [2021-10-12 23:59:25,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-12 23:59:25,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-12 23:59:25,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-12 23:59:25,445 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-12 23:59:25,446 INFO L275 PluginConnector]: CDTParser initialized [2021-10-12 23:59:25,447 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b33fa023-5571-4e7b-8c0a-118e7525d233/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/pthread-wmm/mix056_tso.opt.i [2021-10-12 23:59:25,525 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b33fa023-5571-4e7b-8c0a-118e7525d233/bin/uautomizer-WNIpwEf4Nt/data/fda79652f/98ce61a5276744b7bf5e4e4c90f19fd9/FLAGc06ed68e7 [2021-10-12 23:59:26,142 INFO L306 CDTParser]: Found 1 translation units. [2021-10-12 23:59:26,142 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b33fa023-5571-4e7b-8c0a-118e7525d233/sv-benchmarks/c/pthread-wmm/mix056_tso.opt.i [2021-10-12 23:59:26,163 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b33fa023-5571-4e7b-8c0a-118e7525d233/bin/uautomizer-WNIpwEf4Nt/data/fda79652f/98ce61a5276744b7bf5e4e4c90f19fd9/FLAGc06ed68e7 [2021-10-12 23:59:26,380 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b33fa023-5571-4e7b-8c0a-118e7525d233/bin/uautomizer-WNIpwEf4Nt/data/fda79652f/98ce61a5276744b7bf5e4e4c90f19fd9 [2021-10-12 23:59:26,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-12 23:59:26,384 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-12 23:59:26,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-12 23:59:26,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-12 23:59:26,392 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-12 23:59:26,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:59:26" (1/1) ... [2021-10-12 23:59:26,394 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f43bc9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:26, skipping insertion in model container [2021-10-12 23:59:26,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:59:26" (1/1) ... [2021-10-12 23:59:26,405 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-12 23:59:26,471 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-12 23:59:26,719 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_b33fa023-5571-4e7b-8c0a-118e7525d233/sv-benchmarks/c/pthread-wmm/mix056_tso.opt.i[948,961] [2021-10-12 23:59:27,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-12 23:59:27,044 INFO L203 MainTranslator]: Completed pre-run [2021-10-12 23:59:27,061 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_b33fa023-5571-4e7b-8c0a-118e7525d233/sv-benchmarks/c/pthread-wmm/mix056_tso.opt.i[948,961] [2021-10-12 23:59:27,147 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-12 23:59:27,216 INFO L208 MainTranslator]: Completed translation [2021-10-12 23:59:27,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:27 WrapperNode [2021-10-12 23:59:27,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-12 23:59:27,220 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-12 23:59:27,221 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-12 23:59:27,221 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-12 23:59:27,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:27" (1/1) ... [2021-10-12 23:59:27,270 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:27" (1/1) ... [2021-10-12 23:59:27,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-12 23:59:27,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-12 23:59:27,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-12 23:59:27,332 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-12 23:59:27,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:27" (1/1) ... [2021-10-12 23:59:27,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:27" (1/1) ... [2021-10-12 23:59:27,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:27" (1/1) ... [2021-10-12 23:59:27,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:27" (1/1) ... [2021-10-12 23:59:27,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:27" (1/1) ... [2021-10-12 23:59:27,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:27" (1/1) ... [2021-10-12 23:59:27,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:27" (1/1) ... [2021-10-12 23:59:27,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-12 23:59:27,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-12 23:59:27,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-12 23:59:27,425 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-12 23:59:27,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:27" (1/1) ... [2021-10-12 23:59:27,442 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-12 23:59:27,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b33fa023-5571-4e7b-8c0a-118e7525d233/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-12 23:59:27,480 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b33fa023-5571-4e7b-8c0a-118e7525d233/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-12 23:59:27,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b33fa023-5571-4e7b-8c0a-118e7525d233/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-12 23:59:27,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-12 23:59:27,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-12 23:59:27,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-12 23:59:27,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-12 23:59:27,553 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-12 23:59:27,553 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-12 23:59:27,554 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-12 23:59:27,554 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-12 23:59:27,554 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-10-12 23:59:27,554 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-10-12 23:59:27,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-12 23:59:27,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-12 23:59:27,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-12 23:59:27,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-12 23:59:27,557 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-12 23:59:29,583 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-12 23:59:29,584 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-12 23:59:29,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:59:29 BoogieIcfgContainer [2021-10-12 23:59:29,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-12 23:59:29,589 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-12 23:59:29,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-12 23:59:29,593 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-12 23:59:29,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:59:26" (1/3) ... [2021-10-12 23:59:29,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390c0218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:59:29, skipping insertion in model container [2021-10-12 23:59:29,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:27" (2/3) ... [2021-10-12 23:59:29,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390c0218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:59:29, skipping insertion in model container [2021-10-12 23:59:29,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:59:29" (3/3) ... [2021-10-12 23:59:29,616 INFO L111 eAbstractionObserver]: Analyzing ICFG mix056_tso.opt.i [2021-10-12 23:59:29,622 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-12 23:59:29,623 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-12 23:59:29,623 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-12 23:59:29,623 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-12 23:59:29,664 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,664 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,664 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,665 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,666 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,666 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,669 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,669 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,670 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,670 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,677 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,677 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,678 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,678 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,678 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,679 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,679 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,680 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,685 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,685 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,685 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,694 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,696 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,696 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,699 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,701 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,703 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,707 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,709 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,709 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,710 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-12 23:59:29,718 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-12 23:59:29,760 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-12 23:59:29,767 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-12 23:59:29,768 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-10-12 23:59:29,785 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-12 23:59:29,798 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 225 flow [2021-10-12 23:59:29,802 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 225 flow [2021-10-12 23:59:29,804 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 225 flow [2021-10-12 23:59:29,862 INFO L129 PetriNetUnfolder]: 2/102 cut-off events. [2021-10-12 23:59:29,863 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-12 23:59:29,867 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2021-10-12 23:59:29,871 INFO L116 LiptonReduction]: Number of co-enabled transitions 1734 [2021-10-12 23:59:40,390 INFO L131 LiptonReduction]: Checked pairs total: 4529 [2021-10-12 23:59:40,391 INFO L133 LiptonReduction]: Total number of compositions: 91 [2021-10-12 23:59:40,414 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2021-10-12 23:59:40,496 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 690 states, 687 states have (on average 3.304221251819505) internal successors, (2270), 689 states have internal predecessors, (2270), 0 states have call successors, (0), 0 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-12 23:59:40,501 INFO L276 IsEmpty]: Start isEmpty. Operand has 690 states, 687 states have (on average 3.304221251819505) internal successors, (2270), 689 states have internal predecessors, (2270), 0 states have call successors, (0), 0 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-12 23:59:40,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-12 23:59:40,508 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:40,509 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:40,510 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-12 23:59:40,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:40,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1420640952, now seen corresponding path program 1 times [2021-10-12 23:59:40,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:40,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948233584] [2021-10-12 23:59:40,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:40,534 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:40,831 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-12 23:59:40,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:40,832 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948233584] [2021-10-12 23:59:40,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948233584] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:40,833 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:40,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-12 23:59:40,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729661093] [2021-10-12 23:59:40,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-12 23:59:40,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:40,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-12 23:59:40,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-12 23:59:40,864 INFO L87 Difference]: Start difference. First operand has 690 states, 687 states have (on average 3.304221251819505) internal successors, (2270), 689 states have internal predecessors, (2270), 0 states have call successors, (0), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 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-12 23:59:40,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:40,968 INFO L93 Difference]: Finished difference Result 570 states and 1744 transitions. [2021-10-12 23:59:40,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-12 23:59:40,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-10-12 23:59:40,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:41,008 INFO L225 Difference]: With dead ends: 570 [2021-10-12 23:59:41,008 INFO L226 Difference]: Without dead ends: 550 [2021-10-12 23:59:41,009 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-12 23:59:41,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-10-12 23:59:41,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2021-10-12 23:59:41,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 3.083788706739526) internal successors, (1693), 549 states have internal predecessors, (1693), 0 states have call successors, (0), 0 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-12 23:59:41,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1693 transitions. [2021-10-12 23:59:41,104 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1693 transitions. Word has length 7 [2021-10-12 23:59:41,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:41,105 INFO L470 AbstractCegarLoop]: Abstraction has 550 states and 1693 transitions. [2021-10-12 23:59:41,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 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-12 23:59:41,106 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1693 transitions. [2021-10-12 23:59:41,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-12 23:59:41,108 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:41,108 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:41,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-12 23:59:41,109 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-12 23:59:41,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:41,110 INFO L82 PathProgramCache]: Analyzing trace with hash -290624727, now seen corresponding path program 1 times [2021-10-12 23:59:41,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:41,111 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352248622] [2021-10-12 23:59:41,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:41,111 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:41,402 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-12 23:59:41,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:41,403 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352248622] [2021-10-12 23:59:41,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352248622] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:41,404 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:41,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-12 23:59:41,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767424037] [2021-10-12 23:59:41,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-12 23:59:41,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:41,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-12 23:59:41,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-12 23:59:41,408 INFO L87 Difference]: Start difference. First operand 550 states and 1693 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 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-12 23:59:41,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:41,518 INFO L93 Difference]: Finished difference Result 634 states and 1876 transitions. [2021-10-12 23:59:41,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-12 23:59:41,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-10-12 23:59:41,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:41,530 INFO L225 Difference]: With dead ends: 634 [2021-10-12 23:59:41,530 INFO L226 Difference]: Without dead ends: 534 [2021-10-12 23:59:41,531 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 23.3ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-12 23:59:41,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2021-10-12 23:59:41,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2021-10-12 23:59:41,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 3.0637898686679175) internal successors, (1633), 533 states have internal predecessors, (1633), 0 states have call successors, (0), 0 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-12 23:59:41,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 1633 transitions. [2021-10-12 23:59:41,616 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 1633 transitions. Word has length 10 [2021-10-12 23:59:41,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:41,617 INFO L470 AbstractCegarLoop]: Abstraction has 534 states and 1633 transitions. [2021-10-12 23:59:41,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 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-12 23:59:41,617 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 1633 transitions. [2021-10-12 23:59:41,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-12 23:59:41,629 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:41,629 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:41,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-12 23:59:41,630 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-12 23:59:41,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:41,632 INFO L82 PathProgramCache]: Analyzing trace with hash -467026856, now seen corresponding path program 1 times [2021-10-12 23:59:41,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:41,634 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398602864] [2021-10-12 23:59:41,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:41,635 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:41,903 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-12 23:59:41,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:41,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398602864] [2021-10-12 23:59:41,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398602864] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:41,905 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:41,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-12 23:59:41,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046039449] [2021-10-12 23:59:41,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-12 23:59:41,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:41,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-12 23:59:41,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-12 23:59:41,907 INFO L87 Difference]: Start difference. First operand 534 states and 1633 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-12 23:59:42,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:42,065 INFO L93 Difference]: Finished difference Result 634 states and 1885 transitions. [2021-10-12 23:59:42,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-12 23:59:42,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-12 23:59:42,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:42,071 INFO L225 Difference]: With dead ends: 634 [2021-10-12 23:59:42,072 INFO L226 Difference]: Without dead ends: 550 [2021-10-12 23:59:42,072 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 50.5ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-10-12 23:59:42,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-10-12 23:59:42,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 542. [2021-10-12 23:59:42,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 3.0591497227356745) internal successors, (1655), 541 states have internal predecessors, (1655), 0 states have call successors, (0), 0 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-12 23:59:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1655 transitions. [2021-10-12 23:59:42,099 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1655 transitions. Word has length 11 [2021-10-12 23:59:42,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:42,100 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 1655 transitions. [2021-10-12 23:59:42,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-12 23:59:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1655 transitions. [2021-10-12 23:59:42,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-12 23:59:42,102 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:42,102 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:42,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-12 23:59:42,103 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-12 23:59:42,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:42,103 INFO L82 PathProgramCache]: Analyzing trace with hash -419486186, now seen corresponding path program 2 times [2021-10-12 23:59:42,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:42,104 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231114849] [2021-10-12 23:59:42,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:42,104 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:42,200 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-12 23:59:42,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:42,201 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231114849] [2021-10-12 23:59:42,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231114849] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:42,202 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:42,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-12 23:59:42,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502256999] [2021-10-12 23:59:42,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-12 23:59:42,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:42,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-12 23:59:42,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-12 23:59:42,206 INFO L87 Difference]: Start difference. First operand 542 states and 1655 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-12 23:59:42,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:42,246 INFO L93 Difference]: Finished difference Result 606 states and 1787 transitions. [2021-10-12 23:59:42,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-12 23:59:42,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-12 23:59:42,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:42,252 INFO L225 Difference]: With dead ends: 606 [2021-10-12 23:59:42,252 INFO L226 Difference]: Without dead ends: 526 [2021-10-12 23:59:42,253 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-12 23:59:42,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-10-12 23:59:42,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2021-10-12 23:59:42,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 3.038095238095238) internal successors, (1595), 525 states have internal predecessors, (1595), 0 states have call successors, (0), 0 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-12 23:59:42,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 1595 transitions. [2021-10-12 23:59:42,279 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 1595 transitions. Word has length 11 [2021-10-12 23:59:42,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:42,280 INFO L470 AbstractCegarLoop]: Abstraction has 526 states and 1595 transitions. [2021-10-12 23:59:42,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-12 23:59:42,281 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 1595 transitions. [2021-10-12 23:59:42,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-12 23:59:42,282 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:42,282 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:42,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-12 23:59:42,283 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-12 23:59:42,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:42,284 INFO L82 PathProgramCache]: Analyzing trace with hash -527556546, now seen corresponding path program 1 times [2021-10-12 23:59:42,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:42,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458335325] [2021-10-12 23:59:42,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:42,285 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:42,412 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-12 23:59:42,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:42,413 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458335325] [2021-10-12 23:59:42,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458335325] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:42,414 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:42,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-12 23:59:42,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833025879] [2021-10-12 23:59:42,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-12 23:59:42,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:42,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-12 23:59:42,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-12 23:59:42,416 INFO L87 Difference]: Start difference. First operand 526 states and 1595 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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-12 23:59:42,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:42,527 INFO L93 Difference]: Finished difference Result 574 states and 1681 transitions. [2021-10-12 23:59:42,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-12 23:59:42,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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-12 23:59:42,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:42,534 INFO L225 Difference]: With dead ends: 574 [2021-10-12 23:59:42,534 INFO L226 Difference]: Without dead ends: 502 [2021-10-12 23:59:42,535 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 34.3ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-12 23:59:42,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2021-10-12 23:59:42,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 494. [2021-10-12 23:59:42,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 3.0121703853955375) internal successors, (1485), 493 states have internal predecessors, (1485), 0 states have call successors, (0), 0 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-12 23:59:42,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1485 transitions. [2021-10-12 23:59:42,563 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1485 transitions. Word has length 12 [2021-10-12 23:59:42,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:42,564 INFO L470 AbstractCegarLoop]: Abstraction has 494 states and 1485 transitions. [2021-10-12 23:59:42,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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-12 23:59:42,565 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1485 transitions. [2021-10-12 23:59:42,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-12 23:59:42,566 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:42,566 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:42,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-12 23:59:42,567 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-12 23:59:42,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:42,568 INFO L82 PathProgramCache]: Analyzing trace with hash -480050472, now seen corresponding path program 1 times [2021-10-12 23:59:42,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:42,569 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785402972] [2021-10-12 23:59:42,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:42,569 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:42,704 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-12 23:59:42,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:42,710 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785402972] [2021-10-12 23:59:42,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785402972] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:42,710 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:42,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-12 23:59:42,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21362164] [2021-10-12 23:59:42,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-12 23:59:42,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:42,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-12 23:59:42,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-12 23:59:42,714 INFO L87 Difference]: Start difference. First operand 494 states and 1485 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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-12 23:59:42,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:42,858 INFO L93 Difference]: Finished difference Result 558 states and 1633 transitions. [2021-10-12 23:59:42,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-12 23:59:42,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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-12 23:59:42,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:42,869 INFO L225 Difference]: With dead ends: 558 [2021-10-12 23:59:42,869 INFO L226 Difference]: Without dead ends: 498 [2021-10-12 23:59:42,870 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 23.8ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-12 23:59:42,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2021-10-12 23:59:42,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2021-10-12 23:59:42,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 497 states have (on average 3.0100603621730384) internal successors, (1496), 497 states have internal predecessors, (1496), 0 states have call successors, (0), 0 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-12 23:59:42,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 1496 transitions. [2021-10-12 23:59:42,897 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 1496 transitions. Word has length 12 [2021-10-12 23:59:42,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:42,898 INFO L470 AbstractCegarLoop]: Abstraction has 498 states and 1496 transitions. [2021-10-12 23:59:42,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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-12 23:59:42,899 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 1496 transitions. [2021-10-12 23:59:42,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-12 23:59:42,900 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:42,901 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:42,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-12 23:59:42,901 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-12 23:59:42,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:42,902 INFO L82 PathProgramCache]: Analyzing trace with hash -482155062, now seen corresponding path program 2 times [2021-10-12 23:59:42,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:42,902 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468880501] [2021-10-12 23:59:42,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:42,903 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:42,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:43,065 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-12 23:59:43,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:43,066 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468880501] [2021-10-12 23:59:43,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468880501] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:43,067 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:43,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-12 23:59:43,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524769023] [2021-10-12 23:59:43,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-12 23:59:43,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:43,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-12 23:59:43,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-12 23:59:43,069 INFO L87 Difference]: Start difference. First operand 498 states and 1496 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-12 23:59:43,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:43,205 INFO L93 Difference]: Finished difference Result 550 states and 1603 transitions. [2021-10-12 23:59:43,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-12 23:59:43,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-12 23:59:43,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:43,211 INFO L225 Difference]: With dead ends: 550 [2021-10-12 23:59:43,211 INFO L226 Difference]: Without dead ends: 490 [2021-10-12 23:59:43,212 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 47.4ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-12 23:59:43,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-10-12 23:59:43,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 486. [2021-10-12 23:59:43,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 485 states have (on average 3.0) internal successors, (1455), 485 states have internal predecessors, (1455), 0 states have call successors, (0), 0 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-12 23:59:43,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1455 transitions. [2021-10-12 23:59:43,233 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1455 transitions. Word has length 12 [2021-10-12 23:59:43,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:43,234 INFO L470 AbstractCegarLoop]: Abstraction has 486 states and 1455 transitions. [2021-10-12 23:59:43,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-12 23:59:43,234 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1455 transitions. [2021-10-12 23:59:43,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-12 23:59:43,236 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:43,236 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:43,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-12 23:59:43,237 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-12 23:59:43,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:43,237 INFO L82 PathProgramCache]: Analyzing trace with hash 825527421, now seen corresponding path program 1 times [2021-10-12 23:59:43,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:43,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126457662] [2021-10-12 23:59:43,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:43,238 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:43,352 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-12 23:59:43,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:43,353 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126457662] [2021-10-12 23:59:43,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126457662] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:43,353 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:43,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-12 23:59:43,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168948584] [2021-10-12 23:59:43,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-12 23:59:43,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:43,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-12 23:59:43,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-12 23:59:43,356 INFO L87 Difference]: Start difference. First operand 486 states and 1455 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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-12 23:59:43,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:43,541 INFO L93 Difference]: Finished difference Result 622 states and 1813 transitions. [2021-10-12 23:59:43,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-12 23:59:43,542 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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-12 23:59:43,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:43,548 INFO L225 Difference]: With dead ends: 622 [2021-10-12 23:59:43,549 INFO L226 Difference]: Without dead ends: 542 [2021-10-12 23:59:43,549 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 67.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-10-12 23:59:43,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2021-10-12 23:59:43,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 526. [2021-10-12 23:59:43,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 2.958095238095238) internal successors, (1553), 525 states have internal predecessors, (1553), 0 states have call successors, (0), 0 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-12 23:59:43,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 1553 transitions. [2021-10-12 23:59:43,577 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 1553 transitions. Word has length 13 [2021-10-12 23:59:43,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:43,577 INFO L470 AbstractCegarLoop]: Abstraction has 526 states and 1553 transitions. [2021-10-12 23:59:43,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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-12 23:59:43,578 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 1553 transitions. [2021-10-12 23:59:43,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-12 23:59:43,580 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:43,580 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:43,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-12 23:59:43,581 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-12 23:59:43,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:43,582 INFO L82 PathProgramCache]: Analyzing trace with hash -236388035, now seen corresponding path program 1 times [2021-10-12 23:59:43,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:43,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42956851] [2021-10-12 23:59:43,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:43,589 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:43,699 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-12 23:59:43,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:43,700 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42956851] [2021-10-12 23:59:43,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42956851] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:43,701 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:43,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-12 23:59:43,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747356128] [2021-10-12 23:59:43,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-12 23:59:43,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:43,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-12 23:59:43,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-12 23:59:43,703 INFO L87 Difference]: Start difference. First operand 526 states and 1553 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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-12 23:59:43,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:43,737 INFO L93 Difference]: Finished difference Result 504 states and 1315 transitions. [2021-10-12 23:59:43,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-12 23:59:43,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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-12 23:59:43,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:43,742 INFO L225 Difference]: With dead ends: 504 [2021-10-12 23:59:43,742 INFO L226 Difference]: Without dead ends: 380 [2021-10-12 23:59:43,743 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-12 23:59:43,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2021-10-12 23:59:43,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2021-10-12 23:59:43,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 2.5567282321899736) internal successors, (969), 379 states have internal predecessors, (969), 0 states have call successors, (0), 0 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-12 23:59:43,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 969 transitions. [2021-10-12 23:59:43,760 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 969 transitions. Word has length 14 [2021-10-12 23:59:43,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:43,760 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 969 transitions. [2021-10-12 23:59:43,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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-12 23:59:43,761 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 969 transitions. [2021-10-12 23:59:43,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-12 23:59:43,762 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:43,763 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:43,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-12 23:59:43,763 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-12 23:59:43,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:43,764 INFO L82 PathProgramCache]: Analyzing trace with hash -994412928, now seen corresponding path program 1 times [2021-10-12 23:59:43,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:43,764 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783405592] [2021-10-12 23:59:43,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:43,765 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:43,918 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-12 23:59:43,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:43,921 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783405592] [2021-10-12 23:59:43,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783405592] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:43,922 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:43,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-12 23:59:43,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618194237] [2021-10-12 23:59:43,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-12 23:59:43,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:43,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-12 23:59:43,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-12 23:59:43,924 INFO L87 Difference]: Start difference. First operand 380 states and 969 transitions. Second operand has 5 states, 5 states have (on average 3.0) 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-12 23:59:43,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:43,969 INFO L93 Difference]: Finished difference Result 293 states and 677 transitions. [2021-10-12 23:59:43,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-12 23:59:43,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) 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-12 23:59:43,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:43,973 INFO L225 Difference]: With dead ends: 293 [2021-10-12 23:59:43,973 INFO L226 Difference]: Without dead ends: 226 [2021-10-12 23:59:43,974 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 21.3ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-12 23:59:43,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-10-12 23:59:43,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2021-10-12 23:59:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 2.2533333333333334) internal successors, (507), 225 states have internal predecessors, (507), 0 states have call successors, (0), 0 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-12 23:59:43,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 507 transitions. [2021-10-12 23:59:43,984 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 507 transitions. Word has length 15 [2021-10-12 23:59:43,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:43,984 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 507 transitions. [2021-10-12 23:59:43,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) 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-12 23:59:43,985 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 507 transitions. [2021-10-12 23:59:43,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-12 23:59:43,986 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:43,986 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:43,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-12 23:59:43,987 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-12 23:59:43,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:43,987 INFO L82 PathProgramCache]: Analyzing trace with hash -455855829, now seen corresponding path program 1 times [2021-10-12 23:59:43,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:43,988 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814985595] [2021-10-12 23:59:43,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:43,988 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:44,079 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-12 23:59:44,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:44,080 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814985595] [2021-10-12 23:59:44,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814985595] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:44,080 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:44,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-12 23:59:44,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472107115] [2021-10-12 23:59:44,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-12 23:59:44,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:44,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-12 23:59:44,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-12 23:59:44,082 INFO L87 Difference]: Start difference. First operand 226 states and 507 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) 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-12 23:59:44,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:44,109 INFO L93 Difference]: Finished difference Result 333 states and 715 transitions. [2021-10-12 23:59:44,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-12 23:59:44,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) 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-12 23:59:44,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:44,112 INFO L225 Difference]: With dead ends: 333 [2021-10-12 23:59:44,112 INFO L226 Difference]: Without dead ends: 228 [2021-10-12 23:59:44,113 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-12 23:59:44,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-10-12 23:59:44,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 212. [2021-10-12 23:59:44,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 2.0995260663507107) internal successors, (443), 211 states have internal predecessors, (443), 0 states have call successors, (0), 0 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-12 23:59:44,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 443 transitions. [2021-10-12 23:59:44,122 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 443 transitions. Word has length 17 [2021-10-12 23:59:44,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:44,124 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 443 transitions. [2021-10-12 23:59:44,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) 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-12 23:59:44,125 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 443 transitions. [2021-10-12 23:59:44,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-12 23:59:44,126 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:44,126 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:44,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-12 23:59:44,127 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-12 23:59:44,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:44,128 INFO L82 PathProgramCache]: Analyzing trace with hash -735906933, now seen corresponding path program 1 times [2021-10-12 23:59:44,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:44,128 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406250282] [2021-10-12 23:59:44,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:44,128 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:44,388 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-12 23:59:44,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:44,389 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406250282] [2021-10-12 23:59:44,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406250282] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:44,389 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:44,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-12 23:59:44,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709182033] [2021-10-12 23:59:44,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-12 23:59:44,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:44,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-12 23:59:44,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-12 23:59:44,392 INFO L87 Difference]: Start difference. First operand 212 states and 443 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 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-12 23:59:44,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:44,562 INFO L93 Difference]: Finished difference Result 264 states and 526 transitions. [2021-10-12 23:59:44,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-12 23:59:44,563 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2021-10-12 23:59:44,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:44,565 INFO L225 Difference]: With dead ends: 264 [2021-10-12 23:59:44,565 INFO L226 Difference]: Without dead ends: 212 [2021-10-12 23:59:44,565 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 108.9ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-10-12 23:59:44,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-10-12 23:59:44,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 186. [2021-10-12 23:59:44,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 2.0486486486486486) internal successors, (379), 185 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-12 23:59:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 379 transitions. [2021-10-12 23:59:44,574 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 379 transitions. Word has length 18 [2021-10-12 23:59:44,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:44,575 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 379 transitions. [2021-10-12 23:59:44,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 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-12 23:59:44,575 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 379 transitions. [2021-10-12 23:59:44,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-12 23:59:44,576 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:44,577 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-12 23:59:44,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-12 23:59:44,577 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-12 23:59:44,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:44,578 INFO L82 PathProgramCache]: Analyzing trace with hash -2003714677, now seen corresponding path program 2 times [2021-10-12 23:59:44,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:44,578 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002632755] [2021-10-12 23:59:44,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:44,579 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:44,714 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-12 23:59:44,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:44,715 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002632755] [2021-10-12 23:59:44,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002632755] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:44,715 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:44,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-12 23:59:44,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199482797] [2021-10-12 23:59:44,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-12 23:59:44,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:44,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-12 23:59:44,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-12 23:59:44,718 INFO L87 Difference]: Start difference. First operand 186 states and 379 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 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-12 23:59:44,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:44,774 INFO L93 Difference]: Finished difference Result 162 states and 331 transitions. [2021-10-12 23:59:44,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-12 23:59:44,775 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2021-10-12 23:59:44,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:44,776 INFO L225 Difference]: With dead ends: 162 [2021-10-12 23:59:44,776 INFO L226 Difference]: Without dead ends: 86 [2021-10-12 23:59:44,777 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 25.6ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-10-12 23:59:44,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-10-12 23:59:44,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2021-10-12 23:59:44,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.988235294117647) internal successors, (169), 85 states have internal predecessors, (169), 0 states have call successors, (0), 0 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-12 23:59:44,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 169 transitions. [2021-10-12 23:59:44,781 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 169 transitions. Word has length 18 [2021-10-12 23:59:44,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:44,781 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 169 transitions. [2021-10-12 23:59:44,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 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-12 23:59:44,782 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 169 transitions. [2021-10-12 23:59:44,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-12 23:59:44,783 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:44,783 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] [2021-10-12 23:59:44,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-12 23:59:44,784 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-12 23:59:44,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:44,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1337561394, now seen corresponding path program 1 times [2021-10-12 23:59:44,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:44,785 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207428071] [2021-10-12 23:59:44,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:44,785 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-12 23:59:44,934 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-12 23:59:44,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-12 23:59:44,935 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207428071] [2021-10-12 23:59:44,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207428071] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-12 23:59:44,935 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-12 23:59:44,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-12 23:59:44,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255325666] [2021-10-12 23:59:44,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-12 23:59:44,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-12 23:59:44,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-12 23:59:44,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-12 23:59:44,938 INFO L87 Difference]: Start difference. First operand 86 states and 169 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 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-12 23:59:44,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-12 23:59:44,975 INFO L93 Difference]: Finished difference Result 112 states and 212 transitions. [2021-10-12 23:59:44,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-12 23:59:44,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-10-12 23:59:44,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-12 23:59:44,977 INFO L225 Difference]: With dead ends: 112 [2021-10-12 23:59:44,977 INFO L226 Difference]: Without dead ends: 36 [2021-10-12 23:59:44,978 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-12 23:59:44,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-10-12 23:59:44,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-10-12 23:59:44,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 35 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-12 23:59:44,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2021-10-12 23:59:44,981 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 21 [2021-10-12 23:59:44,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-12 23:59:44,982 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2021-10-12 23:59:44,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 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-12 23:59:44,982 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2021-10-12 23:59:44,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-12 23:59:44,983 INFO L504 BasicCegarLoop]: Found error trace [2021-10-12 23:59:44,983 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] [2021-10-12 23:59:44,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-12 23:59:44,984 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-12 23:59:44,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-12 23:59:44,985 INFO L82 PathProgramCache]: Analyzing trace with hash -733176904, now seen corresponding path program 2 times [2021-10-12 23:59:44,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-12 23:59:44,985 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717298075] [2021-10-12 23:59:44,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-12 23:59:44,986 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-12 23:59:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-12 23:59:45,064 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-12 23:59:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-12 23:59:45,193 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-12 23:59:45,193 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-12 23:59:45,194 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-12 23:59:45,196 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-12 23:59:45,196 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-12 23:59:45,197 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-12 23:59:45,197 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-12 23:59:45,197 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-12 23:59:45,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-12 23:59:45,205 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-12 23:59:45,205 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-12 23:59:45,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 11:59:45 BasicIcfg [2021-10-12 23:59:45,330 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-12 23:59:45,330 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-12 23:59:45,330 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-12 23:59:45,330 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-12 23:59:45,331 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:59:29" (3/4) ... [2021-10-12 23:59:45,333 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-12 23:59:45,428 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b33fa023-5571-4e7b-8c0a-118e7525d233/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-12 23:59:45,429 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-12 23:59:45,431 INFO L168 Benchmark]: Toolchain (without parser) took 19045.35 ms. Allocated memory was 90.2 MB in the beginning and 220.2 MB in the end (delta: 130.0 MB). Free memory was 50.5 MB in the beginning and 130.5 MB in the end (delta: -80.0 MB). Peak memory consumption was 48.4 MB. Max. memory is 16.1 GB. [2021-10-12 23:59:45,431 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 90.2 MB. Free memory is still 68.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-12 23:59:45,432 INFO L168 Benchmark]: CACSL2BoogieTranslator took 833.15 ms. Allocated memory is still 90.2 MB. Free memory was 50.4 MB in the beginning and 54.6 MB in the end (delta: -4.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-12 23:59:45,433 INFO L168 Benchmark]: Boogie Procedure Inliner took 110.79 ms. Allocated memory is still 90.2 MB. Free memory was 54.6 MB in the beginning and 51.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-12 23:59:45,433 INFO L168 Benchmark]: Boogie Preprocessor took 92.14 ms. Allocated memory is still 90.2 MB. Free memory was 51.7 MB in the beginning and 49.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-12 23:59:45,434 INFO L168 Benchmark]: RCFGBuilder took 2163.15 ms. Allocated memory was 90.2 MB in the beginning and 115.3 MB in the end (delta: 25.2 MB). Free memory was 49.6 MB in the beginning and 47.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 31.2 MB. Max. memory is 16.1 GB. [2021-10-12 23:59:45,434 INFO L168 Benchmark]: TraceAbstraction took 15740.53 ms. Allocated memory was 115.3 MB in the beginning and 220.2 MB in the end (delta: 104.9 MB). Free memory was 47.1 MB in the beginning and 143.1 MB in the end (delta: -96.0 MB). Peak memory consumption was 10.8 MB. Max. memory is 16.1 GB. [2021-10-12 23:59:45,435 INFO L168 Benchmark]: Witness Printer took 98.66 ms. Allocated memory is still 220.2 MB. Free memory was 143.1 MB in the beginning and 130.5 MB in the end (delta: 12.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-12 23:59:45,441 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.30 ms. Allocated memory is still 90.2 MB. Free memory is still 68.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 833.15 ms. Allocated memory is still 90.2 MB. Free memory was 50.4 MB in the beginning and 54.6 MB in the end (delta: -4.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 110.79 ms. Allocated memory is still 90.2 MB. Free memory was 54.6 MB in the beginning and 51.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 92.14 ms. Allocated memory is still 90.2 MB. Free memory was 51.7 MB in the beginning and 49.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2163.15 ms. Allocated memory was 90.2 MB in the beginning and 115.3 MB in the end (delta: 25.2 MB). Free memory was 49.6 MB in the beginning and 47.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 31.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 15740.53 ms. Allocated memory was 115.3 MB in the beginning and 220.2 MB in the end (delta: 104.9 MB). Free memory was 47.1 MB in the beginning and 143.1 MB in the end (delta: -96.0 MB). Peak memory consumption was 10.8 MB. Max. memory is 16.1 GB. * Witness Printer took 98.66 ms. Allocated memory is still 220.2 MB. Free memory was 143.1 MB in the beginning and 130.5 MB in the end (delta: 12.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10589.4ms, 113 PlacesBefore, 36 PlacesAfterwards, 105 TransitionsBefore, 27 TransitionsAfterwards, 1734 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 91 TotalNumberOfCompositions, 4529 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2283, positive: 2132, positive conditional: 0, positive unconditional: 2132, negative: 151, negative conditional: 0, negative unconditional: 151, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1251, positive: 1205, positive conditional: 0, positive unconditional: 1205, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1251, positive: 1176, positive conditional: 0, positive unconditional: 1176, negative: 75, negative conditional: 0, negative unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 75, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 658, positive: 55, positive conditional: 0, positive unconditional: 55, negative: 603, negative conditional: 0, negative unconditional: 603, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2283, positive: 927, positive conditional: 0, positive unconditional: 927, negative: 105, negative conditional: 0, negative unconditional: 105, unknown: 1251, unknown conditional: 0, unknown unconditional: 1251] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 112, Positive conditional cache size: 0, Positive unconditional cache size: 112, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1510; [L814] FCALL, FORK 0 pthread_create(&t1510, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t1511; [L816] FCALL, FORK 0 pthread_create(&t1511, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1512; [L818] FCALL, FORK 0 pthread_create(&t1512, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L759] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - 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: 818]: 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: 814]: 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: 816]: 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 7 procedures, 131 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 15442.1ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 41.8ms, AutomataDifference: 1522.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 10728.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 406 SDtfs, 410 SDslu, 814 SDs, 0 SdLazy, 410 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 737.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 460.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=690occurred in iteration=0, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 372.5ms AutomataMinimizationTime, 14 MinimizatonAttempts, 78 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 75.0ms SsaConstructionTime, 789.2ms SatisfiabilityAnalysisTime, 1430.4ms InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 1045 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-12 23:59:45,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b33fa023-5571-4e7b-8c0a-118e7525d233/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...