./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd99b1ac-711d-41ee-a582-3eec0da6b009/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd99b1ac-711d-41ee-a582-3eec0da6b009/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd99b1ac-711d-41ee-a582-3eec0da6b009/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd99b1ac-711d-41ee-a582-3eec0da6b009/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd99b1ac-711d-41ee-a582-3eec0da6b009/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd99b1ac-711d-41ee-a582-3eec0da6b009/bin/uautomizer-DrprNOufMa --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 4b807ac1723767f46eb51e856f642cbeec29c757d6219d60986235d902b15355 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 23:17:24,383 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 23:17:24,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 23:17:24,415 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 23:17:24,416 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 23:17:24,417 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 23:17:24,419 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 23:17:24,421 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 23:17:24,423 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 23:17:24,424 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 23:17:24,425 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 23:17:24,426 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 23:17:24,427 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 23:17:24,428 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 23:17:24,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 23:17:24,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 23:17:24,432 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 23:17:24,433 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 23:17:24,435 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 23:17:24,437 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 23:17:24,439 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 23:17:24,440 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 23:17:24,441 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 23:17:24,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 23:17:24,446 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 23:17:24,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 23:17:24,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 23:17:24,448 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 23:17:24,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 23:17:24,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 23:17:24,450 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 23:17:24,450 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 23:17:24,451 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 23:17:24,452 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 23:17:24,453 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 23:17:24,453 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 23:17:24,453 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 23:17:24,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 23:17:24,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 23:17:24,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 23:17:24,454 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 23:17:24,455 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd99b1ac-711d-41ee-a582-3eec0da6b009/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 23:17:24,477 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 23:17:24,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 23:17:24,478 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 23:17:24,478 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 23:17:24,478 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 23:17:24,478 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 23:17:24,479 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 23:17:24,479 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 23:17:24,479 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 23:17:24,479 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 23:17:24,480 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 23:17:24,480 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 23:17:24,480 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 23:17:24,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 23:17:24,480 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 23:17:24,480 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 23:17:24,481 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 23:17:24,481 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 23:17:24,481 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 23:17:24,481 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 23:17:24,481 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 23:17:24,481 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 23:17:24,481 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 23:17:24,481 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 23:17:24,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 23:17:24,482 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 23:17:24,482 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 23:17:24,482 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 23:17:24,482 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 23:17:24,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 23:17:24,482 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 23:17:24,482 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 23:17:24,482 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 23:17:24,483 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 23:17:24,483 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_fd99b1ac-711d-41ee-a582-3eec0da6b009/bin/uautomizer-DrprNOufMa/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_fd99b1ac-711d-41ee-a582-3eec0da6b009/bin/uautomizer-DrprNOufMa 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 -> 4b807ac1723767f46eb51e856f642cbeec29c757d6219d60986235d902b15355 [2021-12-06 23:17:24,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 23:17:24,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 23:17:24,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 23:17:24,688 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 23:17:24,689 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 23:17:24,690 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd99b1ac-711d-41ee-a582-3eec0da6b009/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-12-06 23:17:24,738 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd99b1ac-711d-41ee-a582-3eec0da6b009/bin/uautomizer-DrprNOufMa/data/90afeae7d/25eddd49ea834029b6514a7c11518a7f/FLAGd6ad03db5 [2021-12-06 23:17:25,165 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 23:17:25,165 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd99b1ac-711d-41ee-a582-3eec0da6b009/sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-12-06 23:17:25,180 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd99b1ac-711d-41ee-a582-3eec0da6b009/bin/uautomizer-DrprNOufMa/data/90afeae7d/25eddd49ea834029b6514a7c11518a7f/FLAGd6ad03db5 [2021-12-06 23:17:25,190 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd99b1ac-711d-41ee-a582-3eec0da6b009/bin/uautomizer-DrprNOufMa/data/90afeae7d/25eddd49ea834029b6514a7c11518a7f [2021-12-06 23:17:25,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 23:17:25,193 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 23:17:25,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 23:17:25,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 23:17:25,198 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 23:17:25,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 11:17:25" (1/1) ... [2021-12-06 23:17:25,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b8566e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:17:25, skipping insertion in model container [2021-12-06 23:17:25,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 11:17:25" (1/1) ... [2021-12-06 23:17:25,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 23:17:25,242 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 23:17:25,364 WARN L230 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_fd99b1ac-711d-41ee-a582-3eec0da6b009/sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2021-12-06 23:17:25,464 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 23:17:25,470 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 23:17:25,479 WARN L230 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_fd99b1ac-711d-41ee-a582-3eec0da6b009/sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2021-12-06 23:17:25,512 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 23:17:25,536 INFO L208 MainTranslator]: Completed translation [2021-12-06 23:17:25,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:17:25 WrapperNode [2021-12-06 23:17:25,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 23:17:25,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 23:17:25,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 23:17:25,538 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 23:17:25,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:17:25" (1/1) ... [2021-12-06 23:17:25,555 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:17:25" (1/1) ... [2021-12-06 23:17:25,579 INFO L137 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 259 [2021-12-06 23:17:25,580 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 23:17:25,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 23:17:25,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 23:17:25,581 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 23:17:25,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:17:25" (1/1) ... [2021-12-06 23:17:25,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:17:25" (1/1) ... [2021-12-06 23:17:25,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:17:25" (1/1) ... [2021-12-06 23:17:25,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:17:25" (1/1) ... [2021-12-06 23:17:25,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:17:25" (1/1) ... [2021-12-06 23:17:25,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:17:25" (1/1) ... [2021-12-06 23:17:25,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:17:25" (1/1) ... [2021-12-06 23:17:25,607 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 23:17:25,608 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 23:17:25,608 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 23:17:25,608 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 23:17:25,609 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:17:25" (1/1) ... [2021-12-06 23:17:25,614 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 23:17:25,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd99b1ac-711d-41ee-a582-3eec0da6b009/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 23:17:25,633 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd99b1ac-711d-41ee-a582-3eec0da6b009/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 23:17:25,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd99b1ac-711d-41ee-a582-3eec0da6b009/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 23:17:25,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 23:17:25,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-06 23:17:25,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 23:17:25,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-06 23:17:25,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 23:17:25,673 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-06 23:17:25,673 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-06 23:17:25,673 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-06 23:17:25,673 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-06 23:17:25,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 23:17:25,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-06 23:17:25,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 23:17:25,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 23:17:25,675 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-06 23:17:25,770 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 23:17:25,771 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 23:17:26,069 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 23:17:26,252 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 23:17:26,252 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-06 23:17:26,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 11:17:26 BoogieIcfgContainer [2021-12-06 23:17:26,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 23:17:26,255 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 23:17:26,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 23:17:26,258 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 23:17:26,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 11:17:25" (1/3) ... [2021-12-06 23:17:26,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79434564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 11:17:26, skipping insertion in model container [2021-12-06 23:17:26,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 11:17:25" (2/3) ... [2021-12-06 23:17:26,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79434564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 11:17:26, skipping insertion in model container [2021-12-06 23:17:26,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 11:17:26" (3/3) ... [2021-12-06 23:17:26,260 INFO L111 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2021-12-06 23:17:26,264 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-06 23:17:26,264 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 23:17:26,264 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-06 23:17:26,264 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-06 23:17:26,288 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,289 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,289 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,289 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,289 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,289 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,289 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,289 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,290 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,290 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,290 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,290 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,290 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,290 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,290 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,290 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,291 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,291 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,291 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,291 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,299 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,299 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,300 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,300 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,300 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,300 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,301 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,301 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,301 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,301 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,301 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,301 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,301 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,302 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,302 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,302 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,302 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,302 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,302 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,302 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,302 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,303 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,303 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,303 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,303 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,303 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,303 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,303 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,303 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,304 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,304 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,304 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,304 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,304 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,304 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,304 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,305 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,305 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,305 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,305 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,307 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,307 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,308 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,308 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,308 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,308 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,308 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,308 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,308 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,308 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,309 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,309 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,309 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,309 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,310 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,310 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,310 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,310 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,310 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,310 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,310 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,310 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-06 23:17:26,311 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-06 23:17:26,344 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 23:17:26,349 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, mAutomataTypeConcurrency=PETRI_NET, 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-12-06 23:17:26,350 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-12-06 23:17:26,358 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 99 places, 94 transitions, 198 flow [2021-12-06 23:17:26,385 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2021-12-06 23:17:26,386 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-06 23:17:26,388 INFO L84 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2021-12-06 23:17:26,388 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 94 transitions, 198 flow [2021-12-06 23:17:26,392 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 92 transitions, 190 flow [2021-12-06 23:17:26,401 INFO L129 PetriNetUnfolder]: 0/56 cut-off events. [2021-12-06 23:17:26,401 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-06 23:17:26,401 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:17:26,402 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:17:26,402 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-06 23:17:26,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:17:26,406 INFO L85 PathProgramCache]: Analyzing trace with hash -590582846, now seen corresponding path program 1 times [2021-12-06 23:17:26,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:17:26,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422651842] [2021-12-06 23:17:26,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:17:26,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:17:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:17:26,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:17:26,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:17:26,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422651842] [2021-12-06 23:17:26,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422651842] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:17:26,615 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:17:26,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 23:17:26,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730365399] [2021-12-06 23:17:26,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:17:26,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 23:17:26,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:17:26,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 23:17:26,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 23:17:26,645 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 94 [2021-12-06 23:17:26,647 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 92 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:26,648 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:17:26,648 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 94 [2021-12-06 23:17:26,648 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:17:26,716 INFO L129 PetriNetUnfolder]: 17/160 cut-off events. [2021-12-06 23:17:26,716 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-06 23:17:26,717 INFO L84 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 160 events. 17/160 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 394 event pairs, 3 based on Foata normal form. 6/158 useless extension candidates. Maximal degree in co-relation 161. Up to 27 conditions per place. [2021-12-06 23:17:26,718 INFO L132 encePairwiseOnDemand]: 89/94 looper letters, 9 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2021-12-06 23:17:26,719 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 91 transitions, 210 flow [2021-12-06 23:17:26,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 23:17:26,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-06 23:17:26,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2021-12-06 23:17:26,730 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9290780141843972 [2021-12-06 23:17:26,731 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 262 transitions. [2021-12-06 23:17:26,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 262 transitions. [2021-12-06 23:17:26,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:17:26,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 262 transitions. [2021-12-06 23:17:26,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:26,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:26,742 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:26,744 INFO L186 Difference]: Start difference. First operand has 97 places, 92 transitions, 190 flow. Second operand 3 states and 262 transitions. [2021-12-06 23:17:26,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 91 transitions, 210 flow [2021-12-06 23:17:26,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 91 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-06 23:17:26,751 INFO L242 Difference]: Finished difference. Result has 95 places, 88 transitions, 184 flow [2021-12-06 23:17:26,752 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2021-12-06 23:17:26,756 INFO L334 CegarLoopForPetriNet]: 97 programPoint places, -2 predicate places. [2021-12-06 23:17:26,756 INFO L470 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 184 flow [2021-12-06 23:17:26,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:26,756 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:17:26,756 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:17:26,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 23:17:26,757 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-06 23:17:26,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:17:26,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1655661633, now seen corresponding path program 1 times [2021-12-06 23:17:26,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:17:26,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783298056] [2021-12-06 23:17:26,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:17:26,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:17:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:17:27,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:17:27,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:17:27,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783298056] [2021-12-06 23:17:27,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783298056] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:17:27,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:17:27,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 23:17:27,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14265644] [2021-12-06 23:17:27,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:17:27,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 23:17:27,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:17:27,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 23:17:27,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-12-06 23:17:27,032 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 94 [2021-12-06 23:17:27,033 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 184 flow. Second operand has 10 states, 10 states have (on average 73.3) internal successors, (733), 10 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:27,034 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:17:27,034 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 94 [2021-12-06 23:17:27,034 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:17:27,389 INFO L129 PetriNetUnfolder]: 119/492 cut-off events. [2021-12-06 23:17:27,390 INFO L130 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2021-12-06 23:17:27,391 INFO L84 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 492 events. 119/492 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2628 event pairs, 47 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 718. Up to 125 conditions per place. [2021-12-06 23:17:27,393 INFO L132 encePairwiseOnDemand]: 83/94 looper letters, 16 selfloop transitions, 8 changer transitions 48/133 dead transitions. [2021-12-06 23:17:27,393 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 133 transitions, 416 flow [2021-12-06 23:17:27,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 23:17:27,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-06 23:17:27,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1146 transitions. [2021-12-06 23:17:27,400 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8127659574468085 [2021-12-06 23:17:27,400 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1146 transitions. [2021-12-06 23:17:27,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1146 transitions. [2021-12-06 23:17:27,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:17:27,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1146 transitions. [2021-12-06 23:17:27,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 76.4) internal successors, (1146), 15 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:27,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 94.0) internal successors, (1504), 16 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:27,411 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 94.0) internal successors, (1504), 16 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:27,411 INFO L186 Difference]: Start difference. First operand has 95 places, 88 transitions, 184 flow. Second operand 15 states and 1146 transitions. [2021-12-06 23:17:27,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 133 transitions, 416 flow [2021-12-06 23:17:27,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 133 transitions, 398 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-06 23:17:27,414 INFO L242 Difference]: Finished difference. Result has 118 places, 82 transitions, 232 flow [2021-12-06 23:17:27,415 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=232, PETRI_PLACES=118, PETRI_TRANSITIONS=82} [2021-12-06 23:17:27,415 INFO L334 CegarLoopForPetriNet]: 97 programPoint places, 21 predicate places. [2021-12-06 23:17:27,415 INFO L470 AbstractCegarLoop]: Abstraction has has 118 places, 82 transitions, 232 flow [2021-12-06 23:17:27,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 73.3) internal successors, (733), 10 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:27,416 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:17:27,416 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:17:27,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 23:17:27,416 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-06 23:17:27,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:17:27,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1668964423, now seen corresponding path program 1 times [2021-12-06 23:17:27,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:17:27,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134143513] [2021-12-06 23:17:27,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:17:27,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:17:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:17:27,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:17:27,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:17:27,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134143513] [2021-12-06 23:17:27,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134143513] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:17:27,587 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:17:27,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 23:17:27,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435759369] [2021-12-06 23:17:27,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:17:27,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 23:17:27,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:17:27,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 23:17:27,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-06 23:17:27,590 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 94 [2021-12-06 23:17:27,591 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 82 transitions, 232 flow. Second operand has 9 states, 9 states have (on average 74.44444444444444) internal successors, (670), 9 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:27,591 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:17:27,591 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 94 [2021-12-06 23:17:27,591 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:17:27,874 INFO L129 PetriNetUnfolder]: 82/284 cut-off events. [2021-12-06 23:17:27,875 INFO L130 PetriNetUnfolder]: For 518/518 co-relation queries the response was YES. [2021-12-06 23:17:27,876 INFO L84 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 284 events. 82/284 cut-off events. For 518/518 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1068 event pairs, 13 based on Foata normal form. 6/283 useless extension candidates. Maximal degree in co-relation 733. Up to 88 conditions per place. [2021-12-06 23:17:27,879 INFO L132 encePairwiseOnDemand]: 84/94 looper letters, 23 selfloop transitions, 8 changer transitions 19/112 dead transitions. [2021-12-06 23:17:27,879 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 112 transitions, 500 flow [2021-12-06 23:17:27,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 23:17:27,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-06 23:17:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 852 transitions. [2021-12-06 23:17:27,883 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8239845261121856 [2021-12-06 23:17:27,883 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 852 transitions. [2021-12-06 23:17:27,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 852 transitions. [2021-12-06 23:17:27,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:17:27,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 852 transitions. [2021-12-06 23:17:27,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 77.45454545454545) internal successors, (852), 11 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:27,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 94.0) internal successors, (1128), 12 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:27,891 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 94.0) internal successors, (1128), 12 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:27,891 INFO L186 Difference]: Start difference. First operand has 118 places, 82 transitions, 232 flow. Second operand 11 states and 852 transitions. [2021-12-06 23:17:27,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 112 transitions, 500 flow [2021-12-06 23:17:27,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 112 transitions, 476 flow, removed 10 selfloop flow, removed 5 redundant places. [2021-12-06 23:17:27,899 INFO L242 Difference]: Finished difference. Result has 111 places, 85 transitions, 274 flow [2021-12-06 23:17:27,899 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=274, PETRI_PLACES=111, PETRI_TRANSITIONS=85} [2021-12-06 23:17:27,900 INFO L334 CegarLoopForPetriNet]: 97 programPoint places, 14 predicate places. [2021-12-06 23:17:27,900 INFO L470 AbstractCegarLoop]: Abstraction has has 111 places, 85 transitions, 274 flow [2021-12-06 23:17:27,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 74.44444444444444) internal successors, (670), 9 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:27,901 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:17:27,901 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:17:27,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 23:17:27,901 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-06 23:17:27,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:17:27,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1940937855, now seen corresponding path program 2 times [2021-12-06 23:17:27,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:17:27,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387025102] [2021-12-06 23:17:27,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:17:27,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:17:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:17:28,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:17:28,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:17:28,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387025102] [2021-12-06 23:17:28,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387025102] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:17:28,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:17:28,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-06 23:17:28,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274638182] [2021-12-06 23:17:28,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:17:28,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-06 23:17:28,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:17:28,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-06 23:17:28,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-12-06 23:17:28,136 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 94 [2021-12-06 23:17:28,138 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 85 transitions, 274 flow. Second operand has 13 states, 13 states have (on average 68.3076923076923) internal successors, (888), 13 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:28,138 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:17:28,138 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 94 [2021-12-06 23:17:28,138 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:17:28,671 INFO L129 PetriNetUnfolder]: 208/552 cut-off events. [2021-12-06 23:17:28,671 INFO L130 PetriNetUnfolder]: For 1410/1437 co-relation queries the response was YES. [2021-12-06 23:17:28,675 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1683 conditions, 552 events. 208/552 cut-off events. For 1410/1437 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2762 event pairs, 8 based on Foata normal form. 16/561 useless extension candidates. Maximal degree in co-relation 1610. Up to 148 conditions per place. [2021-12-06 23:17:28,678 INFO L132 encePairwiseOnDemand]: 80/94 looper letters, 40 selfloop transitions, 15 changer transitions 52/163 dead transitions. [2021-12-06 23:17:28,679 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 163 transitions, 972 flow [2021-12-06 23:17:28,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-06 23:17:28,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-12-06 23:17:28,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1446 transitions. [2021-12-06 23:17:28,685 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7691489361702127 [2021-12-06 23:17:28,685 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1446 transitions. [2021-12-06 23:17:28,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1446 transitions. [2021-12-06 23:17:28,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:17:28,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1446 transitions. [2021-12-06 23:17:28,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 72.3) internal successors, (1446), 20 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:28,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 94.0) internal successors, (1974), 21 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:28,696 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 94.0) internal successors, (1974), 21 states have internal predecessors, (1974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:28,696 INFO L186 Difference]: Start difference. First operand has 111 places, 85 transitions, 274 flow. Second operand 20 states and 1446 transitions. [2021-12-06 23:17:28,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 163 transitions, 972 flow [2021-12-06 23:17:28,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 163 transitions, 879 flow, removed 38 selfloop flow, removed 8 redundant places. [2021-12-06 23:17:28,707 INFO L242 Difference]: Finished difference. Result has 130 places, 91 transitions, 369 flow [2021-12-06 23:17:28,707 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=369, PETRI_PLACES=130, PETRI_TRANSITIONS=91} [2021-12-06 23:17:28,708 INFO L334 CegarLoopForPetriNet]: 97 programPoint places, 33 predicate places. [2021-12-06 23:17:28,708 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 91 transitions, 369 flow [2021-12-06 23:17:28,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 68.3076923076923) internal successors, (888), 13 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:28,709 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:17:28,709 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:17:28,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 23:17:28,710 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-06 23:17:28,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:17:28,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1408778179, now seen corresponding path program 1 times [2021-12-06 23:17:28,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:17:28,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719302086] [2021-12-06 23:17:28,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:17:28,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:17:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:17:28,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:17:28,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:17:28,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719302086] [2021-12-06 23:17:28,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719302086] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:17:28,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:17:28,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-06 23:17:28,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880751927] [2021-12-06 23:17:28,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:17:28,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 23:17:28,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:17:28,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 23:17:28,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-06 23:17:28,871 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 94 [2021-12-06 23:17:28,872 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 91 transitions, 369 flow. Second operand has 11 states, 11 states have (on average 72.45454545454545) internal successors, (797), 11 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:28,872 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:17:28,872 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 94 [2021-12-06 23:17:28,872 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:17:29,117 INFO L129 PetriNetUnfolder]: 84/312 cut-off events. [2021-12-06 23:17:29,117 INFO L130 PetriNetUnfolder]: For 1906/1937 co-relation queries the response was YES. [2021-12-06 23:17:29,119 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1234 conditions, 312 events. 84/312 cut-off events. For 1906/1937 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1304 event pairs, 25 based on Foata normal form. 19/320 useless extension candidates. Maximal degree in co-relation 1149. Up to 114 conditions per place. [2021-12-06 23:17:29,121 INFO L132 encePairwiseOnDemand]: 83/94 looper letters, 24 selfloop transitions, 14 changer transitions 16/117 dead transitions. [2021-12-06 23:17:29,121 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 117 transitions, 751 flow [2021-12-06 23:17:29,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 23:17:29,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-06 23:17:29,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 968 transitions. [2021-12-06 23:17:29,124 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7921440261865794 [2021-12-06 23:17:29,124 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 968 transitions. [2021-12-06 23:17:29,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 968 transitions. [2021-12-06 23:17:29,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:17:29,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 968 transitions. [2021-12-06 23:17:29,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 74.46153846153847) internal successors, (968), 13 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:29,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 94.0) internal successors, (1316), 14 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:29,130 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 94.0) internal successors, (1316), 14 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:29,130 INFO L186 Difference]: Start difference. First operand has 130 places, 91 transitions, 369 flow. Second operand 13 states and 968 transitions. [2021-12-06 23:17:29,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 117 transitions, 751 flow [2021-12-06 23:17:29,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 117 transitions, 697 flow, removed 24 selfloop flow, removed 9 redundant places. [2021-12-06 23:17:29,136 INFO L242 Difference]: Finished difference. Result has 128 places, 94 transitions, 424 flow [2021-12-06 23:17:29,136 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=424, PETRI_PLACES=128, PETRI_TRANSITIONS=94} [2021-12-06 23:17:29,137 INFO L334 CegarLoopForPetriNet]: 97 programPoint places, 31 predicate places. [2021-12-06 23:17:29,137 INFO L470 AbstractCegarLoop]: Abstraction has has 128 places, 94 transitions, 424 flow [2021-12-06 23:17:29,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 72.45454545454545) internal successors, (797), 11 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:29,137 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:17:29,137 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:17:29,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 23:17:29,138 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-06 23:17:29,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:17:29,138 INFO L85 PathProgramCache]: Analyzing trace with hash 448543743, now seen corresponding path program 2 times [2021-12-06 23:17:29,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:17:29,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937356065] [2021-12-06 23:17:29,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:17:29,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:17:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:17:29,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:17:29,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:17:29,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937356065] [2021-12-06 23:17:29,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937356065] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:17:29,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:17:29,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-06 23:17:29,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633646233] [2021-12-06 23:17:29,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:17:29,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 23:17:29,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:17:29,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 23:17:29,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-06 23:17:29,327 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 94 [2021-12-06 23:17:29,328 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 94 transitions, 424 flow. Second operand has 11 states, 11 states have (on average 72.45454545454545) internal successors, (797), 11 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:29,328 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:17:29,328 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 94 [2021-12-06 23:17:29,328 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:17:29,573 INFO L129 PetriNetUnfolder]: 74/295 cut-off events. [2021-12-06 23:17:29,573 INFO L130 PetriNetUnfolder]: For 1789/1848 co-relation queries the response was YES. [2021-12-06 23:17:29,575 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1178 conditions, 295 events. 74/295 cut-off events. For 1789/1848 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1189 event pairs, 24 based on Foata normal form. 25/310 useless extension candidates. Maximal degree in co-relation 1090. Up to 104 conditions per place. [2021-12-06 23:17:29,577 INFO L132 encePairwiseOnDemand]: 83/94 looper letters, 21 selfloop transitions, 13 changer transitions 16/113 dead transitions. [2021-12-06 23:17:29,578 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 113 transitions, 733 flow [2021-12-06 23:17:29,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 23:17:29,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-06 23:17:29,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 966 transitions. [2021-12-06 23:17:29,581 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.79050736497545 [2021-12-06 23:17:29,581 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 966 transitions. [2021-12-06 23:17:29,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 966 transitions. [2021-12-06 23:17:29,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:17:29,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 966 transitions. [2021-12-06 23:17:29,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 74.3076923076923) internal successors, (966), 13 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:29,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 94.0) internal successors, (1316), 14 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:29,589 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 94.0) internal successors, (1316), 14 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:29,589 INFO L186 Difference]: Start difference. First operand has 128 places, 94 transitions, 424 flow. Second operand 13 states and 966 transitions. [2021-12-06 23:17:29,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 113 transitions, 733 flow [2021-12-06 23:17:29,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 113 transitions, 653 flow, removed 30 selfloop flow, removed 10 redundant places. [2021-12-06 23:17:29,598 INFO L242 Difference]: Finished difference. Result has 131 places, 94 transitions, 425 flow [2021-12-06 23:17:29,598 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=425, PETRI_PLACES=131, PETRI_TRANSITIONS=94} [2021-12-06 23:17:29,599 INFO L334 CegarLoopForPetriNet]: 97 programPoint places, 34 predicate places. [2021-12-06 23:17:29,599 INFO L470 AbstractCegarLoop]: Abstraction has has 131 places, 94 transitions, 425 flow [2021-12-06 23:17:29,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 72.45454545454545) internal successors, (797), 11 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:29,600 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:17:29,600 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:17:29,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 23:17:29,600 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-06 23:17:29,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:17:29,601 INFO L85 PathProgramCache]: Analyzing trace with hash 2126481980, now seen corresponding path program 1 times [2021-12-06 23:17:29,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:17:29,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262761065] [2021-12-06 23:17:29,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:17:29,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:17:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:17:29,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:17:29,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:17:29,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262761065] [2021-12-06 23:17:29,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262761065] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:17:29,681 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:17:29,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 23:17:29,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850784702] [2021-12-06 23:17:29,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:17:29,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 23:17:29,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:17:29,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 23:17:29,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 23:17:29,683 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 94 [2021-12-06 23:17:29,683 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 94 transitions, 425 flow. Second operand has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:29,683 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:17:29,683 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 94 [2021-12-06 23:17:29,684 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:17:29,892 INFO L129 PetriNetUnfolder]: 153/432 cut-off events. [2021-12-06 23:17:29,892 INFO L130 PetriNetUnfolder]: For 1790/1802 co-relation queries the response was YES. [2021-12-06 23:17:29,894 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1540 conditions, 432 events. 153/432 cut-off events. For 1790/1802 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1870 event pairs, 8 based on Foata normal form. 12/435 useless extension candidates. Maximal degree in co-relation 1455. Up to 92 conditions per place. [2021-12-06 23:17:29,896 INFO L132 encePairwiseOnDemand]: 85/94 looper letters, 29 selfloop transitions, 7 changer transitions 43/142 dead transitions. [2021-12-06 23:17:29,896 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 142 transitions, 942 flow [2021-12-06 23:17:29,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 23:17:29,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 23:17:29,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 794 transitions. [2021-12-06 23:17:29,898 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8446808510638298 [2021-12-06 23:17:29,899 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 794 transitions. [2021-12-06 23:17:29,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 794 transitions. [2021-12-06 23:17:29,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:17:29,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 794 transitions. [2021-12-06 23:17:29,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 79.4) internal successors, (794), 10 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:29,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 94.0) internal successors, (1034), 11 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:29,903 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 94.0) internal successors, (1034), 11 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:29,903 INFO L186 Difference]: Start difference. First operand has 131 places, 94 transitions, 425 flow. Second operand 10 states and 794 transitions. [2021-12-06 23:17:29,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 142 transitions, 942 flow [2021-12-06 23:17:29,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 142 transitions, 835 flow, removed 22 selfloop flow, removed 17 redundant places. [2021-12-06 23:17:29,909 INFO L242 Difference]: Finished difference. Result has 123 places, 91 transitions, 359 flow [2021-12-06 23:17:29,909 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=359, PETRI_PLACES=123, PETRI_TRANSITIONS=91} [2021-12-06 23:17:29,910 INFO L334 CegarLoopForPetriNet]: 97 programPoint places, 26 predicate places. [2021-12-06 23:17:29,910 INFO L470 AbstractCegarLoop]: Abstraction has has 123 places, 91 transitions, 359 flow [2021-12-06 23:17:29,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:29,910 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:17:29,910 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:17:29,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 23:17:29,911 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-06 23:17:29,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:17:29,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1407439487, now seen corresponding path program 1 times [2021-12-06 23:17:29,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:17:29,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150008119] [2021-12-06 23:17:29,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:17:29,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:17:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:17:29,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:17:29,983 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:17:29,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150008119] [2021-12-06 23:17:29,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150008119] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:17:29,983 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:17:29,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 23:17:29,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557184994] [2021-12-06 23:17:29,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:17:29,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 23:17:29,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:17:29,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 23:17:29,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 23:17:29,984 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 94 [2021-12-06 23:17:29,985 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 91 transitions, 359 flow. Second operand has 7 states, 7 states have (on average 75.0) internal successors, (525), 7 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:29,985 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:17:29,985 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 94 [2021-12-06 23:17:29,985 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:17:30,117 INFO L129 PetriNetUnfolder]: 49/221 cut-off events. [2021-12-06 23:17:30,117 INFO L130 PetriNetUnfolder]: For 495/497 co-relation queries the response was YES. [2021-12-06 23:17:30,118 INFO L84 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 221 events. 49/221 cut-off events. For 495/497 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 737 event pairs, 10 based on Foata normal form. 9/228 useless extension candidates. Maximal degree in co-relation 644. Up to 31 conditions per place. [2021-12-06 23:17:30,119 INFO L132 encePairwiseOnDemand]: 85/94 looper letters, 23 selfloop transitions, 10 changer transitions 15/111 dead transitions. [2021-12-06 23:17:30,119 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 111 transitions, 590 flow [2021-12-06 23:17:30,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 23:17:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-06 23:17:30,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 848 transitions. [2021-12-06 23:17:30,122 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8201160541586073 [2021-12-06 23:17:30,122 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 848 transitions. [2021-12-06 23:17:30,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 848 transitions. [2021-12-06 23:17:30,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:17:30,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 848 transitions. [2021-12-06 23:17:30,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 77.0909090909091) internal successors, (848), 11 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:30,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 94.0) internal successors, (1128), 12 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:30,126 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 94.0) internal successors, (1128), 12 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:30,126 INFO L186 Difference]: Start difference. First operand has 123 places, 91 transitions, 359 flow. Second operand 11 states and 848 transitions. [2021-12-06 23:17:30,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 111 transitions, 590 flow [2021-12-06 23:17:30,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 111 transitions, 443 flow, removed 56 selfloop flow, removed 21 redundant places. [2021-12-06 23:17:30,130 INFO L242 Difference]: Finished difference. Result has 115 places, 92 transitions, 325 flow [2021-12-06 23:17:30,131 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=325, PETRI_PLACES=115, PETRI_TRANSITIONS=92} [2021-12-06 23:17:30,131 INFO L334 CegarLoopForPetriNet]: 97 programPoint places, 18 predicate places. [2021-12-06 23:17:30,131 INFO L470 AbstractCegarLoop]: Abstraction has has 115 places, 92 transitions, 325 flow [2021-12-06 23:17:30,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.0) internal successors, (525), 7 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:30,132 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:17:30,132 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:17:30,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 23:17:30,132 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-06 23:17:30,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:17:30,132 INFO L85 PathProgramCache]: Analyzing trace with hash 600485396, now seen corresponding path program 1 times [2021-12-06 23:17:30,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:17:30,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280387140] [2021-12-06 23:17:30,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:17:30,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:17:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:17:30,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:17:30,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:17:30,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280387140] [2021-12-06 23:17:30,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280387140] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:17:30,290 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:17:30,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-06 23:17:30,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420626630] [2021-12-06 23:17:30,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:17:30,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-06 23:17:30,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:17:30,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-06 23:17:30,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-12-06 23:17:30,292 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 94 [2021-12-06 23:17:30,293 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 92 transitions, 325 flow. Second operand has 13 states, 13 states have (on average 69.61538461538461) internal successors, (905), 13 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:30,294 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:17:30,294 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 94 [2021-12-06 23:17:30,294 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:17:30,502 INFO L129 PetriNetUnfolder]: 23/259 cut-off events. [2021-12-06 23:17:30,502 INFO L130 PetriNetUnfolder]: For 281/286 co-relation queries the response was YES. [2021-12-06 23:17:30,503 INFO L84 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 259 events. 23/259 cut-off events. For 281/286 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1213 event pairs, 0 based on Foata normal form. 4/253 useless extension candidates. Maximal degree in co-relation 594. Up to 30 conditions per place. [2021-12-06 23:17:30,504 INFO L132 encePairwiseOnDemand]: 82/94 looper letters, 19 selfloop transitions, 5 changer transitions 25/112 dead transitions. [2021-12-06 23:17:30,504 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 112 transitions, 492 flow [2021-12-06 23:17:30,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 23:17:30,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-06 23:17:30,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 995 transitions. [2021-12-06 23:17:30,506 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.756079027355623 [2021-12-06 23:17:30,506 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 995 transitions. [2021-12-06 23:17:30,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 995 transitions. [2021-12-06 23:17:30,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:17:30,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 995 transitions. [2021-12-06 23:17:30,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 71.07142857142857) internal successors, (995), 14 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:30,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 94.0) internal successors, (1410), 15 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:30,511 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 94.0) internal successors, (1410), 15 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:30,512 INFO L186 Difference]: Start difference. First operand has 115 places, 92 transitions, 325 flow. Second operand 14 states and 995 transitions. [2021-12-06 23:17:30,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 112 transitions, 492 flow [2021-12-06 23:17:30,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 112 transitions, 468 flow, removed 4 selfloop flow, removed 6 redundant places. [2021-12-06 23:17:30,515 INFO L242 Difference]: Finished difference. Result has 126 places, 86 transitions, 290 flow [2021-12-06 23:17:30,515 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=290, PETRI_PLACES=126, PETRI_TRANSITIONS=86} [2021-12-06 23:17:30,516 INFO L334 CegarLoopForPetriNet]: 97 programPoint places, 29 predicate places. [2021-12-06 23:17:30,516 INFO L470 AbstractCegarLoop]: Abstraction has has 126 places, 86 transitions, 290 flow [2021-12-06 23:17:30,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 69.61538461538461) internal successors, (905), 13 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:30,516 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:17:30,516 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:17:30,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 23:17:30,516 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-06 23:17:30,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:17:30,517 INFO L85 PathProgramCache]: Analyzing trace with hash -571600922, now seen corresponding path program 2 times [2021-12-06 23:17:30,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:17:30,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37475170] [2021-12-06 23:17:30,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:17:30,517 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:17:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 23:17:30,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 23:17:30,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 23:17:30,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37475170] [2021-12-06 23:17:30,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37475170] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 23:17:30,706 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 23:17:30,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-06 23:17:30,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577043588] [2021-12-06 23:17:30,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 23:17:30,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-06 23:17:30,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 23:17:30,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-06 23:17:30,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-12-06 23:17:30,708 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 94 [2021-12-06 23:17:30,709 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 86 transitions, 290 flow. Second operand has 12 states, 12 states have (on average 70.66666666666667) internal successors, (848), 12 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:30,709 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-06 23:17:30,709 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 94 [2021-12-06 23:17:30,709 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-06 23:17:30,873 INFO L129 PetriNetUnfolder]: 7/190 cut-off events. [2021-12-06 23:17:30,873 INFO L130 PetriNetUnfolder]: For 128/130 co-relation queries the response was YES. [2021-12-06 23:17:30,874 INFO L84 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 190 events. 7/190 cut-off events. For 128/130 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 772 event pairs, 0 based on Foata normal form. 3/187 useless extension candidates. Maximal degree in co-relation 409. Up to 21 conditions per place. [2021-12-06 23:17:30,875 INFO L132 encePairwiseOnDemand]: 85/94 looper letters, 17 selfloop transitions, 4 changer transitions 8/93 dead transitions. [2021-12-06 23:17:30,875 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 93 transitions, 372 flow [2021-12-06 23:17:30,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 23:17:30,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-06 23:17:30,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 719 transitions. [2021-12-06 23:17:30,876 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7648936170212766 [2021-12-06 23:17:30,876 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 719 transitions. [2021-12-06 23:17:30,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 719 transitions. [2021-12-06 23:17:30,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-06 23:17:30,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 719 transitions. [2021-12-06 23:17:30,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 71.9) internal successors, (719), 10 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:30,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 94.0) internal successors, (1034), 11 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:30,879 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 94.0) internal successors, (1034), 11 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:30,879 INFO L186 Difference]: Start difference. First operand has 126 places, 86 transitions, 290 flow. Second operand 10 states and 719 transitions. [2021-12-06 23:17:30,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 93 transitions, 372 flow [2021-12-06 23:17:30,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 93 transitions, 334 flow, removed 13 selfloop flow, removed 13 redundant places. [2021-12-06 23:17:30,882 INFO L242 Difference]: Finished difference. Result has 116 places, 84 transitions, 269 flow [2021-12-06 23:17:30,882 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=94, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=269, PETRI_PLACES=116, PETRI_TRANSITIONS=84} [2021-12-06 23:17:30,883 INFO L334 CegarLoopForPetriNet]: 97 programPoint places, 19 predicate places. [2021-12-06 23:17:30,883 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 84 transitions, 269 flow [2021-12-06 23:17:30,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 70.66666666666667) internal successors, (848), 12 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 23:17:30,883 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-06 23:17:30,883 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 23:17:30,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 23:17:30,884 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-12-06 23:17:30,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 23:17:30,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1820999590, now seen corresponding path program 3 times [2021-12-06 23:17:30,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 23:17:30,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188556225] [2021-12-06 23:17:30,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 23:17:30,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 23:17:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 23:17:30,926 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 23:17:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 23:17:31,001 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 23:17:31,001 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 23:17:31,002 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2021-12-06 23:17:31,004 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2021-12-06 23:17:31,004 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 5 remaining) [2021-12-06 23:17:31,005 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 5 remaining) [2021-12-06 23:17:31,005 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2021-12-06 23:17:31,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 23:17:31,009 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1] [2021-12-06 23:17:31,014 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-06 23:17:31,014 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 23:17:31,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 11:17:31 BasicIcfg [2021-12-06 23:17:31,098 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 23:17:31,099 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 23:17:31,099 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 23:17:31,099 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 23:17:31,099 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 11:17:26" (3/4) ... [2021-12-06 23:17:31,100 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-06 23:17:31,176 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd99b1ac-711d-41ee-a582-3eec0da6b009/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 23:17:31,177 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 23:17:31,177 INFO L158 Benchmark]: Toolchain (without parser) took 5984.09ms. Allocated memory was 102.8MB in the beginning and 155.2MB in the end (delta: 52.4MB). Free memory was 67.4MB in the beginning and 116.4MB in the end (delta: -49.0MB). Peak memory consumption was 86.1MB. Max. memory is 16.1GB. [2021-12-06 23:17:31,177 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 75.5MB. Free memory was 50.2MB in the beginning and 50.2MB in the end (delta: 24.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 23:17:31,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.05ms. Allocated memory is still 102.8MB. Free memory was 67.2MB in the beginning and 65.4MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-06 23:17:31,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.41ms. Allocated memory is still 102.8MB. Free memory was 65.4MB in the beginning and 62.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 23:17:31,178 INFO L158 Benchmark]: Boogie Preprocessor took 26.61ms. Allocated memory is still 102.8MB. Free memory was 62.3MB in the beginning and 60.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 23:17:31,178 INFO L158 Benchmark]: RCFGBuilder took 646.82ms. Allocated memory is still 102.8MB. Free memory was 60.2MB in the beginning and 39.7MB in the end (delta: 20.5MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. [2021-12-06 23:17:31,179 INFO L158 Benchmark]: TraceAbstraction took 4842.98ms. Allocated memory was 102.8MB in the beginning and 155.2MB in the end (delta: 52.4MB). Free memory was 38.8MB in the beginning and 48.4MB in the end (delta: -9.6MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. [2021-12-06 23:17:31,179 INFO L158 Benchmark]: Witness Printer took 77.98ms. Allocated memory is still 155.2MB. Free memory was 48.4MB in the beginning and 116.4MB in the end (delta: -67.9MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2021-12-06 23:17:31,181 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.13ms. Allocated memory is still 75.5MB. Free memory was 50.2MB in the beginning and 50.2MB in the end (delta: 24.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.05ms. Allocated memory is still 102.8MB. Free memory was 67.2MB in the beginning and 65.4MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.41ms. Allocated memory is still 102.8MB. Free memory was 65.4MB in the beginning and 62.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.61ms. Allocated memory is still 102.8MB. Free memory was 62.3MB in the beginning and 60.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 646.82ms. Allocated memory is still 102.8MB. Free memory was 60.2MB in the beginning and 39.7MB in the end (delta: 20.5MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4842.98ms. Allocated memory was 102.8MB in the beginning and 155.2MB in the end (delta: 52.4MB). Free memory was 38.8MB in the beginning and 48.4MB in the end (delta: -9.6MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. * Witness Printer took 77.98ms. Allocated memory is still 155.2MB. Free memory was 48.4MB in the beginning and 116.4MB in the end (delta: -67.9MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s 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: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L711] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L712] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L714] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L716] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L717] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L718] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L719] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L720] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L721] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L722] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L723] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L724] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L725] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L726] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L727] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L728] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L730] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L731] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L732] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] 0 pthread_t t1447; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1447={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1447, ((void *)0), P0, ((void *)0))=-1, t1447={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] 0 pthread_t t1448; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1448, ((void *)0), P1, ((void *)0))=0, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L760] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L760] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L801] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L801] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L803] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L804] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447={5:0}, t1448={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=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: 795]: 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: 793]: 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 5 procedures, 112 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 476 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 476 mSDsluCounter, 521 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 667 mSDsCounter, 159 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1276 IncrementalHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 159 mSolverCounterUnsat, 86 mSDtfsCounter, 1276 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=425occurred in iteration=6, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 731 NumberOfCodeBlocks, 731 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 648 ConstructedInterpolants, 0 QuantifiedInterpolants, 4452 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-12-06 23:17:31,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd99b1ac-711d-41ee-a582-3eec0da6b009/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE